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:1606-C | codeforces | 1606-C | Banknotes | https://codeforces.com/problemset/problem/1606/C | [
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15305
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1606-B | codeforces | 1606-B | Update Files | https://codeforces.com/problemset/problem/1606/B | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19670
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1606-A | codeforces | 1606-A | AB Balance | https://codeforces.com/problemset/problem/1606/A | [
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 40061
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1605-F | codeforces | 1605-F | PalindORme | https://codeforces.com/problemset/problem/1605/F | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 436
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1605-E | codeforces | 1605-E | Array Equalizer | https://codeforces.com/problemset/problem/1605/E | [
"binary search",
"greedy",
"implementation",
"math",
"number theory",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1219
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1605-D | codeforces | 1605-D | Treelabeling | https://codeforces.com/problemset/problem/1605/D | [
"bitmasks",
"constructive algorithms",
"dfs and similar",
"games",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3301
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1605-C | codeforces | 1605-C | Dominant Character | https://codeforces.com/problemset/problem/1605/C | [
"brute force",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 19099
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1605-B | codeforces | 1605-B | Reverse Sort | https://codeforces.com/problemset/problem/1605/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19472
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1605-A | codeforces | 1605-A | A.M. Deviation | https://codeforces.com/problemset/problem/1605/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21717
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1604-B | codeforces | 1604-B | XOR Specia-LIS-t | https://codeforces.com/problemset/problem/1604/B | [] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16394
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1604-A | codeforces | 1604-A | Era | https://codeforces.com/problemset/problem/1604/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22754
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1603-F | codeforces | 1603-F | October 18, 2017 | https://codeforces.com/problemset/problem/1603/F | [
"combinatorics",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 404
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1603-E | codeforces | 1603-E | A Perfect Problem | https://codeforces.com/problemset/problem/1603/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 687
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1603-D | codeforces | 1603-D | Artistic Partition | https://codeforces.com/problemset/problem/1603/D | [
"divide and conquer",
"dp",
"number theory"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 987
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1603-C | codeforces | 1603-C | Extreme Extension | https://codeforces.com/problemset/problem/1603/C | [
"dp",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2345
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1603-B | codeforces | 1603-B | Moderate Modular Mode | https://codeforces.com/problemset/problem/1603/B | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15232
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1603-A | codeforces | 1603-A | Di-visible Confusion | https://codeforces.com/problemset/problem/1603/A | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17955
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1602-B | codeforces | 1602-B | Divine Array | https://codeforces.com/problemset/problem/1602/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 14818
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1602-A | codeforces | 1602-A | Two Subsequences | https://codeforces.com/problemset/problem/1602/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19879
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1601-F | codeforces | 1601-F | Two Sorts | https://codeforces.com/problemset/problem/1601/F | [
"binary search",
"dfs and similar",
"math",
"meet-in-the-middle"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 370
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1601-E | codeforces | 1601-E | Phys Ed Online | https://codeforces.com/problemset/problem/1601/E | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 651
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1601-D | codeforces | 1601-D | Difficult Mountain | https://codeforces.com/problemset/problem/1601/D | [
"data structures",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 2054
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1601-C | codeforces | 1601-C | Optimal Insertion | https://codeforces.com/problemset/problem/1601/C | [
"data structures",
"divide and conquer",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2395
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1601-B | codeforces | 1601-B | Frog Traveler | https://codeforces.com/problemset/problem/1601/B | [
"data structures",
"dfs and similar",
"dp",
"graphs",
"shortest paths",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5564
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1601-A | codeforces | 1601-A | Array Elimination | https://codeforces.com/problemset/problem/1601/A | [
"bitmasks",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 22408
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1600-J | codeforces | 1600-J | Robot Factory | https://codeforces.com/problemset/problem/1600/J | [
"bitmasks",
"dfs and similar"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 4471
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1600-F | codeforces | 1600-F | Party Organization | https://codeforces.com/problemset/problem/1600/F | [
"brute force",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 643
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1600-E | codeforces | 1600-E | Array Game | https://codeforces.com/problemset/problem/1600/E | [
"games",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2427
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1599-J | codeforces | 1599-J | Bob's Beautiful Array | https://codeforces.com/problemset/problem/1599/J | [
"bitmasks",
"brute force",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 355
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1599-I | codeforces | 1599-I | Desert | https://codeforces.com/problemset/problem/1599/I | [
"data structures",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 150
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1599-H | codeforces | 1599-H | Hidden Fortress | https://codeforces.com/problemset/problem/1599/H | [
"interactive",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1309
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1599-G | codeforces | 1599-G | Shortest path | https://codeforces.com/problemset/problem/1599/G | [
"brute force",
"geometry",
"math",
"shortest paths"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 438
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1599-F | codeforces | 1599-F | Mars | https://codeforces.com/problemset/problem/1599/F | [
"hashing"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 428
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1599-E | codeforces | 1599-E | Two Arrays | https://codeforces.com/problemset/problem/1599/E | [
"data structures",
"matrices"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 98
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1599-D | codeforces | 1599-D | Bubble Popping | https://codeforces.com/problemset/problem/1599/D | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 71
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1599-C | codeforces | 1599-C | Bubble Strike | https://codeforces.com/problemset/problem/1599/C | [
"combinatorics",
"math",
"probabilities",
"ternary search"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2057
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1599-B | codeforces | 1599-B | Restaurant Game | https://codeforces.com/problemset/problem/1599/B | [] | null | null | stdin_stdout | 3,100 | {
"solved_count": 220
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1599-A | codeforces | 1599-A | Weights | https://codeforces.com/problemset/problem/1599/A | [
"constructive algorithms",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 919
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1598-G | codeforces | 1598-G | The Sum of Good Numbers | https://codeforces.com/problemset/problem/1598/G | [
"hashing",
"math",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 488
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1598-F | codeforces | 1598-F | RBS | https://codeforces.com/problemset/problem/1598/F | [
"binary search",
"bitmasks",
"brute force",
"data structures",
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1676
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1598-E | codeforces | 1598-E | Staircases | https://codeforces.com/problemset/problem/1598/E | [
"brute force",
"combinatorics",
"data structures",
"dfs and similar",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2552
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1598-D | codeforces | 1598-D | Training Session | https://codeforces.com/problemset/problem/1598/D | [
"combinatorics",
"data structures",
"geometry",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10785
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1598-C | codeforces | 1598-C | Delete Two Elements | https://codeforces.com/problemset/problem/1598/C | [
"data structures",
"dp",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 23964
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1598-B | codeforces | 1598-B | Groups | https://codeforces.com/problemset/problem/1598/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17036
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1598-A | codeforces | 1598-A | Computer Game | https://codeforces.com/problemset/problem/1598/A | [
"brute force",
"dfs and similar",
"dp",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25936
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1594-F | codeforces | 1594-F | Ideal Farm | https://codeforces.com/problemset/problem/1594/F | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1582
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1594-E2 | codeforces | 1594-E2 | Rubik's Cube Coloring (hard version) | https://codeforces.com/problemset/problem/1594/E2 | [
"brute force",
"dp",
"implementation",
"math",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1688
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1594-E1 | codeforces | 1594-E1 | Rubik's Cube Coloring (easy version) | https://codeforces.com/problemset/problem/1594/E1 | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12448
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1594-D | codeforces | 1594-D | The Number of Imposters | https://codeforces.com/problemset/problem/1594/D | [
"constructive algorithms",
"dfs and similar",
"dp",
"dsu",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9871
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1594-C | codeforces | 1594-C | Make Them Equal | https://codeforces.com/problemset/problem/1594/C | [
"brute force",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 30314
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1594-B | codeforces | 1594-B | Special Numbers | https://codeforces.com/problemset/problem/1594/B | [
"bitmasks",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22457
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1594-A | codeforces | 1594-A | Consecutive Sum Riddle | https://codeforces.com/problemset/problem/1594/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27466
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1593-G | codeforces | 1593-G | Changing Brackets | https://codeforces.com/problemset/problem/1593/G | [
"constructive algorithms",
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1935
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1593-F | codeforces | 1593-F | Red-Black Number | https://codeforces.com/problemset/problem/1593/F | [
"dfs and similar",
"dp",
"implementation",
"math",
"meet-in-the-middle"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2720
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1593-E | codeforces | 1593-E | Gardener and Tree | https://codeforces.com/problemset/problem/1593/E | [
"brute force",
"data structures",
"dfs and similar",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15184
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1593-D2 | codeforces | 1593-D2 | Half of Same | https://codeforces.com/problemset/problem/1593/D2 | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5628
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1593-D1 | codeforces | 1593-D1 | All are Same | https://codeforces.com/problemset/problem/1593/D1 | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22223
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1593-C | codeforces | 1593-C | Save More Mice | https://codeforces.com/problemset/problem/1593/C | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 28317
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1593-B | codeforces | 1593-B | Make it Divisible by 25 | https://codeforces.com/problemset/problem/1593/B | [
"dfs and similar",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 43389
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1593-A | codeforces | 1593-A | Elections | https://codeforces.com/problemset/problem/1593/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 42070
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1592-F2 | codeforces | 1592-F2 | Alice and Recoloring 2 | https://codeforces.com/problemset/problem/1592/F2 | [
"constructive algorithms",
"flows",
"graph matchings",
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1076
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1592-F1 | codeforces | 1592-F1 | Alice and Recoloring 1 | https://codeforces.com/problemset/problem/1592/F1 | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1207
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1592-E | codeforces | 1592-E | Bored Bakry | https://codeforces.com/problemset/problem/1592/E | [
"bitmasks",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1981
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1592-D | codeforces | 1592-D | Hemose in ICPC ? | https://codeforces.com/problemset/problem/1592/D | [
"binary search",
"dfs and similar",
"implementation",
"interactive",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2661
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1592-C | codeforces | 1592-C | Bakry and Partitioning | https://codeforces.com/problemset/problem/1592/C | [
"bitmasks",
"constructive algorithms",
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9374
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1592-B | codeforces | 1592-B | Hemose Shopping | https://codeforces.com/problemset/problem/1592/B | [
"constructive algorithms",
"dsu",
"math",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17408
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1592-A | codeforces | 1592-A | Gamer Hemose | https://codeforces.com/problemset/problem/1592/A | [
"binary search",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23984
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1588-F | codeforces | 1588-F | Jumping Through the Array | https://codeforces.com/problemset/problem/1588/F | [
"binary search",
"data structures",
"graphs",
"two pointers"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 359
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1586-I | codeforces | 1586-I | Omkar and Mosaic | https://codeforces.com/problemset/problem/1586/I | [
"combinatorics",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 397
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1585-G | codeforces | 1585-G | Poachers | https://codeforces.com/problemset/problem/1585/G | [
"dp",
"games",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 341
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1585-F | codeforces | 1585-F | Non-equal Neighbours | https://codeforces.com/problemset/problem/1585/F | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1749
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1585-E | codeforces | 1585-E | Frequency Queries | https://codeforces.com/problemset/problem/1585/E | [
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1255
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1585-D | codeforces | 1585-D | Yet Another Sorting Problem | https://codeforces.com/problemset/problem/1585/D | [
"data structures",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4476
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1585-C | codeforces | 1585-C | Minimize Distance | https://codeforces.com/problemset/problem/1585/C | [
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12904
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1585-B | codeforces | 1585-B | Array Eversion | https://codeforces.com/problemset/problem/1585/B | [
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16413
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1585-A | codeforces | 1585-A | Life of a Flower | https://codeforces.com/problemset/problem/1585/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19141
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1584-G | codeforces | 1584-G | Eligible Segments | https://codeforces.com/problemset/problem/1584/G | [
"geometry"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 285
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1584-F | codeforces | 1584-F | Strange LCS | https://codeforces.com/problemset/problem/1584/F | [
"bitmasks",
"dp",
"graphs",
"greedy",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1180
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1584-E | codeforces | 1584-E | Game with Stones | https://codeforces.com/problemset/problem/1584/E | [
"binary search",
"data structures",
"games",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1500
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1584-D | codeforces | 1584-D | Guess the Permutation | https://codeforces.com/problemset/problem/1584/D | [
"binary search",
"combinatorics",
"interactive",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4045
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1584-C | codeforces | 1584-C | Two Arrays | https://codeforces.com/problemset/problem/1584/C | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 17895
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1584-B | codeforces | 1584-B | Coloring Rectangles | https://codeforces.com/problemset/problem/1584/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 14441
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1584-A | codeforces | 1584-A | Mathematical Addition | https://codeforces.com/problemset/problem/1584/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15624
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1583-H | codeforces | 1583-H | Omkar and Tours | https://codeforces.com/problemset/problem/1583/H | [
"data structures",
"divide and conquer",
"sortings",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 526
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1583-G | codeforces | 1583-G | Omkar and Time Travel | https://codeforces.com/problemset/problem/1583/G | [
"data structures",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 571
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1583-F | codeforces | 1583-F | Defender of Childhood Dreams | https://codeforces.com/problemset/problem/1583/F | [
"bitmasks",
"constructive algorithms",
"divide and conquer"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1635
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1583-E | codeforces | 1583-E | Moment of Bloom | https://codeforces.com/problemset/problem/1583/E | [
"constructive algorithms",
"dfs and similar",
"graph matchings",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2546
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1583-D | codeforces | 1583-D | Omkar and the Meaning of Life | https://codeforces.com/problemset/problem/1583/D | [
"constructive algorithms",
"greedy",
"interactive"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5981
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1583-C | codeforces | 1583-C | Omkar and Determination | https://codeforces.com/problemset/problem/1583/C | [
"data structures",
"dp"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7493
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1583-B | codeforces | 1583-B | Omkar and Heavenly Tree | https://codeforces.com/problemset/problem/1583/B | [
"constructive algorithms",
"trees"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 13411
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1583-A | codeforces | 1583-A | Windblume Ode | https://codeforces.com/problemset/problem/1583/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14429
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1582-G | codeforces | 1582-G | Kuzya and Homework | https://codeforces.com/problemset/problem/1582/G | [
"data structures",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 744
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1582-F2 | codeforces | 1582-F2 | Korney Korneevich and XOR (hard version) | https://codeforces.com/problemset/problem/1582/F2 | [
"binary search",
"brute force",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2187
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1582-F1 | codeforces | 1582-F1 | Korney Korneevich and XOR (easy version) | https://codeforces.com/problemset/problem/1582/F1 | [
"bitmasks",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6730
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1582-E | codeforces | 1582-E | Pchelyonok and Segments | https://codeforces.com/problemset/problem/1582/E | [
"binary search",
"data structures",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4305
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1582-D | codeforces | 1582-D | Vupsen, Pupsen and 0 | https://codeforces.com/problemset/problem/1582/D | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11690
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1582-C | codeforces | 1582-C | Grandma Capa Knits a Scarf | https://codeforces.com/problemset/problem/1582/C | [
"brute force",
"data structures",
"greedy",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 25364
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1582-B | codeforces | 1582-B | Luntik and Subsequences | https://codeforces.com/problemset/problem/1582/B | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 36024
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1582-A | codeforces | 1582-A | Luntik and Concerts | https://codeforces.com/problemset/problem/1582/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19873
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1581-B | codeforces | 1581-B | Diameter of Graph | https://codeforces.com/problemset/problem/1581/B | [
"constructive algorithms",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12652
} | 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.