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:1034-A | codeforces | 1034-A | Enlarge GCD | https://codeforces.com/problemset/problem/1034/A | [
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 10186
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1033-G | codeforces | 1033-G | Chip Game | https://codeforces.com/problemset/problem/1033/G | [
"games"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 669
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1033-F | codeforces | 1033-F | Boolean Computer | https://codeforces.com/problemset/problem/1033/F | [
"bitmasks",
"brute force",
"fft",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 513
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1033-E | codeforces | 1033-E | Hidden Bipartite Graph | https://codeforces.com/problemset/problem/1033/E | [
"binary search",
"constructive algorithms",
"dfs and similar",
"graphs",
"interactive"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 886
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1033-D | codeforces | 1033-D | Divisors | https://codeforces.com/problemset/problem/1033/D | [
"interactive",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2664
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1033-C | codeforces | 1033-C | Permutation Game | https://codeforces.com/problemset/problem/1033/C | [
"brute force",
"dp",
"games"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6364
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1033-B | codeforces | 1033-B | Square Difference | https://codeforces.com/problemset/problem/1033/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12321
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1033-A | codeforces | 1033-A | King Escape | https://codeforces.com/problemset/problem/1033/A | [
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16481
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1032-G | codeforces | 1032-G | Chattering | https://codeforces.com/problemset/problem/1032/G | [] | null | null | stdin_stdout | 2,900 | {
"solved_count": 556
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1032-F | codeforces | 1032-F | Vasya and Maximum Matching | https://codeforces.com/problemset/problem/1032/F | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1176
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1032-E | codeforces | 1032-E | The Unbearable Lightness of Weights | https://codeforces.com/problemset/problem/1032/E | [
"dp",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1914
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1032-D | codeforces | 1032-D | Barcelonian Distance | https://codeforces.com/problemset/problem/1032/D | [
"geometry",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2993
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1032-C | codeforces | 1032-C | Playing Piano | https://codeforces.com/problemset/problem/1032/C | [
"constructive algorithms",
"dp"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4397
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1032-B | codeforces | 1032-B | Personalized Cup | https://codeforces.com/problemset/problem/1032/B | [] | null | null | stdin_stdout | 1,200 | {
"solved_count": 5176
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1032-A | codeforces | 1032-A | Kitchen Utensils | https://codeforces.com/problemset/problem/1032/A | [] | null | null | stdin_stdout | 900 | {
"solved_count": 7416
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1031-F | codeforces | 1031-F | Familiar Operations | https://codeforces.com/problemset/problem/1031/F | [
"brute force",
"graphs",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 323
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1031-E | codeforces | 1031-E | Triple Flips | https://codeforces.com/problemset/problem/1031/E | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 606
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1031-D | codeforces | 1031-D | Minimum path | https://codeforces.com/problemset/problem/1031/D | [
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3017
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1031-C | codeforces | 1031-C | Cram Time | https://codeforces.com/problemset/problem/1031/C | [
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5628
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1031-B | codeforces | 1031-B | Curiosity Has No Limits | https://codeforces.com/problemset/problem/1031/B | [] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4100
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1031-A | codeforces | 1031-A | Golden Plate | https://codeforces.com/problemset/problem/1031/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 13444
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1030-G | codeforces | 1030-G | Linear Congruential Generator | https://codeforces.com/problemset/problem/1030/G | [
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 488
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1030-F | codeforces | 1030-F | Putting Boxes Together | https://codeforces.com/problemset/problem/1030/F | [
"data structures"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 967
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1030-E | codeforces | 1030-E | Vasya and Good Sequences | https://codeforces.com/problemset/problem/1030/E | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3401
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1030-D | codeforces | 1030-D | Vasya and Triangle | https://codeforces.com/problemset/problem/1030/D | [
"geometry",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6302
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1030-C | codeforces | 1030-C | Vasya and Golden Ticket | https://codeforces.com/problemset/problem/1030/C | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9996
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1030-B | codeforces | 1030-B | Vasya and Cornfield | https://codeforces.com/problemset/problem/1030/B | [
"geometry"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 13384
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1030-A | codeforces | 1030-A | In Search of an Easy Problem | https://codeforces.com/problemset/problem/1030/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 178239
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1029-F | codeforces | 1029-F | Multicolored Markers | https://codeforces.com/problemset/problem/1029/F | [
"binary search",
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2888
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1029-E | codeforces | 1029-E | Tree with Small Distances | https://codeforces.com/problemset/problem/1029/E | [
"dp",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3542
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1029-D | codeforces | 1029-D | Concatenated Multiples | https://codeforces.com/problemset/problem/1029/D | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4326
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1029-C | codeforces | 1029-C | Maximal Intersection | https://codeforces.com/problemset/problem/1029/C | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8457
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1029-B | codeforces | 1029-B | Creating the Contest | https://codeforces.com/problemset/problem/1029/B | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18730
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1029-A | codeforces | 1029-A | Many Equal Substrings | https://codeforces.com/problemset/problem/1029/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13625
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1028-H | codeforces | 1028-H | Make Square | https://codeforces.com/problemset/problem/1028/H | [
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 627
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1028-G | codeforces | 1028-G | Guess the number | https://codeforces.com/problemset/problem/1028/G | [
"dp",
"interactive"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 731
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1028-F | codeforces | 1028-F | Make Symmetrical | https://codeforces.com/problemset/problem/1028/F | [
"brute force"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 672
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1028-E | codeforces | 1028-E | Restore Array | https://codeforces.com/problemset/problem/1028/E | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1231
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1028-D | codeforces | 1028-D | Order book | https://codeforces.com/problemset/problem/1028/D | [
"combinatorics",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1846
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1028-C | codeforces | 1028-C | Rectangles | https://codeforces.com/problemset/problem/1028/C | [
"geometry",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5164
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1028-B | codeforces | 1028-B | Unnatural Conditions | https://codeforces.com/problemset/problem/1028/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10439
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1028-A | codeforces | 1028-A | Find Square | https://codeforces.com/problemset/problem/1028/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 11643
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1027-G | codeforces | 1027-G | X-mouse in the Campus | https://codeforces.com/problemset/problem/1027/G | [
"bitmasks",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 386
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1027-F | codeforces | 1027-F | Session in BSU | https://codeforces.com/problemset/problem/1027/F | [
"binary search",
"dfs and similar",
"dsu",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2032
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1027-E | codeforces | 1027-E | Inverse Coloring | https://codeforces.com/problemset/problem/1027/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2426
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1027-D | codeforces | 1027-D | Mouse Hunt | https://codeforces.com/problemset/problem/1027/D | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8657
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1027-C | codeforces | 1027-C | Minimum Value Rectangle | https://codeforces.com/problemset/problem/1027/C | [
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7169
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1027-B | codeforces | 1027-B | Numbers on the Chessboard | https://codeforces.com/problemset/problem/1027/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8781
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1027-A | codeforces | 1027-A | Palindromic Twist | https://codeforces.com/problemset/problem/1027/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19244
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1025-G | codeforces | 1025-G | Company Acquisitions | https://codeforces.com/problemset/problem/1025/G | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 1046
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1025-F | codeforces | 1025-F | Disjoint Triangles | https://codeforces.com/problemset/problem/1025/F | [
"geometry"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 952
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1025-E | codeforces | 1025-E | Colored Cubes | https://codeforces.com/problemset/problem/1025/E | [
"constructive algorithms",
"implementation",
"matrices"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 626
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1025-D | codeforces | 1025-D | Recovering BST | https://codeforces.com/problemset/problem/1025/D | [
"brute force",
"dp",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4311
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1025-C | codeforces | 1025-C | Plasticine zebra | https://codeforces.com/problemset/problem/1025/C | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6554
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1025-B | codeforces | 1025-B | Weakened Common Divisor | https://codeforces.com/problemset/problem/1025/B | [
"brute force",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8746
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1025-A | codeforces | 1025-A | Doggo Recoloring | https://codeforces.com/problemset/problem/1025/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16729
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1023-G | codeforces | 1023-G | Pisces | https://codeforces.com/problemset/problem/1023/G | [
"data structures",
"flows",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 194
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1023-F | codeforces | 1023-F | Mobile Phone Network | https://codeforces.com/problemset/problem/1023/F | [
"dfs and similar",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1077
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1023-E | codeforces | 1023-E | Down or Right | https://codeforces.com/problemset/problem/1023/E | [
"constructive algorithms",
"interactive",
"matrices"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2271
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1023-D | codeforces | 1023-D | Array Restoration | https://codeforces.com/problemset/problem/1023/D | [
"constructive algorithms",
"data structures"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4336
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1023-C | codeforces | 1023-C | Bracket Subsequence | https://codeforces.com/problemset/problem/1023/C | [
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 11063
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1023-B | codeforces | 1023-B | Pair of Toys | https://codeforces.com/problemset/problem/1023/B | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 11857
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1023-A | codeforces | 1023-A | Single Wildcard Pattern Matching | https://codeforces.com/problemset/problem/1023/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9394
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1020-B | codeforces | 1020-B | Badge | https://codeforces.com/problemset/problem/1020/B | [
"brute force",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 26027
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1020-A | codeforces | 1020-A | New Building for SIS | https://codeforces.com/problemset/problem/1020/A | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 9500
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1019-E | codeforces | 1019-E | Raining season | https://codeforces.com/problemset/problem/1019/E | [
"data structures",
"divide and conquer",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 532
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1019-D | codeforces | 1019-D | Large Triangle | https://codeforces.com/problemset/problem/1019/D | [
"binary search",
"geometry",
"sortings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 776
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1019-C | codeforces | 1019-C | Sergey's problem | https://codeforces.com/problemset/problem/1019/C | [
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1608
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1019-B | codeforces | 1019-B | The hat | https://codeforces.com/problemset/problem/1019/B | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2157
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1019-A | codeforces | 1019-A | Elections | https://codeforces.com/problemset/problem/1019/A | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4882
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1017-H | codeforces | 1017-H | The Films | https://codeforces.com/problemset/problem/1017/H | [
"brute force"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 319
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1017-G | codeforces | 1017-G | The Tree | https://codeforces.com/problemset/problem/1017/G | [
"data structures"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 1332
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1017-F | codeforces | 1017-F | The Neutral Zone | https://codeforces.com/problemset/problem/1017/F | [
"brute force",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1048
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1017-E | codeforces | 1017-E | The Supersonic Rocket | https://codeforces.com/problemset/problem/1017/E | [
"geometry",
"hashing",
"strings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1128
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1017-D | codeforces | 1017-D | The Wu | https://codeforces.com/problemset/problem/1017/D | [
"bitmasks",
"brute force",
"data structures"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4098
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1017-C | codeforces | 1017-C | The Phone Number | https://codeforces.com/problemset/problem/1017/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6545
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1017-B | codeforces | 1017-B | The Bits | https://codeforces.com/problemset/problem/1017/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9712
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1017-A | codeforces | 1017-A | The Rank | https://codeforces.com/problemset/problem/1017/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21709
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1016-G | codeforces | 1016-G | Appropriate Team | https://codeforces.com/problemset/problem/1016/G | [
"bitmasks",
"math",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 364
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1016-F | codeforces | 1016-F | Road Projects | https://codeforces.com/problemset/problem/1016/F | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1097
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1016-E | codeforces | 1016-E | Rest In The Shades | https://codeforces.com/problemset/problem/1016/E | [
"binary search",
"geometry"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1328
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1016-D | codeforces | 1016-D | Vasya And The Matrix | https://codeforces.com/problemset/problem/1016/D | [
"constructive algorithms",
"flows",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5014
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1016-C | codeforces | 1016-C | Vasya And The Mushrooms | https://codeforces.com/problemset/problem/1016/C | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4016
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1016-B | codeforces | 1016-B | Segment Occurrences | https://codeforces.com/problemset/problem/1016/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 10232
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1016-A | codeforces | 1016-A | Death Note | https://codeforces.com/problemset/problem/1016/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16101
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1015-F | codeforces | 1015-F | Bracket Substring | https://codeforces.com/problemset/problem/1015/F | [
"dp",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1542
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1015-E2 | codeforces | 1015-E2 | Stars Drawing (Hard Edition) | https://codeforces.com/problemset/problem/1015/E2 | [
"binary search",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4078
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1015-E1 | codeforces | 1015-E1 | Stars Drawing (Easy Edition) | https://codeforces.com/problemset/problem/1015/E1 | [
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6943
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1015-D | codeforces | 1015-D | Walking Between Houses | https://codeforces.com/problemset/problem/1015/D | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9056
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1015-C | codeforces | 1015-C | Songs Compression | https://codeforces.com/problemset/problem/1015/C | [
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21666
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1015-B | codeforces | 1015-B | Obtaining the String | https://codeforces.com/problemset/problem/1015/B | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12497
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1015-A | codeforces | 1015-A | Points in Segments | https://codeforces.com/problemset/problem/1015/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22705
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1013-B | codeforces | 1013-B | And | https://codeforces.com/problemset/problem/1013/B | [
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8375
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1013-A | codeforces | 1013-A | Piles With Stones | https://codeforces.com/problemset/problem/1013/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 11782
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1012-F | codeforces | 1012-F | Passports | https://codeforces.com/problemset/problem/1012/F | [
"dp",
"implementation"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 269
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1012-E | codeforces | 1012-E | Cycle sort | https://codeforces.com/problemset/problem/1012/E | [
"dsu",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 609
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1012-D | codeforces | 1012-D | AB-Strings | https://codeforces.com/problemset/problem/1012/D | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 473
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1012-C | codeforces | 1012-C | Hills | https://codeforces.com/problemset/problem/1012/C | [
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3916
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1012-B | codeforces | 1012-B | Chemical table | https://codeforces.com/problemset/problem/1012/B | [
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"matrices"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4454
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1012-A | codeforces | 1012-A | Photo of The Sky | https://codeforces.com/problemset/problem/1012/A | [
"brute force",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6723
} | 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.