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:1610-F | codeforces | 1610-F | Mashtali: a Space Oddysey | https://codeforces.com/problemset/problem/1610/F | [
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 755
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1610-E | codeforces | 1610-E | AmShZ and G.O.A.T. | https://codeforces.com/problemset/problem/1610/E | [
"binary search",
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2171
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1610-D | codeforces | 1610-D | Not Quite Lee | https://codeforces.com/problemset/problem/1610/D | [
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3168
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1610-C | codeforces | 1610-C | Keshi Is Throwing a Party | https://codeforces.com/problemset/problem/1610/C | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 17078
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1610-B | codeforces | 1610-B | Kalindrome Array | https://codeforces.com/problemset/problem/1610/B | [
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 26166
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1610-A | codeforces | 1610-A | Anti Light's Cell Guessing | https://codeforces.com/problemset/problem/1610/A | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 17255
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1609-H | codeforces | 1609-H | Pushing Robots | https://codeforces.com/problemset/problem/1609/H | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 110
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1609-G | codeforces | 1609-G | A Stroll Around the Matrix | https://codeforces.com/problemset/problem/1609/G | [
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 776
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1609-F | codeforces | 1609-F | Interesting Sections | https://codeforces.com/problemset/problem/1609/F | [
"data structures",
"divide and conquer",
"meet-in-the-middle",
"two pointers"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1095
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1609-E | codeforces | 1609-E | William The Oblivious | https://codeforces.com/problemset/problem/1609/E | [
"bitmasks",
"data structures",
"dp",
"matrices"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2576
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1609-D | codeforces | 1609-D | Social Network | https://codeforces.com/problemset/problem/1609/D | [
"dsu",
"graphs",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8831
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1609-C | codeforces | 1609-C | Complex Market Analysis | https://codeforces.com/problemset/problem/1609/C | [
"binary search",
"dp",
"implementation",
"number theory",
"schedules",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10662
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1609-B | codeforces | 1609-B | William the Vigilant | https://codeforces.com/problemset/problem/1609/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12231
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1609-A | codeforces | 1609-A | Divide and Multiply | https://codeforces.com/problemset/problem/1609/A | [
"greedy",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 19263
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1608-G | codeforces | 1608-G | Alphabetic Tree | https://codeforces.com/problemset/problem/1608/G | [
"binary search",
"data structures",
"dfs and similar",
"hashing",
"string suffix structures",
"strings",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 327
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1608-F | codeforces | 1608-F | MEX counting | https://codeforces.com/problemset/problem/1608/F | [
"combinatorics",
"dp",
"implementation"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 1007
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1608-E | codeforces | 1608-E | The Cells on the Paper | https://codeforces.com/problemset/problem/1608/E | [
"binary search",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 535
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1608-D | codeforces | 1608-D | Dominoes | https://codeforces.com/problemset/problem/1608/D | [
"combinatorics",
"fft",
"graphs",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1659
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1608-C | codeforces | 1608-C | Game Master | https://codeforces.com/problemset/problem/1608/C | [
"data structures",
"dfs and similar",
"dp",
"graphs",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7495
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1608-B | codeforces | 1608-B | Build the Permutation | https://codeforces.com/problemset/problem/1608/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12680
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1608-A | codeforces | 1608-A | Find Array | https://codeforces.com/problemset/problem/1608/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20499
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1607-H | codeforces | 1607-H | Banquet Preparations 2 | https://codeforces.com/problemset/problem/1607/H | [
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1493
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1607-G | codeforces | 1607-G | Banquet Preparations 1 | https://codeforces.com/problemset/problem/1607/G | [
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1788
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1607-F | codeforces | 1607-F | Robot on the Board 2 | https://codeforces.com/problemset/problem/1607/F | [
"brute force",
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2185
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1607-E | codeforces | 1607-E | Robot on the Board 1 | https://codeforces.com/problemset/problem/1607/E | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10167
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1607-D | codeforces | 1607-D | Blue-Red Permutation | https://codeforces.com/problemset/problem/1607/D | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18446
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1607-C | codeforces | 1607-C | Minimum Extraction | https://codeforces.com/problemset/problem/1607/C | [
"brute force",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 27429
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1607-B | codeforces | 1607-B | Odd Grasshopper | https://codeforces.com/problemset/problem/1607/B | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 44297
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1607-A | codeforces | 1607-A | Linear Keyboard | https://codeforces.com/problemset/problem/1607/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 41537
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1606-F | codeforces | 1606-F | Tree Queries | https://codeforces.com/problemset/problem/1606/F | [
"brute force",
"dp",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 835
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1606-E | codeforces | 1606-E | Arena | https://codeforces.com/problemset/problem/1606/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4402
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1606-D | codeforces | 1606-D | Red-Blue Matrix | https://codeforces.com/problemset/problem/1606/D | [
"brute force",
"constructive algorithms",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1663
} | 2026-11-02T05:37:07.883505+00:00 |
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": 15423
} | 2026-11-02T05:37:07.883505+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": 19795
} | 2026-11-02T05:37:07.883505+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": 42067
} | 2026-11-02T05:37:07.883505+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": 443
} | 2026-11-02T05:37:07.883505+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": 1231
} | 2026-11-02T05:37:07.883505+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": 3336
} | 2026-11-02T05:37:07.883505+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": 19328
} | 2026-11-02T05:37:07.883505+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": 19589
} | 2026-11-02T05:37:07.883505+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": 21824
} | 2026-11-02T05:37:07.883505+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": 16451
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1604-A | codeforces | 1604-A | Era | https://codeforces.com/problemset/problem/1604/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22818
} | 2026-11-02T05:37:07.883505+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": 409
} | 2026-11-02T05:37:07.883505+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": 699
} | 2026-11-02T05:37:07.883505+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": 1010
} | 2026-11-02T05:37:07.883505+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": 2374
} | 2026-11-02T05:37:07.883505+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": 15359
} | 2026-11-02T05:37:07.883505+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": 18082
} | 2026-11-02T05:37:07.883505+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": 14897
} | 2026-11-02T05:37:07.883505+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": 19999
} | 2026-11-02T05:37:07.883505+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": 373
} | 2026-11-02T05:37:07.883505+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": 668
} | 2026-11-02T05:37:07.883505+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": 2156
} | 2026-11-02T05:37:07.883505+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": 2453
} | 2026-11-02T05:37:07.883505+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": 5636
} | 2026-11-02T05:37:07.883505+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": 23270
} | 2026-11-02T05:37:07.883505+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": 4515
} | 2026-11-02T05:37:07.883505+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": 655
} | 2026-11-02T05:37:07.883505+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": 2517
} | 2026-11-02T05:37:07.883505+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": 364
} | 2026-11-02T05:37:07.883505+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": 151
} | 2026-11-02T05:37:07.883505+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": 1339
} | 2026-11-02T05:37:07.883505+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": 444
} | 2026-11-02T05:37:07.883505+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": 434
} | 2026-11-02T05:37:07.883505+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": 99
} | 2026-11-02T05:37:07.883505+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": 72
} | 2026-11-02T05:37:07.883505+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": 2095
} | 2026-11-02T05:37:07.883505+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": 223
} | 2026-11-02T05:37:07.883505+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": 1045
} | 2026-11-02T05:37:07.883505+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": 505
} | 2026-11-02T05:37:07.883505+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": 1705
} | 2026-11-02T05:37:07.883505+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": 2598
} | 2026-11-02T05:37:07.883505+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": 11053
} | 2026-11-02T05:37:07.883505+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": 24330
} | 2026-11-02T05:37:07.883505+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": 17160
} | 2026-11-02T05:37:07.883505+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": 26464
} | 2026-11-02T05:37:07.883505+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": 1595
} | 2026-11-02T05:37:07.883505+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": 1709
} | 2026-11-02T05:37:07.883505+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": 12646
} | 2026-11-02T05:37:07.883505+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": 10175
} | 2026-11-02T05:37:07.883505+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": 31500
} | 2026-11-02T05:37:07.883505+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": 22721
} | 2026-11-02T05:37:07.883505+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": 27805
} | 2026-11-02T05:37:07.883505+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": 1980
} | 2026-11-02T05:37:07.883505+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": 2768
} | 2026-11-02T05:37:07.883505+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": 15531
} | 2026-11-02T05:37:07.883505+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": 5678
} | 2026-11-02T05:37:07.883505+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": 22456
} | 2026-11-02T05:37:07.883505+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": 28579
} | 2026-11-02T05:37:07.883505+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": 45493
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1593-A | codeforces | 1593-A | Elections | https://codeforces.com/problemset/problem/1593/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 42739
} | 2026-11-02T05:37:07.883505+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": 1091
} | 2026-11-02T05:37:07.883505+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": 1237
} | 2026-11-02T05:37:07.883505+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": 2007
} | 2026-11-02T05:37:07.883505+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": 2697
} | 2026-11-02T05:37:07.883505+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": 9543
} | 2026-11-02T05:37:07.883505+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": 17678
} | 2026-11-02T05:37:07.883505+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": 24109
} | 2026-11-02T05:37:07.883505+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": 364
} | 2026-11-02T05:37:07.883505+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.