Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Get exact match for tags using this format, eg: [u'brute force', 'dp']
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 322 | Colors | *special binary search constructive algorithms interactive | Statement | A | Baltic Olympiad in Informatics 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1386} | PROGRAMMING | T | ||
| 143 | XOR Guessing | *special interactive | Statement | G | Kotlin Heroes: Practice 8 {1570} | PROGRAMMING | |||
| 156 | Expected Twist | *special interactive | Statement | H | April Fools Day Contest 2023 {1812} | PROGRAMMING | Editorial of April Fools Day Contest 2023 | ||
| 24 | Draw Polygon Lines | *special constructive algorithms dp geometry interactive | Statement | A | XVIII Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules) {1939} | PROGRAMMING | |||
| 229 | Uppercase or Lowercase? | *special *special interactive | Statement | D | Kotlin Heroes: Episode 12 {2087} | PROGRAMMING | |||
| 4793 | Plinko | *special games interactive | Statement | B | April Fools Day Contest 2025 {2095} | PROGRAMMING |