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:153-C | codeforces | 153-C | Caesar Cipher | https://codeforces.com/problemset/problem/153/C | [
"*special"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 415
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:153-B | codeforces | 153-B | Binary notation | https://codeforces.com/problemset/problem/153/B | [
"*special"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 166
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:153-A | codeforces | 153-A | A + B | https://codeforces.com/problemset/problem/153/A | [
"*special"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 948
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:152-E | codeforces | 152-E | Garden | https://codeforces.com/problemset/problem/152/E | [
"bitmasks",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 572
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:152-D | codeforces | 152-D | Frames | https://codeforces.com/problemset/problem/152/D | [
"brute force"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 260
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:152-C | codeforces | 152-C | Pocket Book | https://codeforces.com/problemset/problem/152/C | [
"combinatorics"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11667
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:152-B | codeforces | 152-B | Steps | https://codeforces.com/problemset/problem/152/B | [
"binary search",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 7406
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:152-A | codeforces | 152-A | Marks | https://codeforces.com/problemset/problem/152/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18671
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:151-B | codeforces | 151-B | Phone Numbers | https://codeforces.com/problemset/problem/151/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 6875
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:151-A | codeforces | 151-A | Soft Drinking | https://codeforces.com/problemset/problem/151/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 95543
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:150-E | codeforces | 150-E | Freezing with Style | https://codeforces.com/problemset/problem/150/E | [
"binary search",
"data structures",
"divide and conquer",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1041
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:150-D | codeforces | 150-D | Mission Impassable | https://codeforces.com/problemset/problem/150/D | [
"dp",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 738
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:150-C | codeforces | 150-C | Smart Cheater | https://codeforces.com/problemset/problem/150/C | [
"data structures",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 748
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:150-B | codeforces | 150-B | Quantity of Strings | https://codeforces.com/problemset/problem/150/B | [
"combinatorics",
"dfs and similar",
"graphs",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5356
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:150-A | codeforces | 150-A | Win or Freeze | https://codeforces.com/problemset/problem/150/A | [
"games",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8615
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:149-E | codeforces | 149-E | Martian Strings | https://codeforces.com/problemset/problem/149/E | [
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2531
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:149-D | codeforces | 149-D | Coloring Brackets | https://codeforces.com/problemset/problem/149/D | [
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4674
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:149-C | codeforces | 149-C | Division into Teams | https://codeforces.com/problemset/problem/149/C | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5747
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:149-B | codeforces | 149-B | Martian Clock | https://codeforces.com/problemset/problem/149/B | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2397
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:149-A | codeforces | 149-A | Business trip | https://codeforces.com/problemset/problem/149/A | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 46234
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:148-E | codeforces | 148-E | Porcelain | https://codeforces.com/problemset/problem/148/E | [
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4918
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:148-D | codeforces | 148-D | Bag of mice | https://codeforces.com/problemset/problem/148/D | [
"dp",
"games",
"math",
"probabilities"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8994
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:148-C | codeforces | 148-C | Terse princess | https://codeforces.com/problemset/problem/148/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3384
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:148-B | codeforces | 148-B | Escape | https://codeforces.com/problemset/problem/148/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6033
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:148-A | codeforces | 148-A | Insomnia cure | https://codeforces.com/problemset/problem/148/A | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 113122
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:147-B | codeforces | 147-B | Smile House | https://codeforces.com/problemset/problem/147/B | [
"binary search",
"graphs",
"matrices"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 924
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:147-A | codeforces | 147-A | Punctuation | https://codeforces.com/problemset/problem/147/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4251
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:146-B | codeforces | 146-B | Lucky Mask | https://codeforces.com/problemset/problem/146/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4982
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:146-A | codeforces | 146-A | Lucky Ticket | https://codeforces.com/problemset/problem/146/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17149
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:145-E | codeforces | 145-E | Lucky Queries | https://codeforces.com/problemset/problem/145/E | [
"data structures"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 4001
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:145-D | codeforces | 145-D | Lucky Pair | https://codeforces.com/problemset/problem/145/D | [
"combinatorics",
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 269
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:145-C | codeforces | 145-C | Lucky Subsequence | https://codeforces.com/problemset/problem/145/C | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2184
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:145-B | codeforces | 145-B | Lucky Number 2 | https://codeforces.com/problemset/problem/145/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2426
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:145-A | codeforces | 145-A | Lucky Conversion | https://codeforces.com/problemset/problem/145/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 7950
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:144-E | codeforces | 144-E | Competition | https://codeforces.com/problemset/problem/144/E | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 685
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:144-D | codeforces | 144-D | Missile Silos | https://codeforces.com/problemset/problem/144/D | [
"data structures",
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5114
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:144-C | codeforces | 144-C | Anagram Search | https://codeforces.com/problemset/problem/144/C | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4269
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:144-B | codeforces | 144-B | Meeting | https://codeforces.com/problemset/problem/144/B | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 5698
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:144-A | codeforces | 144-A | Arrival of the General | https://codeforces.com/problemset/problem/144/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 122426
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:143-B | codeforces | 143-B | Help Kingdom of Far Far Away 2 | https://codeforces.com/problemset/problem/143/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 5337
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:143-A | codeforces | 143-A | Help Vasilisa the Wise 2 | https://codeforces.com/problemset/problem/143/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 15493
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:142-E | codeforces | 142-E | Help Greg the Dwarf 2 | https://codeforces.com/problemset/problem/142/E | [
"geometry"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 92
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:142-D | codeforces | 142-D | Help Shrek and Donkey 2 | https://codeforces.com/problemset/problem/142/D | [
"games"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 404
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:142-C | codeforces | 142-C | Help Caretaker | https://codeforces.com/problemset/problem/142/C | [
"brute force",
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 998
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:142-B | codeforces | 142-B | Help General | https://codeforces.com/problemset/problem/142/B | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2406
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:142-A | codeforces | 142-A | Help Farmer | https://codeforces.com/problemset/problem/142/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2847
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:141-E | codeforces | 141-E | Clearing Up | https://codeforces.com/problemset/problem/141/E | [
"constructive algorithms",
"dp",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1369
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:141-D | codeforces | 141-D | Take-off Ramps | https://codeforces.com/problemset/problem/141/D | [
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1217
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:141-C | codeforces | 141-C | Queue | https://codeforces.com/problemset/problem/141/C | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2737
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:141-B | codeforces | 141-B | Hopscotch | https://codeforces.com/problemset/problem/141/B | [
"geometry",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 5801
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:141-A | codeforces | 141-A | Amusing Joke | https://codeforces.com/problemset/problem/141/A | [
"implementation",
"sortings",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 102147
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:140-F | codeforces | 140-F | New Year Snowflake | https://codeforces.com/problemset/problem/140/F | [
"geometry",
"sortings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 401
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:140-E | codeforces | 140-E | New Year Garland | https://codeforces.com/problemset/problem/140/E | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1037
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:140-D | codeforces | 140-D | New Year Contest | https://codeforces.com/problemset/problem/140/D | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2312
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:140-C | codeforces | 140-C | New Year Snowmen | https://codeforces.com/problemset/problem/140/C | [
"binary search",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4767
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:140-B | codeforces | 140-B | New Year Cards | https://codeforces.com/problemset/problem/140/B | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1754
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:140-A | codeforces | 140-A | New Year Table | https://codeforces.com/problemset/problem/140/A | [
"geometry",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4370
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:139-B | codeforces | 139-B | Wallpaper | https://codeforces.com/problemset/problem/139/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 1463
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:139-A | codeforces | 139-A | Petr and Book | https://codeforces.com/problemset/problem/139/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 37740
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:138-E | codeforces | 138-E | Hellish Constraints | https://codeforces.com/problemset/problem/138/E | [
"brute force",
"dp",
"two pointers"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 188
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:138-D | codeforces | 138-D | World of Darkraft | https://codeforces.com/problemset/problem/138/D | [
"dp",
"games"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 594
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:138-C | codeforces | 138-C | Mushroom Gnomes - 2 | https://codeforces.com/problemset/problem/138/C | [
"binary search",
"data structures",
"probabilities",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 963
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:138-B | codeforces | 138-B | Digits Permutations | https://codeforces.com/problemset/problem/138/B | [
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1110
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:138-A | codeforces | 138-A | Literature Lesson | https://codeforces.com/problemset/problem/138/A | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2592
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:137-E | codeforces | 137-E | Last Chance | https://codeforces.com/problemset/problem/137/E | [
"data structures",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1381
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:137-D | codeforces | 137-D | Palindromes | https://codeforces.com/problemset/problem/137/D | [
"dp",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1726
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:137-C | codeforces | 137-C | History | https://codeforces.com/problemset/problem/137/C | [
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7829
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:137-B | codeforces | 137-B | Permutation | https://codeforces.com/problemset/problem/137/B | [
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 15154
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:137-A | codeforces | 137-A | Postcards and photos | https://codeforces.com/problemset/problem/137/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 7878
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:136-B | codeforces | 136-B | Ternary Logic | https://codeforces.com/problemset/problem/136/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 5339
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:136-A | codeforces | 136-A | Presents | https://codeforces.com/problemset/problem/136/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 147675
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:135-E | codeforces | 135-E | Weak Subsequence | https://codeforces.com/problemset/problem/135/E | [
"combinatorics"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 358
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:135-D | codeforces | 135-D | Cycle | https://codeforces.com/problemset/problem/135/D | [
"brute force",
"dfs and similar",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 315
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:135-C | codeforces | 135-C | Zero-One | https://codeforces.com/problemset/problem/135/C | [
"constructive algorithms",
"games",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1452
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:135-B | codeforces | 135-B | Rectangle and Square | https://codeforces.com/problemset/problem/135/B | [
"brute force",
"geometry",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2660
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:135-A | codeforces | 135-A | Replacement | https://codeforces.com/problemset/problem/135/A | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 8270
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:134-C | codeforces | 134-C | Swaps | https://codeforces.com/problemset/problem/134/C | [
"constructive algorithms",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 579
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:134-B | codeforces | 134-B | Pairs of Numbers | https://codeforces.com/problemset/problem/134/B | [
"brute force",
"dfs and similar",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2490
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:134-A | codeforces | 134-A | Average Numbers | https://codeforces.com/problemset/problem/134/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 4810
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:133-B | codeforces | 133-B | Unary | https://codeforces.com/problemset/problem/133/B | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9404
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:133-A | codeforces | 133-A | HQ9+ | https://codeforces.com/problemset/problem/133/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 125761
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:132-E | codeforces | 132-E | Bits of merry old England | https://codeforces.com/problemset/problem/132/E | [
"flows",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 569
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:132-D | codeforces | 132-D | Constants in the language of Shakespeare | https://codeforces.com/problemset/problem/132/D | [
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 724
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:132-C | codeforces | 132-C | Logo Turtle | https://codeforces.com/problemset/problem/132/C | [
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2653
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:132-B | codeforces | 132-B | Piet | https://codeforces.com/problemset/problem/132/B | [
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 758
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:132-A | codeforces | 132-A | Turing Tape | https://codeforces.com/problemset/problem/132/A | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 2986
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:131-F | codeforces | 131-F | Present to Mom | https://codeforces.com/problemset/problem/131/F | [
"binary search",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 730
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:131-E | codeforces | 131-E | Yet Another Task with Queens | https://codeforces.com/problemset/problem/131/E | [
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2097
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:131-D | codeforces | 131-D | Subway | https://codeforces.com/problemset/problem/131/D | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5276
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:131-C | codeforces | 131-C | The World is a Theatre | https://codeforces.com/problemset/problem/131/C | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12631
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:131-B | codeforces | 131-B | Opposites Attract | https://codeforces.com/problemset/problem/131/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 7562
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:131-A | codeforces | 131-A | cAPS lOCK | https://codeforces.com/problemset/problem/131/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 101573
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:130-J | codeforces | 130-J | Date calculation | https://codeforces.com/problemset/problem/130/J | [
"*special"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 357
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:130-I | codeforces | 130-I | Array sorting | https://codeforces.com/problemset/problem/130/I | [
"*special",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 192
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:130-H | codeforces | 130-H | Balanced brackets | https://codeforces.com/problemset/problem/130/H | [
"*special"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 930
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:130-G | codeforces | 130-G | CAPS LOCK ON | https://codeforces.com/problemset/problem/130/G | [
"*special"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 300
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:130-F | codeforces | 130-F | Prime factorization | https://codeforces.com/problemset/problem/130/F | [
"*special"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 300
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:130-E | codeforces | 130-E | Tribonacci numbers | https://codeforces.com/problemset/problem/130/E | [
"*special"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 323
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:130-D | codeforces | 130-D | Exponentiation | https://codeforces.com/problemset/problem/130/D | [
"*special"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 427
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:130-C | codeforces | 130-C | Decimal sum | https://codeforces.com/problemset/problem/130/C | [
"*special"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 539
} | 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.