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:1364-C | codeforces | 1364-C | Ehab and Prefix MEXs | https://codeforces.com/problemset/problem/1364/C | [
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14403
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1364-B | codeforces | 1364-B | Most socially-distanced subsequence | https://codeforces.com/problemset/problem/1364/B | [
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 26492
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1364-A | codeforces | 1364-A | XXXXX | https://codeforces.com/problemset/problem/1364/A | [
"brute force",
"data structures",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 31445
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1363-F | codeforces | 1363-F | Rotating Substrings | https://codeforces.com/problemset/problem/1363/F | [
"dp",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1747
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1363-E | codeforces | 1363-E | Tree Shuffling | https://codeforces.com/problemset/problem/1363/E | [
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 7522
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1363-D | codeforces | 1363-D | Guess The Maximums | https://codeforces.com/problemset/problem/1363/D | [
"binary search",
"implementation",
"interactive",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4427
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1363-C | codeforces | 1363-C | Game On Leaves | https://codeforces.com/problemset/problem/1363/C | [
"games",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 21202
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1363-B | codeforces | 1363-B | Subsequence Hate | https://codeforces.com/problemset/problem/1363/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 26254
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1363-A | codeforces | 1363-A | Odd Selection | https://codeforces.com/problemset/problem/1363/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 40564
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1362-C | codeforces | 1362-C | Johnny and Another Rating Drop | https://codeforces.com/problemset/problem/1362/C | [
"bitmasks",
"greedy",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 23998
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1362-B | codeforces | 1362-B | Johnny and His Hobbies | https://codeforces.com/problemset/problem/1362/B | [
"bitmasks",
"brute force"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 21146
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1362-A | codeforces | 1362-A | Johnny and Ancient Computer | https://codeforces.com/problemset/problem/1362/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 34733
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1361-F | codeforces | 1361-F | Johnny and New Toy | https://codeforces.com/problemset/problem/1361/F | [
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 172
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1361-E | codeforces | 1361-E | James and the Chase | https://codeforces.com/problemset/problem/1361/E | [
"dfs and similar",
"graphs",
"probabilities",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 999
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1361-D | codeforces | 1361-D | Johnny and James | https://codeforces.com/problemset/problem/1361/D | [
"greedy",
"implementation",
"math",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 340
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1361-C | codeforces | 1361-C | Johnny and Megan's Necklace | https://codeforces.com/problemset/problem/1361/C | [
"binary search",
"bitmasks",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1845
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1361-B | codeforces | 1361-B | Johnny and Grandmaster | https://codeforces.com/problemset/problem/1361/B | [
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3872
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1361-A | codeforces | 1361-A | Johnny and Contribution | https://codeforces.com/problemset/problem/1361/A | [
"constructive algorithms",
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8863
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1360-H | codeforces | 1360-H | Binary Median | https://codeforces.com/problemset/problem/1360/H | [
"binary search",
"bitmasks",
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4866
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1360-G | codeforces | 1360-G | A/B Matrix | https://codeforces.com/problemset/problem/1360/G | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8366
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1360-F | codeforces | 1360-F | Spy-string | https://codeforces.com/problemset/problem/1360/F | [
"bitmasks",
"brute force",
"constructive algorithms",
"dp",
"hashing",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 13552
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1360-E | codeforces | 1360-E | Polygon | https://codeforces.com/problemset/problem/1360/E | [
"dp",
"graphs",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 28097
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1360-D | codeforces | 1360-D | Buying Shovels | https://codeforces.com/problemset/problem/1360/D | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 43423
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1360-C | codeforces | 1360-C | Similar Pairs | https://codeforces.com/problemset/problem/1360/C | [
"constructive algorithms",
"graph matchings",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 36888
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1360-B | codeforces | 1360-B | Honest Coach | https://codeforces.com/problemset/problem/1360/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 53947
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1360-A | codeforces | 1360-A | Minimal Square | https://codeforces.com/problemset/problem/1360/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 57333
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1359-F | codeforces | 1359-F | RC Kaboom Show | https://codeforces.com/problemset/problem/1359/F | [
"binary search",
"brute force",
"data structures",
"geometry",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 584
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1359-E | codeforces | 1359-E | Modular Stability | https://codeforces.com/problemset/problem/1359/E | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6755
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1359-D | codeforces | 1359-D | Yet Another Yet Another Task | https://codeforces.com/problemset/problem/1359/D | [
"data structures",
"dp",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 10776
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1359-C | codeforces | 1359-C | Mixing Water | https://codeforces.com/problemset/problem/1359/C | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 15362
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1359-B | codeforces | 1359-B | New Theatre Square | https://codeforces.com/problemset/problem/1359/B | [
"brute force",
"dp",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 29437
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1359-A | codeforces | 1359-A | Berland Poker | https://codeforces.com/problemset/problem/1359/A | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 31791
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1358-F | codeforces | 1358-F | Tasty Cookie | https://codeforces.com/problemset/problem/1358/F | [
"binary search",
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 504
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1358-E | codeforces | 1358-E | Are You Fired? | https://codeforces.com/problemset/problem/1358/E | [
"constructive algorithms",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2453
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1358-D | codeforces | 1358-D | The Best Vacation | https://codeforces.com/problemset/problem/1358/D | [
"binary search",
"brute force",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8743
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1358-C | codeforces | 1358-C | Celex Update | https://codeforces.com/problemset/problem/1358/C | [
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 18395
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1358-B | codeforces | 1358-B | Maria Breaks the Self-isolation | https://codeforces.com/problemset/problem/1358/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 25940
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1358-A | codeforces | 1358-A | Park Lighting | https://codeforces.com/problemset/problem/1358/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 43412
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1357-E2 | codeforces | 1357-E2 | Root of quantum Fourier transform | https://codeforces.com/problemset/problem/1357/E2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 53
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1357-E1 | codeforces | 1357-E1 | Power of quantum Fourier transform | https://codeforces.com/problemset/problem/1357/E1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 195
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1357-D5 | codeforces | 1357-D5 | Quantum Classification - Dataset 7 | https://codeforces.com/problemset/problem/1357/D5 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 83
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1357-D4 | codeforces | 1357-D4 | Quantum Classification - Dataset 6 | https://codeforces.com/problemset/problem/1357/D4 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 86
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1357-D3 | codeforces | 1357-D3 | Quantum Classification - Dataset 5 | https://codeforces.com/problemset/problem/1357/D3 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 106
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1357-D2 | codeforces | 1357-D2 | Quantum Classification - Dataset 4 | https://codeforces.com/problemset/problem/1357/D2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 113
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1357-D1 | codeforces | 1357-D1 | Quantum Classification - Dataset 3 | https://codeforces.com/problemset/problem/1357/D1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 126
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1357-C2 | codeforces | 1357-C2 | Prepare superposition of basis states with the same parity | https://codeforces.com/problemset/problem/1357/C2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 307
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1357-C1 | codeforces | 1357-C1 | Prepare superposition of basis states with 0s | https://codeforces.com/problemset/problem/1357/C1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 350
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1357-B2 | codeforces | 1357-B2 | "Is the number divisible by 3?" oracle | https://codeforces.com/problemset/problem/1357/B2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 216
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1357-B1 | codeforces | 1357-B1 | "Is the bit string balanced?" oracle | https://codeforces.com/problemset/problem/1357/B1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 216
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1357-A7 | codeforces | 1357-A7 | Distinguish Y, XZ, -Y and -XZ | https://codeforces.com/problemset/problem/1357/A7 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 185
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1357-A6 | codeforces | 1357-A6 | Distinguish four Pauli gates | https://codeforces.com/problemset/problem/1357/A6 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 170
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1357-A5 | codeforces | 1357-A5 | Distinguish Rz(θ) from Ry(θ) | https://codeforces.com/problemset/problem/1357/A5 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 243
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1357-A4 | codeforces | 1357-A4 | Distinguish Rz from R1 | https://codeforces.com/problemset/problem/1357/A4 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 354
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1357-A3 | codeforces | 1357-A3 | Distinguish H from X | https://codeforces.com/problemset/problem/1357/A3 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 481
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1357-A2 | codeforces | 1357-A2 | Distinguish I, CNOTs and SWAP | https://codeforces.com/problemset/problem/1357/A2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 513
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1357-A1 | codeforces | 1357-A1 | Figure out direction of CNOT | https://codeforces.com/problemset/problem/1357/A1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 634
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1356-D2 | codeforces | 1356-D2 | Quantum Classification - 2 | https://codeforces.com/problemset/problem/1356/D2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 129
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1356-D1 | codeforces | 1356-D1 | Quantum Classification - 1 | https://codeforces.com/problemset/problem/1356/D1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 138
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1356-C | codeforces | 1356-C | Prepare state |01⟩ + |10⟩ + |11⟩ | https://codeforces.com/problemset/problem/1356/C | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 305
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1356-B2 | codeforces | 1356-B2 | Decrement | https://codeforces.com/problemset/problem/1356/B2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 287
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1356-B1 | codeforces | 1356-B1 | Increment | https://codeforces.com/problemset/problem/1356/B1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 286
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1356-A5 | codeforces | 1356-A5 | Distinguish Z from -Z | https://codeforces.com/problemset/problem/1356/A5 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 334
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1356-A4 | codeforces | 1356-A4 | Distinguish I ⊗ X from CNOT | https://codeforces.com/problemset/problem/1356/A4 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 461
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1356-A3 | codeforces | 1356-A3 | Distinguish Z from S | https://codeforces.com/problemset/problem/1356/A3 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 463
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1356-A2 | codeforces | 1356-A2 | Distinguish I from Z | https://codeforces.com/problemset/problem/1356/A2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 490
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1356-A1 | codeforces | 1356-A1 | Distinguish I from X | https://codeforces.com/problemset/problem/1356/A1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 606
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1355-F | codeforces | 1355-F | Guess Divisors Count | https://codeforces.com/problemset/problem/1355/F | [
"constructive algorithms",
"interactive",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 967
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1355-E | codeforces | 1355-E | Restorer Distance | https://codeforces.com/problemset/problem/1355/E | [
"binary search",
"greedy",
"math",
"sortings",
"ternary search"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5861
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1355-D | codeforces | 1355-D | Game With Array | https://codeforces.com/problemset/problem/1355/D | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 19086
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1355-C | codeforces | 1355-C | Count Triangles | https://codeforces.com/problemset/problem/1355/C | [
"binary search",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 12105
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1355-B | codeforces | 1355-B | Young Explorers | https://codeforces.com/problemset/problem/1355/B | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 27429
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1355-A | codeforces | 1355-A | Sequence with Digits | https://codeforces.com/problemset/problem/1355/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 28885
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1354-G | codeforces | 1354-G | Find a Gift | https://codeforces.com/problemset/problem/1354/G | [
"binary search",
"interactive",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 976
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1354-F | codeforces | 1354-F | Summoning Minions | https://codeforces.com/problemset/problem/1354/F | [
"constructive algorithms",
"dp",
"flows",
"graph matchings",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1487
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1354-E | codeforces | 1354-E | Graph Coloring | https://codeforces.com/problemset/problem/1354/E | [
"dfs and similar",
"dp",
"graphs"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3780
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1354-D | codeforces | 1354-D | Multiset | https://codeforces.com/problemset/problem/1354/D | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 10294
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1354-C2 | codeforces | 1354-C2 | Not So Simple Polygon Embedding | https://codeforces.com/problemset/problem/1354/C2 | [
"binary search",
"brute force",
"geometry",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6378
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1354-C1 | codeforces | 1354-C1 | Simple Polygon Embedding | https://codeforces.com/problemset/problem/1354/C1 | [
"binary search",
"geometry",
"math",
"ternary search"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16370
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1354-B | codeforces | 1354-B | Ternary String | https://codeforces.com/problemset/problem/1354/B | [
"binary search",
"dp",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 35429
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1354-A | codeforces | 1354-A | Alarm Clock | https://codeforces.com/problemset/problem/1354/A | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 24920
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1353-F | codeforces | 1353-F | Decreasing Heights | https://codeforces.com/problemset/problem/1353/F | [
"brute force",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3618
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1353-E | codeforces | 1353-E | K-periodic Garland | https://codeforces.com/problemset/problem/1353/E | [
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7895
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1353-D | codeforces | 1353-D | Constructing the Array | https://codeforces.com/problemset/problem/1353/D | [
"constructive algorithms",
"data structures",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 20364
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1353-C | codeforces | 1353-C | Board Moves | https://codeforces.com/problemset/problem/1353/C | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 38931
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1353-B | codeforces | 1353-B | Two Arrays And Swaps | https://codeforces.com/problemset/problem/1353/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 58396
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1353-A | codeforces | 1353-A | Most Unstable Array | https://codeforces.com/problemset/problem/1353/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 44706
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1352-G | codeforces | 1352-G | Special Permutation | https://codeforces.com/problemset/problem/1352/G | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 24933
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1352-F | codeforces | 1352-F | Binary String Reconstruction | https://codeforces.com/problemset/problem/1352/F | [
"constructive algorithms",
"dfs and similar",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 19583
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1352-E | codeforces | 1352-E | Special Elements | https://codeforces.com/problemset/problem/1352/E | [
"brute force",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 24100
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1352-D | codeforces | 1352-D | Alice, Bob and Candies | https://codeforces.com/problemset/problem/1352/D | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 29969
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1352-C | codeforces | 1352-C | K-th Not Divisible by n | https://codeforces.com/problemset/problem/1352/C | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 70367
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1352-B | codeforces | 1352-B | Same Parity Summands | https://codeforces.com/problemset/problem/1352/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 45093
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1352-A | codeforces | 1352-A | Sum of Round Numbers | https://codeforces.com/problemset/problem/1352/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 105097
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1351-C | codeforces | 1351-C | Skier | https://codeforces.com/problemset/problem/1351/C | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9315
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1351-B | codeforces | 1351-B | Square? | https://codeforces.com/problemset/problem/1351/B | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18574
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1351-A | codeforces | 1351-A | A+B (Trial Problem) | https://codeforces.com/problemset/problem/1351/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27059
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1350-B | codeforces | 1350-B | Orac and Models | https://codeforces.com/problemset/problem/1350/B | [
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 29797
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1350-A | codeforces | 1350-A | Orac and Factors | https://codeforces.com/problemset/problem/1350/A | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 27431
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1349-F2 | codeforces | 1349-F2 | Slime and Sequences (Hard Version) | https://codeforces.com/problemset/problem/1349/F2 | [
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 134
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1349-F1 | codeforces | 1349-F1 | Slime and Sequences (Easy Version) | https://codeforces.com/problemset/problem/1349/F1 | [
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 519
} | 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.