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:1560-D | codeforces | 1560-D | Make a Power of Two | https://codeforces.com/problemset/problem/1560/D | [
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 19650
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1560-C | codeforces | 1560-C | Infinity Table | https://codeforces.com/problemset/problem/1560/C | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28154
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1560-B | codeforces | 1560-B | Who's Opposite? | https://codeforces.com/problemset/problem/1560/B | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 39264
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1560-A | codeforces | 1560-A | Dislike of Threes | https://codeforces.com/problemset/problem/1560/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 75381
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1559-E | codeforces | 1559-E | Mocha and Stars | https://codeforces.com/problemset/problem/1559/E | [
"combinatorics",
"dp",
"fft",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2809
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1559-D2 | codeforces | 1559-D2 | Mocha and Diana (Hard Version) | https://codeforces.com/problemset/problem/1559/D2 | [
"brute force",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 3233
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1559-D1 | codeforces | 1559-D1 | Mocha and Diana (Easy Version) | https://codeforces.com/problemset/problem/1559/D1 | [
"brute force",
"constructive algorithms",
"dsu",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16557
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1559-C | codeforces | 1559-C | Mocha and Hiking | https://codeforces.com/problemset/problem/1559/C | [
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 23250
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1559-B | codeforces | 1559-B | Mocha and Red and Blue | https://codeforces.com/problemset/problem/1559/B | [
"dp",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 24442
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1559-A | codeforces | 1559-A | Mocha and Math | https://codeforces.com/problemset/problem/1559/A | [
"bitmasks",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 48815
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1558-F | codeforces | 1558-F | Strange Sort | https://codeforces.com/problemset/problem/1558/F | [
"data structures",
"sortings"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 611
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1558-E | codeforces | 1558-E | Down Below | https://codeforces.com/problemset/problem/1558/E | [
"binary search",
"dfs and similar",
"graphs",
"greedy",
"meet-in-the-middle",
"shortest paths"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 760
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1558-D | codeforces | 1558-D | Top-Notch Insertions | https://codeforces.com/problemset/problem/1558/D | [
"combinatorics",
"data structures"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1178
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1558-C | codeforces | 1558-C | Bottom-Tier Reversals | https://codeforces.com/problemset/problem/1558/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3794
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1558-B | codeforces | 1558-B | Up the Strip | https://codeforces.com/problemset/problem/1558/B | [
"brute force",
"dp",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5372
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1558-A | codeforces | 1558-A | Charmed by the Game | https://codeforces.com/problemset/problem/1558/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11534
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1557-E | codeforces | 1557-E | Assiut Chess | https://codeforces.com/problemset/problem/1557/E | [
"brute force",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 797
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1557-D | codeforces | 1557-D | Ezzat and Grid | https://codeforces.com/problemset/problem/1557/D | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3130
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1557-C | codeforces | 1557-C | Moamen and XOR | https://codeforces.com/problemset/problem/1557/C | [
"bitmasks",
"combinatorics",
"dp",
"math",
"matrices"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10992
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1557-B | codeforces | 1557-B | Moamen and k-subarrays | https://codeforces.com/problemset/problem/1557/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 24928
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1557-A | codeforces | 1557-A | Ezzat and Two Subsequences | https://codeforces.com/problemset/problem/1557/A | [
"brute force",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29318
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1556-H | codeforces | 1556-H | DIY Tree | https://codeforces.com/problemset/problem/1556/H | [
"graphs",
"greedy",
"math",
"probabilities"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 626
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1556-G | codeforces | 1556-G | Gates to Another World | https://codeforces.com/problemset/problem/1556/G | [
"bitmasks",
"data structures",
"dsu",
"two pointers"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 481
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1556-F | codeforces | 1556-F | Sports Betting | https://codeforces.com/problemset/problem/1556/F | [
"bitmasks",
"combinatorics",
"dp",
"graphs",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1472
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1556-E | codeforces | 1556-E | Equilibrium | https://codeforces.com/problemset/problem/1556/E | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3091
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1556-D | codeforces | 1556-D | Take a Guess | https://codeforces.com/problemset/problem/1556/D | [
"bitmasks",
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9019
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1556-C | codeforces | 1556-C | Compressed Bracket Sequence | https://codeforces.com/problemset/problem/1556/C | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6274
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1556-B | codeforces | 1556-B | Take Your Places! | https://codeforces.com/problemset/problem/1556/B | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13353
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1556-A | codeforces | 1556-A | A Variety of Operations | https://codeforces.com/problemset/problem/1556/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18634
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1555-F | codeforces | 1555-F | Good Graph | https://codeforces.com/problemset/problem/1555/F | [
"data structures",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1148
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1555-E | codeforces | 1555-E | Boring Segments | https://codeforces.com/problemset/problem/1555/E | [
"data structures",
"sortings",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4733
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1555-D | codeforces | 1555-D | Say No to Palindromes | https://codeforces.com/problemset/problem/1555/D | [
"brute force",
"constructive algorithms",
"dp",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 16101
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1555-C | codeforces | 1555-C | Coin Rows | https://codeforces.com/problemset/problem/1555/C | [
"brute force",
"constructive algorithms",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 24491
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1555-B | codeforces | 1555-B | Two Tables | https://codeforces.com/problemset/problem/1555/B | [
"brute force"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17416
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1555-A | codeforces | 1555-A | PizzaForces | https://codeforces.com/problemset/problem/1555/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 30600
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1554-E | codeforces | 1554-E | You | https://codeforces.com/problemset/problem/1554/E | [
"dfs and similar",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1444
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1554-D | codeforces | 1554-D | Diane | https://codeforces.com/problemset/problem/1554/D | [
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 10699
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1554-C | codeforces | 1554-C | Mikasa | https://codeforces.com/problemset/problem/1554/C | [
"binary search",
"bitmasks",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9902
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1554-B | codeforces | 1554-B | Cobb | https://codeforces.com/problemset/problem/1554/B | [
"bitmasks",
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 13962
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1554-A | codeforces | 1554-A | Cherry | https://codeforces.com/problemset/problem/1554/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31618
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1553-I | codeforces | 1553-I | Stairs | https://codeforces.com/problemset/problem/1553/I | [
"combinatorics",
"divide and conquer",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 389
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1553-H | codeforces | 1553-H | XOR and Distance | https://codeforces.com/problemset/problem/1553/H | [
"bitmasks",
"divide and conquer",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 921
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1553-G | codeforces | 1553-G | Common Divisor Graph | https://codeforces.com/problemset/problem/1553/G | [
"brute force",
"constructive algorithms",
"dsu",
"graphs",
"hashing",
"math",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1299
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1553-F | codeforces | 1553-F | Pairwise Modulo | https://codeforces.com/problemset/problem/1553/F | [
"data structures",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2616
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1553-E | codeforces | 1553-E | Permutation Shift | https://codeforces.com/problemset/problem/1553/E | [
"brute force",
"combinatorics",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3853
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1553-D | codeforces | 1553-D | Backspace | https://codeforces.com/problemset/problem/1553/D | [
"dp",
"greedy",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15305
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1553-C | codeforces | 1553-C | Penalty | https://codeforces.com/problemset/problem/1553/C | [
"bitmasks",
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 20068
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1553-B | codeforces | 1553-B | Reverse String | https://codeforces.com/problemset/problem/1553/B | [
"brute force",
"dp",
"hashing",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15607
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1553-A | codeforces | 1553-A | Digits Sum | https://codeforces.com/problemset/problem/1553/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34666
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1552-I | codeforces | 1552-I | Organizing a Music Festival | https://codeforces.com/problemset/problem/1552/I | [
"dfs and similar",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 154
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1552-H | codeforces | 1552-H | Guess the Perimeter | https://codeforces.com/problemset/problem/1552/H | [
"binary search",
"interactive",
"number theory"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 471
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1552-G | codeforces | 1552-G | A Serious Referee | https://codeforces.com/problemset/problem/1552/G | [
"bitmasks",
"brute force",
"dfs and similar",
"sortings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 691
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1552-F | codeforces | 1552-F | Telepanting | https://codeforces.com/problemset/problem/1552/F | [
"binary search",
"data structures",
"dp",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3402
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1552-E | codeforces | 1552-E | Colors and Intervals | https://codeforces.com/problemset/problem/1552/E | [
"constructive algorithms",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2147
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1552-D | codeforces | 1552-D | Array Differentiation | https://codeforces.com/problemset/problem/1552/D | [
"bitmasks",
"brute force",
"constructive algorithms",
"dfs and similar",
"dp",
"graphs",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7999
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1552-C | codeforces | 1552-C | Maximize the Intersections | https://codeforces.com/problemset/problem/1552/C | [
"combinatorics",
"constructive algorithms",
"geometry",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6337
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1552-B | codeforces | 1552-B | Running for Gold | https://codeforces.com/problemset/problem/1552/B | [
"combinatorics",
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 17125
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1552-A | codeforces | 1552-A | Subsequence Permutation | https://codeforces.com/problemset/problem/1552/A | [
"sortings",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25516
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1551-F | codeforces | 1551-F | Equidistant Vertices | https://codeforces.com/problemset/problem/1551/F | [
"brute force",
"combinatorics",
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2243
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1551-E | codeforces | 1551-E | Fixed Points | https://codeforces.com/problemset/problem/1551/E | [
"binary search",
"brute force",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4634
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1551-D2 | codeforces | 1551-D2 | Domino (hard version) | https://codeforces.com/problemset/problem/1551/D2 | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3042
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1551-D1 | codeforces | 1551-D1 | Domino (easy version) | https://codeforces.com/problemset/problem/1551/D1 | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7659
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1551-C | codeforces | 1551-C | Interesting Story | https://codeforces.com/problemset/problem/1551/C | [
"greedy",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14695
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1551-B2 | codeforces | 1551-B2 | Wonderful Coloring - 2 | https://codeforces.com/problemset/problem/1551/B2 | [
"binary search",
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16824
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1551-B1 | codeforces | 1551-B1 | Wonderful Coloring - 1 | https://codeforces.com/problemset/problem/1551/B1 | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31591
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1551-A | codeforces | 1551-A | Polycarp and Coins | https://codeforces.com/problemset/problem/1551/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 59354
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1550-F | codeforces | 1550-F | Jumping Around | https://codeforces.com/problemset/problem/1550/F | [
"binary search",
"data structures",
"divide and conquer",
"dp",
"dsu",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 973
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1550-E | codeforces | 1550-E | Stringforces | https://codeforces.com/problemset/problem/1550/E | [
"binary search",
"bitmasks",
"brute force",
"dp",
"strings",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1960
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1550-D | codeforces | 1550-D | Excellent Arrays | https://codeforces.com/problemset/problem/1550/D | [
"binary search",
"combinatorics",
"constructive algorithms",
"implementation",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2103
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1550-C | codeforces | 1550-C | Manhattan Subarrays | https://codeforces.com/problemset/problem/1550/C | [
"brute force",
"geometry",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10932
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1550-B | codeforces | 1550-B | Maximum Cost Deletion | https://codeforces.com/problemset/problem/1550/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 28798
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1550-A | codeforces | 1550-A | Find The Array | https://codeforces.com/problemset/problem/1550/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29608
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1549-B | codeforces | 1549-B | Gregor and the Pawn Game | https://codeforces.com/problemset/problem/1549/B | [
"dfs and similar",
"dp",
"flows",
"graph matchings",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27306
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1549-A | codeforces | 1549-A | Gregor and Cryptography | https://codeforces.com/problemset/problem/1549/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 35970
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1548-E | codeforces | 1548-E | Gregor and the Two Painters | https://codeforces.com/problemset/problem/1548/E | [
"data structures",
"divide and conquer",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 619
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1548-D2 | codeforces | 1548-D2 | Gregor and the Odd Cows (Hard) | https://codeforces.com/problemset/problem/1548/D2 | [
"brute force",
"geometry",
"math",
"number theory"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 358
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1548-D1 | codeforces | 1548-D1 | Gregor and the Odd Cows (Easy) | https://codeforces.com/problemset/problem/1548/D1 | [
"bitmasks",
"geometry",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1646
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1548-C | codeforces | 1548-C | The Three Little Pigs | https://codeforces.com/problemset/problem/1548/C | [
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2255
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1548-B | codeforces | 1548-B | Integers Have Friends | https://codeforces.com/problemset/problem/1548/B | [
"binary search",
"data structures",
"divide and conquer",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 11669
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1548-A | codeforces | 1548-A | Web of Lies | https://codeforces.com/problemset/problem/1548/A | [
"brute force",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17918
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1547-G | codeforces | 1547-G | How Many Paths? | https://codeforces.com/problemset/problem/1547/G | [
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3699
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1547-F | codeforces | 1547-F | Array Stabilization (GCD version) | https://codeforces.com/problemset/problem/1547/F | [
"binary search",
"brute force",
"data structures",
"divide and conquer",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7276
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1547-E | codeforces | 1547-E | Air Conditioners | https://codeforces.com/problemset/problem/1547/E | [
"data structures",
"dp",
"implementation",
"shortest paths",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 16676
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1547-D | codeforces | 1547-D | Co-growing Sequence | https://codeforces.com/problemset/problem/1547/D | [
"bitmasks",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18887
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1547-C | codeforces | 1547-C | Pair Programming | https://codeforces.com/problemset/problem/1547/C | [
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 24685
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1547-B | codeforces | 1547-B | Alphabetical Strings | https://codeforces.com/problemset/problem/1547/B | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28103
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1547-A | codeforces | 1547-A | Shortest Path with Obstacle | https://codeforces.com/problemset/problem/1547/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32516
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1546-B | codeforces | 1546-B | AquaMoon and Stolen String | https://codeforces.com/problemset/problem/1546/B | [
"interactive",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14088
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1546-A | codeforces | 1546-A | AquaMoon and Two Arrays | https://codeforces.com/problemset/problem/1546/A | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18631
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1545-F | codeforces | 1545-F | AquaMoon and Potatoes | https://codeforces.com/problemset/problem/1545/F | [
"brute force",
"data structures",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 149
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1545-E2 | codeforces | 1545-E2 | AquaMoon and Time Stop (hard version) | https://codeforces.com/problemset/problem/1545/E2 | [
"data structures",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 107
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1545-E1 | codeforces | 1545-E1 | AquaMoon and Time Stop (easy version) | https://codeforces.com/problemset/problem/1545/E1 | [
"data structures",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 107
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1545-D | codeforces | 1545-D | AquaMoon and Wrong Coordinate | https://codeforces.com/problemset/problem/1545/D | [
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 801
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1545-C | codeforces | 1545-C | AquaMoon and Permutations | https://codeforces.com/problemset/problem/1545/C | [
"2-sat",
"brute force",
"combinatorics",
"constructive algorithms",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 832
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1545-B | codeforces | 1545-B | AquaMoon and Chess | https://codeforces.com/problemset/problem/1545/B | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7120
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1545-A | codeforces | 1545-A | AquaMoon and Strange Sort | https://codeforces.com/problemset/problem/1545/A | [
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14993
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1543-E | codeforces | 1543-E | The Final Pursuit | https://codeforces.com/problemset/problem/1543/E | [
"bitmasks",
"constructive algorithms",
"divide and conquer",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 505
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1543-D2 | codeforces | 1543-D2 | RPD and Rap Sheet (Hard Version) | https://codeforces.com/problemset/problem/1543/D2 | [
"brute force",
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2204
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1543-D1 | codeforces | 1543-D1 | RPD and Rap Sheet (Easy Version) | https://codeforces.com/problemset/problem/1543/D1 | [
"bitmasks",
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8067
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1543-C | codeforces | 1543-C | Need for Pink Slips | https://codeforces.com/problemset/problem/1543/C | [
"bitmasks",
"brute force",
"dfs and similar",
"implementation",
"math",
"probabilities"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5674
} | 2026-08-17T01:43:56.191071+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.