A2OJ Ladders
This ladder provides a structured path for users with a Codeforces Rating between 1600 to 1699. It has different levels of difficulty, helping them to systematically improve their problem-solving skills. A2OJ ladders have proven to be beneficial for many competitive programmers over the years.
Also known as ACD Ladder 1600–1699, A2OJ Ladder.
0%
0/100
Overall progress
0 / 100
0/20
Easy
0/53
Medium
0/27
Hard
| Status | Problem | Solve | Practice | Revision | Level | |
|---|---|---|---|---|---|---|
| 1. | Boy or Girl |  | Easy | |||
| 2. | Beautiful Matrix | | Easy | |||
| 3. | Team | | Easy | |||
| 4. | Petya and Strings | | Easy | |||
| 5. | Magnets | | Easy | |||
| 6. | Young Physicist | | Easy | |||
| 7. | Word Capitalization | | Easy | |||
| 8. | Bit++ | | Easy | |||
| 9. | Way Too Long Words | | Easy | |||
| 10. | Even Odds | | Easy | |||
| 11. | Dubstep | | Easy | |||
| 12. | Xenia and Ringroad | | Easy | |||
| 13. | Football | | Easy | |||
| 14. | System of Equations | | Easy | |||
| 15. | Lucky Division | | Easy | |||
| 16. | Dragons | | Easy | |||
| 17. | Puzzles | | Easy | |||
| 18. | Chat room | | Easy | |||
| 19. | Dreamoon and WiFi | | Medium | |||
| 20. | Ice Skating | | Medium | |||
| 21. | Learning Languages | | Medium | |||
| 22. | T-primes | | Medium | |||
| 23. | Fence | | Easy | |||
| 24. | Party | | Easy | |||
| 25. | Building Permutation | | Medium | |||
| 26. | Greg and Array | | Medium | |||
| 27. | Cut Ribbon | | Medium | |||
| 28. | Maximum Absurdity | | Medium | |||
| 29. | Vasya and Chess | | Medium | |||
| 30. | Bubble Sort Graph | | Medium | |||
| 31. | Modified GCD | | Medium | |||
| 32. | Palindrome Transformation | | Medium | |||
| 33. | Mafia | | Medium | |||
| 34. | To Add or Not to Add | | Medium | |||
| 35. | Almost Arithmetical Progression | | Medium | |||
| 36. | DZY Loves Sequences | | Medium | |||
| 37. | Ilya and Matrix | | Medium | |||
| 38. | Physics Practical | | Medium | |||
| 39. | Common Divisors | | Medium | |||
| 40. | Valera and Elections | | Medium | |||
| 41. | XOR and OR | | Medium | |||
| 42. | Color the Fence | | Medium | |||
| 43. | Colorful Graph | | Medium | |||
| 44. | Boredom | | Medium | |||
| 45. | Hometask | | Medium | |||
| 46. | k-Tree | | Medium | |||
| 47. | Bombs | | Medium | |||
| 48. | Beautiful Numbers | | Hard | |||
| 49. | Shaass and Bookshelf | | Medium | |||
| 50. | Password | | Medium | |||
| 51. | Fixing Typos | | Medium | |||
| 52. | Zero Tree | | Hard | |||
| 53. | Pipeline | | Medium | |||
| 54. | Greenhouse Effect | | Medium | |||
| 55. | Hamburgers | | Medium | |||
| 56. | Little Girl and Maximum XOR | | Medium | |||
| 57. | Dima and Hares | | Hard | |||
| 58. | Another Problem on Strings | | Medium | |||
| 59. | Cows and Sequence | | Medium | |||
| 60. | Little Girl and Maximum Sum | | Medium | |||
| 61. | Booking System | | Medium | |||
| 62. | Barcode | | Medium | |||
| 63. | Arithmetic Progression | | Medium | |||
| 64. | Ladder | | Medium | |||
| 65. | Caesar's Legions | | Medium | |||
| 66. | Xenia and Bit Operations | | Medium | |||
| 67. | Tetrahedron | | Medium | |||
| 68. | George and Job | | Medium | |||
| 69. | Good Sequences | | Medium | |||
| 70. | Xenia and Weights | | Medium | |||
| 71. | Greg and Graph | | Medium | |||
| 72. | Number of Ways | | Medium | |||
| 73. | Pair of Numbers | | Hard | |||
| 74. | Wonder Room | | Hard | |||
| 75. | Pashmak and Parmida's problem | | Hard | |||
| 76. | Ice Cave | | Hard | |||
| 77. | Devu and his Brother | | Medium | |||
| 78. | Dima and Bacteria | | Hard | |||
| 79. | Watto and Mechanism | | Hard | |||
| 80. | Restore Graph | | Hard | |||
| 81. | Riding in a Lift | | Hard | |||
| 82. | Count Good Substrings | | Hard | |||
| 83. | Roman and Numbers | | Hard | |||
| 84. | Choosing Capital for Treeland | | Medium | |||
| 85. | Devu and Partitioning of the Array | | Medium | |||
| 86. | Valid Sets | | Hard | |||
| 87. | MUH and Cube Walls | | Hard | |||
| 88. | Painting Fence | | Hard | |||
| 89. | XOR on Segment | | Hard | |||
| 90. | Vessels | | Hard | |||
| 91. | Bad Luck Island | | Hard | |||
| 92. | Multiplication Table | | Hard | |||
| 93. | Red-Green Towers | | Hard | |||
| 94. | Pashmak and Buses | | Hard | |||
| 95. | Bag of mice | | Hard | |||
| 96. | Gargari and Bishops | | Hard | |||
| 97. | Gargari and Permutations | | Hard | |||
| 98. | R2D2 and Droid Army | | Hard | |||
| 99. | Bear and Prime Numbers | | Medium | |||
| 100. | Good Substrings | | Hard |
There is no PDF here, and you do not need one. All 100 problems are listed in full on this page, free and without an account — and unlike a PDF the list remembers what you have ticked off, so you are not re-reading a static file to work out where you stopped. Use your browser's print view if you want it on paper.
Yes — same sheet, different name. It is also known as ACD Ladder 1600–1699, A2OJ Ladder. Whichever name you searched for, this is the tracker for it.
Tick a problem on this page and it stays ticked. Progress saves in your browser straight away with no account, and the counts update per section so you can see which parts of 1600-1699 A2OJ: Ladder you have actually covered. Signing in with Google syncs it across devices.
At roughly 25 minutes a problem — reading it, solving it and writing the approach down — 100 problems is about 42 hours, or 4 weeks at ten hours a week. Treat that as a planning figure rather than a promise; the first pass through an unfamiliar topic is always slower.
Yes, completely, and no account is needed. There is no paid tier and nothing is held back — the sheet itself is by A2OJ Ladders, and this is a free tracker for it.
Finish one. Sheets overlap heavily, so working several in parallel mostly means re-solving the same problems while never completing a full topic sweep. If you are not sure this is the right one for the time you have, the sheet comparison page puts the options side by side with hour estimates.