List of Graph Problems Having Short Statements (900 to 2100)

Long, wordy statements can be exhausting, especially for beginners. So here is a list of graph problems (DFS/BFS, trees, DSU, shortest paths, constructive graph tasks) 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!

900

1. 115A — Party (900)
2. 1057A — Bmail Computer Network (900)

1000

1. 500A — New Year Transportation (1000)

1100

1. 1829E — The Lakes (1100)

1200

1. 217A — Ice Skating (1200)
2. 902B — Coloring a Tree (1200)
3. 1433D — Districts Connection (1200)
4. 1581B — Diameter of Graph (1200)

1400

1. 24A — Ring road (1400)
2. 437C — The Child and Toy (1400)
3. 475B — Strongly Connected City (1400)
4. 505B — Mr. Kitayuta's Colorful Graph (1400)
5. 520B — Two Buttons (1400)
6. 1167C — News Distribution (1400)

1500

1. 103B — Cthulhu (1500)
2. 510B — Fox and Two Dots (1500)
3. 580C — Kefa and Park (1500)
4. 771A — Bear and Friendship Condition (1500)
5. 977E — Cyclic Components (1500)
6. 982C — Cut 'em all! (1500)
7. 1106D — Lunar New Year and a Wander (1500)
8. 1139C — Edgy Trees (1500)
9. 1169B — Pairs (1500)
10. 1325C — Ehab and Path-etic MEXs (1500)

1600

1. 23B — Party (1600)
2. 377A — Maze (1600)
3. 862B — Mahmoud and Ehab and the bipartiteness (1600)
4. 1098A — Sum in the tree (1600)
5. 1363C — Game On Leaves (1600)
6. 1511D — Min Cost String (1600)
7. 1833E — Round Dance (1600)

1700

1. 22C — System Administrator (1700)
2. 216B — Forming Teams (1700)
3. 219D — Choosing Capital for Treeland (1700)
4. 275B — Convex Shape (1700)
5. 598D — Igor In the Museum (1700)
6. 919D — Substring (1700)
7. 1144F — Graph Without Long Directed Paths (1700)
8. 1176E — Cover it! (1700)
9. 1881F — Minimum Maximum Distance (1700)
10. 1931F — Chat Screenshots (1700)
11. 1970C2 — Game on Tree (Medium) (1700)
12. 2041D — Drunken Maze (1700)

1800

1. 33B — String Problem (1800)

1900

1. 20C — Dijkstra? (1900)
2. 550D — Regular Bridge (1900)
3. 920E — Connected Components? (1900)
4. 1085D — Minimum Diameter Tree (1900)
5. 1205B — Shortest Cycle (1900)
6. 1294F — Three Paths on a Tree (1900)
7. 1986F — Non-academic Problem (1900)

2000

1. 1325F — Ehab's Last Theorem (2000)
2. 1385E — Directing Edges (2000)

2100

1. 1029E — Tree with Small Distances (2100)
2. 1092F — Tree with Maximum Cost (2100)

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