What are some examples of surprisingly similar problems across different contests on codeforces?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
What are some examples of surprisingly similar problems across different contests on codeforces?
Name |
---|
765F and 1793F from a week ago.
I think this blog is for this exact answer lol.
The blog asks for similar problems, not same problem
1771B and 652C. They are basically the same task but the permutation is $$$\left[1,2,3,...,n-1,n\right]$$$ in 1771B while it can be any permutation in 652C
This 1790F - Timofey and Black-White Tree and 342E - Xenia and Tree overall still pretty interesting problem
1141E - Superhero Battle and 1490G - Old Floppy Drive they are both from Div 3 contests, one has multiple testcases while the other doesn't.
1795C in educational round same as 923B
All the problems until 2000 rating that involve the concept of permutation groups , permutation parity and permutation cycles are similar;
407B and 1552F. The latter is just the former with a ton of shit added on top.
1462C - Unique Number and 1714C - Minimum Varied Number are the same, except the constraints (45 vs 50)
713C - Sonya and Problem Wihtout a Legend and 13C - Sequence
Differences: strictly increasing/non-decreasing, N=3000/5000. In other words, no difference...