# 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)](https://codeforces.me/problemset/problem/115/A)↵
2. [1057A — Bmail Computer Network (900)](https://codeforces.me/problemset/problem/1057/A)↵
↵
**1000**↵
↵
1. [500A — New Year Transportation (1000)](https://codeforces.me/problemset/problem/500/A)↵
↵
**1100**↵
↵
1. [1829E — The Lakes (1100)](https://codeforces.me/problemset/problem/1829/E)↵
↵
**1200**↵
↵
1. [217A — Ice Skating (1200)](https://codeforces.me/problemset/problem/217/A)↵
2. [902B — Coloring a Tree (1200)](https://codeforces.me/problemset/problem/902/B)↵
3. [1433D — Districts Connection (1200)](https://codeforces.me/problemset/problem/1433/D)↵
4. [1581B — Diameter of Graph (1200)](https://codeforces.me/problemset/problem/1581/B)↵
↵
**1300**↵
↵
1. [862B — Mahmoud and Ehab and the bipartiteness (1300)](https://codeforces.me/problemset/problem/862/B)↵
↵
**1400**↵
↵
1. [24A — Ring road (1400)](https://codeforces.me/problemset/problem/24/A)↵
2. [437C — The Child and Toy (1400)](https://codeforces.me/problemset/problem/437/C)↵
3. [475B — Strongly Connected City (1400)](https://codeforces.me/problemset/problem/475/B)↵
4. [505B — Mr. Kitayuta's Colorful Graph (1400)](https://codeforces.me/problemset/problem/505/B)↵
5. [520B — Two Buttons (1400)](https://codeforces.me/problemset/problem/520/B)↵
6. [1167C — News Distribution (1400)](https://codeforces.me/problemset/problem/1167/C)↵
↵
**1500**↵
↵
1. [103B — Cthulhu (1500)](https://codeforces.me/problemset/problem/103/B)↵
2. [510B — Fox and Two Dots (1500)](https://codeforces.me/problemset/problem/510/B)↵
3. [580C — Kefa and Park (1500)](https://codeforces.me/problemset/problem/580/C)↵
4. [771A — Bear and Friendship Condition (1500)](https://codeforces.me/problemset/problem/771/A)↵
5. [977E — Cyclic Components (1500)](https://codeforces.me/problemset/problem/977/E)↵
6. [982C — Cut 'em all! (1500)](https://codeforces.me/problemset/problem/982/C)↵
7. [1106D — Lunar New Year and a Wander (1500)](https://codeforces.me/problemset/problem/1106/D)↵
8. [1139C — Edgy Trees (1500)](https://codeforces.me/problemset/problem/1139/C)↵
9. [1169B — Pairs (1500)](https://codeforces.me/problemset/problem/1169/B)↵
10. [1325C — Ehab and Path-etic MEXs (1500)](https://codeforces.me/problemset/problem/1325/C)↵
↵
**1600**↵
↵
1. [23B — Party (1600)](https://codeforces.me/problemset/problem/23/B)↵
2. [377A — Maze (1600)](https://codeforces.me/problemset/problem/377/A)↵
3. [1098A — Sum in the tree (1600)](https://codeforces.me/problemset/problem/1098/A)↵
4. [1363C — Game On Leaves (1600)](https://codeforces.me/problemset/problem/1363/C)↵
5. [1511D — Min Cost String (1600)](https://codeforces.me/problemset/problem/1511/D)↵
6. [1833E — Round Dance (1600)](https://codeforces.me/problemset/problem/1833/E)↵
↵
**1700**↵
↵
1. [22C — System Administrator (1700)](https://codeforces.me/problemset/problem/22/C)↵
2. [216B — Forming Teams (1700)](https://codeforces.me/problemset/problem/216/B)↵
3. [219D — Choosing Capital for Treeland (1700)](https://codeforces.me/problemset/problem/219/D)↵
4. [275B — Convex Shape (1700)](https://codeforces.me/problemset/problem/275/B)↵
5. [598D — Igor In the Museum (1700)](https://codeforces.me/problemset/problem/598/D)↵
6. [919D — Substring (1700)](https://codeforces.me/problemset/problem/919/D)↵
7. [1144F — Graph Without Long Directed Paths (1700)](https://codeforces.me/problemset/problem/1144/F)↵
8. [1176E — Cover it! (1700)](https://codeforces.me/problemset/problem/1176/E)↵
9. [1881F — Minimum Maximum Distance (1700)](https://codeforces.me/problemset/problem/1881/F)↵
10. [1931F — Chat Screenshots (1700)](https://codeforces.me/problemset/problem/1931/F)↵
11. [1970C2 — Game on Tree (Medium) (1700)](https://codeforces.me/problemset/problem/1970/C2)↵
12. [2041D — Drunken Maze (1700)](https://codeforces.me/problemset/problem/2041/D)↵
↵
**1800**↵
↵
1. [33B — String Problem (1800)](https://codeforces.me/problemset/problem/33/B)↵
↵
**1900**↵
↵
1. [20C — Dijkstra? (1900)](https://codeforces.me/problemset/problem/20/C)↵
2. [550D — Regular Bridge (1900)](https://codeforces.me/problemset/problem/550/D)↵
3. [920E — Connected Components? (1900)](https://codeforces.me/problemset/problem/920/E)↵
4. [1085D — Minimum Diameter Tree (1900)](https://codeforces.me/problemset/problem/1085/D)↵
5. [1205B — Shortest Cycle (1900)](https://codeforces.me/problemset/problem/1205/B)↵
6. [1986F — Non-academic Problem (1900)](https://codeforces.me/problemset/problem/1986/F)↵
↵
**2000**↵
↵
1. [1294F — Three Paths on a Tree (2000)](https://codeforces.me/problemset/problem/1294/F)↵
2. [1325F — Ehab's Last Theorem (2000)](https://codeforces.me/problemset/problem/1325/F)↵
3. [1385E — Directing Edges (2000)](https://codeforces.me/problemset/problem/1385/E)↵
↵
↵
**2100**↵
↵
1. [1029E — Tree with Small Distances (2100)](https://codeforces.me/problemset/problem/1029/E)↵
2. [1092F — Tree with Maximum Cost (2100)](https://codeforces.me/problemset/problem/1092/F)↵
↵
If you know other graph problems with short statements, share them in the comments! Happy coding!
↵
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)](https://codeforces.me/problemset/problem/115/A)↵
2. [1057A — Bmail Computer Network (900)](https://codeforces.me/problemset/problem/1057/A)↵
↵
**1000**↵
↵
1. [500A — New Year Transportation (1000)](https://codeforces.me/problemset/problem/500/A)↵
↵
**1100**↵
↵
1. [1829E — The Lakes (1100)](https://codeforces.me/problemset/problem/1829/E)↵
↵
**1200**↵
↵
1. [217A — Ice Skating (1200)](https://codeforces.me/problemset/problem/217/A)↵
2. [902B — Coloring a Tree (1200)](https://codeforces.me/problemset/problem/902/B)↵
3. [1433D — Districts Connection (1200)](https://codeforces.me/problemset/problem/1433/D)↵
4. [1581B — Diameter of Graph (1200)](https://codeforces.me/problemset/problem/1581/B)↵
↵
**1300**↵
↵
1. [862B — Mahmoud and Ehab and the bipartiteness (1300)](https://codeforces.me/problemset/problem/862/B)↵
↵
**1400**↵
↵
1. [24A — Ring road (1400)](https://codeforces.me/problemset/problem/24/A)↵
2. [437C — The Child and Toy (1400)](https://codeforces.me/problemset/problem/437/C)↵
3. [475B — Strongly Connected City (1400)](https://codeforces.me/problemset/problem/475/B)↵
4. [505B — Mr. Kitayuta's Colorful Graph (1400)](https://codeforces.me/problemset/problem/505/B)↵
5. [520B — Two Buttons (1400)](https://codeforces.me/problemset/problem/520/B)↵
6. [1167C — News Distribution (1400)](https://codeforces.me/problemset/problem/1167/C)↵
↵
**1500**↵
↵
1. [103B — Cthulhu (1500)](https://codeforces.me/problemset/problem/103/B)↵
2. [510B — Fox and Two Dots (1500)](https://codeforces.me/problemset/problem/510/B)↵
3. [580C — Kefa and Park (1500)](https://codeforces.me/problemset/problem/580/C)↵
4. [771A — Bear and Friendship Condition (1500)](https://codeforces.me/problemset/problem/771/A)↵
5. [977E — Cyclic Components (1500)](https://codeforces.me/problemset/problem/977/E)↵
6. [982C — Cut 'em all! (1500)](https://codeforces.me/problemset/problem/982/C)↵
7. [1106D — Lunar New Year and a Wander (1500)](https://codeforces.me/problemset/problem/1106/D)↵
8. [1139C — Edgy Trees (1500)](https://codeforces.me/problemset/problem/1139/C)↵
9. [1169B — Pairs (1500)](https://codeforces.me/problemset/problem/1169/B)↵
10. [1325C — Ehab and Path-etic MEXs (1500)](https://codeforces.me/problemset/problem/1325/C)↵
↵
**1600**↵
↵
1. [23B — Party (1600)](https://codeforces.me/problemset/problem/23/B)↵
2. [377A — Maze (1600)](https://codeforces.me/problemset/problem/377/A)↵
3. [1098A — Sum in the tree (1600)](https://codeforces.me/problemset/problem/1098/A)↵
4. [1363C — Game On Leaves (1600)](https://codeforces.me/problemset/problem/1363/C)↵
5. [1511D — Min Cost String (1600)](https://codeforces.me/problemset/problem/1511/D)↵
6. [1833E — Round Dance (1600)](https://codeforces.me/problemset/problem/1833/E)↵
↵
**1700**↵
↵
1. [22C — System Administrator (1700)](https://codeforces.me/problemset/problem/22/C)↵
2. [216B — Forming Teams (1700)](https://codeforces.me/problemset/problem/216/B)↵
3. [219D — Choosing Capital for Treeland (1700)](https://codeforces.me/problemset/problem/219/D)↵
4. [275B — Convex Shape (1700)](https://codeforces.me/problemset/problem/275/B)↵
5. [598D — Igor In the Museum (1700)](https://codeforces.me/problemset/problem/598/D)↵
6. [919D — Substring (1700)](https://codeforces.me/problemset/problem/919/D)↵
7. [1144F — Graph Without Long Directed Paths (1700)](https://codeforces.me/problemset/problem/1144/F)↵
8. [1176E — Cover it! (1700)](https://codeforces.me/problemset/problem/1176/E)↵
9. [1881F — Minimum Maximum Distance (1700)](https://codeforces.me/problemset/problem/1881/F)↵
10. [1931F — Chat Screenshots (1700)](https://codeforces.me/problemset/problem/1931/F)↵
11. [1970C2 — Game on Tree (Medium) (1700)](https://codeforces.me/problemset/problem/1970/C2)↵
12. [2041D — Drunken Maze (1700)](https://codeforces.me/problemset/problem/2041/D)↵
↵
**1800**↵
↵
1. [33B — String Problem (1800)](https://codeforces.me/problemset/problem/33/B)↵
↵
**1900**↵
↵
1. [20C — Dijkstra? (1900)](https://codeforces.me/problemset/problem/20/C)↵
2. [550D — Regular Bridge (1900)](https://codeforces.me/problemset/problem/550/D)↵
3. [920E — Connected Components? (1900)](https://codeforces.me/problemset/problem/920/E)↵
4. [1085D — Minimum Diameter Tree (1900)](https://codeforces.me/problemset/problem/1085/D)↵
5. [1205B — Shortest Cycle (1900)](https://codeforces.me/problemset/problem/1205/B)↵
6. [1986F — Non-academic Problem (1900)](https://codeforces.me/problemset/problem/1986/F)↵
↵
**2000**↵
↵
1. [1294F — Three Paths on a Tree (2000)](https://codeforces.me/problemset/problem/1294/F)↵
2. [1325F — Ehab's Last Theorem (2000)](https://codeforces.me/problemset/problem/1325/F)↵
3. [1385E — Directing Edges (2000)](https://codeforces.me/problemset/problem/1385/E)↵
↵
↵
**2100**↵
↵
1. [1029E — Tree with Small Distances (2100)](https://codeforces.me/problemset/problem/1029/E)↵
2. [1092F — Tree with Maximum Cost (2100)](https://codeforces.me/problemset/problem/1092/F)↵
↵
If you know other graph problems with short statements, share them in the comments! Happy coding!
