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:825-B | codeforces | 825-B | Five-In-a-Row | https://codeforces.com/problemset/problem/825/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4791
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:825-A | codeforces | 825-A | Binary Protocol | https://codeforces.com/problemset/problem/825/A | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 8210
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:822-F | codeforces | 822-F | Madness | https://codeforces.com/problemset/problem/822/F | [
"constructive algorithms",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 375
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:822-E | codeforces | 822-E | Liar | https://codeforces.com/problemset/problem/822/E | [
"binary search",
"dp",
"hashing",
"string suffix structures"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1090
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:822-D | codeforces | 822-D | My pretty girl Noora | https://codeforces.com/problemset/problem/822/D | [
"brute force",
"dp",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3292
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:822-C | codeforces | 822-C | Hacker, pack your bags! | https://codeforces.com/problemset/problem/822/C | [
"binary search",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4944
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:822-B | codeforces | 822-B | Crossword solving | https://codeforces.com/problemset/problem/822/B | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 10232
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:822-A | codeforces | 822-A | I'm bored with life | https://codeforces.com/problemset/problem/822/A | [
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 37134
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:821-E | codeforces | 821-E | Okabe and El Psy Kongroo | https://codeforces.com/problemset/problem/821/E | [
"dp",
"matrices"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1673
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:821-D | codeforces | 821-D | Okabe and City | https://codeforces.com/problemset/problem/821/D | [
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1716
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:821-C | codeforces | 821-C | Okabe and Boxes | https://codeforces.com/problemset/problem/821/C | [
"data structures",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7942
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:821-B | codeforces | 821-B | Okabe and Banana Trees | https://codeforces.com/problemset/problem/821/B | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6075
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:821-A | codeforces | 821-A | Okabe and Future Gadget Laboratory | https://codeforces.com/problemset/problem/821/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 8998
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:820-C | codeforces | 820-C | Mister B and Boring Game | https://codeforces.com/problemset/problem/820/C | [
"games",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 529
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:820-B | codeforces | 820-B | Mister B and Angle in Polygon | https://codeforces.com/problemset/problem/820/B | [
"constructive algorithms",
"geometry",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 5522
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:820-A | codeforces | 820-A | Mister B and Book Reading | https://codeforces.com/problemset/problem/820/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 8640
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:819-E | codeforces | 819-E | Mister B and Flight to the Moon | https://codeforces.com/problemset/problem/819/E | [
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 611
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:819-D | codeforces | 819-D | Mister B and Astronomers | https://codeforces.com/problemset/problem/819/D | [
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 309
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:819-C | codeforces | 819-C | Mister B and Beacons on Field | https://codeforces.com/problemset/problem/819/C | [
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 232
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:819-B | codeforces | 819-B | Mister B and PR Shifts | https://codeforces.com/problemset/problem/819/B | [
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1794
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:818-G | codeforces | 818-G | Four Melodies | https://codeforces.com/problemset/problem/818/G | [
"flows",
"graphs"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1023
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:818-F | codeforces | 818-F | Level Generation | https://codeforces.com/problemset/problem/818/F | [
"binary search",
"math",
"ternary search"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1942
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:818-E | codeforces | 818-E | Card Game Again | https://codeforces.com/problemset/problem/818/E | [
"binary search",
"data structures",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2689
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:818-D | codeforces | 818-D | Multicolored Cars | https://codeforces.com/problemset/problem/818/D | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3798
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:818-C | codeforces | 818-C | Sofa Thief | https://codeforces.com/problemset/problem/818/C | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1375
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:818-B | codeforces | 818-B | Permutation Game | https://codeforces.com/problemset/problem/818/B | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 3228
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:818-A | codeforces | 818-A | Diplomas and Certificates | https://codeforces.com/problemset/problem/818/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 7807
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:817-F | codeforces | 817-F | MEX Queries | https://codeforces.com/problemset/problem/817/F | [
"binary search",
"data structures",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3388
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:817-E | codeforces | 817-E | Choosing The Commander | https://codeforces.com/problemset/problem/817/E | [
"bitmasks",
"data structures",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3750
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:817-D | codeforces | 817-D | Imbalanced Array | https://codeforces.com/problemset/problem/817/D | [
"data structures",
"divide and conquer",
"dsu",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6366
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:817-C | codeforces | 817-C | Really Big Numbers | https://codeforces.com/problemset/problem/817/C | [
"binary search",
"brute force",
"dp",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8512
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:817-B | codeforces | 817-B | Makes And The Product | https://codeforces.com/problemset/problem/817/B | [
"combinatorics",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6437
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:817-A | codeforces | 817-A | Treasure Hunt | https://codeforces.com/problemset/problem/817/A | [
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 6896
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:816-B | codeforces | 816-B | Karen and Coffee | https://codeforces.com/problemset/problem/816/B | [
"binary search",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 27889
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:816-A | codeforces | 816-A | Karen and Morning | https://codeforces.com/problemset/problem/816/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 9733
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:815-E | codeforces | 815-E | Karen and Neighborhood | https://codeforces.com/problemset/problem/815/E | [
"binary search",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 249
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:815-D | codeforces | 815-D | Karen and Cards | https://codeforces.com/problemset/problem/815/D | [
"binary search",
"combinatorics",
"data structures",
"geometry"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 751
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:815-C | codeforces | 815-C | Karen and Supermarket | https://codeforces.com/problemset/problem/815/C | [
"brute force",
"dp",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 3345
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:815-B | codeforces | 815-B | Karen and Test | https://codeforces.com/problemset/problem/815/B | [
"brute force",
"combinatorics",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1603
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:815-A | codeforces | 815-A | Karen and Game | https://codeforces.com/problemset/problem/815/A | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5897
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:814-E | codeforces | 814-E | An unavoidable detour for home | https://codeforces.com/problemset/problem/814/E | [
"combinatorics",
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 728
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:814-D | codeforces | 814-D | An overnight dance in discotheque | https://codeforces.com/problemset/problem/814/D | [
"dfs and similar",
"dp",
"geometry",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2588
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:814-C | codeforces | 814-C | An impassioned circulation of affection | https://codeforces.com/problemset/problem/814/C | [
"brute force",
"dp",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7778
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:814-B | codeforces | 814-B | An express train to reveries | https://codeforces.com/problemset/problem/814/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 5887
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:814-A | codeforces | 814-A | An abandoned sentiment from past | https://codeforces.com/problemset/problem/814/A | [
"constructive algorithms",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 11063
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:813-F | codeforces | 813-F | Bipartite Checking | https://codeforces.com/problemset/problem/813/F | [
"data structures",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1727
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:813-E | codeforces | 813-E | Army Creation | https://codeforces.com/problemset/problem/813/E | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3161
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:813-D | codeforces | 813-D | Two Melodies | https://codeforces.com/problemset/problem/813/D | [
"dp",
"flows"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1156
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:813-C | codeforces | 813-C | The Tag Game | https://codeforces.com/problemset/problem/813/C | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8311
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:813-B | codeforces | 813-B | The Golden Age | https://codeforces.com/problemset/problem/813/B | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4450
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:813-A | codeforces | 813-A | The Contest | https://codeforces.com/problemset/problem/813/A | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 5444
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:812-E | codeforces | 812-E | Sagheer and Apple Tree | https://codeforces.com/problemset/problem/812/E | [
"games",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1344
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:812-D | codeforces | 812-D | Sagheer and Kindergarten | https://codeforces.com/problemset/problem/812/D | [
"dfs and similar",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 350
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:812-C | codeforces | 812-C | Sagheer and Nubian Market | https://codeforces.com/problemset/problem/812/C | [
"binary search",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 17677
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:812-B | codeforces | 812-B | Sagheer, the Hausmeister | https://codeforces.com/problemset/problem/812/B | [
"bitmasks",
"brute force",
"dp"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5561
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:812-A | codeforces | 812-A | Sagheer and Crossroads | https://codeforces.com/problemset/problem/812/A | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 6453
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:811-E | codeforces | 811-E | Vladik and Entertaining Flags | https://codeforces.com/problemset/problem/811/E | [
"data structures",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 981
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:811-D | codeforces | 811-D | Vladik and Favorite Game | https://codeforces.com/problemset/problem/811/D | [
"constructive algorithms",
"dfs and similar",
"graphs",
"interactive"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1906
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:811-C | codeforces | 811-C | Vladik and Memorable Trip | https://codeforces.com/problemset/problem/811/C | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3498
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:811-B | codeforces | 811-B | Vladik and Complicated Book | https://codeforces.com/problemset/problem/811/B | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 6802
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:811-A | codeforces | 811-A | Vladik and Courtesy | https://codeforces.com/problemset/problem/811/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12384
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:810-B | codeforces | 810-B | Summer sell-off | https://codeforces.com/problemset/problem/810/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12655
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:810-A | codeforces | 810-A | Straight <<A>> | https://codeforces.com/problemset/problem/810/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 9329
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:809-E | codeforces | 809-E | Surprise me! | https://codeforces.com/problemset/problem/809/E | [
"divide and conquer",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 855
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:809-D | codeforces | 809-D | Hitchhiking in the Baltic States | https://codeforces.com/problemset/problem/809/D | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1034
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:809-C | codeforces | 809-C | Find a car | https://codeforces.com/problemset/problem/809/C | [
"combinatorics",
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 911
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:809-B | codeforces | 809-B | Glad to see you! | https://codeforces.com/problemset/problem/809/B | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1783
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:809-A | codeforces | 809-A | Do you want a date? | https://codeforces.com/problemset/problem/809/A | [
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4898
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:808-G | codeforces | 808-G | Anthem of Berland | https://codeforces.com/problemset/problem/808/G | [
"dp",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3828
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:808-F | codeforces | 808-F | Card Game | https://codeforces.com/problemset/problem/808/F | [
"binary search",
"flows",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1599
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:808-E | codeforces | 808-E | Selling Souvenirs | https://codeforces.com/problemset/problem/808/E | [
"binary search",
"dp",
"greedy",
"ternary search"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2202
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:808-D | codeforces | 808-D | Array Division | https://codeforces.com/problemset/problem/808/D | [
"binary search",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8178
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:808-C | codeforces | 808-C | Tea Party | https://codeforces.com/problemset/problem/808/C | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7042
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:808-B | codeforces | 808-B | Average Sleep Time | https://codeforces.com/problemset/problem/808/B | [
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15234
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:808-A | codeforces | 808-A | Lucky Year | https://codeforces.com/problemset/problem/808/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 11051
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:807-B | codeforces | 807-B | T-Shirt Hunt | https://codeforces.com/problemset/problem/807/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 3668
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:807-A | codeforces | 807-A | Is it rated? | https://codeforces.com/problemset/problem/807/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 23329
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:805-B | codeforces | 805-B | 3-palindrome | https://codeforces.com/problemset/problem/805/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 18805
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:805-A | codeforces | 805-A | Fake NP | https://codeforces.com/problemset/problem/805/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19238
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:804-F | codeforces | 804-F | Fake bullions | https://codeforces.com/problemset/problem/804/F | [
"combinatorics",
"dfs and similar",
"dp",
"graphs",
"number theory"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 215
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:804-E | codeforces | 804-E | The same permutation | https://codeforces.com/problemset/problem/804/E | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 658
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:804-D | codeforces | 804-D | Expected diameter of a tree | https://codeforces.com/problemset/problem/804/D | [
"binary search",
"brute force",
"dfs and similar",
"dp",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1561
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:804-C | codeforces | 804-C | Ice cream coloring | https://codeforces.com/problemset/problem/804/C | [
"constructive algorithms",
"dfs and similar",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1932
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:804-B | codeforces | 804-B | Minimum number of steps | https://codeforces.com/problemset/problem/804/B | [
"combinatorics",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10176
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:804-A | codeforces | 804-A | Find Amir | https://codeforces.com/problemset/problem/804/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16574
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:803-G | codeforces | 803-G | Periodic RMQ Problem | https://codeforces.com/problemset/problem/803/G | [
"data structures"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1899
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:803-F | codeforces | 803-F | Coprime Subsequences | https://codeforces.com/problemset/problem/803/F | [
"bitmasks",
"combinatorics",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4725
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:803-E | codeforces | 803-E | Roma and Poker | https://codeforces.com/problemset/problem/803/E | [
"dp",
"graphs"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2669
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:803-D | codeforces | 803-D | Magazine Ad | https://codeforces.com/problemset/problem/803/D | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4062
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:803-C | codeforces | 803-C | Maximal GCD | https://codeforces.com/problemset/problem/803/C | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5834
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:803-B | codeforces | 803-B | Distances to Zero | https://codeforces.com/problemset/problem/803/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 7590
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:803-A | codeforces | 803-A | Maximal Binary Matrix | https://codeforces.com/problemset/problem/803/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 5364
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:802-M3 | codeforces | 802-M3 | April Fools' Problem (hard) | https://codeforces.com/problemset/problem/802/M3 | [
"binary search",
"data structures",
"flows"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1296
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:802-M2 | codeforces | 802-M2 | April Fools' Problem (medium) | https://codeforces.com/problemset/problem/802/M2 | [
"binary search",
"flows",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1489
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:802-M1 | codeforces | 802-M1 | April Fools' Problem (easy) | https://codeforces.com/problemset/problem/802/M1 | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 3684
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:802-J3 | codeforces | 802-J3 | Send the Fool Further! (hard) | https://codeforces.com/problemset/problem/802/J3 | [
"dfs and similar",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 388
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:802-J2 | codeforces | 802-J2 | Send the Fool Further! (medium) | https://codeforces.com/problemset/problem/802/J2 | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 736
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:802-J1 | codeforces | 802-J1 | Send the Fool Further! (easy) | https://codeforces.com/problemset/problem/802/J1 | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 6581
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:802-G3 | codeforces | 802-G3 | Fake News (hard) | https://codeforces.com/problemset/problem/802/G3 | [
"string suffix structures"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1845
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:802-G2 | codeforces | 802-G2 | Fake News (medium) | https://codeforces.com/problemset/problem/802/G2 | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 555
} | 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.