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:1732-D2 | codeforces | 1732-D2 | Balance (Hard version) | https://codeforces.com/problemset/problem/1732/D2 | [
"brute force",
"data structures",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1645
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1732-D1 | codeforces | 1732-D1 | Balance (Easy version) | https://codeforces.com/problemset/problem/1732/D1 | [
"brute force",
"data structures",
"implementation",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10177
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1732-C2 | codeforces | 1732-C2 | Sheikh (Hard Version) | https://codeforces.com/problemset/problem/1732/C2 | [
"binary search",
"bitmasks",
"brute force",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3209
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1732-C1 | codeforces | 1732-C1 | Sheikh (Easy version) | https://codeforces.com/problemset/problem/1732/C1 | [
"binary search",
"bitmasks",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8171
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1732-B | codeforces | 1732-B | Ugu | https://codeforces.com/problemset/problem/1732/B | [
"brute force",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 17784
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1732-A | codeforces | 1732-A | Bestie | https://codeforces.com/problemset/problem/1732/A | [
"brute force",
"combinatorics",
"constructive algorithms",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 18139
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1731-F | codeforces | 1731-F | Function Sum | https://codeforces.com/problemset/problem/1731/F | [
"brute force",
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 940
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1731-E | codeforces | 1731-E | Graph Cost | https://codeforces.com/problemset/problem/1731/E | [
"dp",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3642
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1731-D | codeforces | 1731-D | Valiant's New Map | https://codeforces.com/problemset/problem/1731/D | [
"binary search",
"brute force",
"data structures",
"dp",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8781
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1731-C | codeforces | 1731-C | Even Subarrays | https://codeforces.com/problemset/problem/1731/C | [
"bitmasks",
"brute force",
"hashing",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 12914
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1731-B | codeforces | 1731-B | Kill Demodogs | https://codeforces.com/problemset/problem/1731/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 29679
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1731-A | codeforces | 1731-A | Joey Takes Money | https://codeforces.com/problemset/problem/1731/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23850
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1730-F | codeforces | 1730-F | Almost Sorted | https://codeforces.com/problemset/problem/1730/F | [
"bitmasks",
"data structures",
"dp"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 819
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1730-E | codeforces | 1730-E | Maximums and Minimums | https://codeforces.com/problemset/problem/1730/E | [
"combinatorics",
"data structures",
"divide and conquer",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 834
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1730-D | codeforces | 1730-D | Prefixes and Suffixes | https://codeforces.com/problemset/problem/1730/D | [
"constructive algorithms",
"strings",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3118
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1730-C | codeforces | 1730-C | Minimum Notation | https://codeforces.com/problemset/problem/1730/C | [
"data structures",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18190
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1730-B | codeforces | 1730-B | Meeting on the Line | https://codeforces.com/problemset/problem/1730/B | [
"binary search",
"geometry",
"greedy",
"implementation",
"math",
"ternary search"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 18903
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1730-A | codeforces | 1730-A | Planets | https://codeforces.com/problemset/problem/1730/A | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25236
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1729-G | codeforces | 1729-G | Cut Substrings | https://codeforces.com/problemset/problem/1729/G | [
"combinatorics",
"dp",
"hashing",
"strings",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2659
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1729-F | codeforces | 1729-F | Kirei and the Linear Function | https://codeforces.com/problemset/problem/1729/F | [
"hashing",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4634
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1729-E | codeforces | 1729-E | Guess the Cycle Size | https://codeforces.com/problemset/problem/1729/E | [
"interactive",
"probabilities"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8158
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1729-D | codeforces | 1729-D | Friends and the Restaurant | https://codeforces.com/problemset/problem/1729/D | [
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 34113
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1729-C | codeforces | 1729-C | Jumping on Tiles | https://codeforces.com/problemset/problem/1729/C | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21875
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1729-B | codeforces | 1729-B | Decode String | https://codeforces.com/problemset/problem/1729/B | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32862
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1729-A | codeforces | 1729-A | Two Elevators | https://codeforces.com/problemset/problem/1729/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 46937
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1728-G | codeforces | 1728-G | Illumination | https://codeforces.com/problemset/problem/1728/G | [
"binary search",
"bitmasks",
"brute force",
"combinatorics",
"dp",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 694
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1728-F | codeforces | 1728-F | Fishermen | https://codeforces.com/problemset/problem/1728/F | [
"flows",
"graph matchings",
"greedy"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 530
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1728-E | codeforces | 1728-E | Red-Black Pepper | https://codeforces.com/problemset/problem/1728/E | [
"brute force",
"data structures",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2114
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1728-D | codeforces | 1728-D | Letter Picking | https://codeforces.com/problemset/problem/1728/D | [
"constructive algorithms",
"dp",
"games",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8524
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1728-C | codeforces | 1728-C | Digital Logarithm | https://codeforces.com/problemset/problem/1728/C | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 18329
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1728-B | codeforces | 1728-B | Best Permutation | https://codeforces.com/problemset/problem/1728/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20841
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1728-A | codeforces | 1728-A | Colored Balls: Revisited | https://codeforces.com/problemset/problem/1728/A | [
"brute force",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25618
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1726-H | codeforces | 1726-H | Mainak and the Bleeding Polygon | https://codeforces.com/problemset/problem/1726/H | [
"binary search",
"geometry",
"implementation",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 120
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1726-G | codeforces | 1726-G | A Certain Magical Party | https://codeforces.com/problemset/problem/1726/G | [
"combinatorics",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 516
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1726-E | codeforces | 1726-E | Almost Perfect | https://codeforces.com/problemset/problem/1726/E | [
"combinatorics",
"fft",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1804
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1726-D | codeforces | 1726-D | Edge Split | https://codeforces.com/problemset/problem/1726/D | [
"brute force",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4331
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1726-C | codeforces | 1726-C | Jatayu's Balanced Bracket Sequence | https://codeforces.com/problemset/problem/1726/C | [
"data structures",
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13566
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1726-B | codeforces | 1726-B | Mainak and Interesting Sequence | https://codeforces.com/problemset/problem/1726/B | [
"bitmasks",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17190
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1726-A | codeforces | 1726-A | Mainak and Array | https://codeforces.com/problemset/problem/1726/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 41789
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1725-M | codeforces | 1725-M | Moving Both Hands | https://codeforces.com/problemset/problem/1725/M | [
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4910
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1725-L | codeforces | 1725-L | Lemper Cooking Competition | https://codeforces.com/problemset/problem/1725/L | [
"data structures"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1173
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1725-K | codeforces | 1725-K | Kingdom of Criticism | https://codeforces.com/problemset/problem/1725/K | [
"data structures",
"dsu"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 868
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1725-J | codeforces | 1725-J | Journey | https://codeforces.com/problemset/problem/1725/J | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 514
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1725-I | codeforces | 1725-I | Imitating the Key Tree | https://codeforces.com/problemset/problem/1725/I | [
"combinatorics",
"dsu",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 373
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1725-H | codeforces | 1725-H | Hot Black Hot White | https://codeforces.com/problemset/problem/1725/H | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3079
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1725-G | codeforces | 1725-G | Garage | https://codeforces.com/problemset/problem/1725/G | [
"binary search",
"geometry",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6879
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1725-F | codeforces | 1725-F | Field Photography | https://codeforces.com/problemset/problem/1725/F | [
"bitmasks",
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1196
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1725-E | codeforces | 1725-E | Electrical Efficiency | https://codeforces.com/problemset/problem/1725/E | [
"combinatorics",
"data structures",
"dp",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 647
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1725-D | codeforces | 1725-D | Deducing Sortability | https://codeforces.com/problemset/problem/1725/D | [
"binary search",
"bitmasks",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 262
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1725-C | codeforces | 1725-C | Circular Mirror | https://codeforces.com/problemset/problem/1725/C | [
"binary search",
"combinatorics",
"geometry",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2040
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1725-B | codeforces | 1725-B | Basketball Together | https://codeforces.com/problemset/problem/1725/B | [
"binary search",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 33275
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1725-A | codeforces | 1725-A | Accumulation of Dominoes | https://codeforces.com/problemset/problem/1725/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 10315
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1722-G | codeforces | 1722-G | Even-Odd XOR | https://codeforces.com/problemset/problem/1722/G | [
"bitmasks",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14994
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1722-F | codeforces | 1722-F | L-shapes | https://codeforces.com/problemset/problem/1722/F | [
"dfs and similar",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8235
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1722-E | codeforces | 1722-E | Counting Rectangles | https://codeforces.com/problemset/problem/1722/E | [
"brute force",
"data structures",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14178
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1722-D | codeforces | 1722-D | Line | https://codeforces.com/problemset/problem/1722/D | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 27289
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1722-C | codeforces | 1722-C | Word Game | https://codeforces.com/problemset/problem/1722/C | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 37859
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1722-B | codeforces | 1722-B | Colourblindness | https://codeforces.com/problemset/problem/1722/B | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 59195
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1722-A | codeforces | 1722-A | Spell Check | https://codeforces.com/problemset/problem/1722/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 69370
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1721-F | codeforces | 1721-F | Matching Reduction | https://codeforces.com/problemset/problem/1721/F | [
"brute force",
"constructive algorithms",
"dfs and similar",
"flows",
"graph matchings",
"graphs",
"interactive"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 702
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1721-E | codeforces | 1721-E | Prefix Function Queries | https://codeforces.com/problemset/problem/1721/E | [
"dfs and similar",
"dp",
"hashing",
"string suffix structures",
"strings",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2794
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1721-D | codeforces | 1721-D | Maximum AND | https://codeforces.com/problemset/problem/1721/D | [
"bitmasks",
"dfs and similar",
"divide and conquer",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7920
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1721-C | codeforces | 1721-C | Min-Max Array Transformation | https://codeforces.com/problemset/problem/1721/C | [
"binary search",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14822
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1721-B | codeforces | 1721-B | Deadly Laser | https://codeforces.com/problemset/problem/1721/B | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 24164
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1721-A | codeforces | 1721-A | Image | https://codeforces.com/problemset/problem/1721/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28519
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1720-E | codeforces | 1720-E | Misha and Paintings | https://codeforces.com/problemset/problem/1720/E | [
"constructive algorithms",
"data structures",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1119
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1720-D2 | codeforces | 1720-D2 | Xor-Subsequence (hard version) | https://codeforces.com/problemset/problem/1720/D2 | [
"bitmasks",
"data structures",
"dp",
"strings",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2324
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1720-D1 | codeforces | 1720-D1 | Xor-Subsequence (easy version) | https://codeforces.com/problemset/problem/1720/D1 | [
"bitmasks",
"brute force",
"dp",
"strings",
"trees",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6854
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1720-C | codeforces | 1720-C | Corners | https://codeforces.com/problemset/problem/1720/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18465
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1720-B | codeforces | 1720-B | Interesting Sum | https://codeforces.com/problemset/problem/1720/B | [
"brute force",
"data structures",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22654
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1720-A | codeforces | 1720-A | Burenka Plays with Fractions | https://codeforces.com/problemset/problem/1720/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 24729
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1719-C | codeforces | 1719-C | Fighting Tournament | https://codeforces.com/problemset/problem/1719/C | [
"binary search",
"data structures",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14604
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1719-B | codeforces | 1719-B | Mathematical Circus | https://codeforces.com/problemset/problem/1719/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19258
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1719-A | codeforces | 1719-A | Chip Game | https://codeforces.com/problemset/problem/1719/A | [
"games",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27032
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1718-F | codeforces | 1718-F | Burenka, an Array and Queries | https://codeforces.com/problemset/problem/1718/F | [
"data structures",
"math",
"number theory"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 277
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1718-E | codeforces | 1718-E | Impressionism | https://codeforces.com/problemset/problem/1718/E | [
"constructive algorithms",
"graphs",
"implementation",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 255
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1718-D | codeforces | 1718-D | Permutation for Burenka | https://codeforces.com/problemset/problem/1718/D | [
"data structures",
"graph matchings",
"greedy",
"math",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 465
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1718-C | codeforces | 1718-C | Tonya and Burenka-179 | https://codeforces.com/problemset/problem/1718/C | [
"data structures",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1938
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1718-B | codeforces | 1718-B | Fibonacci Strings | https://codeforces.com/problemset/problem/1718/B | [
"greedy",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3606
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1718-A2 | codeforces | 1718-A2 | Burenka and Traditions (hard version) | https://codeforces.com/problemset/problem/1718/A2 | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6043
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1718-A1 | codeforces | 1718-A1 | Burenka and Traditions (easy version) | https://codeforces.com/problemset/problem/1718/A1 | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6533
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1717-F | codeforces | 1717-F | Madoka and The First Session | https://codeforces.com/problemset/problem/1717/F | [
"constructive algorithms",
"flows",
"graph matchings",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 802
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1717-E | codeforces | 1717-E | Madoka and The Best University | https://codeforces.com/problemset/problem/1717/E | [
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3683
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1717-D | codeforces | 1717-D | Madoka and The Corruption Scheme | https://codeforces.com/problemset/problem/1717/D | [
"combinatorics",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4979
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1717-C | codeforces | 1717-C | Madoka and Formal Statement | https://codeforces.com/problemset/problem/1717/C | [
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16106
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1717-B | codeforces | 1717-B | Madoka and Underground Competitions | https://codeforces.com/problemset/problem/1717/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15784
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1717-A | codeforces | 1717-A | Madoka and Strange Thoughts | https://codeforces.com/problemset/problem/1717/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21340
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1716-F | codeforces | 1716-F | Bags with Balls | https://codeforces.com/problemset/problem/1716/F | [
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1500
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1716-E | codeforces | 1716-E | Swap and Maximum Block | https://codeforces.com/problemset/problem/1716/E | [
"bitmasks",
"data structures",
"dfs and similar",
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1405
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1716-D | codeforces | 1716-D | Chip Move | https://codeforces.com/problemset/problem/1716/D | [
"brute force",
"dp",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6370
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1716-C | codeforces | 1716-C | Robot in a Hallway | https://codeforces.com/problemset/problem/1716/C | [
"data structures",
"dp",
"greedy",
"implementation",
"ternary search"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4706
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1716-B | codeforces | 1716-B | Permutation Chain | https://codeforces.com/problemset/problem/1716/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22163
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1716-A | codeforces | 1716-A | 2-3 Moves | https://codeforces.com/problemset/problem/1716/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 36677
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1715-F | codeforces | 1715-F | Crop Squares | https://codeforces.com/problemset/problem/1715/F | [
"constructive algorithms",
"geometry",
"interactive",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 612
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1715-E | codeforces | 1715-E | Long Way Home | https://codeforces.com/problemset/problem/1715/E | [
"data structures",
"divide and conquer",
"dp",
"geometry",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2479
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1715-D | codeforces | 1715-D | 2+ doors | https://codeforces.com/problemset/problem/1715/D | [
"2-sat",
"bitmasks",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6390
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1715-C | codeforces | 1715-C | Monoblock | https://codeforces.com/problemset/problem/1715/C | [
"combinatorics",
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10898
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1715-B | codeforces | 1715-B | Beautiful Array | https://codeforces.com/problemset/problem/1715/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 37672
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1715-A | codeforces | 1715-A | Crossmarket | https://codeforces.com/problemset/problem/1715/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24542
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1714-G | codeforces | 1714-G | Path Prefixes | https://codeforces.com/problemset/problem/1714/G | [
"binary search",
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10011
} | 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.