List of Math Problems Having Short Statements (800 to 2000)

Revision en1, by levitational, 2026-10-12 15:48:54

List of Math Problems Having Short Statements (800 to 2000)

Long, wordy statements can be exhausting, especially for beginners. So here is a list of math problems (math, number theory, combinatorics, constructive math) with short and easy-to-read statements, sorted by rating.

Notes: - Every problem here has a short statement (under about 1000 characters, input/output and samples not counted). - Within each rating, problems are listed in order of problem ID. - Ratings are as of April 2026 and may shift a little over time. - Short statement does not always mean an easy idea. Some of these are tricky!

800

  1. 47A — Triangular numbers (800)
  2. 50A — Domino piling (800)
  3. 546A — Soldier and Bananas (800)
  4. 749A — Bachgold Problem (800)
  5. 1154A — Restoring Three Numbers (800)
  6. 1325A — EhAb AnD gCd (800)
  7. 1328A — Divisibility Problem (800)
  8. 1352A — Sum of Round Numbers (800)
  9. 1370A — Maximum GCD (800)
  10. 1374A — Required Remainder (800)
  11. 1389A — LCM Problem (800)
  12. 1553A — Digits Sum (800)
  13. 1594A — Consecutive Sum Riddle (800)
  14. 1699A — The Third Three Number Problem (800)
  15. 1740A — Factorise N+M (800)
  16. 1787A — Exponential Equation (800)
  17. 1886A — Sum of Three (800)
  18. 1985B — Maximum Multiple Sum (800)

900

  1. 26A — Almost Prime (900)
  2. 267A — Subtractions (900)
  3. 318A — Even Odds (900)
  4. 598A — Tricky Sum (900)
  5. 1208A — XORinacci (900)
  6. 1436B — Prime Square (900)
  7. 1475A — Odd Divisor (900)
  8. 1617B — GCD Problem (900)
  9. 1758B — XOR = Average (900)
  10. 2035B — Everyone Loves Tres (900)

1000

  1. 1A — Theatre Square (1000)
  2. 584A — Olesya and Rodion (1000)
  3. 622A — Infinite Sequence (1000)
  4. 753A — Santa Claus and Candies (1000)
  5. 1101A — Minimum Integer (1000)
  6. 1257B — Magic Stick (1000)
  7. 1418A — Buying Torches (1000)
  8. 1476A — K-divisible Sum (1000)
  9. 1485A — Add and Divide (1000)
  10. 1968C — Assembly via Remainders (1000)

1100

  1. 797A — k-Factorization (1100)
  2. 858A — k-rounding (1100)
  3. 1288B — Yet Another Meme Problem (1100)
  4. 1327A — Sum of Odd Integers (1100)
  5. 1366A — Shovels and Swords (1100)
  6. 1478B — Nezzar and Lucky Number (1100)
  7. 1490C — Sum of Cubes (1100)
  8. 1511B — GCD Length (1100)
  9. 1593D1 — All are Same (1100)
  10. 1708B — Difference of GCDs (1100)
  11. 1977B — Binary Colouring (1100)
  12. 2043B — Digits (1100)

1200

  1. 239A — Two Bags of Potatoes (1200)
  2. 660A — Co-prime Array (1200)
  3. 1068B — LCM (1200)
  4. 1076B — Divisor Subtraction (1200)
  5. 1213C — Book Reading (1200)
  6. 1352B — Same Parity Summands (1200)
  7. 1352C — K-th Not Divisible by n (1200)
  8. 1497C1 — k-LCM (easy version) (1200)
  9. 1514B — AND 0, Sum Big (1200)
  10. 1541B — Pleasant Pairs (1200)
  11. 1822D — Super-Permutation (1200)

1300

  1. 230B — T-primes (1300)
  2. 573A — Bear and Poker (1300)
  3. 844B — Rectangles (1300)
  4. 1076C — Meme Problem (1300)
  5. 1220B — Multiplication Table (1300)
  6. 1260B — Obtain Two Zeroes (1300)
  7. 1294C — Product of Three Numbers (1300)
  8. 1454D — Number into Sequence (1300)
  9. 1667A — Make it Increasing (1300)
  10. 1788C — Matching Numbers (1300)

1400

  1. 248B — Chilly Willy (1400)
  2. 762A — k-th divisor (1400)
  3. 1285C — Fadi and LCM (1400)
  4. 1355D — Game With Array (1400)
  5. 1463B — Find The Array (1400)
  6. 1606C — Banknotes (1400)
  7. 1838C — No Prime Differences (1400)
  8. 1918C — XOR-distance (1400)
  9. 1967B1 — Reverse Card (Easy Version) (1400)
  10. 2009E — Klee's SUPER DUPER LARGE Array!!! (1400)

1500

  1. 710C — Magic Odd Square (1500)
  2. 1133D — Zero Quantity Maximization (1500)
  3. 1141C — Polycarp Restores Permutation (1500)
  4. 1201B — Zero Array (1500)
  5. 1409D — Decrease the Sum of Digits (1500)
  6. 1722G — Even-Odd XOR (1500)
  7. 1809C — Sum on Subarrays (1500)
  8. 1811E — Living Sequence (1500)
  9. 1996D — Fun (1500)

1600

  1. 11B — Jumping Jack (1600)
  2. 235A — LCM Challenge (1600)
  3. 348A — Mafia (1600)
  4. 1165D — Almost All Divisors (1600)
  5. 1342C — Yet Another Counting Problem (1600)
  6. 1349A — Orac and LCM (1600)
  7. 1458A — Row GCD (1600)
  8. 1497C2 — k-LCM (hard version) (1600)
  9. 1514C — Product 1 Modulo N (1600)
  10. 1603B — Moderate Modular Mode (1600)
  11. 1612D — X-Magic Pair (1600)
  12. 1985G — D-Function (1600)

1700

  1. 439C — Devu and Partitioning of the Array (1700)
  2. 578A — A Problem about Polyline (1700)
  3. 983A — Finite or not? (1700)
  4. 1141E — Superhero Battle (1700)
  5. 1228C — Primes and Multiplication (1700)
  6. 1312D — Count the Arrays (1700)
  7. 1325D — Ehab the Xorcist (1700)
  8. 1329B — Dreamoon Likes Sequences (1700)
  9. 1485C — Floor and Mod (1700)
  10. 1554B — Cobb (1700)
  11. 2089A — Simple Permutation (1700)

1800

  1. 7C — Line (1800)
  2. 16C — Monitor (1800)
  3. 1034A — Enlarge GCD (1800)

2000

  1. 1366D — Two Divisors (2000)

If you know other math problems with short statements, share them in the comments! Happy coding!

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English levitational 2026-10-12 15:48:54 11144 Initial revision (published)