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:1324-D | codeforces | 1324-D | Pair of Topics | https://codeforces.com/problemset/problem/1324/D | [
"binary search",
"data structures",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 36185
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1324-C | codeforces | 1324-C | Frog Jumps | https://codeforces.com/problemset/problem/1324/C | [
"binary search",
"data structures",
"dfs and similar",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 31221
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1324-B | codeforces | 1324-B | Yet Another Palindrome Problem | https://codeforces.com/problemset/problem/1324/B | [
"brute force",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 31215
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1324-A | codeforces | 1324-A | Yet Another Tetris Problem | https://codeforces.com/problemset/problem/1324/A | [
"implementation",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 27648
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1323-B | codeforces | 1323-B | Count Subrectangles | https://codeforces.com/problemset/problem/1323/B | [
"binary search",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12766
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1323-A | codeforces | 1323-A | Even Subset Sum Problem | https://codeforces.com/problemset/problem/1323/A | [
"brute force",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21148
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1322-F | codeforces | 1322-F | Assigning Fares | https://codeforces.com/problemset/problem/1322/F | [
"dp",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 176
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1322-E | codeforces | 1322-E | Median Mountain Range | https://codeforces.com/problemset/problem/1322/E | [
"data structures"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 424
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1322-D | codeforces | 1322-D | Reality Show | https://codeforces.com/problemset/problem/1322/D | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 926
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1322-C | codeforces | 1322-C | Instant Noodles | https://codeforces.com/problemset/problem/1322/C | [
"graphs",
"hashing",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2816
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1322-B | codeforces | 1322-B | Present | https://codeforces.com/problemset/problem/1322/B | [
"binary search",
"bitmasks",
"constructive algorithms",
"data structures",
"math",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4786
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1322-A | codeforces | 1322-A | Unusual Competitions | https://codeforces.com/problemset/problem/1322/A | [
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12992
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1321-C | codeforces | 1321-C | Remove Adjacent | https://codeforces.com/problemset/problem/1321/C | [
"brute force",
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10682
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1321-A | codeforces | 1321-A | Contest for Robots | https://codeforces.com/problemset/problem/1321/A | [
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 15109
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1320-F | codeforces | 1320-F | Blocks and Sensors | https://codeforces.com/problemset/problem/1320/F | [
"brute force"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 177
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1320-E | codeforces | 1320-E | Treeland and Viruses | https://codeforces.com/problemset/problem/1320/E | [
"data structures",
"dfs and similar",
"dp",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1164
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1320-D | codeforces | 1320-D | Reachable Strings | https://codeforces.com/problemset/problem/1320/D | [
"data structures",
"hashing",
"strings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1782
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1320-C | codeforces | 1320-C | World of Darkraft: Battle for Azathoth | https://codeforces.com/problemset/problem/1320/C | [
"brute force",
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3469
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1320-B | codeforces | 1320-B | Navigation System | https://codeforces.com/problemset/problem/1320/B | [
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6746
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1320-A | codeforces | 1320-A | Journey Planning | https://codeforces.com/problemset/problem/1320/A | [
"data structures",
"dp",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 23615
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1316-F | codeforces | 1316-F | Battalion Strength | https://codeforces.com/problemset/problem/1316/F | [
"data structures",
"divide and conquer",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1001
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1316-E | codeforces | 1316-E | Team Building | https://codeforces.com/problemset/problem/1316/E | [
"bitmasks",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 6087
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1316-D | codeforces | 1316-D | Nash Matrix | https://codeforces.com/problemset/problem/1316/D | [
"constructive algorithms",
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3693
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1316-C | codeforces | 1316-C | Primitive Primes | https://codeforces.com/problemset/problem/1316/C | [
"constructive algorithms",
"math",
"ternary search"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7659
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1316-B | codeforces | 1316-B | String Modification | https://codeforces.com/problemset/problem/1316/B | [
"brute force",
"constructive algorithms",
"implementation",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11898
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1316-A | codeforces | 1316-A | Grade Allocation | https://codeforces.com/problemset/problem/1316/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19938
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1315-C | codeforces | 1315-C | Restoring Permutation | https://codeforces.com/problemset/problem/1315/C | [
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10838
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1315-B | codeforces | 1315-B | Homecoming | https://codeforces.com/problemset/problem/1315/B | [
"binary search",
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9764
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1315-A | codeforces | 1315-A | Dead Pixel | https://codeforces.com/problemset/problem/1315/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 13063
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1313-E | codeforces | 1313-E | Concatenation with intersection | https://codeforces.com/problemset/problem/1313/E | [
"data structures",
"hashing",
"strings",
"two pointers"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 798
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1313-D | codeforces | 1313-D | Happy New Year | https://codeforces.com/problemset/problem/1313/D | [
"bitmasks",
"dp",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1620
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1313-C2 | codeforces | 1313-C2 | Skyscrapers (hard version) | https://codeforces.com/problemset/problem/1313/C2 | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7713
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1313-C1 | codeforces | 1313-C1 | Skyscrapers (easy version) | https://codeforces.com/problemset/problem/1313/C1 | [
"brute force",
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11248
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1313-B | codeforces | 1313-B | Different Rules | https://codeforces.com/problemset/problem/1313/B | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7095
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1313-A | codeforces | 1313-A | Fast Food Restaurant | https://codeforces.com/problemset/problem/1313/A | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16436
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1312-G | codeforces | 1312-G | Autocompletion | https://codeforces.com/problemset/problem/1312/G | [
"data structures",
"dfs and similar",
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1188
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1312-F | codeforces | 1312-F | Attack on Red Kingdom | https://codeforces.com/problemset/problem/1312/F | [
"games",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1101
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1312-E | codeforces | 1312-E | Array Shrinking | https://codeforces.com/problemset/problem/1312/E | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 8270
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1312-D | codeforces | 1312-D | Count the Arrays | https://codeforces.com/problemset/problem/1312/D | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11065
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1312-C | codeforces | 1312-C | Adding Powers | https://codeforces.com/problemset/problem/1312/C | [
"bitmasks",
"greedy",
"implementation",
"math",
"number theory",
"ternary search"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 18801
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1312-B | codeforces | 1312-B | Bogosort | https://codeforces.com/problemset/problem/1312/B | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 43000
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1312-A | codeforces | 1312-A | Two Regular Polygons | https://codeforces.com/problemset/problem/1312/A | [
"geometry",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27919
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1311-F | codeforces | 1311-F | Moving Points | https://codeforces.com/problemset/problem/1311/F | [
"data structures",
"divide and conquer",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5086
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1311-E | codeforces | 1311-E | Construct the Binary Tree | https://codeforces.com/problemset/problem/1311/E | [
"brute force",
"constructive algorithms",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2992
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1311-D | codeforces | 1311-D | Three Integers | https://codeforces.com/problemset/problem/1311/D | [
"brute force",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 10157
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1311-C | codeforces | 1311-C | Perform the Combo | https://codeforces.com/problemset/problem/1311/C | [
"brute force"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17132
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1311-B | codeforces | 1311-B | WeirdSort | https://codeforces.com/problemset/problem/1311/B | [
"dfs and similar",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 20302
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1311-A | codeforces | 1311-A | Add Odd or Subtract Even | https://codeforces.com/problemset/problem/1311/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 47219
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1310-F | codeforces | 1310-F | Bad Cryptography | https://codeforces.com/problemset/problem/1310/F | [
"math",
"number theory"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 257
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1310-E | codeforces | 1310-E | Strange Function | https://codeforces.com/problemset/problem/1310/E | [
"dp"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 583
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1310-D | codeforces | 1310-D | Tourism | https://codeforces.com/problemset/problem/1310/D | [
"dp",
"graphs",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2146
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1310-C | codeforces | 1310-C | Au Pont Rouge | https://codeforces.com/problemset/problem/1310/C | [
"binary search",
"dp",
"strings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 809
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1310-B | codeforces | 1310-B | Double Elimination | https://codeforces.com/problemset/problem/1310/B | [
"dp",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 644
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1310-A | codeforces | 1310-A | Recommendations | https://codeforces.com/problemset/problem/1310/A | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5775
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1307-G | codeforces | 1307-G | Cow and Exercise | https://codeforces.com/problemset/problem/1307/G | [
"flows",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 795
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1307-F | codeforces | 1307-F | Cow and Vacation | https://codeforces.com/problemset/problem/1307/F | [
"dfs and similar",
"dsu",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 786
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1307-E | codeforces | 1307-E | Cow and Treats | https://codeforces.com/problemset/problem/1307/E | [
"binary search",
"combinatorics",
"dp",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1481
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1307-D | codeforces | 1307-D | Cow and Fields | https://codeforces.com/problemset/problem/1307/D | [
"binary search",
"data structures",
"dfs and similar",
"graphs",
"greedy",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7697
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1307-C | codeforces | 1307-C | Cow and Message | https://codeforces.com/problemset/problem/1307/C | [
"brute force",
"dp",
"math",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12880
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1307-B | codeforces | 1307-B | Cow and Friend | https://codeforces.com/problemset/problem/1307/B | [
"geometry",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13979
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1307-A | codeforces | 1307-A | Cow and Haybales | https://codeforces.com/problemset/problem/1307/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15753
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1305-H | codeforces | 1305-H | Kuroni the Private Tutor | https://codeforces.com/problemset/problem/1305/H | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 223
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1305-G | codeforces | 1305-G | Kuroni and Antihype | https://codeforces.com/problemset/problem/1305/G | [
"bitmasks",
"brute force",
"dp",
"dsu",
"graphs"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 1557
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1305-F | codeforces | 1305-F | Kuroni and the Punishment | https://codeforces.com/problemset/problem/1305/F | [
"math",
"number theory",
"probabilities"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 3478
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1305-E | codeforces | 1305-E | Kuroni and the Score Distribution | https://codeforces.com/problemset/problem/1305/E | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3318
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1305-D | codeforces | 1305-D | Kuroni and the Celebration | https://codeforces.com/problemset/problem/1305/D | [
"constructive algorithms",
"dfs and similar",
"interactive",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5482
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1305-C | codeforces | 1305-C | Kuroni and Impossible Calculation | https://codeforces.com/problemset/problem/1305/C | [
"brute force",
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 20590
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1305-B | codeforces | 1305-B | Kuroni and Simple Strings | https://codeforces.com/problemset/problem/1305/B | [
"constructive algorithms",
"greedy",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12636
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1305-A | codeforces | 1305-A | Kuroni and the Gifts | https://codeforces.com/problemset/problem/1305/A | [
"brute force",
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14805
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1304-F2 | codeforces | 1304-F2 | Animal Observation (hard version) | https://codeforces.com/problemset/problem/1304/F2 | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1895
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1304-F1 | codeforces | 1304-F1 | Animal Observation (easy version) | https://codeforces.com/problemset/problem/1304/F1 | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2066
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1304-E | codeforces | 1304-E | 1-Trees and Queries | https://codeforces.com/problemset/problem/1304/E | [
"data structures",
"dfs and similar",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6459
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1304-D | codeforces | 1304-D | Shortest and Longest LIS | https://codeforces.com/problemset/problem/1304/D | [
"constructive algorithms",
"graphs",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6861
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1304-C | codeforces | 1304-C | Air Conditioner | https://codeforces.com/problemset/problem/1304/C | [
"dp",
"greedy",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 18227
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1304-B | codeforces | 1304-B | Longest Palindrome | https://codeforces.com/problemset/problem/1304/B | [
"brute force",
"constructive algorithms",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19037
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1304-A | codeforces | 1304-A | Two Rabbits | https://codeforces.com/problemset/problem/1304/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27098
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1303-G | codeforces | 1303-G | Sum of Prefix Sums | https://codeforces.com/problemset/problem/1303/G | [
"data structures",
"divide and conquer",
"geometry",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1181
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1303-F | codeforces | 1303-F | Number of Components | https://codeforces.com/problemset/problem/1303/F | [
"dsu",
"implementation"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 696
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1303-E | codeforces | 1303-E | Erase Subsequences | https://codeforces.com/problemset/problem/1303/E | [
"dp",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3412
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1303-D | codeforces | 1303-D | Fill The Bag | https://codeforces.com/problemset/problem/1303/D | [
"bitmasks",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8068
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1303-C | codeforces | 1303-C | Perfect Keyboard | https://codeforces.com/problemset/problem/1303/C | [
"dfs and similar",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13182
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1303-B | codeforces | 1303-B | National Project | https://codeforces.com/problemset/problem/1303/B | [
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17105
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1303-A | codeforces | 1303-A | Erasing Zeroes | https://codeforces.com/problemset/problem/1303/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 37725
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1302-J | codeforces | 1302-J | Keep talking and nobody explodes -- hard | https://codeforces.com/problemset/problem/1302/J | [] | null | null | stdin_stdout | null | {
"solved_count": 13
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1302-I | codeforces | 1302-I | Deja vu | https://codeforces.com/problemset/problem/1302/I | [] | null | null | stdin_stdout | null | {
"solved_count": 13
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1302-H | codeforces | 1302-H | Who needs suffix structures? | https://codeforces.com/problemset/problem/1302/H | [] | null | null | stdin_stdout | null | {
"solved_count": 14
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1302-G | codeforces | 1302-G | Keep talking and nobody explodes -- medium | https://codeforces.com/problemset/problem/1302/G | [] | null | null | stdin_stdout | null | {
"solved_count": 24
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1302-F | codeforces | 1302-F | Keep talking and nobody explodes -- easy | https://codeforces.com/problemset/problem/1302/F | [
"bitmasks",
"brute force",
"expression parsing"
] | null | null | stdin_stdout | null | {
"solved_count": 81
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1302-E | codeforces | 1302-E | Amazing bitset | https://codeforces.com/problemset/problem/1302/E | [] | null | null | stdin_stdout | null | {
"solved_count": 53
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1302-D | codeforces | 1302-D | Dijkstra | https://codeforces.com/problemset/problem/1302/D | [] | null | null | stdin_stdout | null | {
"solved_count": 101
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1302-C | codeforces | 1302-C | Segment tree or Fenwick? | https://codeforces.com/problemset/problem/1302/C | [
"data structures"
] | null | null | stdin_stdout | null | {
"solved_count": 398
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1302-B | codeforces | 1302-B | DAG | https://codeforces.com/problemset/problem/1302/B | [
"constructive algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": 159
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1302-A | codeforces | 1302-A | Nash equilibrium | https://codeforces.com/problemset/problem/1302/A | [] | null | null | stdin_stdout | null | {
"solved_count": 302
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1301-F | codeforces | 1301-F | Super Jaber | https://codeforces.com/problemset/problem/1301/F | [
"dfs and similar",
"graphs",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1590
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1301-E | codeforces | 1301-E | Nanosoft | https://codeforces.com/problemset/problem/1301/E | [
"binary search",
"data structures",
"dp",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1695
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1301-D | codeforces | 1301-D | Time to Run | https://codeforces.com/problemset/problem/1301/D | [
"constructive algorithms",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4283
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1301-C | codeforces | 1301-C | Ayoub's function | https://codeforces.com/problemset/problem/1301/C | [
"binary search",
"combinatorics",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10017
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1301-B | codeforces | 1301-B | Motarack's Birthday | https://codeforces.com/problemset/problem/1301/B | [
"binary search",
"greedy",
"ternary search"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15256
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1301-A | codeforces | 1301-A | Three Strings | https://codeforces.com/problemset/problem/1301/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20308
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1300-B | codeforces | 1300-B | Assigning to Classes | https://codeforces.com/problemset/problem/1300/B | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 26539
} | 2026-11-02T05:37:07.883505+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.