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:1011-B | codeforces | 1011-B | Planning The Expedition | https://codeforces.com/problemset/problem/1011/B | [
"binary search",
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 11125
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1011-A | codeforces | 1011-A | Stages | https://codeforces.com/problemset/problem/1011/A | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 13362
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1010-F | codeforces | 1010-F | Tree | https://codeforces.com/problemset/problem/1010/F | [
"fft",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 571
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1010-E | codeforces | 1010-E | Store | https://codeforces.com/problemset/problem/1010/E | [
"data structures"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 435
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1010-D | codeforces | 1010-D | Mars rover | https://codeforces.com/problemset/problem/1010/D | [
"dfs and similar",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2629
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1010-C | codeforces | 1010-C | Border | https://codeforces.com/problemset/problem/1010/C | [
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6070
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1010-B | codeforces | 1010-B | Rocket | https://codeforces.com/problemset/problem/1010/B | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6481
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1010-A | codeforces | 1010-A | Fly | https://codeforces.com/problemset/problem/1010/A | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9108
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1009-G | codeforces | 1009-G | Allowed Letters | https://codeforces.com/problemset/problem/1009/G | [
"bitmasks",
"flows",
"graph matchings",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1098
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1009-F | codeforces | 1009-F | Dominant Indices | https://codeforces.com/problemset/problem/1009/F | [
"data structures",
"dsu",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 8301
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1009-E | codeforces | 1009-E | Intercity Travelling | https://codeforces.com/problemset/problem/1009/E | [
"combinatorics",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3488
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1009-D | codeforces | 1009-D | Relatively Prime Graph | https://codeforces.com/problemset/problem/1009/D | [
"brute force",
"constructive algorithms",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6742
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1009-C | codeforces | 1009-C | Annoying Present | https://codeforces.com/problemset/problem/1009/C | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5587
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1009-B | codeforces | 1009-B | Minimum Ternary String | https://codeforces.com/problemset/problem/1009/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10804
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1009-A | codeforces | 1009-A | Game Shopping | https://codeforces.com/problemset/problem/1009/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12362
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1008-B | codeforces | 1008-B | Turn the Rectangles | https://codeforces.com/problemset/problem/1008/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 12728
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1008-A | codeforces | 1008-A | Romaji | https://codeforces.com/problemset/problem/1008/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16501
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1007-E | codeforces | 1007-E | Mini Metro | https://codeforces.com/problemset/problem/1007/E | [
"dp"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 254
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1007-D | codeforces | 1007-D | Ants | https://codeforces.com/problemset/problem/1007/D | [
"2-sat",
"data structures",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 419
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1007-C | codeforces | 1007-C | Guess two numbers | https://codeforces.com/problemset/problem/1007/C | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 590
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1007-B | codeforces | 1007-B | Pave the Parallelepiped | https://codeforces.com/problemset/problem/1007/B | [
"bitmasks",
"brute force",
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1064
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1007-A | codeforces | 1007-A | Reorder the Array | https://codeforces.com/problemset/problem/1007/A | [
"combinatorics",
"data structures",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13196
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1006-F | codeforces | 1006-F | Xor-Paths | https://codeforces.com/problemset/problem/1006/F | [
"bitmasks",
"brute force",
"dp",
"meet-in-the-middle"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 7333
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1006-E | codeforces | 1006-E | Military Problem | https://codeforces.com/problemset/problem/1006/E | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12020
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1006-D | codeforces | 1006-D | Two Strings Swaps | https://codeforces.com/problemset/problem/1006/D | [
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6525
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1006-C | codeforces | 1006-C | Three Parts of the Array | https://codeforces.com/problemset/problem/1006/C | [
"binary search",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 26310
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1006-B | codeforces | 1006-B | Polycarp's Practice | https://codeforces.com/problemset/problem/1006/B | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14826
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1006-A | codeforces | 1006-A | Adjacent Replacements | https://codeforces.com/problemset/problem/1006/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23031
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1005-F | codeforces | 1005-F | Berland and the Shortest Paths | https://codeforces.com/problemset/problem/1005/F | [
"brute force",
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2196
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1005-E2 | codeforces | 1005-E2 | Median on Segments (General Case Edition) | https://codeforces.com/problemset/problem/1005/E2 | [
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1610
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1005-E1 | codeforces | 1005-E1 | Median on Segments (Permutations Edition) | https://codeforces.com/problemset/problem/1005/E1 | [
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4429
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1005-D | codeforces | 1005-D | Polycarp and Div 3 | https://codeforces.com/problemset/problem/1005/D | [
"dp",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11620
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1005-C | codeforces | 1005-C | Summarize to the Power of Two | https://codeforces.com/problemset/problem/1005/C | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13251
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1005-B | codeforces | 1005-B | Delete from the Left | https://codeforces.com/problemset/problem/1005/B | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 27903
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1005-A | codeforces | 1005-A | Tanya and Stairways | https://codeforces.com/problemset/problem/1005/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28463
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1004-F | codeforces | 1004-F | Sonya and Bitwise OR | https://codeforces.com/problemset/problem/1004/F | [
"bitmasks",
"data structures",
"divide and conquer"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 994
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1004-E | codeforces | 1004-E | Sonya and Ice Cream | https://codeforces.com/problemset/problem/1004/E | [
"binary search",
"data structures",
"dp",
"greedy",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1309
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1004-D | codeforces | 1004-D | Sonya and Matrix | https://codeforces.com/problemset/problem/1004/D | [
"brute force",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1520
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1004-C | codeforces | 1004-C | Sonya and Robots | https://codeforces.com/problemset/problem/1004/C | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7920
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1004-B | codeforces | 1004-B | Sonya and Exhibition | https://codeforces.com/problemset/problem/1004/B | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 10055
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1004-A | codeforces | 1004-A | Sonya and Hotels | https://codeforces.com/problemset/problem/1004/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 11930
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1003-F | codeforces | 1003-F | Abbreviation | https://codeforces.com/problemset/problem/1003/F | [
"dp",
"hashing",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1653
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1003-E | codeforces | 1003-E | Tree Constructing | https://codeforces.com/problemset/problem/1003/E | [
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3202
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1003-D | codeforces | 1003-D | Coins and Queries | https://codeforces.com/problemset/problem/1003/D | [
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8681
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1003-C | codeforces | 1003-C | Intense Heat | https://codeforces.com/problemset/problem/1003/C | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11650
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1003-B | codeforces | 1003-B | Binary String Constructing | https://codeforces.com/problemset/problem/1003/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12368
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1003-A | codeforces | 1003-A | Polycarp's Pockets | https://codeforces.com/problemset/problem/1003/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30504
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1002-E2 | codeforces | 1002-E2 | Another array reconstruction algorithm | https://codeforces.com/problemset/problem/1002/E2 | [
"*special"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 211
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1002-E1 | codeforces | 1002-E1 | Bernstein-Vazirani algorithm | https://codeforces.com/problemset/problem/1002/E1 | [
"*special"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 329
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1002-D3 | codeforces | 1002-D3 | Oracle for majority function | https://codeforces.com/problemset/problem/1002/D3 | [
"*special"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 341
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1002-D2 | codeforces | 1002-D2 | Oracle for f(x) = b * x + (1 - b) * (1 - x) mod 2 | https://codeforces.com/problemset/problem/1002/D2 | [
"*special"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 395
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1002-D1 | codeforces | 1002-D1 | Oracle for f(x) = b * x mod 2 | https://codeforces.com/problemset/problem/1002/D1 | [
"*special"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 420
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1002-C2 | codeforces | 1002-C2 | Distinguish zero state and plus state without errors | https://codeforces.com/problemset/problem/1002/C2 | [
"*special"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 273
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1002-C1 | codeforces | 1002-C1 | Distinguish zero state and plus state with minimum error | https://codeforces.com/problemset/problem/1002/C1 | [
"*special"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 309
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1002-B4 | codeforces | 1002-B4 | Distinguish four 2-qubit states - 2 | https://codeforces.com/problemset/problem/1002/B4 | [
"*special"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 317
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1002-B3 | codeforces | 1002-B3 | Distinguish four 2-qubit states | https://codeforces.com/problemset/problem/1002/B3 | [
"*special"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 421
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1002-B2 | codeforces | 1002-B2 | Distinguish GHZ state and W state | https://codeforces.com/problemset/problem/1002/B2 | [
"*special"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 456
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1002-B1 | codeforces | 1002-B1 | Distinguish zero state and W state | https://codeforces.com/problemset/problem/1002/B1 | [
"*special"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 490
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1002-A4 | codeforces | 1002-A4 | Generate W state | https://codeforces.com/problemset/problem/1002/A4 | [
"*special"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 274
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1002-A3 | codeforces | 1002-A3 | Generate superposition of two basis states | https://codeforces.com/problemset/problem/1002/A3 | [
"*special"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 484
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1002-A2 | codeforces | 1002-A2 | Generate superposition of zero state and a basis state | https://codeforces.com/problemset/problem/1002/A2 | [
"*special"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 571
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1002-A1 | codeforces | 1002-A1 | Generate superposition of all basis states | https://codeforces.com/problemset/problem/1002/A1 | [
"*special"
] | null | null | stdin_stdout | 800 | {
"solved_count": 946
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1001-I | codeforces | 1001-I | Deutsch-Jozsa algorithm | https://codeforces.com/problemset/problem/1001/I | [
"*special"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 413
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1001-H | codeforces | 1001-H | Oracle for f(x) = parity of the number of 1s in x | https://codeforces.com/problemset/problem/1001/H | [
"*special"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 547
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1001-G | codeforces | 1001-G | Oracle for f(x) = k-th element of x | https://codeforces.com/problemset/problem/1001/G | [
"*special"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 553
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1001-F | codeforces | 1001-F | Distinguish multi-qubit basis states | https://codeforces.com/problemset/problem/1001/F | [
"*special"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 551
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1001-E | codeforces | 1001-E | Distinguish Bell states | https://codeforces.com/problemset/problem/1001/E | [
"*special"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 568
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1001-D | codeforces | 1001-D | Distinguish plus state and minus state | https://codeforces.com/problemset/problem/1001/D | [
"*special"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 701
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1001-C | codeforces | 1001-C | Generate GHZ state | https://codeforces.com/problemset/problem/1001/C | [
"*special"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 667
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1001-B | codeforces | 1001-B | Generate Bell state | https://codeforces.com/problemset/problem/1001/B | [
"*special"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 724
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1001-A | codeforces | 1001-A | Generate plus state or minus state | https://codeforces.com/problemset/problem/1001/A | [
"*special"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 1044
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1000-G | codeforces | 1000-G | Two-Paths | https://codeforces.com/problemset/problem/1000/G | [
"data structures",
"dp",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 796
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1000-F | codeforces | 1000-F | One Occurrence | https://codeforces.com/problemset/problem/1000/F | [
"data structures",
"divide and conquer"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 5121
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1000-E | codeforces | 1000-E | We Need More Bosses | https://codeforces.com/problemset/problem/1000/E | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 7067
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1000-D | codeforces | 1000-D | Yet Another Problem On a Subsequence | https://codeforces.com/problemset/problem/1000/D | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5218
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1000-C | codeforces | 1000-C | Covered Points Count | https://codeforces.com/problemset/problem/1000/C | [
"data structures",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8796
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1000-B | codeforces | 1000-B | Light It Up | https://codeforces.com/problemset/problem/1000/B | [
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6227
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1000-A | codeforces | 1000-A | Codehorses T-shirts | https://codeforces.com/problemset/problem/1000/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9483
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:999-F | codeforces | 999-F | Cards and Joy | https://codeforces.com/problemset/problem/999/F | [
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3365
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:999-E | codeforces | 999-E | Reachability from the Capital | https://codeforces.com/problemset/problem/999/E | [
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 8233
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:999-D | codeforces | 999-D | Equalize the Remainders | https://codeforces.com/problemset/problem/999/D | [
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4958
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:999-C | codeforces | 999-C | Alphabetic Removals | https://codeforces.com/problemset/problem/999/C | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 21338
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:999-B | codeforces | 999-B | Reversing Encryption | https://codeforces.com/problemset/problem/999/B | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 19624
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:999-A | codeforces | 999-A | Mishka and Contest | https://codeforces.com/problemset/problem/999/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25549
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:998-B | codeforces | 998-B | Cutting | https://codeforces.com/problemset/problem/998/B | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14560
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:998-A | codeforces | 998-A | Balloons | https://codeforces.com/problemset/problem/998/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 10229
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:997-E | codeforces | 997-E | Good Subsegments | https://codeforces.com/problemset/problem/997/E | [
"data structures"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1833
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:997-D | codeforces | 997-D | Cycles in product | https://codeforces.com/problemset/problem/997/D | [
"combinatorics",
"divide and conquer",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 920
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:997-C | codeforces | 997-C | Sky Full of Stars | https://codeforces.com/problemset/problem/997/C | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2436
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:997-B | codeforces | 997-B | Roman Digits | https://codeforces.com/problemset/problem/997/B | [
"brute force",
"combinatorics",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3237
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:997-A | codeforces | 997-A | Convert to Ones | https://codeforces.com/problemset/problem/997/A | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8696
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:996-B | codeforces | 996-B | World Cup | https://codeforces.com/problemset/problem/996/B | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9995
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:996-A | codeforces | 996-A | Hit the Lottery | https://codeforces.com/problemset/problem/996/A | [
"dp",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 123063
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:995-F | codeforces | 995-F | Cowmpany Cowmpensation | https://codeforces.com/problemset/problem/995/F | [
"combinatorics",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1851
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:995-E | codeforces | 995-E | Number Clicker | https://codeforces.com/problemset/problem/995/E | [
"divide and conquer",
"graphs",
"meet-in-the-middle",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 986
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:995-D | codeforces | 995-D | Game | https://codeforces.com/problemset/problem/995/D | [
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 981
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:995-C | codeforces | 995-C | Leaving the Bar | https://codeforces.com/problemset/problem/995/C | [
"brute force",
"data structures",
"geometry",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2141
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:995-B | codeforces | 995-B | Suit and Tie | https://codeforces.com/problemset/problem/995/B | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7485
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:995-A | codeforces | 995-A | Tesla | https://codeforces.com/problemset/problem/995/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1863
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:994-B | codeforces | 994-B | Knights of a Polygonal Table | https://codeforces.com/problemset/problem/994/B | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 6088
} | 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.