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:1358-C | codeforces | 1358-C | Celex Update | https://codeforces.com/problemset/problem/1358/C | [
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 18605
} | 2026-11-02T05:37:07.883505+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": 26134
} | 2026-11-02T05:37:07.883505+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": 44175
} | 2026-11-02T05:37:07.883505+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": 54
} | 2026-11-02T05:37:07.883505+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": 196
} | 2026-11-02T05:37:07.883505+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": 84
} | 2026-11-02T05:37:07.883505+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": 87
} | 2026-11-02T05:37:07.883505+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": 107
} | 2026-11-02T05:37:07.883505+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": 114
} | 2026-11-02T05:37:07.883505+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": 127
} | 2026-11-02T05:37:07.883505+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": 308
} | 2026-11-02T05:37:07.883505+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": 351
} | 2026-11-02T05:37:07.883505+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": 217
} | 2026-11-02T05:37:07.883505+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": 217
} | 2026-11-02T05:37:07.883505+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": 186
} | 2026-11-02T05:37:07.883505+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": 171
} | 2026-11-02T05:37:07.883505+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": 244
} | 2026-11-02T05:37:07.883505+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": 355
} | 2026-11-02T05:37:07.883505+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": 482
} | 2026-11-02T05:37:07.883505+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": 514
} | 2026-11-02T05:37:07.883505+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": 635
} | 2026-11-02T05:37:07.883505+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": 130
} | 2026-11-02T05:37:07.883505+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": 139
} | 2026-11-02T05:37:07.883505+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": 306
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1356-B2 | codeforces | 1356-B2 | Decrement | https://codeforces.com/problemset/problem/1356/B2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 288
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1356-B1 | codeforces | 1356-B1 | Increment | https://codeforces.com/problemset/problem/1356/B1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 287
} | 2026-11-02T05:37:07.883505+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": 335
} | 2026-11-02T05:37:07.883505+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": 462
} | 2026-11-02T05:37:07.883505+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": 464
} | 2026-11-02T05:37:07.883505+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": 491
} | 2026-11-02T05:37:07.883505+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": 607
} | 2026-11-02T05:37:07.883505+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": 996
} | 2026-11-02T05:37:07.883505+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": 6234
} | 2026-11-02T05:37:07.883505+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": 19289
} | 2026-11-02T05:37:07.883505+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": 12529
} | 2026-11-02T05:37:07.883505+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": 27937
} | 2026-11-02T05:37:07.883505+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": 29435
} | 2026-11-02T05:37:07.883505+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": 1118
} | 2026-11-02T05:37:07.883505+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": 1577
} | 2026-11-02T05:37:07.883505+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": 3889
} | 2026-11-02T05:37:07.883505+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": 10909
} | 2026-11-02T05:37:07.883505+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": 6458
} | 2026-11-02T05:37:07.883505+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": 16452
} | 2026-11-02T05:37:07.883505+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": 36563
} | 2026-11-02T05:37:07.883505+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": 25122
} | 2026-11-02T05:37:07.883505+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": 3747
} | 2026-11-02T05:37:07.883505+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": 8059
} | 2026-11-02T05:37:07.883505+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": 21057
} | 2026-11-02T05:37:07.883505+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": 39581
} | 2026-11-02T05:37:07.883505+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": 60377
} | 2026-11-02T05:37:07.883505+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": 45371
} | 2026-11-02T05:37:07.883505+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": 25873
} | 2026-11-02T05:37:07.883505+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": 20083
} | 2026-11-02T05:37:07.883505+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": 24926
} | 2026-11-02T05:37:07.883505+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": 31014
} | 2026-11-02T05:37:07.883505+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": 76003
} | 2026-11-02T05:37:07.883505+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": 47656
} | 2026-11-02T05:37:07.883505+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": 111543
} | 2026-11-02T05:37:07.883505+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": 9472
} | 2026-11-02T05:37:07.883505+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": 18852
} | 2026-11-02T05:37:07.883505+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": 27722
} | 2026-11-02T05:37:07.883505+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": 31850
} | 2026-11-02T05:37:07.883505+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": 27793
} | 2026-11-02T05:37:07.883505+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": 147
} | 2026-11-02T05:37:07.883505+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": 694
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1349-E | codeforces | 1349-E | Slime and Hats | https://codeforces.com/problemset/problem/1349/E | [
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 127
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1349-D | codeforces | 1349-D | Slime and Biscuits | https://codeforces.com/problemset/problem/1349/D | [
"math",
"probabilities"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 1264
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1349-C | codeforces | 1349-C | Orac and Game of Life | https://codeforces.com/problemset/problem/1349/C | [
"dfs and similar",
"graphs",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4960
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1349-B | codeforces | 1349-B | Orac and Medians | https://codeforces.com/problemset/problem/1349/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 9120
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1349-A | codeforces | 1349-A | Orac and LCM | https://codeforces.com/problemset/problem/1349/A | [
"data structures",
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 23285
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1348-F | codeforces | 1348-F | Phoenix and Memory | https://codeforces.com/problemset/problem/1348/F | [
"data structures",
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 992
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1348-E | codeforces | 1348-E | Phoenix and Berries | https://codeforces.com/problemset/problem/1348/E | [
"brute force",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2554
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1348-D | codeforces | 1348-D | Phoenix and Science | https://codeforces.com/problemset/problem/1348/D | [
"binary search",
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 9464
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1348-C | codeforces | 1348-C | Phoenix and Distribution | https://codeforces.com/problemset/problem/1348/C | [
"constructive algorithms",
"greedy",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15746
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1348-B | codeforces | 1348-B | Phoenix and Beauty | https://codeforces.com/problemset/problem/1348/B | [
"constructive algorithms",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 28163
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1348-A | codeforces | 1348-A | Phoenix and Balance | https://codeforces.com/problemset/problem/1348/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 43654
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1346-I | codeforces | 1346-I | Pac-Man 2.0 | https://codeforces.com/problemset/problem/1346/I | [
"*special",
"dp"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 70
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1346-H | codeforces | 1346-H | Game with Segments | https://codeforces.com/problemset/problem/1346/H | [
"*special",
"data structures",
"games"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 65
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1346-G | codeforces | 1346-G | Two IP Cameras | https://codeforces.com/problemset/problem/1346/G | [
"*special",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 153
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1346-F | codeforces | 1346-F | Dune II: Battle For Arrakis | https://codeforces.com/problemset/problem/1346/F | [
"*special",
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 258
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1346-E | codeforces | 1346-E | Magic Tricks | https://codeforces.com/problemset/problem/1346/E | [
"*special",
"dp",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 418
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1346-D | codeforces | 1346-D | Constructing the Dungeon | https://codeforces.com/problemset/problem/1346/D | [
"*special",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 556
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1346-C | codeforces | 1346-C | Spring Cleaning | https://codeforces.com/problemset/problem/1346/C | [
"*special",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 686
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1346-B | codeforces | 1346-B | Boot Camp | https://codeforces.com/problemset/problem/1346/B | [
"*special",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 1297
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1346-A | codeforces | 1346-A | Color Revolution | https://codeforces.com/problemset/problem/1346/A | [
"*special",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 2234
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1345-B | codeforces | 1345-B | Card Constructions | https://codeforces.com/problemset/problem/1345/B | [
"binary search",
"brute force",
"dp",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 28637
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1345-A | codeforces | 1345-A | Puzzle Pieces | https://codeforces.com/problemset/problem/1345/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24954
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1344-F | codeforces | 1344-F | Piet's Palette | https://codeforces.com/problemset/problem/1344/F | [
"matrices"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 630
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1344-E | codeforces | 1344-E | Train Tracks | https://codeforces.com/problemset/problem/1344/E | [
"data structures",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 699
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1344-D | codeforces | 1344-D | Résumé Review | https://codeforces.com/problemset/problem/1344/D | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1356
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1344-C | codeforces | 1344-C | Quantifier Question | https://codeforces.com/problemset/problem/1344/C | [
"dfs and similar",
"dp",
"graphs",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 2046
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1344-B | codeforces | 1344-B | Monopole Magnets | https://codeforces.com/problemset/problem/1344/B | [
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6433
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1344-A | codeforces | 1344-A | Hilbert's Hotel | https://codeforces.com/problemset/problem/1344/A | [
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 16712
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1343-F | codeforces | 1343-F | Restore the Permutation by Sorted Segments | https://codeforces.com/problemset/problem/1343/F | [
"brute force",
"constructive algorithms",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1439
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1343-E | codeforces | 1343-E | Weights Distributing | https://codeforces.com/problemset/problem/1343/E | [
"brute force",
"graphs",
"greedy",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5937
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1343-D | codeforces | 1343-D | Constant Palindrome Sum | https://codeforces.com/problemset/problem/1343/D | [
"brute force",
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 13739
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1343-C | codeforces | 1343-C | Alternating Subsequence | https://codeforces.com/problemset/problem/1343/C | [
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 45995
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1343-B | codeforces | 1343-B | Balanced Array | https://codeforces.com/problemset/problem/1343/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 67560
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1343-A | codeforces | 1343-A | Candies | https://codeforces.com/problemset/problem/1343/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 54889
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1342-F | codeforces | 1342-F | Make It Ascending | https://codeforces.com/problemset/problem/1342/F | [
"bitmasks",
"brute force",
"dp"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1196
} | 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.