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: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": 2833
} | 2026-06-01T05:00:40.145500+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": 5009
} | 2026-06-01T05:00:40.145500+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": 12440
} | 2026-06-01T05:00:40.145500+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": 47377
} | 2026-06-01T05:00:40.145500+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": 9172
} | 2026-06-01T05:00:40.145500+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": 7611
} | 2026-06-01T05:00:40.145500+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": 288
} | 2026-06-01T05:00:40.145500+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": 389
} | 2026-06-01T05:00:40.145500+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": 649
} | 2026-06-01T05:00:40.145500+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": 2060
} | 2026-06-01T05:00:40.145500+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": 5405
} | 2026-06-01T05:00:40.145500+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": 1195
} | 2026-06-01T05:00:40.145500+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": 4155
} | 2026-06-01T05:00:40.145500+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": 3478
} | 2026-06-01T05:00:40.145500+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": 1989
} | 2026-06-01T05:00:40.145500+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": 4242
} | 2026-06-01T05:00:40.145500+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": 9284
} | 2026-06-01T05:00:40.145500+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": 10904
} | 2026-06-01T05:00:40.145500+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": 3500
} | 2026-06-01T05:00:40.145500+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": 7467
} | 2026-06-01T05:00:40.145500+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": 13111
} | 2026-06-01T05:00:40.145500+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": 520
} | 2026-06-01T05:00:40.145500+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": 447
} | 2026-06-01T05:00:40.145500+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": 2387
} | 2026-06-01T05:00:40.145500+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": 3142
} | 2026-06-01T05:00:40.145500+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": 8437
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:929-D | codeforces | 929-D | Пограничные врата | https://codeforces.com/problemset/problem/929/D | [] | null | null | stdin_stdout | 2,400 | {
"solved_count": 159
} | 2026-06-01T05:00:40.145500+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": 1203
} | 2026-06-01T05:00:40.145500+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": 2088
} | 2026-06-01T05:00:40.145500+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": 2559
} | 2026-06-01T05:00:40.145500+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": 833
} | 2026-06-01T05:00:40.145500+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": 906
} | 2026-06-01T05:00:40.145500+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": 2650
} | 2026-06-01T05:00:40.145500+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": 3605
} | 2026-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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": 571
} | 2026-06-01T05:00:40.145500+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": 767
} | 2026-06-01T05:00:40.145500+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": 271
} | 2026-06-01T05:00:40.145500+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": 1739
} | 2026-06-01T05:00:40.145500+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": 325
} | 2026-06-01T05:00:40.145500+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": 1067
} | 2026-06-01T05:00:40.145500+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": 1038
} | 2026-06-01T05:00:40.145500+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": 2094
} | 2026-06-01T05:00:40.145500+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": 2038
} | 2026-06-01T05:00:40.145500+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": 4186
} | 2026-06-01T05:00:40.145500+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": 169
} | 2026-06-01T05:00:40.145500+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": 542
} | 2026-06-01T05:00:40.145500+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": 569
} | 2026-06-01T05:00:40.145500+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": 1416
} | 2026-06-01T05:00:40.145500+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": 2353
} | 2026-06-01T05:00:40.145500+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": 3887
} | 2026-06-01T05:00:40.145500+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": 335
} | 2026-06-01T05:00:40.145500+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": 570
} | 2026-06-01T05:00:40.145500+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": 922
} | 2026-06-01T05:00:40.145500+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": 4220
} | 2026-06-01T05:00:40.145500+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": 5622
} | 2026-06-01T05:00:40.145500+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": 5217
} | 2026-06-01T05:00:40.145500+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": 139
} | 2026-06-01T05:00:40.145500+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": 516
} | 2026-06-01T05:00:40.145500+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": 1261
} | 2026-06-01T05:00:40.145500+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": 4733
} | 2026-06-01T05:00:40.145500+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": 7769
} | 2026-06-01T05:00:40.145500+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": 5429
} | 2026-06-01T05:00:40.145500+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": 745
} | 2026-06-01T05:00:40.145500+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": 2476
} | 2026-06-01T05:00:40.145500+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": 4834
} | 2026-06-01T05:00:40.145500+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": 7712
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:922-B | codeforces | 922-B | Magic Forest | https://codeforces.com/problemset/problem/922/B | [
"brute force"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9490
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:922-A | codeforces | 922-A | Cloning Toys | https://codeforces.com/problemset/problem/922/A | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12618
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:921-14 | codeforces | 921-14 | Labyrinth-14 | https://codeforces.com/problemset/problem/921/14 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:921-13 | codeforces | 921-13 | Labyrinth-13 | https://codeforces.com/problemset/problem/921/13 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:921-12 | codeforces | 921-12 | Labyrinth-12 | https://codeforces.com/problemset/problem/921/12 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:921-11 | codeforces | 921-11 | Labyrinth-11 | https://codeforces.com/problemset/problem/921/11 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:921-10 | codeforces | 921-10 | Labyrinth-10 | https://codeforces.com/problemset/problem/921/10 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:921-09 | codeforces | 921-09 | Labyrinth-9 | https://codeforces.com/problemset/problem/921/09 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:921-08 | codeforces | 921-08 | Labyrinth-8 | https://codeforces.com/problemset/problem/921/08 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:921-07 | codeforces | 921-07 | Labyrinth-7 | https://codeforces.com/problemset/problem/921/07 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:921-06 | codeforces | 921-06 | Labyrinth-6 | https://codeforces.com/problemset/problem/921/06 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:921-05 | codeforces | 921-05 | Labyrinth-5 | https://codeforces.com/problemset/problem/921/05 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:921-04 | codeforces | 921-04 | Labyrinth-4 | https://codeforces.com/problemset/problem/921/04 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:921-03 | codeforces | 921-03 | Labyrinth-3 | https://codeforces.com/problemset/problem/921/03 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:921-02 | codeforces | 921-02 | Labyrinth-2 | https://codeforces.com/problemset/problem/921/02 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:921-01 | codeforces | 921-01 | Labyrinth-1 | https://codeforces.com/problemset/problem/921/01 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:920-G | codeforces | 920-G | List Of Integers | https://codeforces.com/problemset/problem/920/G | [
"binary search",
"bitmasks",
"brute force",
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2008
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:920-F | codeforces | 920-F | SUM and REPLACE | https://codeforces.com/problemset/problem/920/F | [
"brute force",
"data structures",
"dsu",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 8681
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:920-E | codeforces | 920-E | Connected Components? | https://codeforces.com/problemset/problem/920/E | [
"data structures",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 7807
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:920-D | codeforces | 920-D | Tanks | https://codeforces.com/problemset/problem/920/D | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 811
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:920-C | codeforces | 920-C | Swap Adjacent Elements | https://codeforces.com/problemset/problem/920/C | [
"dfs and similar",
"greedy",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10003
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:920-B | codeforces | 920-B | Tea Queue | https://codeforces.com/problemset/problem/920/B | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8138
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:920-A | codeforces | 920-A | Water The Garden | https://codeforces.com/problemset/problem/920/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 8209
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:919-F | codeforces | 919-F | A Game With Numbers | https://codeforces.com/problemset/problem/919/F | [
"games",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 388
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:919-E | codeforces | 919-E | Congruence Equation | https://codeforces.com/problemset/problem/919/E | [
"chinese remainder theorem",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2456
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:919-D | codeforces | 919-D | Substring | https://codeforces.com/problemset/problem/919/D | [
"dfs and similar",
"dp",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 12328
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:919-C | codeforces | 919-C | Seat Arrangements | https://codeforces.com/problemset/problem/919/C | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9435
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:919-B | codeforces | 919-B | Perfect Number | https://codeforces.com/problemset/problem/919/B | [
"binary search",
"brute force",
"dp",
"implementation",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 31714
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:919-A | codeforces | 919-A | Supermarket | https://codeforces.com/problemset/problem/919/A | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16971
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:918-B | codeforces | 918-B | Radio Station | https://codeforces.com/problemset/problem/918/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 20063
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:918-A | codeforces | 918-A | Eleven | https://codeforces.com/problemset/problem/918/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18291
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:917-E | codeforces | 917-E | Upside Down | https://codeforces.com/problemset/problem/917/E | [
"data structures",
"string suffix structures",
"strings",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 186
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:917-D | codeforces | 917-D | Stranger Trees | https://codeforces.com/problemset/problem/917/D | [
"dp",
"math",
"matrices",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1477
} | 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.