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:1230-B | codeforces | 1230-B | Ania and Minimizing | https://codeforces.com/problemset/problem/1230/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19741
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1230-A | codeforces | 1230-A | Dawid and Bags of Candies | https://codeforces.com/problemset/problem/1230/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23093
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1228-F | codeforces | 1228-F | One Node is Gone | https://codeforces.com/problemset/problem/1228/F | [
"constructive algorithms",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 623
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1228-E | codeforces | 1228-E | Another Filling the Grid | https://codeforces.com/problemset/problem/1228/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3670
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1228-D | codeforces | 1228-D | Complete Tripartite | https://codeforces.com/problemset/problem/1228/D | [
"brute force",
"constructive algorithms",
"graphs",
"hashing",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5462
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1228-C | codeforces | 1228-C | Primes and Multiplication | https://codeforces.com/problemset/problem/1228/C | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9776
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1228-B | codeforces | 1228-B | Filling the Grid | https://codeforces.com/problemset/problem/1228/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11954
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1228-A | codeforces | 1228-A | Distinct Digits | https://codeforces.com/problemset/problem/1228/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23448
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1227-G | codeforces | 1227-G | Not Same | https://codeforces.com/problemset/problem/1227/G | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1271
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1227-F2 | codeforces | 1227-F2 | Wrong Answer on test 233 (Hard Version) | https://codeforces.com/problemset/problem/1227/F2 | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1985
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1227-F1 | codeforces | 1227-F1 | Wrong Answer on test 233 (Easy Version) | https://codeforces.com/problemset/problem/1227/F1 | [
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2094
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1227-E | codeforces | 1227-E | Arson In Berland Forest | https://codeforces.com/problemset/problem/1227/E | [
"binary search",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1826
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1227-D2 | codeforces | 1227-D2 | Optimal Subsequences (Hard Version) | https://codeforces.com/problemset/problem/1227/D2 | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4771
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1227-D1 | codeforces | 1227-D1 | Optimal Subsequences (Easy Version) | https://codeforces.com/problemset/problem/1227/D1 | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6871
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1227-C | codeforces | 1227-C | Messy | https://codeforces.com/problemset/problem/1227/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5821
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1227-B | codeforces | 1227-B | Box | https://codeforces.com/problemset/problem/1227/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10546
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1227-A | codeforces | 1227-A | Math Problem | https://codeforces.com/problemset/problem/1227/A | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10325
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1225-G | codeforces | 1225-G | To Make 1 | https://codeforces.com/problemset/problem/1225/G | [
"bitmasks",
"constructive algorithms",
"dp",
"greedy",
"number theory"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 677
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1225-F | codeforces | 1225-F | Tree Factory | https://codeforces.com/problemset/problem/1225/F | [
"constructive algorithms",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1052
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1225-E | codeforces | 1225-E | Rock Is Push | https://codeforces.com/problemset/problem/1225/E | [
"binary search",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2157
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1225-D | codeforces | 1225-D | Power Products | https://codeforces.com/problemset/problem/1225/D | [
"hashing",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 10506
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1225-C | codeforces | 1225-C | p-binary | https://codeforces.com/problemset/problem/1225/C | [
"bitmasks",
"brute force",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9899
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1225-B2 | codeforces | 1225-B2 | TV Subscriptions (Hard Version) | https://codeforces.com/problemset/problem/1225/B2 | [
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12351
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1225-B1 | codeforces | 1225-B1 | TV Subscriptions (Easy Version) | https://codeforces.com/problemset/problem/1225/B1 | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 12598
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1225-A | codeforces | 1225-A | Forgetting Things | https://codeforces.com/problemset/problem/1225/A | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16724
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1223-G | codeforces | 1223-G | Wooden Raft | https://codeforces.com/problemset/problem/1223/G | [
"binary search",
"math",
"number theory"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 431
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1223-F | codeforces | 1223-F | Stack Exterminable Arrays | https://codeforces.com/problemset/problem/1223/F | [
"data structures",
"divide and conquer",
"dp",
"hashing"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 2325
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1223-E | codeforces | 1223-E | Paint the Tree | https://codeforces.com/problemset/problem/1223/E | [
"dp",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3011
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1223-D | codeforces | 1223-D | Sequence Sorting | https://codeforces.com/problemset/problem/1223/D | [
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4540
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1223-C | codeforces | 1223-C | Save the Nature | https://codeforces.com/problemset/problem/1223/C | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9932
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1223-B | codeforces | 1223-B | Strings Equalization | https://codeforces.com/problemset/problem/1223/B | [
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16197
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1223-A | codeforces | 1223-A | CME | https://codeforces.com/problemset/problem/1223/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22398
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1221-G | codeforces | 1221-G | Graph And Numbers | https://codeforces.com/problemset/problem/1221/G | [
"bitmasks",
"brute force",
"combinatorics",
"dp",
"meet-in-the-middle"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1038
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1221-F | codeforces | 1221-F | Choose a Square | https://codeforces.com/problemset/problem/1221/F | [
"binary search",
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1306
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1221-E | codeforces | 1221-E | Game With String | https://codeforces.com/problemset/problem/1221/E | [
"games"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1200
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1221-D | codeforces | 1221-D | Make The Fence Great Again | https://codeforces.com/problemset/problem/1221/D | [
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 10387
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1221-C | codeforces | 1221-C | Perfect Team | https://codeforces.com/problemset/problem/1221/C | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 25181
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1221-B | codeforces | 1221-B | Knights | https://codeforces.com/problemset/problem/1221/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12564
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1221-A | codeforces | 1221-A | 2048 Game | https://codeforces.com/problemset/problem/1221/A | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 18322
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1220-G | codeforces | 1220-G | Geolocation | https://codeforces.com/problemset/problem/1220/G | [
"geometry"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 126
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1220-F | codeforces | 1220-F | Gardener Alex | https://codeforces.com/problemset/problem/1220/F | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 903
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1220-E | codeforces | 1220-E | Tourism | https://codeforces.com/problemset/problem/1220/E | [
"dfs and similar",
"dp",
"dsu",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3064
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1220-D | codeforces | 1220-D | Alex and Julian | https://codeforces.com/problemset/problem/1220/D | [
"bitmasks",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4152
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1220-C | codeforces | 1220-C | Substring Game in the Lesson | https://codeforces.com/problemset/problem/1220/C | [
"games",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 10850
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1220-B | codeforces | 1220-B | Multiplication Table | https://codeforces.com/problemset/problem/1220/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12195
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1220-A | codeforces | 1220-A | Cards | https://codeforces.com/problemset/problem/1220/A | [
"implementation",
"sortings",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33116
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1219-G | codeforces | 1219-G | Harvester | https://codeforces.com/problemset/problem/1219/G | [
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 854
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1219-C | codeforces | 1219-C | Periodic integer number | https://codeforces.com/problemset/problem/1219/C | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2499
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1218-I | codeforces | 1218-I | The Light Square | https://codeforces.com/problemset/problem/1218/I | [
"2-sat",
"dfs and similar",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 799
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1218-H | codeforces | 1218-H | Function Composition | https://codeforces.com/problemset/problem/1218/H | [
"dfs and similar"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 221
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1218-G | codeforces | 1218-G | Alpha planetary system | https://codeforces.com/problemset/problem/1218/G | [
"constructive algorithms",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 318
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1218-F | codeforces | 1218-F | Workout plan | https://codeforces.com/problemset/problem/1218/F | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3219
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1218-E | codeforces | 1218-E | Product Tuples | https://codeforces.com/problemset/problem/1218/E | [
"divide and conquer",
"fft"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 533
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1218-D | codeforces | 1218-D | Xor Spanning Tree | https://codeforces.com/problemset/problem/1218/D | [
"divide and conquer",
"fft",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 624
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1218-C | codeforces | 1218-C | Jumping Transformers | https://codeforces.com/problemset/problem/1218/C | [
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 263
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1218-B | codeforces | 1218-B | Guarding warehouses | https://codeforces.com/problemset/problem/1218/B | [
"data structures",
"geometry"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 200
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1218-A | codeforces | 1218-A | BubbleReactor | https://codeforces.com/problemset/problem/1218/A | [
"dp",
"graphs"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 186
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1217-F | codeforces | 1217-F | Forced Online Queries Problem | https://codeforces.com/problemset/problem/1217/F | [
"data structures",
"divide and conquer",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 748
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1217-E | codeforces | 1217-E | Sum Queries? | https://codeforces.com/problemset/problem/1217/E | [
"data structures",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2126
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1217-D | codeforces | 1217-D | Coloring Edges | https://codeforces.com/problemset/problem/1217/D | [
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 6080
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1217-C | codeforces | 1217-C | The Number Of Good Substrings | https://codeforces.com/problemset/problem/1217/C | [
"binary search",
"bitmasks",
"brute force"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7914
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1217-B | codeforces | 1217-B | Zmei Gorynich | https://codeforces.com/problemset/problem/1217/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11924
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1217-A | codeforces | 1217-A | Creating a Character | https://codeforces.com/problemset/problem/1217/A | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15878
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1216-F | codeforces | 1216-F | Wi-Fi | https://codeforces.com/problemset/problem/1216/F | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3245
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1216-E2 | codeforces | 1216-E2 | Numerical Sequence (hard version) | https://codeforces.com/problemset/problem/1216/E2 | [
"binary search",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1699
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1216-E1 | codeforces | 1216-E1 | Numerical Sequence (easy version) | https://codeforces.com/problemset/problem/1216/E1 | [
"binary search",
"brute force",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3783
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1216-D | codeforces | 1216-D | Swords | https://codeforces.com/problemset/problem/1216/D | [
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12442
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1216-C | codeforces | 1216-C | White Sheet | https://codeforces.com/problemset/problem/1216/C | [
"geometry",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10550
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1216-B | codeforces | 1216-B | Shooting | https://codeforces.com/problemset/problem/1216/B | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 19893
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1216-A | codeforces | 1216-A | Prefixes | https://codeforces.com/problemset/problem/1216/A | [
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19668
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1215-F | codeforces | 1215-F | Radio Stations | https://codeforces.com/problemset/problem/1215/F | [
"2-sat"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1289
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1215-E | codeforces | 1215-E | Marbles | https://codeforces.com/problemset/problem/1215/E | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3622
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1215-D | codeforces | 1215-D | Ticket Game | https://codeforces.com/problemset/problem/1215/D | [
"games",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6624
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1215-C | codeforces | 1215-C | Swap Letters | https://codeforces.com/problemset/problem/1215/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12047
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1215-B | codeforces | 1215-B | The Number of Products | https://codeforces.com/problemset/problem/1215/B | [
"combinatorics",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 19571
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1215-A | codeforces | 1215-A | Yellow Cards | https://codeforces.com/problemset/problem/1215/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 12265
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1214-H | codeforces | 1214-H | Tiles Placement | https://codeforces.com/problemset/problem/1214/H | [
"constructive algorithms",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 523
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1214-G | codeforces | 1214-G | Feeling Good | https://codeforces.com/problemset/problem/1214/G | [
"bitmasks",
"data structures"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 475
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1214-F | codeforces | 1214-F | Employment | https://codeforces.com/problemset/problem/1214/F | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 548
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1214-E | codeforces | 1214-E | Petya and Construction Set | https://codeforces.com/problemset/problem/1214/E | [
"constructive algorithms",
"graphs",
"math",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2889
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1214-D | codeforces | 1214-D | Treasure Island | https://codeforces.com/problemset/problem/1214/D | [
"dfs and similar",
"dp",
"flows",
"hashing"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7209
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1214-C | codeforces | 1214-C | Bad Sequence | https://codeforces.com/problemset/problem/1214/C | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14299
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1214-B | codeforces | 1214-B | Badges | https://codeforces.com/problemset/problem/1214/B | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 11542
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1214-A | codeforces | 1214-A | Optimal Currency Exchange | https://codeforces.com/problemset/problem/1214/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9536
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1213-G | codeforces | 1213-G | Path Queries | https://codeforces.com/problemset/problem/1213/G | [
"divide and conquer",
"dsu",
"graphs",
"sortings",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 10029
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1213-F | codeforces | 1213-F | Unstable String Sort | https://codeforces.com/problemset/problem/1213/F | [
"data structures",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3131
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1213-E | codeforces | 1213-E | Two Small Strings | https://codeforces.com/problemset/problem/1213/E | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5504
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1213-D2 | codeforces | 1213-D2 | Equalizing by Division (hard version) | https://codeforces.com/problemset/problem/1213/D2 | [
"brute force",
"math",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12361
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1213-D1 | codeforces | 1213-D1 | Equalizing by Division (easy version) | https://codeforces.com/problemset/problem/1213/D1 | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12196
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1213-C | codeforces | 1213-C | Book Reading | https://codeforces.com/problemset/problem/1213/C | [
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19772
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1213-B | codeforces | 1213-B | Bad Prices | https://codeforces.com/problemset/problem/1213/B | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 32265
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1213-A | codeforces | 1213-A | Chips Moving | https://codeforces.com/problemset/problem/1213/A | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 25797
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1211-I | codeforces | 1211-I | Unusual Graph | https://codeforces.com/problemset/problem/1211/I | [
"*special",
"graphs"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 55
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1211-H | codeforces | 1211-H | Road Repair in Treeland | https://codeforces.com/problemset/problem/1211/H | [
"*special",
"binary search",
"dp",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 60
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1211-G | codeforces | 1211-G | King's Path | https://codeforces.com/problemset/problem/1211/G | [
"*special",
"math",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 89
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1211-F | codeforces | 1211-F | kotlinkotlinkotlinkotlin... | https://codeforces.com/problemset/problem/1211/F | [
"*special",
"graphs",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 153
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1211-E | codeforces | 1211-E | Double Permutation Inc. | https://codeforces.com/problemset/problem/1211/E | [
"*special",
"binary search",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 220
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1211-D | codeforces | 1211-D | Teams | https://codeforces.com/problemset/problem/1211/D | [
"*special",
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 254
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1211-C | codeforces | 1211-C | Ice Cream | https://codeforces.com/problemset/problem/1211/C | [
"*special",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 571
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1211-B | codeforces | 1211-B | Traveling Around the Golden Ring of Berland | https://codeforces.com/problemset/problem/1211/B | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 831
} | 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.