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:551-E | codeforces | 551-E | GukiZ and GukiZiana | https://codeforces.com/problemset/problem/551/E | [
"binary search",
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2257
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:551-D | codeforces | 551-D | GukiZ and Binary Operations | https://codeforces.com/problemset/problem/551/D | [
"combinatorics",
"implementation",
"math",
"matrices",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2147
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:551-C | codeforces | 551-C | GukiZ hates Boxes | https://codeforces.com/problemset/problem/551/C | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4076
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:551-B | codeforces | 551-B | ZgukistringZ | https://codeforces.com/problemset/problem/551/B | [
"brute force",
"constructive algorithms",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4080
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:551-A | codeforces | 551-A | GukiZ and Contest | https://codeforces.com/problemset/problem/551/A | [
"brute force",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17970
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:550-E | codeforces | 550-E | Brackets in Implications | https://codeforces.com/problemset/problem/550/E | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1526
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:550-D | codeforces | 550-D | Regular Bridge | https://codeforces.com/problemset/problem/550/D | [
"constructive algorithms",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3794
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:550-C | codeforces | 550-C | Divisibility by Eight | https://codeforces.com/problemset/problem/550/C | [
"brute force",
"dp",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 32762
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:550-B | codeforces | 550-B | Preparing Olympiad | https://codeforces.com/problemset/problem/550/B | [
"bitmasks",
"brute force"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 28756
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:550-A | codeforces | 550-A | Two Substrings | https://codeforces.com/problemset/problem/550/A | [
"brute force",
"dp",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 44524
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:549-H | codeforces | 549-H | Degenerate Matrix | https://codeforces.com/problemset/problem/549/H | [
"binary search",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2131
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:549-G | codeforces | 549-G | Happy Line | https://codeforces.com/problemset/problem/549/G | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2711
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:549-F | codeforces | 549-F | Yura and Developers | https://codeforces.com/problemset/problem/549/F | [
"data structures",
"divide and conquer"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1088
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:549-E | codeforces | 549-E | Sasha Circle | https://codeforces.com/problemset/problem/549/E | [
"geometry",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 179
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:549-D | codeforces | 549-D | Haar Features | https://codeforces.com/problemset/problem/549/D | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2262
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:549-C | codeforces | 549-C | The Game Of Parity | https://codeforces.com/problemset/problem/549/C | [
"games"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1859
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:549-B | codeforces | 549-B | Looksery Party | https://codeforces.com/problemset/problem/549/B | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1614
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:549-A | codeforces | 549-A | Face Detection | https://codeforces.com/problemset/problem/549/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 10297
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:548-B | codeforces | 548-B | Mike and Fun | https://codeforces.com/problemset/problem/548/B | [
"brute force",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9100
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:548-A | codeforces | 548-A | Mike and Fax | https://codeforces.com/problemset/problem/548/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10384
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:547-E | codeforces | 547-E | Mike and Friends | https://codeforces.com/problemset/problem/547/E | [
"data structures",
"string suffix structures",
"strings",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 2782
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:547-D | codeforces | 547-D | Mike and Fish | https://codeforces.com/problemset/problem/547/D | [
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 3258
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:547-C | codeforces | 547-C | Mike and Foam | https://codeforces.com/problemset/problem/547/C | [
"bitmasks",
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3550
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:547-B | codeforces | 547-B | Mike and Feet | https://codeforces.com/problemset/problem/547/B | [
"binary search",
"data structures",
"dp",
"dsu"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 11519
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:547-A | codeforces | 547-A | Mike and Frog | https://codeforces.com/problemset/problem/547/A | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2802
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:546-E | codeforces | 546-E | Soldier and Traveling | https://codeforces.com/problemset/problem/546/E | [
"flows",
"graphs",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4445
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:546-D | codeforces | 546-D | Soldier and Number Game | https://codeforces.com/problemset/problem/546/D | [
"constructive algorithms",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 14100
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:546-C | codeforces | 546-C | Soldier and Cards | https://codeforces.com/problemset/problem/546/C | [
"brute force",
"dfs and similar",
"games"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 19636
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:546-B | codeforces | 546-B | Soldier and Badges | https://codeforces.com/problemset/problem/546/B | [
"brute force",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18814
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:546-A | codeforces | 546-A | Soldier and Bananas | https://codeforces.com/problemset/problem/546/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 243787
} | 2026-08-10T02:20:32.917453+00:00 |
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": 5870
} | 2026-08-10T02:20:32.917453+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": 30374
} | 2026-08-10T02:20:32.917453+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": 34189
} | 2026-08-10T02:20:32.917453+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": 12295
} | 2026-08-10T02:20:32.917453+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": 12215
} | 2026-08-10T02:20:32.917453+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": 9009
} | 2026-08-10T02:20:32.917453+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": 8889
} | 2026-08-10T02:20:32.917453+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": 359
} | 2026-08-10T02:20:32.917453+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": 3409
} | 2026-08-10T02:20:32.917453+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": 1604
} | 2026-08-10T02:20:32.917453+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": 4649
} | 2026-08-10T02:20:32.917453+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": 8999
} | 2026-08-10T02:20:32.917453+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": 1009
} | 2026-08-10T02:20:32.917453+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": 1017
} | 2026-08-10T02:20:32.917453+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": 543
} | 2026-08-10T02:20:32.917453+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": 1298
} | 2026-08-10T02:20:32.917453+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": 276
} | 2026-08-10T02:20:32.917453+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": 657
} | 2026-08-10T02:20:32.917453+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": 2601
} | 2026-08-10T02:20:32.917453+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": 6799
} | 2026-08-10T02:20:32.917453+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": 8444
} | 2026-08-10T02:20:32.917453+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": 5007
} | 2026-08-10T02:20:32.917453+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": 35629
} | 2026-08-10T02:20:32.917453+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": 882
} | 2026-08-10T02:20:32.917453+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": 690
} | 2026-08-10T02:20:32.917453+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": 1889
} | 2026-08-10T02:20:32.917453+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": 1675
} | 2026-08-10T02:20:32.917453+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": 2531
} | 2026-08-10T02:20:32.917453+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": 6172
} | 2026-08-10T02:20:32.917453+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": 19563
} | 2026-08-10T02:20:32.917453+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": 7416
} | 2026-08-10T02:20:32.917453+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": 570
} | 2026-08-10T02:20:32.917453+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": 845
} | 2026-08-10T02:20:32.917453+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": 941
} | 2026-08-10T02:20:32.917453+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": 4882
} | 2026-08-10T02:20:32.917453+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": 4010
} | 2026-08-10T02:20:32.917453+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": 27107
} | 2026-08-10T02:20:32.917453+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": 13138
} | 2026-08-10T02:20:32.917453+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": 566
} | 2026-08-10T02:20:32.917453+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": 415
} | 2026-08-10T02:20:32.917453+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": 2583
} | 2026-08-10T02:20:32.917453+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": 5305
} | 2026-08-10T02:20:32.917453+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": 11500
} | 2026-08-10T02:20:32.917453+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": 12998
} | 2026-08-10T02:20:32.917453+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": 1002
} | 2026-08-10T02:20:32.917453+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": 2455
} | 2026-08-10T02:20:32.917453+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": 374
} | 2026-08-10T02:20:32.917453+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": 2464
} | 2026-08-10T02:20:32.917453+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": 2726
} | 2026-08-10T02:20:32.917453+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": 680
} | 2026-08-10T02:20:32.917453+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-08-10T02:20:32.917453+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-08-10T02:20:32.917453+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": 569
} | 2026-08-10T02:20:32.917453+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": 112
} | 2026-08-10T02:20:32.917453+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": 330
} | 2026-08-10T02:20:32.917453+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": 462
} | 2026-08-10T02:20:32.917453+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": 627
} | 2026-08-10T02:20:32.917453+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": 556
} | 2026-08-10T02:20:32.917453+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": 696
} | 2026-08-10T02:20:32.917453+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": 1001
} | 2026-08-10T02:20:32.917453+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": 227
} | 2026-08-10T02:20:32.917453+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": 2991
} | 2026-08-10T02:20:32.917453+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": 2267
} | 2026-08-10T02:20:32.917453+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": 5126
} | 2026-08-10T02:20:32.917453+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": 7630
} | 2026-08-10T02:20:32.917453+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": 4083
} | 2026-08-10T02:20:32.917453+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": 15761
} | 2026-08-10T02:20:32.917453+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": 923
} | 2026-08-10T02:20:32.917453+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": 3673
} | 2026-08-10T02:20:32.917453+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": 1193
} | 2026-08-10T02:20:32.917453+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.