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:675-D | codeforces | 675-D | Tree Construction | https://codeforces.com/problemset/problem/675/D | [
"data structures",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4337
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:675-C | codeforces | 675-C | Money Transfers | https://codeforces.com/problemset/problem/675/C | [
"constructive algorithms",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3902
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:675-B | codeforces | 675-B | Restoring Painting | https://codeforces.com/problemset/problem/675/B | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7758
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:675-A | codeforces | 675-A | Infinite Sequence | https://codeforces.com/problemset/problem/675/A | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15760
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:673-B | codeforces | 673-B | Problems for Round | https://codeforces.com/problemset/problem/673/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 3700
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:673-A | codeforces | 673-A | Bear and Game | https://codeforces.com/problemset/problem/673/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 10962
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:672-B | codeforces | 672-B | Different is Good | https://codeforces.com/problemset/problem/672/B | [
"constructive algorithms",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 18713
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:672-A | codeforces | 672-A | Summer Camp | https://codeforces.com/problemset/problem/672/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16790
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:671-E | codeforces | 671-E | Organizing a Race | https://codeforces.com/problemset/problem/671/E | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 508
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:671-D | codeforces | 671-D | Roads in Yusland | https://codeforces.com/problemset/problem/671/D | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1396
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:671-C | codeforces | 671-C | Ultimate Weirdness of an Array | https://codeforces.com/problemset/problem/671/C | [
"data structures",
"number theory"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 857
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:671-B | codeforces | 671-B | Robin Hood | https://codeforces.com/problemset/problem/671/B | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3420
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:671-A | codeforces | 671-A | Recycling Bottles | https://codeforces.com/problemset/problem/671/A | [
"dp",
"geometry",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4420
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:670-F | codeforces | 670-F | Restore a Number | https://codeforces.com/problemset/problem/670/F | [
"brute force",
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 941
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:670-E | codeforces | 670-E | Correct Bracket Sequence Editor | https://codeforces.com/problemset/problem/670/E | [
"data structures",
"dsu",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3495
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:670-D2 | codeforces | 670-D2 | Magic Powder - 2 | https://codeforces.com/problemset/problem/670/D2 | [
"binary search",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 20681
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:670-D1 | codeforces | 670-D1 | Magic Powder - 1 | https://codeforces.com/problemset/problem/670/D1 | [
"binary search",
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 25310
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:670-C | codeforces | 670-C | Cinema | https://codeforces.com/problemset/problem/670/C | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 10146
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:670-B | codeforces | 670-B | Game of Robots | https://codeforces.com/problemset/problem/670/B | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 12120
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:670-A | codeforces | 670-A | Holidays | https://codeforces.com/problemset/problem/670/A | [
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18891
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:669-A | codeforces | 669-A | Little Artem and Presents | https://codeforces.com/problemset/problem/669/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 11796
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:667-B | codeforces | 667-B | Coat of Anticubism | https://codeforces.com/problemset/problem/667/B | [
"constructive algorithms",
"geometry"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 5921
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:667-A | codeforces | 667-A | Pouring Rain | https://codeforces.com/problemset/problem/667/A | [
"geometry",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 8580
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:666-E | codeforces | 666-E | Forensic Examination | https://codeforces.com/problemset/problem/666/E | [
"data structures",
"string suffix structures"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 1746
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:666-D | codeforces | 666-D | Chain Reaction | https://codeforces.com/problemset/problem/666/D | [
"brute force",
"geometry"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 423
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:666-C | codeforces | 666-C | Codeword | https://codeforces.com/problemset/problem/666/C | [
"combinatorics",
"strings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 961
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:666-B | codeforces | 666-B | World Tour | https://codeforces.com/problemset/problem/666/B | [
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2450
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:666-A | codeforces | 666-A | Reberland Linguistics | https://codeforces.com/problemset/problem/666/A | [
"dp",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3834
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:665-F | codeforces | 665-F | Four Divisors | https://codeforces.com/problemset/problem/665/F | [
"data structures",
"dp",
"math",
"number theory",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 839
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:665-E | codeforces | 665-E | Beautiful Subarrays | https://codeforces.com/problemset/problem/665/E | [
"data structures",
"divide and conquer",
"strings",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4796
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:665-D | codeforces | 665-D | Simple Subset | https://codeforces.com/problemset/problem/665/D | [
"constructive algorithms",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4240
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:665-C | codeforces | 665-C | Simple Strings | https://codeforces.com/problemset/problem/665/C | [
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18728
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:665-B | codeforces | 665-B | Shopping | https://codeforces.com/problemset/problem/665/B | [
"brute force"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 3921
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:665-A | codeforces | 665-A | Buses Between Cities | https://codeforces.com/problemset/problem/665/A | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 3217
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:664-A | codeforces | 664-A | Complicated GCD | https://codeforces.com/problemset/problem/664/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22396
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:663-A | codeforces | 663-A | Rebus | https://codeforces.com/problemset/problem/663/A | [
"constructive algorithms",
"expression parsing",
"greedy",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3810
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:662-E | codeforces | 662-E | To Hack or not to Hack | https://codeforces.com/problemset/problem/662/E | [
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 284
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:662-D | codeforces | 662-D | International Olympiad | https://codeforces.com/problemset/problem/662/D | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1739
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:662-C | codeforces | 662-C | Binary Table | https://codeforces.com/problemset/problem/662/C | [
"bitmasks",
"brute force",
"divide and conquer",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 2641
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:662-B | codeforces | 662-B | Graph Coloring | https://codeforces.com/problemset/problem/662/B | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1722
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:662-A | codeforces | 662-A | Gambling Nim | https://codeforces.com/problemset/problem/662/A | [
"bitmasks",
"math",
"matrices",
"probabilities"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 689
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:661-H | codeforces | 661-H | Rotate Matrix | https://codeforces.com/problemset/problem/661/H | [
"*special"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 97
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:661-G | codeforces | 661-G | Hungarian Notation | https://codeforces.com/problemset/problem/661/G | [
"*special"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 78
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:661-F | codeforces | 661-F | Primes in Interval | https://codeforces.com/problemset/problem/661/F | [
"*special"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 714
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:661-E | codeforces | 661-E | Divisibility Check | https://codeforces.com/problemset/problem/661/E | [
"*special"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 93
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:661-D | codeforces | 661-D | Maximal Difference | https://codeforces.com/problemset/problem/661/D | [
"*special"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 138
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:661-C | codeforces | 661-C | Array Sum | https://codeforces.com/problemset/problem/661/C | [
"*special"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 139
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:661-B | codeforces | 661-B | Seasons | https://codeforces.com/problemset/problem/661/B | [
"*special"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 237
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:661-A | codeforces | 661-A | Lazy Caterer Sequence | https://codeforces.com/problemset/problem/661/A | [
"*special"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 650
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:660-F | codeforces | 660-F | Bear and Bowling 4 | https://codeforces.com/problemset/problem/660/F | [
"binary search",
"data structures",
"divide and conquer",
"geometry",
"ternary search"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2483
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:660-E | codeforces | 660-E | Different Subsets For All Tuples | https://codeforces.com/problemset/problem/660/E | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2031
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:660-D | codeforces | 660-D | Number of Parallelograms | https://codeforces.com/problemset/problem/660/D | [
"geometry"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4826
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:660-C | codeforces | 660-C | Hard Process | https://codeforces.com/problemset/problem/660/C | [
"binary search",
"dp",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11042
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:660-B | codeforces | 660-B | Seating On Bus | https://codeforces.com/problemset/problem/660/B | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 5934
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:660-A | codeforces | 660-A | Co-prime Array | https://codeforces.com/problemset/problem/660/A | [
"greedy",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10686
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:659-G | codeforces | 659-G | Fence Divercity | https://codeforces.com/problemset/problem/659/G | [
"combinatorics",
"dp",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1347
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:659-F | codeforces | 659-F | Polycarp and Hay | https://codeforces.com/problemset/problem/659/F | [
"dfs and similar",
"dsu",
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2009
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:659-E | codeforces | 659-E | New Reform | https://codeforces.com/problemset/problem/659/E | [
"data structures",
"dfs and similar",
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8110
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:659-D | codeforces | 659-D | Bicycle Race | https://codeforces.com/problemset/problem/659/D | [
"geometry",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6774
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:659-C | codeforces | 659-C | Tanya and Toys | https://codeforces.com/problemset/problem/659/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12035
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:659-B | codeforces | 659-B | Qualifying Contest | https://codeforces.com/problemset/problem/659/B | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6683
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:659-A | codeforces | 659-A | Round House | https://codeforces.com/problemset/problem/659/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17007
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:658-A | codeforces | 658-A | Bear and Reverse Radewoosh | https://codeforces.com/problemset/problem/658/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 7787
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:656-G | codeforces | 656-G | You're a Professional | https://codeforces.com/problemset/problem/656/G | [
"*special"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 517
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:656-F | codeforces | 656-F | Ace It! | https://codeforces.com/problemset/problem/656/F | [
"*special"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 966
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:656-E | codeforces | 656-E | Out of Controls | https://codeforces.com/problemset/problem/656/E | [
"*special"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 780
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:656-D | codeforces | 656-D | Rosetta Problem | https://codeforces.com/problemset/problem/656/D | [
"*special"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1010
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:656-C | codeforces | 656-C | Without Text | https://codeforces.com/problemset/problem/656/C | [
"*special"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 762
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:656-B | codeforces | 656-B | Scrambled | https://codeforces.com/problemset/problem/656/B | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1778
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:656-A | codeforces | 656-A | Da Vinci Powers | https://codeforces.com/problemset/problem/656/A | [
"*special"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3851
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:653-G | codeforces | 653-G | Move by Prime | https://codeforces.com/problemset/problem/653/G | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 812
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:653-F | codeforces | 653-F | Paper task | https://codeforces.com/problemset/problem/653/F | [
"data structures",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1252
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:653-E | codeforces | 653-E | Bear and Forgotten Tree 2 | https://codeforces.com/problemset/problem/653/E | [
"dfs and similar",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1785
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:653-D | codeforces | 653-D | Delivery Bears | https://codeforces.com/problemset/problem/653/D | [
"binary search",
"flows",
"graphs"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3079
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:653-C | codeforces | 653-C | Bear and Up-Down | https://codeforces.com/problemset/problem/653/C | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1786
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:653-B | codeforces | 653-B | Bear and Compressing | https://codeforces.com/problemset/problem/653/B | [
"brute force",
"dfs and similar",
"dp",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 5415
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:653-A | codeforces | 653-A | Bear and Three Balls | https://codeforces.com/problemset/problem/653/A | [
"brute force",
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 9373
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:652-F | codeforces | 652-F | Ants on a Circle | https://codeforces.com/problemset/problem/652/F | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 786
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:652-E | codeforces | 652-E | Pursuit For Artifacts | https://codeforces.com/problemset/problem/652/E | [
"dfs and similar",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3054
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:652-D | codeforces | 652-D | Nested Segments | https://codeforces.com/problemset/problem/652/D | [
"data structures",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5012
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:652-C | codeforces | 652-C | Foe Pairs | https://codeforces.com/problemset/problem/652/C | [
"combinatorics",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3832
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:652-B | codeforces | 652-B | z-sort | https://codeforces.com/problemset/problem/652/B | [
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 12080
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:652-A | codeforces | 652-A | Gabriel and Caterpillar | https://codeforces.com/problemset/problem/652/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 5318
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:651-B | codeforces | 651-B | Beautiful Paintings | https://codeforces.com/problemset/problem/651/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12338
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:651-A | codeforces | 651-A | Joysticks | https://codeforces.com/problemset/problem/651/A | [
"dp",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 24332
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:650-E | codeforces | 650-E | Clockwork Bomb | https://codeforces.com/problemset/problem/650/E | [
"data structures",
"dfs and similar",
"dsu",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 1088
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:650-D | codeforces | 650-D | Zip-line | https://codeforces.com/problemset/problem/650/D | [
"binary search",
"data structures",
"dp",
"hashing"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1733
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:650-C | codeforces | 650-C | Table Compression | https://codeforces.com/problemset/problem/650/C | [
"dfs and similar",
"dp",
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2252
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:650-B | codeforces | 650-B | Image Preview | https://codeforces.com/problemset/problem/650/B | [
"binary search",
"brute force",
"dp",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3519
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:650-A | codeforces | 650-A | Watchmen | https://codeforces.com/problemset/problem/650/A | [
"data structures",
"geometry",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16778
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:649-E | codeforces | 649-E | Автобус | https://codeforces.com/problemset/problem/649/E | [
"binary search",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 184
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:649-D | codeforces | 649-D | Дефрагментация памяти | https://codeforces.com/problemset/problem/649/D | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 443
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:649-C | codeforces | 649-C | Печать условий | https://codeforces.com/problemset/problem/649/C | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 562
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:649-B | codeforces | 649-B | Этажи | https://codeforces.com/problemset/problem/649/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 645
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:649-A | codeforces | 649-A | Любимые числа Поликарпа | https://codeforces.com/problemset/problem/649/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 1716
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:648-E | codeforces | 648-E | Собери число | https://codeforces.com/problemset/problem/648/E | [
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 182
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:648-D | codeforces | 648-D | Собачки и миски | https://codeforces.com/problemset/problem/648/D | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 357
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:648-C | codeforces | 648-C | Путь Робота | https://codeforces.com/problemset/problem/648/C | [
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 1421
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:648-B | codeforces | 648-B | Собери стол | https://codeforces.com/problemset/problem/648/B | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 2218
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:648-A | codeforces | 648-A | Наибольший подъем | https://codeforces.com/problemset/problem/648/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 1187
} | 2026-08-17T01:43:56.191071+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.