Share your favourite I will try solving them .
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | cry | 161 |
2 | maomao90 | 160 |
3 | awoo | 159 |
4 | atcoder_official | 157 |
5 | -is-this-fft- | 155 |
5 | nor | 155 |
5 | adamant | 155 |
8 | maroonrk | 152 |
8 | Um_nik | 152 |
10 | Petr | 146 |
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 - Nikita and LCM 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
1968F - Отрезки с равным XOR the best problem as i ever seen
thanks for sharing
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
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 - 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.
thanks for sharing
2004D - Colored Portals
thanks for sharing
Enjoy tle 1771C - Hossam and Trainees
Solved it before. Thanks for sharing
1083A - The Fair Nut and the Best Path
1151D - Stas and the Queue at the Buffet
Thanks for sharing
1983D - Swap Dilemma 1851F - Lisa and the Martians 1872E - Data Structures Fan 1556D - Take a Guess 2001C - Guess The Tree 816B - Karen and Coffee 2002D1 - DFS Checker (Easy Version) 1791F - Range Update Point Query 1999F - Expected Median 1997D - Maximize the Root I hope you enjoy these.
Thanks for sharing
Nice idea for practice
G. Path Queries
thanks for sharing
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.