A2OJ Ladders
This ladder provides a structured path for users with a Codeforces Rating between 1700 to 1799. 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 1700–1799, A2OJ Ladder.
0%
0/99
Overall progress
0 / 99
0/5
Easy
0/35
Medium
0/59
Hard
| Status | Problem | Solve | Practice | Revision | Level | |
|---|---|---|---|---|---|---|
| 1. | Candy Bags |  | Easy | |||
| 2. | Word | | Easy | |||
| 3. | Dreamoon and Stairs | | Easy | |||
| 4. | Cut Ribbon | | Medium | |||
| 5. | T-primes | | Medium | |||
| 6. | Ice Skating | | Medium | |||
| 7. | Little Elephant and Bits | | Easy | |||
| 8. | Dreamoon and WiFi | | Medium | |||
| 9. | Party | | Easy | |||
| 10. | Greg and Array | | Medium | |||
| 11. | Table Decorations | | Hard | |||
| 12. | Checkposts | | Medium | |||
| 13. | Valera and Elections | | Medium | |||
| 14. | Psychos in a Line | | Hard | |||
| 15. | Counting Rectangles is Fun | | Hard | |||
| 16. | Greg and Graph | | Medium | |||
| 17. | Little Girl and Maximum Sum | | Medium | |||
| 18. | Renting Bikes | | Hard | |||
| 19. | Treasure | | Medium | |||
| 20. | DZY Loves Sequences | | Medium | |||
| 21. | Color the Fence | | Medium | |||
| 22. | Colorful Graph | | Medium | |||
| 23. | Zero Tree | | Hard | |||
| 24. | King's Path | | Hard | |||
| 25. | Interesting Array | | Hard | |||
| 26. | Greenhouse Effect | | Medium | |||
| 27. | The Brand New Function | | Medium | |||
| 28. | Caesar's Legions | | Medium | |||
| 29. | Dima and Hares | | Hard | |||
| 30. | Almost Arithmetical Progression | | Medium | |||
| 31. | Hamburgers | | Medium | |||
| 32. | Petya and Divisors | | Hard | |||
| 33. | Matrix | | Medium | |||
| 34. | Xenia and Weights | | Medium | |||
| 35. | Barcode | | Medium | |||
| 36. | Color Stripe | | Medium | |||
| 37. | Xenia and Bit Operations | | Medium | |||
| 38. | Ciel and Robot | | Medium | |||
| 39. | Little Elephant and Interval | | Medium | |||
| 40. | Little Elephant and Cards | | Medium | |||
| 41. | Good Sequences | | Medium | |||
| 42. | k-Tree | | Medium | |||
| 43. | Mike and Feet | | Hard | |||
| 44. | Andrey and Problem | | Hard | |||
| 45. | Maximum Submatrix 2 | | Medium | |||
| 46. | Password | | Medium | |||
| 47. | Good Substrings | | Hard | |||
| 48. | GukiZ hates Boxes | | Hard | |||
| 49. | Regular Bridge | | Hard | |||
| 50. | MUH and Cube Walls | | Hard | |||
| 51. | Little Pony and Harmony Chest | | Hard | |||
| 52. | Sereja and Brackets | | Hard | |||
| 53. | Obsessive String | | Hard | |||
| 54. | Gargari and Bishops | | Hard | |||
| 55. | Appleman and Tree | | Hard | |||
| 56. | Soldier and Number Game | | Medium | |||
| 57. | Lucky Tree | | Hard | |||
| 58. | Missile Silos | | Hard | |||
| 59. | Sereja and the Arrangement of Numbers | | Hard | |||
| 60. | Enemy is weak | | Hard | |||
| 61. | A and B and Interesting Substrings | | Hard | |||
| 62. | Equivalent Strings | | Medium | |||
| 63. | Book of Evil | | Hard | |||
| 64. | Dima and Bacteria | | Hard | |||
| 65. | Present | | Medium | |||
| 66. | Ciel the Commander | | Hard | |||
| 67. | Pashmak and Buses | | Hard | |||
| 68. | Pashmak and Parmida's problem | | Hard | |||
| 69. | Count Good Substrings | | Hard | |||
| 70. | Civilization | | Hard | |||
| 71. | Painting Fence | | Hard | |||
| 72. | A and B and Lecture Rooms | | Hard | |||
| 73. | Water Tree | | Hard | |||
| 74. | Choosing Balls | | Hard | |||
| 75. | Watto and Mechanism | | Hard | |||
| 76. | Multiplication Table | | Hard | |||
| 77. | Characteristics of Rectangles | | Hard | |||
| 78. | Lucky Common Subsequence | | Hard | |||
| 79. | Prefixes and Suffixes | | Hard | |||
| 80. | Sereja ans Anagrams | | Hard | |||
| 81. | XOR on Segment | | Hard | |||
| 82. | Porcelain | | Hard | |||
| 83. | Devu and his Brother | | Medium | |||
| 84. | Eternal Victory | | Hard | |||
| 85. | Red-Green Towers | | Hard | |||
| 86. | Choosing Capital for Treeland | | Medium | |||
| 87. | Roman and Numbers | | Hard | |||
| 88. | Vessels | | Hard | |||
| 89. | Propagating tree | | Hard | |||
| 90. | Bag of mice | | Hard | |||
| 91. | A Lot of Games | | Hard | |||
| 92. | Pair of Numbers | | Hard | |||
| 93. | Pashmak and Graph | | Hard | |||
| 94. | Petr# | | Hard | |||
| 95. | The Child and Sequence | | Hard | |||
| 96. | Vasya and Beautiful Arrays | | Hard | |||
| 97. | Little Girl and Problem on Trees | | Hard | |||
| 98. | Antimatter | | Hard | |||
| 99. | Tree Requests | | Hard |
There is no PDF here, and you do not need one. All 99 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 1700–1799, 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 1700-1799 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 — 99 problems is about 41 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.