uid stringlengths 9 18 | source stringclasses 2
values | native_id stringlengths 3 7 | title stringlengths 2 64 | url stringlengths 36 49 | tags listlengths 0 11 | time_limit_ms null | memory_limit_mb null | io_type stringclasses 1
value | difficulty_rating int64 800 3.5k ⌀ | stats dict | last_scraped_at stringclasses 2
values |
|---|---|---|---|---|---|---|---|---|---|---|---|
codeforces:1195-B | codeforces | 1195-B | Sport Mafia | https://codeforces.com/problemset/problem/1195/B | [
"binary search",
"brute force",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22197
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1195-A | codeforces | 1195-A | Drinks Choosing | https://codeforces.com/problemset/problem/1195/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 14361
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1194-G | codeforces | 1194-G | Another Meme Problem | https://codeforces.com/problemset/problem/1194/G | [
"dp"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 373
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1194-F | codeforces | 1194-F | Crossword Expert | https://codeforces.com/problemset/problem/1194/F | [
"combinatorics",
"dp",
"number theory",
"probabilities",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1256
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1194-E | codeforces | 1194-E | Count The Rectangles | https://codeforces.com/problemset/problem/1194/E | [
"bitmasks",
"brute force",
"data structures",
"geometry",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2103
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1194-D | codeforces | 1194-D | 1-2-K Game | https://codeforces.com/problemset/problem/1194/D | [
"games",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7363
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1194-C | codeforces | 1194-C | From S To T | https://codeforces.com/problemset/problem/1194/C | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14727
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1194-B | codeforces | 1194-B | Yet Another Crosses Problem | https://codeforces.com/problemset/problem/1194/B | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 10754
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1194-A | codeforces | 1194-A | Remove a Progression | https://codeforces.com/problemset/problem/1194/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17529
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1193-C | codeforces | 1193-C | Scissors and Tape | https://codeforces.com/problemset/problem/1193/C | [
"*special",
"constructive algorithms",
"geometry"
] | null | null | stdin_stdout | null | {
"solved_count": 48
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1193-B | codeforces | 1193-B | Magic Tree | https://codeforces.com/problemset/problem/1193/B | [
"*special",
"data structures",
"dp",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 513
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1193-A | codeforces | 1193-A | Amusement Park | https://codeforces.com/problemset/problem/1193/A | [
"*special",
"dp",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 481
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1192-C | codeforces | 1192-C | Cubeword | https://codeforces.com/problemset/problem/1192/C | [
"*special",
"brute force",
"dp",
"meet-in-the-middle"
] | null | null | stdin_stdout | null | {
"solved_count": 372
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1192-B | codeforces | 1192-B | Dynamic Diameter | https://codeforces.com/problemset/problem/1192/B | [
"*special",
"data structures",
"dfs and similar",
"divide and conquer",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 1616
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1192-A | codeforces | 1192-A | Building Skyscrapers | https://codeforces.com/problemset/problem/1192/A | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 82
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1191-B | codeforces | 1191-B | Tokitsukaze and Mahjong | https://codeforces.com/problemset/problem/1191/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9904
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1191-A | codeforces | 1191-A | Tokitsukaze and Enhancement | https://codeforces.com/problemset/problem/1191/A | [
"brute force"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19110
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1190-F | codeforces | 1190-F | Tokitsukaze and Powers | https://codeforces.com/problemset/problem/1190/F | [
"number theory",
"probabilities"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 247
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1190-E | codeforces | 1190-E | Tokitsukaze and Explosion | https://codeforces.com/problemset/problem/1190/E | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 370
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1190-D | codeforces | 1190-D | Tokitsukaze and Strange Rectangle | https://codeforces.com/problemset/problem/1190/D | [
"data structures",
"divide and conquer",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2729
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1190-C | codeforces | 1190-C | Tokitsukaze and Duel | https://codeforces.com/problemset/problem/1190/C | [
"brute force",
"games",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2346
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1190-B | codeforces | 1190-B | Tokitsukaze, CSL and Stone Game | https://codeforces.com/problemset/problem/1190/B | [
"games"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6879
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1190-A | codeforces | 1190-A | Tokitsukaze and Discard Items | https://codeforces.com/problemset/problem/1190/A | [
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9849
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1189-C | codeforces | 1189-C | Candies! | https://codeforces.com/problemset/problem/1189/C | [
"data structures",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11138
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1189-B | codeforces | 1189-B | Number Circle | https://codeforces.com/problemset/problem/1189/B | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15469
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1189-A | codeforces | 1189-A | Keanu Reeves | https://codeforces.com/problemset/problem/1189/A | [
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16172
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1188-E | codeforces | 1188-E | Problem from Red Panda | https://codeforces.com/problemset/problem/1188/E | [
"combinatorics"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 317
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1188-D | codeforces | 1188-D | Make Equal | https://codeforces.com/problemset/problem/1188/D | [
"dp"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 1109
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1188-C | codeforces | 1188-C | Array Beauty | https://codeforces.com/problemset/problem/1188/C | [
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2219
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1188-B | codeforces | 1188-B | Count Pairs | https://codeforces.com/problemset/problem/1188/B | [
"math",
"matrices",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 5409
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1188-A2 | codeforces | 1188-A2 | Add on a Tree: Revolution | https://codeforces.com/problemset/problem/1188/A2 | [
"constructive algorithms",
"dfs and similar",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1333
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1188-A1 | codeforces | 1188-A1 | Add on a Tree | https://codeforces.com/problemset/problem/1188/A1 | [
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9063
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1187-G | codeforces | 1187-G | Gang Up | https://codeforces.com/problemset/problem/1187/G | [
"flows",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 728
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1187-F | codeforces | 1187-F | Expected Square Beauty | https://codeforces.com/problemset/problem/1187/F | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1193
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1187-E | codeforces | 1187-E | Tree Painting | https://codeforces.com/problemset/problem/1187/E | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 12011
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1187-D | codeforces | 1187-D | Subarray Sorting | https://codeforces.com/problemset/problem/1187/D | [
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 3076
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1187-C | codeforces | 1187-C | Vasya And Array | https://codeforces.com/problemset/problem/1187/C | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6825
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1187-B | codeforces | 1187-B | Letters Shop | https://codeforces.com/problemset/problem/1187/B | [
"binary search",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12965
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1187-A | codeforces | 1187-A | Stickers and Toys | https://codeforces.com/problemset/problem/1187/A | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 15661
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1186-F | codeforces | 1186-F | Vus the Cossack and a Graph | https://codeforces.com/problemset/problem/1186/F | [
"dfs and similar",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1192
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1186-E | codeforces | 1186-E | Vus the Cossack and a Field | https://codeforces.com/problemset/problem/1186/E | [
"divide and conquer",
"implementation",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 771
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1186-D | codeforces | 1186-D | Vus the Cossack and Numbers | https://codeforces.com/problemset/problem/1186/D | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9367
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1186-C | codeforces | 1186-C | Vus the Cossack and Strings | https://codeforces.com/problemset/problem/1186/C | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6614
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1186-A | codeforces | 1186-A | Vus the Cossack and a Contest | https://codeforces.com/problemset/problem/1186/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 43034
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1185-G2 | codeforces | 1185-G2 | Playlist for Polycarp (hard version) | https://codeforces.com/problemset/problem/1185/G2 | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 989
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1185-G1 | codeforces | 1185-G1 | Playlist for Polycarp (easy version) | https://codeforces.com/problemset/problem/1185/G1 | [
"bitmasks",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3271
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1185-F | codeforces | 1185-F | Two Pizzas | https://codeforces.com/problemset/problem/1185/F | [
"bitmasks",
"brute force"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2305
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1185-E | codeforces | 1185-E | Polycarp and Snakes | https://codeforces.com/problemset/problem/1185/E | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2834
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1185-D | codeforces | 1185-D | Extra Element | https://codeforces.com/problemset/problem/1185/D | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7080
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1185-C2 | codeforces | 1185-C2 | Exam in BerSU (hard version) | https://codeforces.com/problemset/problem/1185/C2 | [
"brute force",
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7869
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1185-C1 | codeforces | 1185-C1 | Exam in BerSU (easy version) | https://codeforces.com/problemset/problem/1185/C1 | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 11943
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1185-B | codeforces | 1185-B | Email from Polycarp | https://codeforces.com/problemset/problem/1185/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14351
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1185-A | codeforces | 1185-A | Ropewalkers | https://codeforces.com/problemset/problem/1185/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15477
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1184-E3 | codeforces | 1184-E3 | Daleks' Invasion (hard) | https://codeforces.com/problemset/problem/1184/E3 | [
"data structures",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 704
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1184-E2 | codeforces | 1184-E2 | Daleks' Invasion (medium) | https://codeforces.com/problemset/problem/1184/E2 | [
"dfs and similar",
"graphs",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1123
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1184-E1 | codeforces | 1184-E1 | Daleks' Invasion (easy) | https://codeforces.com/problemset/problem/1184/E1 | [
"graphs",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1884
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1184-D2 | codeforces | 1184-D2 | Parallel Universes (Hard) | https://codeforces.com/problemset/problem/1184/D2 | [
"math",
"matrices"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 169
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1184-D1 | codeforces | 1184-D1 | Parallel Universes (Easy) | https://codeforces.com/problemset/problem/1184/D1 | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2817
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1184-C3 | codeforces | 1184-C3 | Heidi and the Turing Test (Hard) | https://codeforces.com/problemset/problem/1184/C3 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 50
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1184-C2 | codeforces | 1184-C2 | Heidi and the Turing Test (Medium) | https://codeforces.com/problemset/problem/1184/C2 | [
"data structures"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 804
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1184-C1 | codeforces | 1184-C1 | Heidi and the Turing Test (Easy) | https://codeforces.com/problemset/problem/1184/C1 | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2965
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1184-B3 | codeforces | 1184-B3 | The Doctor Meets Vader (Hard) | https://codeforces.com/problemset/problem/1184/B3 | [
"flows",
"shortest paths"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 310
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1184-B2 | codeforces | 1184-B2 | The Doctor Meets Vader (Medium) | https://codeforces.com/problemset/problem/1184/B2 | [
"flows",
"graph matchings",
"graphs",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 715
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1184-B1 | codeforces | 1184-B1 | The Doctor Meets Vader (Easy) | https://codeforces.com/problemset/problem/1184/B1 | [
"binary search",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 6269
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1184-A3 | codeforces | 1184-A3 | Heidi Learns Hashing (Hard) | https://codeforces.com/problemset/problem/1184/A3 | [
"fft",
"math",
"number theory"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 177
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1184-A2 | codeforces | 1184-A2 | Heidi Learns Hashing (Medium) | https://codeforces.com/problemset/problem/1184/A2 | [
"brute force",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1153
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1184-A1 | codeforces | 1184-A1 | Heidi Learns Hashing (Easy) | https://codeforces.com/problemset/problem/1184/A1 | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 6661
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1183-H | codeforces | 1183-H | Subsequences (hard version) | https://codeforces.com/problemset/problem/1183/H | [
"dp",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3727
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1183-G | codeforces | 1183-G | Candy Box (hard version) | https://codeforces.com/problemset/problem/1183/G | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2738
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1183-F | codeforces | 1183-F | Topforces Strikes Back | https://codeforces.com/problemset/problem/1183/F | [
"brute force",
"math",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2288
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1183-E | codeforces | 1183-E | Subsequences (easy version) | https://codeforces.com/problemset/problem/1183/E | [
"dp",
"graphs",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5572
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1183-D | codeforces | 1183-D | Candy Box (easy version) | https://codeforces.com/problemset/problem/1183/D | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 21813
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1183-C | codeforces | 1183-C | Computer Game | https://codeforces.com/problemset/problem/1183/C | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15218
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1183-B | codeforces | 1183-B | Equalize Prices | https://codeforces.com/problemset/problem/1183/B | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 19829
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1183-A | codeforces | 1183-A | Nearest Interesting Number | https://codeforces.com/problemset/problem/1183/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27221
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1182-F | codeforces | 1182-F | Maximum Sine | https://codeforces.com/problemset/problem/1182/F | [
"binary search",
"data structures",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 449
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1182-E | codeforces | 1182-E | Product Oriented Recurrence | https://codeforces.com/problemset/problem/1182/E | [
"dp",
"math",
"matrices",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3477
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1182-D | codeforces | 1182-D | Complete Mirror | https://codeforces.com/problemset/problem/1182/D | [
"constructive algorithms",
"dfs and similar",
"dp",
"hashing",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1046
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1182-C | codeforces | 1182-C | Beautiful Lyrics | https://codeforces.com/problemset/problem/1182/C | [
"data structures",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4609
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1182-B | codeforces | 1182-B | Plus from Picture | https://codeforces.com/problemset/problem/1182/B | [
"dfs and similar",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12090
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1182-A | codeforces | 1182-A | Filling Shapes | https://codeforces.com/problemset/problem/1182/A | [
"dp",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 36226
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1181-E2 | codeforces | 1181-E2 | A Story of One Country (Hard) | https://codeforces.com/problemset/problem/1181/E2 | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 548
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1181-E1 | codeforces | 1181-E1 | A Story of One Country (Easy) | https://codeforces.com/problemset/problem/1181/E1 | [
"brute force",
"divide and conquer",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 673
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1181-D | codeforces | 1181-D | Irrigation | https://codeforces.com/problemset/problem/1181/D | [
"binary search",
"data structures",
"implementation",
"sortings",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2908
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1181-C | codeforces | 1181-C | Flag | https://codeforces.com/problemset/problem/1181/C | [
"brute force",
"combinatorics",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3415
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1181-B | codeforces | 1181-B | Split a Number | https://codeforces.com/problemset/problem/1181/B | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6666
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1181-A | codeforces | 1181-A | Chunga-Changa | https://codeforces.com/problemset/problem/1181/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 15044
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1180-B | codeforces | 1180-B | Nick and Array | https://codeforces.com/problemset/problem/1180/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10150
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1180-A | codeforces | 1180-A | Alex and a Rhombus | https://codeforces.com/problemset/problem/1180/A | [
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27757
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1179-E | codeforces | 1179-E | Alesya and Discrete Math | https://codeforces.com/problemset/problem/1179/E | [
"divide and conquer",
"interactive"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 204
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1179-D | codeforces | 1179-D | Fedor Runs for President | https://codeforces.com/problemset/problem/1179/D | [
"data structures",
"dp",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1088
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1179-C | codeforces | 1179-C | Serge and Dining Room | https://codeforces.com/problemset/problem/1179/C | [
"binary search",
"data structures",
"graph matchings",
"greedy",
"implementation",
"math",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2555
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1179-B | codeforces | 1179-B | Tolik and His Uncle | https://codeforces.com/problemset/problem/1179/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4614
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1179-A | codeforces | 1179-A | Valeriy and Deque | https://codeforces.com/problemset/problem/1179/A | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12057
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1178-H | codeforces | 1178-H | Stock Exchange | https://codeforces.com/problemset/problem/1178/H | [
"binary search",
"flows",
"graphs"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 299
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1178-G | codeforces | 1178-G | The Awesomest Vertex | https://codeforces.com/problemset/problem/1178/G | [
"data structures",
"dfs and similar"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 677
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1178-F2 | codeforces | 1178-F2 | Long Colorful Strip | https://codeforces.com/problemset/problem/1178/F2 | [
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1092
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1178-F1 | codeforces | 1178-F1 | Short Colorful Strip | https://codeforces.com/problemset/problem/1178/F1 | [
"combinatorics",
"dfs and similar",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2348
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1178-E | codeforces | 1178-E | Archaeology | https://codeforces.com/problemset/problem/1178/E | [
"brute force",
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4606
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1178-D | codeforces | 1178-D | Prime Graph | https://codeforces.com/problemset/problem/1178/D | [
"constructive algorithms",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7975
} | 2026-08-17T01:43:56.191071+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.