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:1433-E | codeforces | 1433-E | Two Round Dances | https://codeforces.com/problemset/problem/1433/E | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 20267
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1433-D | codeforces | 1433-D | Districts Connection | https://codeforces.com/problemset/problem/1433/D | [
"constructive algorithms",
"dfs and similar"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 33216
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1433-C | codeforces | 1433-C | Dominant Piranha | https://codeforces.com/problemset/problem/1433/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 29126
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1433-B | codeforces | 1433-B | Yet Another Bookshelf | https://codeforces.com/problemset/problem/1433/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30248
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1433-A | codeforces | 1433-A | Boring Apartments | https://codeforces.com/problemset/problem/1433/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 64679
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1431-J | codeforces | 1431-J | Zero-XOR Array | https://codeforces.com/problemset/problem/1431/J | [
"*special",
"dp"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 55
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1431-I | codeforces | 1431-I | Cyclic Shifts | https://codeforces.com/problemset/problem/1431/I | [
"*special",
"strings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 58
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1431-H | codeforces | 1431-H | Rogue-like Game | https://codeforces.com/problemset/problem/1431/H | [
"*special",
"brute force",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 82
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1431-G | codeforces | 1431-G | Number Deletion Game | https://codeforces.com/problemset/problem/1431/G | [
"*special",
"dp",
"games",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 218
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1431-F | codeforces | 1431-F | Neural Network Problem | https://codeforces.com/problemset/problem/1431/F | [
"*special",
"binary search",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 165
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1431-E | codeforces | 1431-E | Chess Match | https://codeforces.com/problemset/problem/1431/E | [
"*special"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 235
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1431-D | codeforces | 1431-D | Used Markers | https://codeforces.com/problemset/problem/1431/D | [
"*special",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 493
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1431-C | codeforces | 1431-C | Black Friday | https://codeforces.com/problemset/problem/1431/C | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 756
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1431-B | codeforces | 1431-B | Polycarp and the Language of Gods | https://codeforces.com/problemset/problem/1431/B | [
"*special",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 1062
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1431-A | codeforces | 1431-A | Selling Hamburgers | https://codeforces.com/problemset/problem/1431/A | [
"*special"
] | null | null | stdin_stdout | 800 | {
"solved_count": 2203
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1430-G | codeforces | 1430-G | Yet Another DAG Problem | https://codeforces.com/problemset/problem/1430/G | [
"bitmasks",
"dfs and similar",
"dp",
"flows",
"graphs",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 977
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1430-F | codeforces | 1430-F | Realistic Gameplay | https://codeforces.com/problemset/problem/1430/F | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1093
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1430-E | codeforces | 1430-E | String Reversal | https://codeforces.com/problemset/problem/1430/E | [
"data structures",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7556
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1430-D | codeforces | 1430-D | String Deletion | https://codeforces.com/problemset/problem/1430/D | [
"binary search",
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9495
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1430-C | codeforces | 1430-C | Numbers on Whiteboard | https://codeforces.com/problemset/problem/1430/C | [
"constructive algorithms",
"data structures",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 29409
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1430-B | codeforces | 1430-B | Barrels | https://codeforces.com/problemset/problem/1430/B | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20561
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1430-A | codeforces | 1430-A | Number of Apartments | https://codeforces.com/problemset/problem/1430/A | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 22062
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1428-H | codeforces | 1428-H | Rotary Laser Lock | https://codeforces.com/problemset/problem/1428/H | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 132
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1428-G2 | codeforces | 1428-G2 | Lucky Numbers (Hard Version) | https://codeforces.com/problemset/problem/1428/G2 | [
"dp",
"greedy"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 874
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1428-G1 | codeforces | 1428-G1 | Lucky Numbers (Easy Version) | https://codeforces.com/problemset/problem/1428/G1 | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 733
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1428-F | codeforces | 1428-F | Fruit Sequences | https://codeforces.com/problemset/problem/1428/F | [
"binary search",
"data structures",
"divide and conquer",
"dp",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2693
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1428-E | codeforces | 1428-E | Carrots for Rabbits | https://codeforces.com/problemset/problem/1428/E | [
"binary search",
"data structures",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4480
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1428-D | codeforces | 1428-D | Bouncing Boomerangs | https://codeforces.com/problemset/problem/1428/D | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4775
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1428-C | codeforces | 1428-C | ABBB | https://codeforces.com/problemset/problem/1428/C | [
"brute force",
"data structures",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 23297
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1428-B | codeforces | 1428-B | Belted Rooms | https://codeforces.com/problemset/problem/1428/B | [
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 15374
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1428-A | codeforces | 1428-A | Box is Pull | https://codeforces.com/problemset/problem/1428/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17181
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1427-H | codeforces | 1427-H | Prison Break | https://codeforces.com/problemset/problem/1427/H | [
"binary search",
"games",
"geometry",
"ternary search"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 103
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1427-G | codeforces | 1427-G | One Billion Shades of Grey | https://codeforces.com/problemset/problem/1427/G | [
"flows",
"graphs"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 521
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1427-F | codeforces | 1427-F | Boring Card Game | https://codeforces.com/problemset/problem/1427/F | [
"data structures",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 439
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1427-E | codeforces | 1427-E | Xum | https://codeforces.com/problemset/problem/1427/E | [
"bitmasks",
"constructive algorithms",
"math",
"matrices",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1761
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1427-D | codeforces | 1427-D | Unshuffling a Deck | https://codeforces.com/problemset/problem/1427/D | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3767
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1427-C | codeforces | 1427-C | The Hard Work of Paparazzi | https://codeforces.com/problemset/problem/1427/C | [
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6217
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1427-B | codeforces | 1427-B | Chess Cheater | https://codeforces.com/problemset/problem/1427/B | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11585
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1427-A | codeforces | 1427-A | Avoiding Zero | https://codeforces.com/problemset/problem/1427/A | [
"math",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18228
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1426-F | codeforces | 1426-F | Number of Subsequences | https://codeforces.com/problemset/problem/1426/F | [
"combinatorics",
"dp",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6531
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1426-E | codeforces | 1426-E | Rock, Paper, Scissors | https://codeforces.com/problemset/problem/1426/E | [
"brute force",
"constructive algorithms",
"flows",
"greedy",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8326
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1426-D | codeforces | 1426-D | Non-zero Segments | https://codeforces.com/problemset/problem/1426/D | [
"constructive algorithms",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 18008
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1426-C | codeforces | 1426-C | Increase and Copy | https://codeforces.com/problemset/problem/1426/C | [
"binary search",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20881
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1426-B | codeforces | 1426-B | Symmetric Matrix | https://codeforces.com/problemset/problem/1426/B | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 22118
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1426-A | codeforces | 1426-A | Floor Number | https://codeforces.com/problemset/problem/1426/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 56724
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1425-I | codeforces | 1425-I | Impressive Harvesting of The Orchard | https://codeforces.com/problemset/problem/1425/I | [
"data structures"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 285
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1425-H | codeforces | 1425-H | Huge Boxes of Animal Toys | https://codeforces.com/problemset/problem/1425/H | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4462
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1425-F | codeforces | 1425-F | Flamingoes of Mystery | https://codeforces.com/problemset/problem/1425/F | [
"interactive"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7430
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1425-E | codeforces | 1425-E | Excitation of Atoms | https://codeforces.com/problemset/problem/1425/E | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1032
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1425-D | codeforces | 1425-D | Danger of Mad Snakes | https://codeforces.com/problemset/problem/1425/D | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 941
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1425-C | codeforces | 1425-C | Captain of Knights | https://codeforces.com/problemset/problem/1425/C | [
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 127
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1425-B | codeforces | 1425-B | Blue and Red of Our Faculty! | https://codeforces.com/problemset/problem/1425/B | [
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 386
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1425-A | codeforces | 1425-A | Arena of Greed | https://codeforces.com/problemset/problem/1425/A | [
"games",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7385
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1424-M | codeforces | 1424-M | Ancient Language | https://codeforces.com/problemset/problem/1424/M | [
"graphs",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 645
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1424-G | codeforces | 1424-G | Years | https://codeforces.com/problemset/problem/1424/G | [
"data structures",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6943
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1423-N | codeforces | 1423-N | BubbleSquare Tokens | https://codeforces.com/problemset/problem/1423/N | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 177
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1423-M | codeforces | 1423-M | Milutin's Plums | https://codeforces.com/problemset/problem/1423/M | [
"interactive"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 378
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1423-L | codeforces | 1423-L | Light switches | https://codeforces.com/problemset/problem/1423/L | [
"meet-in-the-middle"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 673
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1423-K | codeforces | 1423-K | Lonely Numbers | https://codeforces.com/problemset/problem/1423/K | [
"binary search",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5552
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1423-J | codeforces | 1423-J | Bubble Cup hypothesis | https://codeforces.com/problemset/problem/1423/J | [
"bitmasks",
"constructive algorithms",
"dp",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 925
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1423-I | codeforces | 1423-I | Lookup Tables | https://codeforces.com/problemset/problem/1423/I | [
"bitmasks"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 304
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1423-H | codeforces | 1423-H | Virus | https://codeforces.com/problemset/problem/1423/H | [
"data structures",
"divide and conquer",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 697
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1423-G | codeforces | 1423-G | Growing flowers | https://codeforces.com/problemset/problem/1423/G | [
"data structures"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 359
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1423-F | codeforces | 1423-F | Coins | https://codeforces.com/problemset/problem/1423/F | [
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 548
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1423-E | codeforces | 1423-E | 5G Antenna Towers | https://codeforces.com/problemset/problem/1423/E | [
"geometry"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 142
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1423-D | codeforces | 1423-D | Does anyone else hate the wind? | https://codeforces.com/problemset/problem/1423/D | [] | null | null | stdin_stdout | 3,100 | {
"solved_count": 83
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1423-C | codeforces | 1423-C | Dušan's Railway | https://codeforces.com/problemset/problem/1423/C | [
"divide and conquer",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 243
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1423-B | codeforces | 1423-B | Valuable Paper | https://codeforces.com/problemset/problem/1423/B | [
"binary search",
"flows",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2299
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1423-A | codeforces | 1423-A | Wakanda Forever | https://codeforces.com/problemset/problem/1423/A | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 131
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1422-F | codeforces | 1422-F | Boring Queries | https://codeforces.com/problemset/problem/1422/F | [
"data structures",
"math",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1468
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1422-E | codeforces | 1422-E | Minlexes | https://codeforces.com/problemset/problem/1422/E | [
"dp",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 929
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1422-D | codeforces | 1422-D | Returning Home | https://codeforces.com/problemset/problem/1422/D | [
"graphs",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3294
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1422-C | codeforces | 1422-C | Bargain | https://codeforces.com/problemset/problem/1422/C | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8939
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1422-B | codeforces | 1422-B | Nice Matrix | https://codeforces.com/problemset/problem/1422/B | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15189
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1422-A | codeforces | 1422-A | Fence | https://codeforces.com/problemset/problem/1422/A | [
"geometry",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22047
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1421-E | codeforces | 1421-E | Swedish Heroes | https://codeforces.com/problemset/problem/1421/E | [
"brute force",
"dp",
"implementation"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1049
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1421-D | codeforces | 1421-D | Hexagons | https://codeforces.com/problemset/problem/1421/D | [
"brute force",
"constructive algorithms",
"greedy",
"implementation",
"math",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4453
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1421-C | codeforces | 1421-C | Palindromifier | https://codeforces.com/problemset/problem/1421/C | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 13691
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1421-B | codeforces | 1421-B | Putting Bricks in the Wall | https://codeforces.com/problemset/problem/1421/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 13540
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1421-A | codeforces | 1421-A | XORwice | https://codeforces.com/problemset/problem/1421/A | [
"bitmasks",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 37613
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1420-E | codeforces | 1420-E | Battle Lemmings | https://codeforces.com/problemset/problem/1420/E | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1115
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1420-D | codeforces | 1420-D | Rescue Nibel! | https://codeforces.com/problemset/problem/1420/D | [
"combinatorics",
"data structures",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8568
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1420-C2 | codeforces | 1420-C2 | Pokémon Army (hard version) | https://codeforces.com/problemset/problem/1420/C2 | [
"data structures",
"divide and conquer",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5344
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1420-C1 | codeforces | 1420-C1 | Pokémon Army (easy version) | https://codeforces.com/problemset/problem/1420/C1 | [
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 19416
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1420-B | codeforces | 1420-B | Rock and Lever | https://codeforces.com/problemset/problem/1420/B | [
"bitmasks",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 39381
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1420-A | codeforces | 1420-A | Cubes Sorting | https://codeforces.com/problemset/problem/1420/A | [
"math",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 25637
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1419-F | codeforces | 1419-F | Rain of Fire | https://codeforces.com/problemset/problem/1419/F | [
"binary search",
"data structures",
"dfs and similar",
"dsu",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 686
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1419-E | codeforces | 1419-E | Decryption | https://codeforces.com/problemset/problem/1419/E | [
"constructive algorithms",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3568
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1419-D2 | codeforces | 1419-D2 | Sage's Birthday (hard version) | https://codeforces.com/problemset/problem/1419/D2 | [
"binary search",
"brute force",
"constructive algorithms",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 17796
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1419-D1 | codeforces | 1419-D1 | Sage's Birthday (easy version) | https://codeforces.com/problemset/problem/1419/D1 | [
"binary search",
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 26814
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1419-C | codeforces | 1419-C | Killjoy | https://codeforces.com/problemset/problem/1419/C | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 16478
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1419-B | codeforces | 1419-B | Stairs | https://codeforces.com/problemset/problem/1419/B | [
"brute force",
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17173
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1419-A | codeforces | 1419-A | Digit Game | https://codeforces.com/problemset/problem/1419/A | [
"games",
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 20741
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1418-G | codeforces | 1418-G | Three Occurrences | https://codeforces.com/problemset/problem/1418/G | [
"data structures",
"divide and conquer",
"hashing",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 3102
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1418-F | codeforces | 1418-F | Equal Product | https://codeforces.com/problemset/problem/1418/F | [
"data structures",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 565
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1418-E | codeforces | 1418-E | Expected Damage | https://codeforces.com/problemset/problem/1418/E | [
"binary search",
"combinatorics",
"probabilities"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2434
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1418-D | codeforces | 1418-D | Trash Problem | https://codeforces.com/problemset/problem/1418/D | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4869
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1418-C | codeforces | 1418-C | Mortal Kombat Tower | https://codeforces.com/problemset/problem/1418/C | [
"dp",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 31235
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1418-B | codeforces | 1418-B | Negative Prefixes | https://codeforces.com/problemset/problem/1418/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17899
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1418-A | codeforces | 1418-A | Buying Torches | https://codeforces.com/problemset/problem/1418/A | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 37741
} | 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.