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:449-A | codeforces | 449-A | Jzzhu and Chocolate | https://codeforces.com/problemset/problem/449/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4116
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:448-E | codeforces | 448-E | Divisors | https://codeforces.com/problemset/problem/448/E | [
"brute force",
"dfs and similar",
"implementation",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1627
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:448-D | codeforces | 448-D | Multiplication Table | https://codeforces.com/problemset/problem/448/D | [
"binary search",
"brute force"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 16579
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:448-C | codeforces | 448-C | Painting Fence | https://codeforces.com/problemset/problem/448/C | [
"divide and conquer",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 10737
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:448-B | codeforces | 448-B | Suffix Structures | https://codeforces.com/problemset/problem/448/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17248
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:448-A | codeforces | 448-A | Rewards | https://codeforces.com/problemset/problem/448/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25834
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:447-B | codeforces | 447-B | DZY Loves Strings | https://codeforces.com/problemset/problem/447/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 21009
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:447-A | codeforces | 447-A | DZY Loves Hash | https://codeforces.com/problemset/problem/447/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 10253
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:446-E | codeforces | 446-E | DZY Loves Bridges | https://codeforces.com/problemset/problem/446/E | [
"math",
"matrices"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 143
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:446-D | codeforces | 446-D | DZY Loves Games | https://codeforces.com/problemset/problem/446/D | [
"math",
"matrices",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 461
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:446-C | codeforces | 446-C | DZY Loves Fibonacci Numbers | https://codeforces.com/problemset/problem/446/C | [
"data structures",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 3907
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:446-B | codeforces | 446-B | DZY Loves Modification | https://codeforces.com/problemset/problem/446/B | [
"brute force",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3849
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:446-A | codeforces | 446-A | DZY Loves Sequences | https://codeforces.com/problemset/problem/446/A | [
"dp",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13507
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:445-B | codeforces | 445-B | DZY Loves Chemistry | https://codeforces.com/problemset/problem/445/B | [
"dfs and similar",
"dsu",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14600
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:445-A | codeforces | 445-A | DZY Loves Chessboard | https://codeforces.com/problemset/problem/445/A | [
"dfs and similar",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 33532
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:444-E | codeforces | 444-E | DZY Loves Planting | https://codeforces.com/problemset/problem/444/E | [
"binary search",
"dsu",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 853
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:444-D | codeforces | 444-D | DZY Loves Strings | https://codeforces.com/problemset/problem/444/D | [
"binary search",
"hashing",
"strings",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 858
} | 2026-04-13T03:38:27.662191+00:00 |
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": 3331
} | 2026-04-13T03:38:27.662191+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": 1152
} | 2026-04-13T03:38:27.662191+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": 3572
} | 2026-04-13T03:38:27.662191+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": 4266
} | 2026-04-13T03:38:27.662191+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": 111218
} | 2026-04-13T03:38:27.662191+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": 193
} | 2026-04-13T03:38:27.662191+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": 1127
} | 2026-04-13T03:38:27.662191+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": 1948
} | 2026-04-13T03:38:27.662191+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": 6078
} | 2026-04-13T03:38:27.662191+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": 2346
} | 2026-04-13T03:38:27.662191+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": 815
} | 2026-04-13T03:38:27.662191+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": 1194
} | 2026-04-13T03:38:27.662191+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": 11905
} | 2026-04-13T03:38:27.662191+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": 7501
} | 2026-04-13T03:38:27.662191+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": 19275
} | 2026-04-13T03:38:27.662191+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": 936
} | 2026-04-13T03:38:27.662191+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": 1045
} | 2026-04-13T03:38:27.662191+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": 2321
} | 2026-04-13T03:38:27.662191+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": 8879
} | 2026-04-13T03:38:27.662191+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": 1833
} | 2026-04-13T03:38:27.662191+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": 6812
} | 2026-04-13T03:38:27.662191+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": 4165
} | 2026-04-13T03:38:27.662191+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": 14989
} | 2026-04-13T03:38:27.662191+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": 26589
} | 2026-04-13T03:38:27.662191+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": 2121
} | 2026-04-13T03:38:27.662191+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": 11442
} | 2026-04-13T03:38:27.662191+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": 778
} | 2026-04-13T03:38:27.662191+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": 3656
} | 2026-04-13T03:38:27.662191+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": 14963
} | 2026-04-13T03:38:27.662191+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": 10418
} | 2026-04-13T03:38:27.662191+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": 9344
} | 2026-04-13T03:38:27.662191+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": 454
} | 2026-04-13T03:38:27.662191+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": 1816
} | 2026-04-13T03:38:27.662191+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": 352
} | 2026-04-13T03:38:27.662191+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": 2877
} | 2026-04-13T03:38:27.662191+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": 3144
} | 2026-04-13T03:38:27.662191+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": 3782
} | 2026-04-13T03:38:27.662191+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-04-13T03:38:27.662191+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": 784
} | 2026-04-13T03:38:27.662191+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": 2721
} | 2026-04-13T03:38:27.662191+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": 7542
} | 2026-04-13T03:38:27.662191+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": 10993
} | 2026-04-13T03:38:27.662191+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-04-13T03:38:27.662191+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": 517
} | 2026-04-13T03:38:27.662191+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": 526
} | 2026-04-13T03:38:27.662191+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": 1312
} | 2026-04-13T03:38:27.662191+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": 2612
} | 2026-04-13T03:38:27.662191+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": 53187
} | 2026-04-13T03:38:27.662191+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": 17862
} | 2026-04-13T03:38:27.662191+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": 791
} | 2026-04-13T03:38:27.662191+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": 11796
} | 2026-04-13T03:38:27.662191+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": 2669
} | 2026-04-13T03:38:27.662191+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": 12247
} | 2026-04-13T03:38:27.662191+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": 69181
} | 2026-04-13T03:38:27.662191+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": 1181
} | 2026-04-13T03:38:27.662191+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": 2868
} | 2026-04-13T03:38:27.662191+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": 29576
} | 2026-04-13T03:38:27.662191+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": 11650
} | 2026-04-13T03:38:27.662191+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": 65555
} | 2026-04-13T03:38:27.662191+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": 4109
} | 2026-04-13T03:38:27.662191+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": 2402
} | 2026-04-13T03:38:27.662191+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": 975
} | 2026-04-13T03:38:27.662191+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": 3223
} | 2026-04-13T03:38:27.662191+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": 1026
} | 2026-04-13T03:38:27.662191+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": 10167
} | 2026-04-13T03:38:27.662191+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": 12206
} | 2026-04-13T03:38:27.662191+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": 1602
} | 2026-04-13T03:38:27.662191+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": 2413
} | 2026-04-13T03:38:27.662191+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": 16750
} | 2026-04-13T03:38:27.662191+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": 15492
} | 2026-04-13T03:38:27.662191+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": 96523
} | 2026-04-13T03:38:27.662191+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": 3955
} | 2026-04-13T03:38:27.662191+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": 9916
} | 2026-04-13T03:38:27.662191+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": 794
} | 2026-04-13T03:38:27.662191+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": 1623
} | 2026-04-13T03:38:27.662191+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": 975
} | 2026-04-13T03:38:27.662191+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": 1404
} | 2026-04-13T03:38:27.662191+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": 4147
} | 2026-04-13T03:38:27.662191+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-04-13T03:38:27.662191+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": 605
} | 2026-04-13T03:38:27.662191+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": 5932
} | 2026-04-13T03:38:27.662191+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": 8447
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:424-A | codeforces | 424-A | Squats | https://codeforces.com/problemset/problem/424/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 9162
} | 2026-04-13T03:38:27.662191+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.