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:444-C | codeforces | 444-C | DZY Loves Colors | https://codeforces.com/problemset/problem/444/C | [
"data structures"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 3373
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:444-B | codeforces | 444-B | DZY Loves FFT | https://codeforces.com/problemset/problem/444/B | [
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1176
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:444-A | codeforces | 444-A | DZY Loves Physics | https://codeforces.com/problemset/problem/444/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 3583
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:443-B | codeforces | 443-B | Kolya and Tandem Repeat | https://codeforces.com/problemset/problem/443/B | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4286
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:443-A | codeforces | 443-A | Anton and Letters | https://codeforces.com/problemset/problem/443/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 112938
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:442-E | codeforces | 442-E | Gena and Second Distance | https://codeforces.com/problemset/problem/442/E | [
"geometry"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 197
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:442-D | codeforces | 442-D | Adam and Tree | https://codeforces.com/problemset/problem/442/D | [
"data structures",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1138
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:442-C | codeforces | 442-C | Artem and Array | https://codeforces.com/problemset/problem/442/C | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1952
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:442-B | codeforces | 442-B | Andrey and Problem | https://codeforces.com/problemset/problem/442/B | [
"greedy",
"math",
"probabilities"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6128
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:442-A | codeforces | 442-A | Borya and Hanabi | https://codeforces.com/problemset/problem/442/A | [
"bitmasks",
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2353
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:441-E | codeforces | 441-E | Valera and Number | https://codeforces.com/problemset/problem/441/E | [
"bitmasks",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 823
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:441-D | codeforces | 441-D | Valera and Swaps | https://codeforces.com/problemset/problem/441/D | [
"constructive algorithms",
"dsu",
"graphs",
"implementation",
"math",
"string suffix structures"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1202
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:441-C | codeforces | 441-C | Valera and Tubes | https://codeforces.com/problemset/problem/441/C | [
"constructive algorithms",
"dfs and similar",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11955
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:441-B | codeforces | 441-B | Valera and Fruits | https://codeforces.com/problemset/problem/441/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7524
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:441-A | codeforces | 441-A | Valera and Antique Items | https://codeforces.com/problemset/problem/441/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19313
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:440-D | codeforces | 440-D | Berland Federalization | https://codeforces.com/problemset/problem/440/D | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 954
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:440-C | codeforces | 440-C | One-Based Arithmetic | https://codeforces.com/problemset/problem/440/C | [
"brute force",
"dfs and similar",
"divide and conquer"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1141
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:440-B | codeforces | 440-B | Balancer | https://codeforces.com/problemset/problem/440/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2338
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:440-A | codeforces | 440-A | Forgotten Episode | https://codeforces.com/problemset/problem/440/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 8967
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:439-E | codeforces | 439-E | Devu and Birthday Celebration | https://codeforces.com/problemset/problem/439/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1849
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:439-D | codeforces | 439-D | Devu and his Brother | https://codeforces.com/problemset/problem/439/D | [
"binary search",
"sortings",
"ternary search",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6891
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:439-C | codeforces | 439-C | Devu and Partitioning of the Array | https://codeforces.com/problemset/problem/439/C | [
"brute force",
"constructive algorithms",
"implementation",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4180
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:439-B | codeforces | 439-B | Devu, the Dumb Guy | https://codeforces.com/problemset/problem/439/B | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 15031
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:439-A | codeforces | 439-A | Devu, the Singer and Churu, the Joker | https://codeforces.com/problemset/problem/439/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 26655
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:438-E | codeforces | 438-E | The Child and Binary Tree | https://codeforces.com/problemset/problem/438/E | [
"combinatorics",
"divide and conquer",
"fft",
"number theory"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 2144
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:438-D | codeforces | 438-D | The Child and Sequence | https://codeforces.com/problemset/problem/438/D | [
"data structures",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 11741
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:437-E | codeforces | 437-E | The Child and Polygon | https://codeforces.com/problemset/problem/437/E | [
"dp",
"geometry"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 789
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:437-D | codeforces | 437-D | The Child and Zoo | https://codeforces.com/problemset/problem/437/D | [
"dsu",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3679
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:437-C | codeforces | 437-C | The Child and Toy | https://codeforces.com/problemset/problem/437/C | [
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15029
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:437-B | codeforces | 437-B | The Child and Set | https://codeforces.com/problemset/problem/437/B | [
"bitmasks",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10474
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:437-A | codeforces | 437-A | The Child and Homework | https://codeforces.com/problemset/problem/437/A | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9405
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:436-F | codeforces | 436-F | Banners | https://codeforces.com/problemset/problem/436/F | [
"brute force",
"data structures",
"dp"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 463
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:436-E | codeforces | 436-E | Cardboard Box | https://codeforces.com/problemset/problem/436/E | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1830
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:436-D | codeforces | 436-D | Pudding Monsters | https://codeforces.com/problemset/problem/436/D | [
"dp"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 353
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:436-C | codeforces | 436-C | Dungeons and Candies | https://codeforces.com/problemset/problem/436/C | [
"dsu",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2897
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:436-B | codeforces | 436-B | Om Nom and Spiders | https://codeforces.com/problemset/problem/436/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 3148
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:436-A | codeforces | 436-A | Feed with Candy | https://codeforces.com/problemset/problem/436/A | [
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3794
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:435-E | codeforces | 435-E | Special Graph | https://codeforces.com/problemset/problem/435/E | [] | null | null | stdin_stdout | 2,500 | {
"solved_count": 259
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:435-D | codeforces | 435-D | Special Grid | https://codeforces.com/problemset/problem/435/D | [
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 789
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:435-C | codeforces | 435-C | Cardiogram | https://codeforces.com/problemset/problem/435/C | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2725
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:435-B | codeforces | 435-B | Pasha Maximizes | https://codeforces.com/problemset/problem/435/B | [
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7575
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:435-A | codeforces | 435-A | Queue on Bus Stop | https://codeforces.com/problemset/problem/435/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 11115
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:434-E | codeforces | 434-E | Furukawa Nagisa's Tree | https://codeforces.com/problemset/problem/434/E | [
"binary search",
"divide and conquer",
"sortings",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 311
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:434-D | codeforces | 434-D | Nanami's Power Plant | https://codeforces.com/problemset/problem/434/D | [
"flows"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 518
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:433-E | codeforces | 433-E | Tachibana Kanade's Tofu | https://codeforces.com/problemset/problem/433/E | [
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 534
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:433-D | codeforces | 433-D | Nanami's Digital Board | https://codeforces.com/problemset/problem/433/D | [
"dsu",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1320
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:433-C | codeforces | 433-C | Ryouko's Memory Note | https://codeforces.com/problemset/problem/433/C | [
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2622
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:433-B | codeforces | 433-B | Kuriyama Mirai's Stones | https://codeforces.com/problemset/problem/433/B | [
"dp",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 54473
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:433-A | codeforces | 433-A | Kitahara Haruki's Gift | https://codeforces.com/problemset/problem/433/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17952
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:432-E | codeforces | 432-E | Square Tiling | https://codeforces.com/problemset/problem/432/E | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 802
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:432-D | codeforces | 432-D | Prefixes and Suffixes | https://codeforces.com/problemset/problem/432/D | [
"dp",
"string suffix structures",
"strings",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 12268
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:432-C | codeforces | 432-C | Prime Swaps | https://codeforces.com/problemset/problem/432/C | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2684
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:432-B | codeforces | 432-B | Football Kit | https://codeforces.com/problemset/problem/432/B | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12274
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:432-A | codeforces | 432-A | Choosing Teams | https://codeforces.com/problemset/problem/432/A | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 69832
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:431-E | codeforces | 431-E | Chemistry Experiment | https://codeforces.com/problemset/problem/431/E | [
"binary search",
"data structures",
"ternary search"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1193
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:431-D | codeforces | 431-D | Random Task | https://codeforces.com/problemset/problem/431/D | [
"binary search",
"bitmasks",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2895
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:431-C | codeforces | 431-C | k-Tree | https://codeforces.com/problemset/problem/431/C | [
"dp",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 29980
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:431-B | codeforces | 431-B | Shower Line | https://codeforces.com/problemset/problem/431/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 11722
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:431-A | codeforces | 431-A | Black Square | https://codeforces.com/problemset/problem/431/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 66414
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:430-B | codeforces | 430-B | Balls Game | https://codeforces.com/problemset/problem/430/B | [
"brute force",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 4128
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:430-A | codeforces | 430-A | Points and Segments (easy) | https://codeforces.com/problemset/problem/430/A | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2411
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:429-E | codeforces | 429-E | Points and Segments | https://codeforces.com/problemset/problem/429/E | [
"graphs"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 981
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:429-D | codeforces | 429-D | Tricky Function | https://codeforces.com/problemset/problem/429/D | [
"data structures",
"divide and conquer",
"geometry"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3239
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:429-C | codeforces | 429-C | Guess the Tree | https://codeforces.com/problemset/problem/429/C | [
"bitmasks",
"constructive algorithms",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1039
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:429-B | codeforces | 429-B | Working out | https://codeforces.com/problemset/problem/429/B | [
"dp"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10308
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:429-A | codeforces | 429-A | Xor-tree | https://codeforces.com/problemset/problem/429/A | [
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12334
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:427-E | codeforces | 427-E | Police Patrol | https://codeforces.com/problemset/problem/427/E | [
"greedy",
"implementation",
"math",
"ternary search"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1617
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:427-D | codeforces | 427-D | Match & Catch | https://codeforces.com/problemset/problem/427/D | [
"dp",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2431
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:427-C | codeforces | 427-C | Checkposts | https://codeforces.com/problemset/problem/427/C | [
"dfs and similar",
"graphs",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 17090
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:427-B | codeforces | 427-B | Prison Transfer | https://codeforces.com/problemset/problem/427/B | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15530
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:427-A | codeforces | 427-A | Police Recruits | https://codeforces.com/problemset/problem/427/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 98021
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:426-B | codeforces | 426-B | Sereja and Mirroring | https://codeforces.com/problemset/problem/426/B | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 3971
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:426-A | codeforces | 426-A | Sereja and Mugs | https://codeforces.com/problemset/problem/426/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 9975
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:425-E | codeforces | 425-E | Sereja and Sets | https://codeforces.com/problemset/problem/425/E | [
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 806
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:425-D | codeforces | 425-D | Sereja and Squares | https://codeforces.com/problemset/problem/425/D | [
"binary search",
"data structures",
"hashing"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1636
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:425-C | codeforces | 425-C | Sereja and Two Sequences | https://codeforces.com/problemset/problem/425/C | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 985
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:425-B | codeforces | 425-B | Sereja and Table | https://codeforces.com/problemset/problem/425/B | [
"bitmasks",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1417
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:425-A | codeforces | 425-A | Sereja and Swaps | https://codeforces.com/problemset/problem/425/A | [
"brute force",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4182
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:424-E | codeforces | 424-E | Colored Jenga | https://codeforces.com/problemset/problem/424/E | [
"dfs and similar",
"dp",
"probabilities"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 149
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:424-D | codeforces | 424-D | Biathlon Track | https://codeforces.com/problemset/problem/424/D | [
"binary search",
"brute force",
"constructive algorithms",
"data structures",
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 613
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:424-C | codeforces | 424-C | Magic Formulas | https://codeforces.com/problemset/problem/424/C | [
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5969
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:424-B | codeforces | 424-B | Megacity | https://codeforces.com/problemset/problem/424/B | [
"binary search",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8481
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:424-A | codeforces | 424-A | Squats | https://codeforces.com/problemset/problem/424/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 9207
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:421-D | codeforces | 421-D | Bug in Code | https://codeforces.com/problemset/problem/421/D | [
"binary search",
"data structures",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 696
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:421-A | codeforces | 421-A | Pasha and Hamsters | https://codeforces.com/problemset/problem/421/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 6910
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:420-E | codeforces | 420-E | Playing the ball | https://codeforces.com/problemset/problem/420/E | [
"geometry"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 267
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:420-D | codeforces | 420-D | Cup Trick | https://codeforces.com/problemset/problem/420/D | [
"data structures"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1002
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:420-C | codeforces | 420-C | Bug in Code | https://codeforces.com/problemset/problem/420/C | [
"data structures",
"graphs",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1397
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:420-B | codeforces | 420-B | Online Meeting | https://codeforces.com/problemset/problem/420/B | [
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1174
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:420-A | codeforces | 420-A | Start Up | https://codeforces.com/problemset/problem/420/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 7081
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:418-E | codeforces | 418-E | Tricky Password | https://codeforces.com/problemset/problem/418/E | [
"data structures"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 351
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:418-D | codeforces | 418-D | Big Problems for Organizers | https://codeforces.com/problemset/problem/418/D | [
"data structures",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 546
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:417-E | codeforces | 417-E | Square Table | https://codeforces.com/problemset/problem/417/E | [
"constructive algorithms",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 932
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:417-D | codeforces | 417-D | Cunning Gena | https://codeforces.com/problemset/problem/417/D | [
"bitmasks",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2936
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:417-C | codeforces | 417-C | Football | https://codeforces.com/problemset/problem/417/C | [
"constructive algorithms",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 5079
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:417-B | codeforces | 417-B | Crash | https://codeforces.com/problemset/problem/417/B | [
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 2031
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:417-A | codeforces | 417-A | Elimination | https://codeforces.com/problemset/problem/417/A | [
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3417
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:416-E | codeforces | 416-E | President's Path | https://codeforces.com/problemset/problem/416/E | [
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1803
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:416-D | codeforces | 416-D | Population Size | https://codeforces.com/problemset/problem/416/D | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1094
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:416-C | codeforces | 416-C | Booking System | https://codeforces.com/problemset/problem/416/C | [
"binary search",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8733
} | 2026-06-01T05:00:40.145500+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.