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:946-E | codeforces | 946-E | Largest Beautiful Number | https://codeforces.com/problemset/problem/946/E | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1267
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:946-D | codeforces | 946-D | Timetable | https://codeforces.com/problemset/problem/946/D | [
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4968
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:946-C | codeforces | 946-C | String Transformation | https://codeforces.com/problemset/problem/946/C | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9464
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:946-B | codeforces | 946-B | Weird Subtraction Process | https://codeforces.com/problemset/problem/946/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 11537
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:946-A | codeforces | 946-A | Partition | https://codeforces.com/problemset/problem/946/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18393
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:940-F | codeforces | 940-F | Machine Learning | https://codeforces.com/problemset/problem/940/F | [
"brute force",
"data structures"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 3626
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:940-E | codeforces | 940-E | Cashback | https://codeforces.com/problemset/problem/940/E | [
"data structures",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4536
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:940-D | codeforces | 940-D | Alena And The Heater | https://codeforces.com/problemset/problem/940/D | [
"binary search",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 3791
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:940-C | codeforces | 940-C | Phone Numbers | https://codeforces.com/problemset/problem/940/C | [
"constructive algorithms",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6785
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:940-B | codeforces | 940-B | Our Tanya is Crying Out Loud | https://codeforces.com/problemset/problem/940/B | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9592
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:940-A | codeforces | 940-A | Points on the line | https://codeforces.com/problemset/problem/940/A | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8857
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:939-F | codeforces | 939-F | Cutlet | https://codeforces.com/problemset/problem/939/F | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1266
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:939-E | codeforces | 939-E | Maximize! | https://codeforces.com/problemset/problem/939/E | [
"binary search",
"greedy",
"ternary search",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3566
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:939-D | codeforces | 939-D | Love Rescue | https://codeforces.com/problemset/problem/939/D | [
"dfs and similar",
"dsu",
"graphs",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8340
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:939-C | codeforces | 939-C | Convenient For Everybody | https://codeforces.com/problemset/problem/939/C | [
"binary search",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4965
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:939-B | codeforces | 939-B | Hamster Farm | https://codeforces.com/problemset/problem/939/B | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 11374
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:939-A | codeforces | 939-A | Love Triangle | https://codeforces.com/problemset/problem/939/A | [
"graphs"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30532
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:938-G | codeforces | 938-G | Shortest Path Queries | https://codeforces.com/problemset/problem/938/G | [
"bitmasks",
"data structures",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1253
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:938-F | codeforces | 938-F | Erasing Substrings | https://codeforces.com/problemset/problem/938/F | [
"bitmasks",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 674
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:938-E | codeforces | 938-E | Max History | https://codeforces.com/problemset/problem/938/E | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1609
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:938-D | codeforces | 938-D | Buy a Ticket | https://codeforces.com/problemset/problem/938/D | [
"data structures",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 7460
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:938-C | codeforces | 938-C | Constructing Tests | https://codeforces.com/problemset/problem/938/C | [
"binary search",
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3493
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:938-B | codeforces | 938-B | Run For Your Prize | https://codeforces.com/problemset/problem/938/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 9369
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:938-A | codeforces | 938-A | Word Correction | https://codeforces.com/problemset/problem/938/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12156
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:937-B | codeforces | 937-B | Vile Grasshoppers | https://codeforces.com/problemset/problem/937/B | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7314
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:937-A | codeforces | 937-A | Olympiad | https://codeforces.com/problemset/problem/937/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16693
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:936-E | codeforces | 936-E | Iqea | https://codeforces.com/problemset/problem/936/E | [
"data structures",
"dfs and similar",
"divide and conquer",
"dsu",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 261
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:936-D | codeforces | 936-D | World of Tank | https://codeforces.com/problemset/problem/936/D | [
"dp",
"greedy"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 399
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:936-C | codeforces | 936-C | Lock Puzzle | https://codeforces.com/problemset/problem/936/C | [
"constructive algorithms",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1291
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:936-B | codeforces | 936-B | Sleepy Game | https://codeforces.com/problemset/problem/936/B | [
"dfs and similar",
"dp",
"games",
"graphs"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3488
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:936-A | codeforces | 936-A | Save Energy! | https://codeforces.com/problemset/problem/936/A | [
"binary search",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4691
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:935-F | codeforces | 935-F | Fafa and Array | https://codeforces.com/problemset/problem/935/F | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 515
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:935-E | codeforces | 935-E | Fafa and Ancient Mathematics | https://codeforces.com/problemset/problem/935/E | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1008
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:935-D | codeforces | 935-D | Fafa and Ancient Alphabet | https://codeforces.com/problemset/problem/935/D | [
"math",
"probabilities"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2867
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:935-C | codeforces | 935-C | Fifa and Fafa | https://codeforces.com/problemset/problem/935/C | [
"geometry"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5044
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:935-B | codeforces | 935-B | Fafa and the Gates | https://codeforces.com/problemset/problem/935/B | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 12545
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:935-A | codeforces | 935-A | Fafa and his Company | https://codeforces.com/problemset/problem/935/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 47913
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:934-B | codeforces | 934-B | A Prosperous Lot | https://codeforces.com/problemset/problem/934/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9263
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:934-A | codeforces | 934-A | A Compatible Pair | https://codeforces.com/problemset/problem/934/A | [
"brute force",
"games"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7662
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:933-E | codeforces | 933-E | A Preponderant Reunion | https://codeforces.com/problemset/problem/933/E | [
"constructive algorithms",
"dp"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 329
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:933-D | codeforces | 933-D | A Creative Cutout | https://codeforces.com/problemset/problem/933/D | [
"brute force",
"combinatorics",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 403
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:933-C | codeforces | 933-C | A Colourful Prospect | https://codeforces.com/problemset/problem/933/C | [
"geometry",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 689
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:933-B | codeforces | 933-B | A Determined Cleanup | https://codeforces.com/problemset/problem/933/B | [
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2085
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:933-A | codeforces | 933-A | A Twisty Movement | https://codeforces.com/problemset/problem/933/A | [
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5491
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:932-G | codeforces | 932-G | Palindrome Partition | https://codeforces.com/problemset/problem/932/G | [
"dp",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1247
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:932-F | codeforces | 932-F | Escape Through Leaf | https://codeforces.com/problemset/problem/932/F | [
"data structures",
"dp",
"geometry"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 4369
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:932-E | codeforces | 932-E | Team Work | https://codeforces.com/problemset/problem/932/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 3625
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:932-D | codeforces | 932-D | Tree | https://codeforces.com/problemset/problem/932/D | [
"binary search",
"dp",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2075
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:932-C | codeforces | 932-C | Permutation Cycle | https://codeforces.com/problemset/problem/932/C | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4254
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:932-B | codeforces | 932-B | Recursive Queries | https://codeforces.com/problemset/problem/932/B | [
"binary search",
"data structures",
"dfs and similar"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9420
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:932-A | codeforces | 932-A | Palindromic Supersequence | https://codeforces.com/problemset/problem/932/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 10950
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:931-C | codeforces | 931-C | Laboratory Work | https://codeforces.com/problemset/problem/931/C | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3539
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:931-B | codeforces | 931-B | World Cup | https://codeforces.com/problemset/problem/931/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 7552
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:931-A | codeforces | 931-A | Friends Meeting | https://codeforces.com/problemset/problem/931/A | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 13174
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:930-E | codeforces | 930-E | Coins Exhibition | https://codeforces.com/problemset/problem/930/E | [
"data structures",
"dp",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 567
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:930-D | codeforces | 930-D | Game with Tokens | https://codeforces.com/problemset/problem/930/D | [
"data structures",
"games",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 466
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:930-C | codeforces | 930-C | Teodor is not a liar! | https://codeforces.com/problemset/problem/930/C | [
"data structures",
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2398
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:930-B | codeforces | 930-B | Game with String | https://codeforces.com/problemset/problem/930/B | [
"implementation",
"probabilities",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 3196
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:930-A | codeforces | 930-A | Peculiar apple-tree | https://codeforces.com/problemset/problem/930/A | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8616
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:929-D | codeforces | 929-D | Пограничные врата | https://codeforces.com/problemset/problem/929/D | [] | null | null | stdin_stdout | 2,400 | {
"solved_count": 172
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:929-C | codeforces | 929-C | Красивая команда | https://codeforces.com/problemset/problem/929/C | [
"*special",
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1205
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:929-B | codeforces | 929-B | Места в самолёте | https://codeforces.com/problemset/problem/929/B | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 2092
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:929-A | codeforces | 929-A | Прокат велосипедов | https://codeforces.com/problemset/problem/929/A | [
"*special",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 2562
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:928-D | codeforces | 928-D | Autocompletion | https://codeforces.com/problemset/problem/928/D | [
"*special",
"strings",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 834
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:928-C | codeforces | 928-C | Dependency management | https://codeforces.com/problemset/problem/928/C | [
"*special",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 908
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:928-B | codeforces | 928-B | Chat | https://codeforces.com/problemset/problem/928/B | [
"*special",
"dp"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 2657
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:928-A | codeforces | 928-A | Login Verification | https://codeforces.com/problemset/problem/928/A | [
"*special",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 3631
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:927-A | codeforces | 927-A | BuberPool Taxi Optimization | https://codeforces.com/problemset/problem/927/A | [
"*special",
"interactive"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:926-J | codeforces | 926-J | Segments | https://codeforces.com/problemset/problem/926/J | [
"data structures"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 658
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:926-I | codeforces | 926-I | A Vital Problem | https://codeforces.com/problemset/problem/926/I | [] | null | null | stdin_stdout | 1,700 | {
"solved_count": 812
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:926-H | codeforces | 926-H | Endless Roses Most Beautiful | https://codeforces.com/problemset/problem/926/H | [] | null | null | stdin_stdout | 2,200 | {
"solved_count": 295
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:926-G | codeforces | 926-G | Large Bouquets | https://codeforces.com/problemset/problem/926/G | [] | null | null | stdin_stdout | 1,500 | {
"solved_count": 1753
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:926-F | codeforces | 926-F | Mobile Communications | https://codeforces.com/problemset/problem/926/F | [] | null | null | stdin_stdout | 2,000 | {
"solved_count": 342
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:926-E | codeforces | 926-E | Merge Equal Elements | https://codeforces.com/problemset/problem/926/E | [
"constructive algorithms",
"data structures"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1076
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:926-D | codeforces | 926-D | Choose Place | https://codeforces.com/problemset/problem/926/D | [] | null | null | stdin_stdout | 1,600 | {
"solved_count": 1040
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:926-C | codeforces | 926-C | Is This a Zebra? | https://codeforces.com/problemset/problem/926/C | [
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2108
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:926-B | codeforces | 926-B | Add Points | https://codeforces.com/problemset/problem/926/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2052
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:926-A | codeforces | 926-A | 2-3-numbers | https://codeforces.com/problemset/problem/926/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4212
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:925-F | codeforces | 925-F | Parametric Circulation | https://codeforces.com/problemset/problem/925/F | [
"binary search",
"flows"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 324
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:925-E | codeforces | 925-E | May Holidays | https://codeforces.com/problemset/problem/925/E | [
"data structures",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 594
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:925-D | codeforces | 925-D | Aztec Catacombs | https://codeforces.com/problemset/problem/925/D | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 579
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:925-C | codeforces | 925-C | Big Secret | https://codeforces.com/problemset/problem/925/C | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1449
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:925-B | codeforces | 925-B | Resource Distribution | https://codeforces.com/problemset/problem/925/B | [
"binary search",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2358
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:925-A | codeforces | 925-A | Stairs and Elevators | https://codeforces.com/problemset/problem/925/A | [
"binary search"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 3941
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:924-F | codeforces | 924-F | Minimal Subset Difference | https://codeforces.com/problemset/problem/924/F | [
"dp"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 452
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:924-E | codeforces | 924-E | Wardrobe | https://codeforces.com/problemset/problem/924/E | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 595
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:924-D | codeforces | 924-D | Contact ATC | https://codeforces.com/problemset/problem/924/D | [] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1009
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:924-C | codeforces | 924-C | Riverside Curio | https://codeforces.com/problemset/problem/924/C | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4341
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:924-B | codeforces | 924-B | Three-level Laser | https://codeforces.com/problemset/problem/924/B | [
"binary search",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5647
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:924-A | codeforces | 924-A | Mystical Mosaic | https://codeforces.com/problemset/problem/924/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 5249
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:923-F | codeforces | 923-F | Public Service | https://codeforces.com/problemset/problem/923/F | [
"constructive algorithms",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 143
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:923-E | codeforces | 923-E | Perpetual Subtraction | https://codeforces.com/problemset/problem/923/E | [
"fft",
"math",
"matrices"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 645
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:923-D | codeforces | 923-D | Picking Strings | https://codeforces.com/problemset/problem/923/D | [
"constructive algorithms",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1466
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:923-C | codeforces | 923-C | Perfect Security | https://codeforces.com/problemset/problem/923/C | [
"data structures",
"greedy",
"strings",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4856
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:923-B | codeforces | 923-B | Producing Snow | https://codeforces.com/problemset/problem/923/B | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7831
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:923-A | codeforces | 923-A | Primal Sport | https://codeforces.com/problemset/problem/923/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5474
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:922-F | codeforces | 922-F | Divisibility | https://codeforces.com/problemset/problem/922/F | [
"constructive algorithms",
"dp",
"greedy",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 770
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:922-E | codeforces | 922-E | Birds | https://codeforces.com/problemset/problem/922/E | [
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2555
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:922-D | codeforces | 922-D | Robot Vacuum Cleaner | https://codeforces.com/problemset/problem/922/D | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4918
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:922-C | codeforces | 922-C | Cave Painting | https://codeforces.com/problemset/problem/922/C | [
"brute force",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7767
} | 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.