Share your favourite I will try solving them .
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
Share your favourite I will try solving them .
Name |
---|
This, and this.
Enjoy solving!
thanks for sharing. I solved them before
I really enjoyed the first problem, thx for sharing!! (second one I had already solved)
1977C - Никита и ТЧ beats them all
D from the same contest is probably the highest quality problem in the 2300 range
oh sure I will try it
thanks for sharing
cute
1968F - Отрезки с равным XOR the best problem as i ever seen
thanks for sharing
This problem is roughly the same idea
this one is out of range (1900) 1714F - Построй дерево и точка.
these are in range:
1528A - Огромное дерево Parsa
1056D - Укрась яблоню
103B - Ктулху
2001C - Угадайте дерево
thanks for sharing
hmm I wonder what this guys favorite topic is...
1800: C. A Mist of Florescence
An ad-hoc problem, I enjoyed the editorial comments because people came up with more than 10 ways to solve the problem and my method was one of the most beautiful.
thanks for sharing
this and this
thanks for sharing
This is my personal list of fav problems, sorry but all problems are from 2000-2400 rating range but nonetheless they are great.
cp concepts are very limited always try to think of topics for a sec and you'll get it right by your logic (piggybacked by your intuition)
1993D - Медизация
Simple mix of binary search + DP, DP logic is also cool and simple
1992G - Ультра-мяу
Simple reverse thinking for exhaustive search using basic PnC
2002D2 - Проверка DFS (сложная версия)
How to use tin and tout for a generic tree and check if u is ancestor of v or not.
2002E - Космические лучи
Simple use of stack for maintaining order (similar to sliding window maximum)
Find Kth smallest pair distance in an array: Leetcode HARD (but simple bs actually)
Double binary search n(logn)^2
2000G - Звонок во время пути
Simple Dijkstra, but from the n-1 to 0 with simple modified logic.
Also, sometimes in modified dijkstra when there could be multiple redundant entries, using a set will save you from TLE.
2008H - Тест Сакурако
Pre computation OR dp is necessary to not get TLE, harmonic complexity is cool. BS on range is also cool.
thanks for sharing
I like your list. These are some questions that can be implemented within 10 minutes, if one gets the logic right.
2004D - Цветные порталы
thanks for sharing
easiest 1600 rated problem I have ever done
Enjoy tle 1771C - Хоссам и ученики
Solved it before. Thanks for sharing
1083A - Орехус и оптимальный путь
1151D - Стас и очередь в буфет
Thanks for sharing
1983D - Дилемма обмена 1851F - Лиза и марсиане 1872E - Фанат структур данных 1556D - Попробуй угадай 2001C - Угадайте дерево 816B - Карен и кофе 2002D1 - Проверка DFS (лёгкая версия) 1791F - Range Update Point Query 1999F - Ожидаемая медиана 1997D - Максимизация корня I hope you enjoy these.
Thanks for sharing
Nice idea for practice
G. Path Queries
thanks for sharing
really enjoyed solving it
1950E - Почти самая короткая повторяющаяся подстрока, 1999F - Ожидаемая медиана
Also out of range problems: 2000H - Ксюша и загруженное множество, 446C - DZY любит числа Фибоначчи, 1155E - Угадай корень.
Thanks for sharing
https://atcoder.jp/contests/abc370/tasks/abc370_e
https://codeforces.net/contest/1793/problem/D
https://codeforces.net/contest/1741/problem/E
Thanks for sharing
https://codeforces.net/contest/1971/problem/G https://codeforces.net/contest/1850/problem/G https://codeforces.net/contest/1971/problem/E https://codeforces.net/problemset/problem/1932/E https://codeforces.net/problemset/problem/1926/E https://codeforces.net/problemset/problem/1907/E
Thanks for sharing
1600 1800 1600
Will share more if remember any. I have few favs higher rated than 1800
thanks for sharing, you can share higher rating problems too just add a rating to it
1700
Do you get notified when i update my comment?
yeah i got notified
I think this one is a nice dp. https://codeforces.net/contest/446/problem/A
thanks for sharing
hide it it s a spoil to the problem
Sorry, this one is out of the range, but It's one of the high quality problems that you would really enjoy thinking and reaching the solution all by yourself.
thanks for sharing I will try it
thanks for this post <3
Literally, 1937C - Побитовая магия is the best one I've ever seen.
Thanks for sharing
1985G - D-Функция. I read the formula they proved in the editorial after i solved it by generating some of the first numbers and learn the rules
And yes it works :) solving this problem is probably the best advancement i've made
thanks for sharing
Fox and names
Thanks for sharing
1777C - Мастер тестов
Thanks for sharing
this aaaand this one
thanks for sharing
the best problem I've ever solved on codeforces.
https://codeforces.net/contest/1284/problem/C
thanks for sharing
Here you go https://codeforces.net/contest/1658/problem/D1
thanks for sharing
this one is really good :)
this
thanks for sharing
i solved it really good problem
Found this interesting. enjoy
I would recommend looking for problems in this range on C2Ladders https://c2-ladders-juol.onrender.com
thanks for sharing
1879D - Сумма функций XOR
Found it very interesting and educational.
You can also try this 1398C - Хорошие подотрезки, as this uses roughly the similar core concept.
thanks for sharing
some good problems are shared
This one is wonderful https://codeforces.net/contest/1851/problem/F
thanks for sharing
https://codeforces.net/problemset/problem/993/A geometry problem
Thanks for sharing
Gotta be 2013D - Минимизировать разницу
Thanks for sharing
https://codeforces.net/problemset/problem/1969/C
A fabulous DP problem.
Thanks for sharing
This one and This one both of them are really good the first is of DP and the second one is interactive
Thanks for sharing
1995B2 - Букет (сложная версия)
Thanks for sharing
Probablity
thanks for sharing
https://codeforces.net/contest/1884/problem/C best observation problem i have seen
Thanks for sharing
Nice DP!
https://codeforces.net/problemset/problem/2005/C
Thanks for sharing
this
an array is considered valid if there is no sovereign longer than B where all the elements are identical additionally the array can contains only integer from the range 1 to C determine the number of valid array of length a
Please solved this