| educational-codeforces-round-180-rated-for-div-2 | A. Race |
| B. Shrinking Array |
| C. Coloring Game |
| D. Reachability and Tree |
| E. Tree Colorings |
| codeforces-round-1059-div-3 | A. Beautiful Average |
| B. Beautiful String |
| C. Beautiful XOR |
| D. Beautiful Permutation |
| E. Beautiful Palindromes |
| F. Beautiful Intervals |
| G. Beautiful Tree |
| codeforces-round-1057-div-2 | A. Circle of Apple Trees |
| B. Bitwise Reversion |
| C. Symmetrical Polygons |
| D. Not Alone |
| codeforces-round-1056-div-2 | A. El fucho |
| B. Abraham's Great Escape |
| C. The Ancient Wizards' Capes |
| D. Batteries |
| E. Mimo & Yuyu |
| codeforces-round-1054-div-3 | A. Be Positive |
| B. Unconventional Pairs |
| C. MEX Rose |
| D. A and B |
| E. Hidden Knowledge of the Ancients |
| codeforces-round-1049-div-2 | A. Shift Sort |
| B. Another Divisibility Problem |
| C. Ultimate Value |
| D. A Cruel Segment's Thesis |
| E. Prime Gaming |
| codeforces-round-1039-div-2 | A. Recycling Center |
| B. Deque Process |
| D. Sum of LDS |
| E1. Submedians (Easy Version) |
| E2. Submedians (Hard Version) |
| codeforces-round-1037-div-3 | F. 1-1-1, Free Tree! |
| G1. Big Wins! (easy version) |
| G2. Big Wins! (hard version) |
| codeforces-round-1035-div-2 | A. Add or XOR |
| B. Line Segments |
| C. A Good Problem |
| D. Token Removing |
| E. And Constraint |
| codeforces-round-1034-div-3 | E. MEX Count |
| F. Minimize Fixed Points |
| G. Modular Sorting |