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: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": 27482
} | 2026-06-01T05:00:40.145500+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": 28018
} | 2026-06-01T05:00:40.145500+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": 932
} | 2026-06-01T05:00:40.145500+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": 1247
} | 2026-06-01T05:00:40.145500+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": 1504
} | 2026-06-01T05:00:40.145500+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": 7889
} | 2026-06-01T05:00:40.145500+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": 9972
} | 2026-06-01T05:00:40.145500+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": 11883
} | 2026-06-01T05:00:40.145500+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": 1614
} | 2026-06-01T05:00:40.145500+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": 3051
} | 2026-06-01T05:00:40.145500+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": 8600
} | 2026-06-01T05:00:40.145500+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": 11555
} | 2026-06-01T05:00:40.145500+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": 12258
} | 2026-06-01T05:00:40.145500+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": 30067
} | 2026-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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": 391
} | 2026-06-01T05:00:40.145500+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": 418
} | 2026-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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": 455
} | 2026-06-01T05:00:40.145500+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": 489
} | 2026-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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": 570
} | 2026-06-01T05:00:40.145500+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": 934
} | 2026-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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": 546
} | 2026-06-01T05:00:40.145500+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": 552
} | 2026-06-01T05:00:40.145500+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": 550
} | 2026-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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": 697
} | 2026-06-01T05:00:40.145500+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": 666
} | 2026-06-01T05:00:40.145500+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": 722
} | 2026-06-01T05:00:40.145500+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": 1041
} | 2026-06-01T05:00:40.145500+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": 725
} | 2026-06-01T05:00:40.145500+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": 4868
} | 2026-06-01T05:00:40.145500+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": 6589
} | 2026-06-01T05:00:40.145500+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": 5095
} | 2026-06-01T05:00:40.145500+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": 8531
} | 2026-06-01T05:00:40.145500+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": 6188
} | 2026-06-01T05:00:40.145500+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": 9392
} | 2026-06-01T05:00:40.145500+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": 3281
} | 2026-06-01T05:00:40.145500+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": 7935
} | 2026-06-01T05:00:40.145500+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": 4911
} | 2026-06-01T05:00:40.145500+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": 21049
} | 2026-06-01T05:00:40.145500+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": 19516
} | 2026-06-01T05:00:40.145500+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": 25373
} | 2026-06-01T05:00:40.145500+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": 14443
} | 2026-06-01T05:00:40.145500+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": 10147
} | 2026-06-01T05:00:40.145500+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": 1664
} | 2026-06-01T05:00:40.145500+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": 517
} | 2026-06-01T05:00:40.145500+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": 2209
} | 2026-06-01T05:00:40.145500+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": 3141
} | 2026-06-01T05:00:40.145500+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": 8669
} | 2026-06-01T05:00:40.145500+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": 9924
} | 2026-06-01T05:00:40.145500+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": 119397
} | 2026-06-01T05:00:40.145500+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": 1656
} | 2026-06-01T05:00:40.145500+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": 936
} | 2026-06-01T05:00:40.145500+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": 901
} | 2026-06-01T05:00:40.145500+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": 2057
} | 2026-06-01T05:00:40.145500+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": 7457
} | 2026-06-01T05:00:40.145500+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": 1809
} | 2026-06-01T05:00:40.145500+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": 6055
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:994-A | codeforces | 994-A | Fingerprints | https://codeforces.com/problemset/problem/994/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15236
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:993-F | codeforces | 993-F | The Moral Dilemma | https://codeforces.com/problemset/problem/993/F | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 67
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:993-E | codeforces | 993-E | Nikita and Order Statistics | https://codeforces.com/problemset/problem/993/E | [
"chinese remainder theorem",
"fft",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1805
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:993-D | codeforces | 993-D | Compute Power | https://codeforces.com/problemset/problem/993/D | [
"binary search",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 838
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:993-C | codeforces | 993-C | Careful Maneuvering | https://codeforces.com/problemset/problem/993/C | [
"bitmasks",
"brute force",
"geometry"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1808
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:993-B | codeforces | 993-B | Open Communication | https://codeforces.com/problemset/problem/993/B | [
"bitmasks",
"brute force"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2054
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:993-A | codeforces | 993-A | Two Squares | https://codeforces.com/problemset/problem/993/A | [
"geometry",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4480
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:992-E | codeforces | 992-E | Nastya and King-Shamans | https://codeforces.com/problemset/problem/992/E | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1681
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:992-D | codeforces | 992-D | Nastya and a Game | https://codeforces.com/problemset/problem/992/D | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1752
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:992-C | codeforces | 992-C | Nastya and a Wardrobe | https://codeforces.com/problemset/problem/992/C | [
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4872
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:992-B | codeforces | 992-B | Nastya Studies Informatics | https://codeforces.com/problemset/problem/992/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6780
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:992-A | codeforces | 992-A | Nastya and an Array | https://codeforces.com/problemset/problem/992/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14361
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:991-F | codeforces | 991-F | Concise and clear | https://codeforces.com/problemset/problem/991/F | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 341
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:991-E | codeforces | 991-E | Bus Number | https://codeforces.com/problemset/problem/991/E | [
"brute force",
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3731
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:991-D | codeforces | 991-D | Bishwock | https://codeforces.com/problemset/problem/991/D | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7745
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:991-C | codeforces | 991-C | Candies | https://codeforces.com/problemset/problem/991/C | [
"binary search",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11558
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:991-B | codeforces | 991-B | Getting an A | https://codeforces.com/problemset/problem/991/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 13772
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:991-A | codeforces | 991-A | If at first you don't succeed... | https://codeforces.com/problemset/problem/991/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 11253
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:990-G | codeforces | 990-G | GCD Counting | https://codeforces.com/problemset/problem/990/G | [
"divide and conquer",
"dp",
"dsu",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2342
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:990-F | codeforces | 990-F | Flow Control | https://codeforces.com/problemset/problem/990/F | [
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1058
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:990-E | codeforces | 990-E | Post Lamps | https://codeforces.com/problemset/problem/990/E | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2168
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:990-D | codeforces | 990-D | Graph And Its Complement | https://codeforces.com/problemset/problem/990/D | [
"constructive algorithms",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4119
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:990-C | codeforces | 990-C | Bracket Sequences Concatenation Problem | https://codeforces.com/problemset/problem/990/C | [
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6303
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:990-B | codeforces | 990-B | Micro-World | https://codeforces.com/problemset/problem/990/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8627
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:990-A | codeforces | 990-A | Commentary Boxes | https://codeforces.com/problemset/problem/990/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 11222
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:989-E | codeforces | 989-E | A Trance of Nightfall | https://codeforces.com/problemset/problem/989/E | [
"dp",
"geometry",
"matrices",
"probabilities"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 282
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:989-D | codeforces | 989-D | A Shade of Moonlight | https://codeforces.com/problemset/problem/989/D | [
"binary search",
"geometry",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 540
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:989-C | codeforces | 989-C | A Mist of Florescence | https://codeforces.com/problemset/problem/989/C | [
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4043
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:989-B | codeforces | 989-B | A Tide of Riverscape | https://codeforces.com/problemset/problem/989/B | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 7293
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:989-A | codeforces | 989-A | A Blend of Springtime | https://codeforces.com/problemset/problem/989/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 11183
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:988-F | codeforces | 988-F | Rain and Umbrellas | https://codeforces.com/problemset/problem/988/F | [
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2788
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:988-E | codeforces | 988-E | Divisibility by 25 | https://codeforces.com/problemset/problem/988/E | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4448
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:988-D | codeforces | 988-D | Points and Powers of Two | https://codeforces.com/problemset/problem/988/D | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8065
} | 2026-06-01T05:00:40.145500+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.