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:1300-A | codeforces | 1300-A | Non-zero | https://codeforces.com/problemset/problem/1300/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21866
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1299-E | codeforces | 1299-E | So Mean | https://codeforces.com/problemset/problem/1299/E | [
"interactive",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 278
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1299-D | codeforces | 1299-D | Around the World | https://codeforces.com/problemset/problem/1299/D | [
"bitmasks",
"combinatorics",
"dfs and similar",
"dp",
"graphs",
"math",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 727
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1299-C | codeforces | 1299-C | Water Balance | https://codeforces.com/problemset/problem/1299/C | [
"data structures",
"geometry",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4516
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1299-B | codeforces | 1299-B | Aerodynamic | https://codeforces.com/problemset/problem/1299/B | [
"geometry"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5687
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1299-A | codeforces | 1299-A | Anu Has a Function | https://codeforces.com/problemset/problem/1299/A | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12740
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1297-I | codeforces | 1297-I | Falling Blocks | https://codeforces.com/problemset/problem/1297/I | [
"*special",
"data structures"
] | null | null | stdin_stdout | null | {
"solved_count": 39
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1297-H | codeforces | 1297-H | Paint the String | https://codeforces.com/problemset/problem/1297/H | [
"*special",
"dp",
"strings"
] | null | null | stdin_stdout | null | {
"solved_count": 53
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1297-G | codeforces | 1297-G | M-numbers | https://codeforces.com/problemset/problem/1297/G | [
"*special",
"dp",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 78
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1297-F | codeforces | 1297-F | Movie Fan | https://codeforces.com/problemset/problem/1297/F | [
"*special",
"data structures",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | null | {
"solved_count": 128
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1297-E | codeforces | 1297-E | Modernization of Treeland | https://codeforces.com/problemset/problem/1297/E | [
"*special",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 220
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1297-D | codeforces | 1297-D | Bonus Distribution | https://codeforces.com/problemset/problem/1297/D | [
"*special",
"binary search",
"greedy",
"sortings"
] | null | null | stdin_stdout | null | {
"solved_count": 274
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1297-C | codeforces | 1297-C | Dream Team | https://codeforces.com/problemset/problem/1297/C | [
"*special",
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 414
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1297-B | codeforces | 1297-B | Cartoons | https://codeforces.com/problemset/problem/1297/B | [
"*special",
"implementation",
"sortings"
] | null | null | stdin_stdout | null | {
"solved_count": 433
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1297-A | codeforces | 1297-A | Likes Display | https://codeforces.com/problemset/problem/1297/A | [
"*special",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 958
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1296-F | codeforces | 1296-F | Berland Beauty | https://codeforces.com/problemset/problem/1296/F | [
"constructive algorithms",
"dfs and similar",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3254
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1296-E2 | codeforces | 1296-E2 | String Coloring (hard version) | https://codeforces.com/problemset/problem/1296/E2 | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5591
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1296-E1 | codeforces | 1296-E1 | String Coloring (easy version) | https://codeforces.com/problemset/problem/1296/E1 | [
"constructive algorithms",
"dp",
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8364
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1296-D | codeforces | 1296-D | Fight with Monsters | https://codeforces.com/problemset/problem/1296/D | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15295
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1296-C | codeforces | 1296-C | Yet Another Walking Robot | https://codeforces.com/problemset/problem/1296/C | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15936
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1296-B | codeforces | 1296-B | Food Buying | https://codeforces.com/problemset/problem/1296/B | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 33241
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1296-A | codeforces | 1296-A | Array with Odd Sum | https://codeforces.com/problemset/problem/1296/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 50071
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1295-F | codeforces | 1295-F | Good Contest | https://codeforces.com/problemset/problem/1295/F | [
"combinatorics",
"dp",
"probabilities"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1594
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1295-E | codeforces | 1295-E | Permutation Separation | https://codeforces.com/problemset/problem/1295/E | [
"data structures",
"divide and conquer"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2943
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1295-D | codeforces | 1295-D | Same GCDs | https://codeforces.com/problemset/problem/1295/D | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 10870
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1295-C | codeforces | 1295-C | Obtain The String | https://codeforces.com/problemset/problem/1295/C | [
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14163
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1295-B | codeforces | 1295-B | Infinite Prefixes | https://codeforces.com/problemset/problem/1295/B | [
"math",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10029
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1295-A | codeforces | 1295-A | Display The Number | https://codeforces.com/problemset/problem/1295/A | [
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 24587
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1294-F | codeforces | 1294-F | Three Paths on a Tree | https://codeforces.com/problemset/problem/1294/F | [
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 7468
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1294-E | codeforces | 1294-E | Obtain a Permutation | https://codeforces.com/problemset/problem/1294/E | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5311
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1294-D | codeforces | 1294-D | MEX maximizing | https://codeforces.com/problemset/problem/1294/D | [
"data structures",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12944
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1294-C | codeforces | 1294-C | Product of Three Numbers | https://codeforces.com/problemset/problem/1294/C | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 50566
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1294-B | codeforces | 1294-B | Collecting Packages | https://codeforces.com/problemset/problem/1294/B | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 23276
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1294-A | codeforces | 1294-A | Collecting Coins | https://codeforces.com/problemset/problem/1294/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 55362
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1293-B | codeforces | 1293-B | JOE is on TV! | https://codeforces.com/problemset/problem/1293/B | [
"combinatorics",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22568
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1293-A | codeforces | 1293-A | ConneR and the A.R.C. Markland-N | https://codeforces.com/problemset/problem/1293/A | [
"binary search",
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16297
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1292-F | codeforces | 1292-F | Nora's Toy Boxes | https://codeforces.com/problemset/problem/1292/F | [
"bitmasks",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 453
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1292-E | codeforces | 1292-E | Rin and The Unknown Flower | https://codeforces.com/problemset/problem/1292/E | [
"constructive algorithms",
"greedy",
"interactive",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 483
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1292-D | codeforces | 1292-D | Chaotic V. | https://codeforces.com/problemset/problem/1292/D | [
"dp",
"graphs",
"greedy",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1089
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1292-C | codeforces | 1292-C | Xenon's Attack on the Gangs | https://codeforces.com/problemset/problem/1292/C | [
"combinatorics",
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2443
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1292-B | codeforces | 1292-B | Aroma's Search | https://codeforces.com/problemset/problem/1292/B | [
"brute force",
"constructive algorithms",
"geometry",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6881
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1292-A | codeforces | 1292-A | NEKO's Maze Game | https://codeforces.com/problemset/problem/1292/A | [
"data structures",
"dsu",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14079
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1291-F | codeforces | 1291-F | Coffee Varieties (easy version) | https://codeforces.com/problemset/problem/1291/F | [
"graphs",
"interactive"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 822
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1291-B | codeforces | 1291-B | Array Sharpening | https://codeforces.com/problemset/problem/1291/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15631
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1291-A | codeforces | 1291-A | Even But Not Even | https://codeforces.com/problemset/problem/1291/A | [
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 21053
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1290-F | codeforces | 1290-F | Making Shapes | https://codeforces.com/problemset/problem/1290/F | [
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 616
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1290-E | codeforces | 1290-E | Cartesian Tree | https://codeforces.com/problemset/problem/1290/E | [
"data structures"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 705
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1290-D | codeforces | 1290-D | Coffee Varieties (hard version) | https://codeforces.com/problemset/problem/1290/D | [
"constructive algorithms",
"graphs",
"interactive"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1032
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1290-C | codeforces | 1290-C | Prefix Enlightenment | https://codeforces.com/problemset/problem/1290/C | [
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2144
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1290-B | codeforces | 1290-B | Irreducible Anagrams | https://codeforces.com/problemset/problem/1290/B | [
"binary search",
"constructive algorithms",
"data structures",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7612
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1290-A | codeforces | 1290-A | Mind Control | https://codeforces.com/problemset/problem/1290/A | [
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9076
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1288-F | codeforces | 1288-F | Red-Blue Graph | https://codeforces.com/problemset/problem/1288/F | [
"constructive algorithms",
"flows"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 780
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1288-E | codeforces | 1288-E | Messenger Simulator | https://codeforces.com/problemset/problem/1288/E | [
"data structures"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4295
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1288-D | codeforces | 1288-D | Minimax Problem | https://codeforces.com/problemset/problem/1288/D | [
"binary search",
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 8853
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1288-C | codeforces | 1288-C | Two Arrays | https://codeforces.com/problemset/problem/1288/C | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 16243
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1288-B | codeforces | 1288-B | Yet Another Meme Problem | https://codeforces.com/problemset/problem/1288/B | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17965
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1288-A | codeforces | 1288-A | Deadline | https://codeforces.com/problemset/problem/1288/A | [
"binary search",
"brute force",
"math",
"ternary search"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19634
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1287-B | codeforces | 1287-B | Hyperset | https://codeforces.com/problemset/problem/1287/B | [
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9947
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1287-A | codeforces | 1287-A | Angry Students | https://codeforces.com/problemset/problem/1287/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23324
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1286-F | codeforces | 1286-F | Harry The Potter | https://codeforces.com/problemset/problem/1286/F | [
"brute force",
"constructive algorithms",
"dp",
"fft",
"implementation",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 545
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1286-E | codeforces | 1286-E | Fedya the Potter Strikes Back | https://codeforces.com/problemset/problem/1286/E | [
"data structures",
"strings"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 755
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1286-D | codeforces | 1286-D | LCC | https://codeforces.com/problemset/problem/1286/D | [
"data structures",
"math",
"matrices",
"probabilities"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 931
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1286-C2 | codeforces | 1286-C2 | Madhouse (Hard version) | https://codeforces.com/problemset/problem/1286/C2 | [
"brute force",
"constructive algorithms",
"hashing",
"interactive",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 787
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1286-C1 | codeforces | 1286-C1 | Madhouse (Easy version) | https://codeforces.com/problemset/problem/1286/C1 | [
"brute force",
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1638
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1286-B | codeforces | 1286-B | Numbers on Tree | https://codeforces.com/problemset/problem/1286/B | [
"constructive algorithms",
"data structures",
"dfs and similar",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5847
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1286-A | codeforces | 1286-A | Garland | https://codeforces.com/problemset/problem/1286/A | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9928
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1285-F | codeforces | 1285-F | Classical? | https://codeforces.com/problemset/problem/1285/F | [
"binary search",
"combinatorics",
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1428
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1285-E | codeforces | 1285-E | Delete a Segment | https://codeforces.com/problemset/problem/1285/E | [
"brute force",
"constructive algorithms",
"data structures",
"dp",
"graphs",
"sortings",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2048
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1285-D | codeforces | 1285-D | Dr. Evil Underscores | https://codeforces.com/problemset/problem/1285/D | [
"bitmasks",
"brute force",
"dfs and similar",
"divide and conquer",
"dp",
"greedy",
"strings",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8937
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1285-C | codeforces | 1285-C | Fadi and LCM | https://codeforces.com/problemset/problem/1285/C | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 29538
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1285-B | codeforces | 1285-B | Just Eat It! | https://codeforces.com/problemset/problem/1285/B | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 33770
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1285-A | codeforces | 1285-A | Mezo Playing Zoma | https://codeforces.com/problemset/problem/1285/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30328
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1284-G | codeforces | 1284-G | Seollal | https://codeforces.com/problemset/problem/1284/G | [
"graphs"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 243
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1284-F | codeforces | 1284-F | New Year and Social Network | https://codeforces.com/problemset/problem/1284/F | [
"data structures",
"graph matchings",
"graphs",
"math",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 432
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1284-E | codeforces | 1284-E | New Year and Castle Construction | https://codeforces.com/problemset/problem/1284/E | [
"combinatorics",
"geometry",
"math",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1449
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1284-D | codeforces | 1284-D | New Year and Conference | https://codeforces.com/problemset/problem/1284/D | [
"binary search",
"data structures",
"hashing",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3473
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1284-C | codeforces | 1284-C | New Year and Permutation | https://codeforces.com/problemset/problem/1284/C | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9070
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1284-B | codeforces | 1284-B | New Year and Ascent Sequence | https://codeforces.com/problemset/problem/1284/B | [
"binary search",
"combinatorics",
"data structures",
"dp",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11642
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1284-A | codeforces | 1284-A | New Year and Naming | https://codeforces.com/problemset/problem/1284/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18642
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1283-F | codeforces | 1283-F | DIY Garland | https://codeforces.com/problemset/problem/1283/F | [
"constructive algorithms",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2190
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1283-E | codeforces | 1283-E | New Year Parties | https://codeforces.com/problemset/problem/1283/E | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7593
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1283-D | codeforces | 1283-D | Christmas Trees | https://codeforces.com/problemset/problem/1283/D | [
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 10352
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1283-C | codeforces | 1283-C | Friends and Gifts | https://codeforces.com/problemset/problem/1283/C | [
"constructive algorithms",
"data structures",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14364
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1283-B | codeforces | 1283-B | Candies Division | https://codeforces.com/problemset/problem/1283/B | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 23329
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1283-A | codeforces | 1283-A | Minutes Before the New Year | https://codeforces.com/problemset/problem/1283/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 63177
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1282-E | codeforces | 1282-E | The Cake Is a Lie | https://codeforces.com/problemset/problem/1282/E | [
"constructive algorithms",
"data structures",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1257
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1282-D | codeforces | 1282-D | Enchanted Artifact | https://codeforces.com/problemset/problem/1282/D | [
"constructive algorithms",
"interactive",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2506
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1282-C | codeforces | 1282-C | Petya and Exam | https://codeforces.com/problemset/problem/1282/C | [
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4726
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1282-B2 | codeforces | 1282-B2 | K for the Price of One (Hard Version) | https://codeforces.com/problemset/problem/1282/B2 | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11240
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1282-B1 | codeforces | 1282-B1 | K for the Price of One (Easy Version) | https://codeforces.com/problemset/problem/1282/B1 | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12298
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1282-A | codeforces | 1282-A | Temporarily unavailable | https://codeforces.com/problemset/problem/1282/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 15605
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1281-B | codeforces | 1281-B | Azamon Web Services | https://codeforces.com/problemset/problem/1281/B | [
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8782
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1281-A | codeforces | 1281-A | Suffix Three | https://codeforces.com/problemset/problem/1281/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19051
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1280-F | codeforces | 1280-F | Intergalactic Sliding Puzzle | https://codeforces.com/problemset/problem/1280/F | [
"combinatorics",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 116
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1280-E | codeforces | 1280-E | Kirchhoff's Current Loss | https://codeforces.com/problemset/problem/1280/E | [
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 275
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1280-D | codeforces | 1280-D | Miss Punyverse | https://codeforces.com/problemset/problem/1280/D | [
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1331
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1280-C | codeforces | 1280-C | Jeremy Bearimy | https://codeforces.com/problemset/problem/1280/C | [
"dfs and similar",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3146
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1280-B | codeforces | 1280-B | Beingawesomeism | https://codeforces.com/problemset/problem/1280/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4232
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1280-A | codeforces | 1280-A | Cut and Paste | https://codeforces.com/problemset/problem/1280/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5925
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1279-F | codeforces | 1279-F | New Year and Handle Change | https://codeforces.com/problemset/problem/1279/F | [
"binary search",
"dp"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1413
} | 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.