Share your favourite I will try solving them .
Share your favourite I will try solving them .
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3857 |
| 2 | jiangly | 3810 |
| 3 | maroonrk | 3534 |
| 4 | tourist | 3528 |
| 5 | Kevin114514 | 3510 |
| 6 | turmax | 3411 |
| 7 | Um_nik | 3387 |
| 8 | Radewoosh | 3367 |
| 9 | heuristica | 3322 |
| 10 | strapple | 3317 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | maspy | 150 |
| 3 | Um_nik | 146 |
| 4 | Errichto | 139 |
| 5 | adamant | 136 |
| 6 | maroonrk | 134 |
| 7 | DNR | 133 |
| 8 | nik_exists | 131 |
| 8 | Dominater069 | 131 |
| 10 | Proof_by_QED | 130 |
This, and this.
Enjoy solving!
1977C - Nikita and LCM beats them all
D from the same contest is probably the highest quality problem in the 2300 range
cute
1968F - Equal XOR Segments the best problem as i ever seen
This problem is roughly the same idea
this one is out of range (1900) 1714F - Build a Tree and That Is It.
these are in range:
1528A - Parsa's Humongous Tree
1056D - Decorate Apple Tree
103B - Cthulhu
2001C - Guess The Tree
hmm I wonder what this guys favorite topic is...
this and this
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 - Med-imize
Simple mix of binary search + DP, DP logic is also cool and simple
1992G - Ultra-Meow
Simple reverse thinking for exhaustive search using basic PnC
2002D2 - DFS Checker (Hard Version)
How to use tin and tout for a generic tree and check if u is ancestor of v or not.
2002E - Cosmic Rays
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 - Call During the Journey
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 - Sakurako's Test
Pre computation OR dp is necessary to not get TLE, harmonic complexity is cool. BS on range is also cool.
I like your list. These are some questions that can be implemented within 10 minutes, if one gets the logic right.
2004D - Colored Portals
Enjoy tle 1771C - Hossam and Trainees
1083A - The Fair Nut and the Best Path
1151D - Stas and the Queue at the Buffet
G. Path Queries
1950E - Nearly Shortest Repeating Substring, 1999F - Expected Median
Also out of range problems: 2000H - Ksyusha and the Loaded Set, 446C - DZY Loves Fibonacci Numbers, 1155E - Guess the Root.
https://atcoder.jp/contests/abc370/tasks/abc370_e
https://codeforces.me/contest/1793/problem/D
https://codeforces.me/contest/1741/problem/E
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?
I think this one is a nice dp. https://codeforces.me/contest/446/problem/A
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.
Literally, 1937C - Bitwise Operation Wizard is the best one I've ever seen.
1777C - Quiz Master
the best problem I've ever solved on codeforces.
https://codeforces.me/contest/1284/problem/C
this
Found this interesting. enjoy
I would recommend looking for problems in this range on C2Ladders https://c2-ladders-juol.onrender.com
This one is wonderful https://codeforces.me/contest/1851/problem/F
https://codeforces.me/problemset/problem/993/A geometry problem
Gotta be 2013D - Minimize the Difference
https://codeforces.me/problemset/problem/1969/C
A fabulous DP problem.
Probablity
Nice DP!
https://codeforces.me/problemset/problem/2005/C
this
I have seen the most cool problem its hard to find but basically, you go to "Problem set". Click the lightning typa button TWICE and the problem on the top is a very cool problem (◍•ᴗ•◍)