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:545-E | codeforces | 545-E | Paths and Trees | https://codeforces.com/problemset/problem/545/E | [
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6121
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:545-D | codeforces | 545-D | Queue | https://codeforces.com/problemset/problem/545/D | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 31509
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:545-C | codeforces | 545-C | Woodcutters | https://codeforces.com/problemset/problem/545/C | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 35369
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:545-B | codeforces | 545-B | Equidistant String | https://codeforces.com/problemset/problem/545/B | [
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12355
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:545-A | codeforces | 545-A | Toy Cars | https://codeforces.com/problemset/problem/545/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 12287
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:544-B | codeforces | 544-B | Sea and Islands | https://codeforces.com/problemset/problem/544/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9058
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:544-A | codeforces | 544-A | Set of Strings | https://codeforces.com/problemset/problem/544/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 8966
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:543-E | codeforces | 543-E | Listening to Music | https://codeforces.com/problemset/problem/543/E | [
"constructive algorithms",
"data structures"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 364
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:543-D | codeforces | 543-D | Road Improvement | https://codeforces.com/problemset/problem/543/D | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3595
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:543-C | codeforces | 543-C | Remembering Strings | https://codeforces.com/problemset/problem/543/C | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1616
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:543-B | codeforces | 543-B | Destroying Roads | https://codeforces.com/problemset/problem/543/B | [
"constructive algorithms",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4720
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:543-A | codeforces | 543-A | Writing Code | https://codeforces.com/problemset/problem/543/A | [
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9191
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:542-F | codeforces | 542-F | Quest | https://codeforces.com/problemset/problem/542/F | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1013
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:542-E | codeforces | 542-E | Playing on Graph | https://codeforces.com/problemset/problem/542/E | [
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1039
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:542-D | codeforces | 542-D | Superhero's Job | https://codeforces.com/problemset/problem/542/D | [
"dfs and similar",
"dp",
"hashing",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 547
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:542-C | codeforces | 542-C | Idempotent functions | https://codeforces.com/problemset/problem/542/C | [
"constructive algorithms",
"graphs",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1309
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:542-B | codeforces | 542-B | Duck Hunt | https://codeforces.com/problemset/problem/542/B | [
"data structures"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 290
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:542-A | codeforces | 542-A | Place Your Ad Here | https://codeforces.com/problemset/problem/542/A | [
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 668
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:540-E | codeforces | 540-E | Infinite Inversions | https://codeforces.com/problemset/problem/540/E | [
"binary search",
"data structures",
"implementation",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2665
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:540-D | codeforces | 540-D | Bad Luck Island | https://codeforces.com/problemset/problem/540/D | [
"dp",
"probabilities"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7076
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:540-C | codeforces | 540-C | Ice Cave | https://codeforces.com/problemset/problem/540/C | [
"dfs and similar"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 8651
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:540-B | codeforces | 540-B | School Marks | https://codeforces.com/problemset/problem/540/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5053
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:540-A | codeforces | 540-A | Combination Lock | https://codeforces.com/problemset/problem/540/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 35961
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:538-H | codeforces | 538-H | Summer Dichotomy | https://codeforces.com/problemset/problem/538/H | [
"2-sat",
"data structures",
"dfs and similar",
"greedy"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 891
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:538-G | codeforces | 538-G | Berserk Robot | https://codeforces.com/problemset/problem/538/G | [
"constructive algorithms",
"math",
"sortings"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 693
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:538-F | codeforces | 538-F | A Heap of Heaps | https://codeforces.com/problemset/problem/538/F | [
"brute force",
"data structures",
"math",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1897
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:538-E | codeforces | 538-E | Demiurges Play Again | https://codeforces.com/problemset/problem/538/E | [
"dfs and similar",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1703
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:538-D | codeforces | 538-D | Weird Chess | https://codeforces.com/problemset/problem/538/D | [
"brute force",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2538
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:538-C | codeforces | 538-C | Tourist's Notes | https://codeforces.com/problemset/problem/538/C | [
"binary search",
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6196
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:538-B | codeforces | 538-B | Quasi Binary | https://codeforces.com/problemset/problem/538/B | [
"constructive algorithms",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 19740
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:538-A | codeforces | 538-A | Cutting Banner | https://codeforces.com/problemset/problem/538/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7450
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:536-E | codeforces | 536-E | Tavas on the Path | https://codeforces.com/problemset/problem/536/E | [
"data structures",
"divide and conquer",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 573
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:536-D | codeforces | 536-D | Tavas in Kansas | https://codeforces.com/problemset/problem/536/D | [
"dp",
"games"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 852
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:535-E | codeforces | 535-E | Tavas and Pashmaks | https://codeforces.com/problemset/problem/535/E | [
"geometry",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 956
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:535-D | codeforces | 535-D | Tavas and Malekas | https://codeforces.com/problemset/problem/535/D | [
"greedy",
"hashing",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5032
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:535-C | codeforces | 535-C | Tavas and Karafs | https://codeforces.com/problemset/problem/535/C | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4021
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:535-B | codeforces | 535-B | Tavas and SaDDas | https://codeforces.com/problemset/problem/535/B | [
"bitmasks",
"brute force",
"combinatorics",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 27563
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:535-A | codeforces | 535-A | Tavas and Nafas | https://codeforces.com/problemset/problem/535/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 13232
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:534-F | codeforces | 534-F | Simplified Nonogram | https://codeforces.com/problemset/problem/534/F | [
"bitmasks",
"dp",
"hashing",
"meet-in-the-middle"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 582
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:534-E | codeforces | 534-E | Berland Local Positioning System | https://codeforces.com/problemset/problem/534/E | [
"constructive algorithms",
"greedy",
"hashing",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 420
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:534-D | codeforces | 534-D | Handshakes | https://codeforces.com/problemset/problem/534/D | [
"binary search",
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2594
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:534-C | codeforces | 534-C | Polycarpus' Dice | https://codeforces.com/problemset/problem/534/C | [
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5331
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:534-B | codeforces | 534-B | Covered Path | https://codeforces.com/problemset/problem/534/B | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11638
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:534-A | codeforces | 534-A | Exam | https://codeforces.com/problemset/problem/534/A | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 13076
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:533-F | codeforces | 533-F | Encoding | https://codeforces.com/problemset/problem/533/F | [
"hashing",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1025
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:533-E | codeforces | 533-E | Correcting Mistakes | https://codeforces.com/problemset/problem/533/E | [
"constructive algorithms",
"dp",
"greedy",
"hashing",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2462
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:533-D | codeforces | 533-D | Landmarks | https://codeforces.com/problemset/problem/533/D | [
"data structures",
"dp"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 378
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:533-C | codeforces | 533-C | Board Game | https://codeforces.com/problemset/problem/533/C | [
"games",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2486
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:533-B | codeforces | 533-B | Work Group | https://codeforces.com/problemset/problem/533/B | [
"dfs and similar",
"dp",
"graphs",
"strings",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2761
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:533-A | codeforces | 533-A | Berland Miners | https://codeforces.com/problemset/problem/533/A | [
"binary search",
"data structures",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 683
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:530-I | codeforces | 530-I | Different variables | https://codeforces.com/problemset/problem/530/I | [
"*special"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 53
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:530-H | codeforces | 530-H | Points in triangle | https://codeforces.com/problemset/problem/530/H | [
"*special",
"geometry"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 131
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:530-G | codeforces | 530-G | Levenshtein distance | https://codeforces.com/problemset/problem/530/G | [
"*special"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 574
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:530-F | codeforces | 530-F | Jumping frogs | https://codeforces.com/problemset/problem/530/F | [
"*special"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 113
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:530-E | codeforces | 530-E | Sum and product | https://codeforces.com/problemset/problem/530/E | [
"*special"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 332
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:530-D | codeforces | 530-D | Set subtraction | https://codeforces.com/problemset/problem/530/D | [
"*special"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 463
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:530-C | codeforces | 530-C | Diophantine equation | https://codeforces.com/problemset/problem/530/C | [
"*special"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 642
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:530-B | codeforces | 530-B | String inside out | https://codeforces.com/problemset/problem/530/B | [
"*special"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 559
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:530-A | codeforces | 530-A | Quadratic equation | https://codeforces.com/problemset/problem/530/A | [
"*special"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 723
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:529-B | codeforces | 529-B | Group Photo 2 (online mirror version) | https://codeforces.com/problemset/problem/529/B | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1007
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:528-E | codeforces | 528-E | Triangles 3000 | https://codeforces.com/problemset/problem/528/E | [
"geometry",
"sortings"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 229
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:528-D | codeforces | 528-D | Fuzzy Search | https://codeforces.com/problemset/problem/528/D | [
"bitmasks",
"brute force",
"fft"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 3059
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:527-E | codeforces | 527-E | Data Center Drama | https://codeforces.com/problemset/problem/527/E | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 2335
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:527-D | codeforces | 527-D | Clique Problem | https://codeforces.com/problemset/problem/527/D | [
"data structures",
"dp",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5179
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:527-C | codeforces | 527-C | Glass Carving | https://codeforces.com/problemset/problem/527/C | [
"binary search",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7758
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:527-B | codeforces | 527-B | Error Correct System | https://codeforces.com/problemset/problem/527/B | [
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4100
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:527-A | codeforces | 527-A | Playing with Paper | https://codeforces.com/problemset/problem/527/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15948
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:526-G | codeforces | 526-G | Spiders Evil Plan | https://codeforces.com/problemset/problem/526/G | [
"greedy",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 939
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:526-F | codeforces | 526-F | Pudding Monsters | https://codeforces.com/problemset/problem/526/F | [
"data structures",
"divide and conquer"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 3833
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:526-E | codeforces | 526-E | Transmitting Levels | https://codeforces.com/problemset/problem/526/E | [
"dp",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1202
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:526-D | codeforces | 526-D | Om Nom and Necklace | https://codeforces.com/problemset/problem/526/D | [
"hashing",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2657
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:526-C | codeforces | 526-C | Om Nom and Candies | https://codeforces.com/problemset/problem/526/C | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2711
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:526-B | codeforces | 526-B | Om Nom and Dark Park | https://codeforces.com/problemset/problem/526/B | [
"dfs and similar",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 4750
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:526-A | codeforces | 526-A | King of Thieves | https://codeforces.com/problemset/problem/526/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 5088
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:525-E | codeforces | 525-E | Anya and Cubes | https://codeforces.com/problemset/problem/525/E | [
"binary search",
"bitmasks",
"brute force",
"dp",
"math",
"meet-in-the-middle"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4529
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:525-D | codeforces | 525-D | Arthur and Walls | https://codeforces.com/problemset/problem/525/D | [
"constructive algorithms",
"data structures",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2343
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:525-C | codeforces | 525-C | Ilya and Sticks | https://codeforces.com/problemset/problem/525/C | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6146
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:525-B | codeforces | 525-B | Pasha and String | https://codeforces.com/problemset/problem/525/B | [
"constructive algorithms",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10412
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:525-A | codeforces | 525-A | Vitaliy and Pie | https://codeforces.com/problemset/problem/525/A | [
"greedy",
"hashing",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16857
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:524-F | codeforces | 524-F | And Yet Another Bracket Sequence | https://codeforces.com/problemset/problem/524/F | [
"data structures",
"greedy",
"hashing",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 658
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:524-E | codeforces | 524-E | Rooks and Rectangles | https://codeforces.com/problemset/problem/524/E | [
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1432
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:524-D | codeforces | 524-D | Social Network | https://codeforces.com/problemset/problem/524/D | [
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1029
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:524-C | codeforces | 524-C | The Art of Dealing with ATM | https://codeforces.com/problemset/problem/524/C | [
"binary search",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2216
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:524-B | codeforces | 524-B | Фото на память - 2 (round version) | https://codeforces.com/problemset/problem/524/B | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1577
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:524-A | codeforces | 524-A | Возможно, вы знаете этих людей? | https://codeforces.com/problemset/problem/524/A | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 1497
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:523-D | codeforces | 523-D | Statistics of Recompressing Videos | https://codeforces.com/problemset/problem/523/D | [
"*special",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2639
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:523-C | codeforces | 523-C | Name Quest | https://codeforces.com/problemset/problem/523/C | [
"*special",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 2628
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:523-B | codeforces | 523-B | Mean Requests | https://codeforces.com/problemset/problem/523/B | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 1006
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:523-A | codeforces | 523-A | Rotate, Flip and Zoom | https://codeforces.com/problemset/problem/523/A | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 2884
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:522-D | codeforces | 522-D | Closest Equals | https://codeforces.com/problemset/problem/522/D | [
"*special",
"data structures"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4457
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:522-C | codeforces | 522-C | Chicken or Fish? | https://codeforces.com/problemset/problem/522/C | [
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 771
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:522-B | codeforces | 522-B | Photo to Remember | https://codeforces.com/problemset/problem/522/B | [
"*special",
"data structures",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 9739
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:522-A | codeforces | 522-A | Reposts | https://codeforces.com/problemset/problem/522/A | [
"*special",
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19654
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:521-E | codeforces | 521-E | Cycling City | https://codeforces.com/problemset/problem/521/E | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 1366
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:521-D | codeforces | 521-D | Shop | https://codeforces.com/problemset/problem/521/D | [
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 2046
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:520-E | codeforces | 520-E | Pluses everywhere | https://codeforces.com/problemset/problem/520/E | [
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2175
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:520-D | codeforces | 520-D | Cubes | https://codeforces.com/problemset/problem/520/D | [
"games",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1710
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:520-C | codeforces | 520-C | DNA Alignment | https://codeforces.com/problemset/problem/520/C | [
"math",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4376
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:520-B | codeforces | 520-B | Two Buttons | https://codeforces.com/problemset/problem/520/B | [
"dfs and similar",
"graphs",
"greedy",
"implementation",
"math",
"shortest paths"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 67707
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:520-A | codeforces | 520-A | Pangram | https://codeforces.com/problemset/problem/520/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 136991
} | 2026-11-16T05:57:40.774385+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.