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:1764-B | codeforces | 1764-B | Doremy's Perfect Math Class | https://codeforces.com/problemset/problem/1764/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18147
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1764-A | codeforces | 1764-A | Doremy's Paint | https://codeforces.com/problemset/problem/1764/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17543
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1763-F | codeforces | 1763-F | Edge Queries | https://codeforces.com/problemset/problem/1763/F | [
"data structures",
"dfs and similar",
"dp",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 940
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1763-E | codeforces | 1763-E | Node Pairs | https://codeforces.com/problemset/problem/1763/E | [
"dp",
"graphs",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2261
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1763-D | codeforces | 1763-D | Valid Bitonic Permutations | https://codeforces.com/problemset/problem/1763/D | [
"combinatorics",
"dp",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2411
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1763-C | codeforces | 1763-C | Another Array Problem | https://codeforces.com/problemset/problem/1763/C | [
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 7970
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1763-B | codeforces | 1763-B | Incinerate | https://codeforces.com/problemset/problem/1763/B | [
"binary search",
"brute force",
"data structures",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 16605
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1763-A | codeforces | 1763-A | Absolute Maximization | https://codeforces.com/problemset/problem/1763/A | [
"bitmasks",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17130
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1762-G | codeforces | 1762-G | Unequal Adjacent Elements | https://codeforces.com/problemset/problem/1762/G | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 159
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1762-F | codeforces | 1762-F | Good Pairs | https://codeforces.com/problemset/problem/1762/F | [
"binary search",
"data structures",
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 918
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1762-E | codeforces | 1762-E | Tree Sum | https://codeforces.com/problemset/problem/1762/E | [
"combinatorics",
"math",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 965
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1762-D | codeforces | 1762-D | GCD Queries | https://codeforces.com/problemset/problem/1762/D | [
"constructive algorithms",
"interactive",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4536
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1762-C | codeforces | 1762-C | Binary Strings are Fun | https://codeforces.com/problemset/problem/1762/C | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10232
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1762-B | codeforces | 1762-B | Make Array Good | https://codeforces.com/problemset/problem/1762/B | [
"constructive algorithms",
"implementation",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 18762
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1762-A | codeforces | 1762-A | Divide and Conquer | https://codeforces.com/problemset/problem/1762/A | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20742
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1761-G | codeforces | 1761-G | Centroid Guess | https://codeforces.com/problemset/problem/1761/G | [
"interactive",
"probabilities",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 156
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1761-F2 | codeforces | 1761-F2 | Anti-median (Hard Version) | https://codeforces.com/problemset/problem/1761/F2 | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 110
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1761-F1 | codeforces | 1761-F1 | Anti-median (Easy Version) | https://codeforces.com/problemset/problem/1761/F1 | [
"dp",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 338
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1761-E | codeforces | 1761-E | Make It Connected | https://codeforces.com/problemset/problem/1761/E | [
"binary search",
"brute force",
"constructive algorithms",
"dsu",
"graphs",
"greedy",
"matrices",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2211
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1761-D | codeforces | 1761-D | Carry Bit | https://codeforces.com/problemset/problem/1761/D | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2887
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1761-C | codeforces | 1761-C | Set Construction | https://codeforces.com/problemset/problem/1761/C | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10826
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1761-B | codeforces | 1761-B | Elimination of a Ring | https://codeforces.com/problemset/problem/1761/B | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 14847
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1761-A | codeforces | 1761-A | Two Permutations | https://codeforces.com/problemset/problem/1761/A | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 40536
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1760-G | codeforces | 1760-G | SlavicG's Favorite Problem | https://codeforces.com/problemset/problem/1760/G | [
"bitmasks",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10874
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1760-F | codeforces | 1760-F | Quests | https://codeforces.com/problemset/problem/1760/F | [
"binary search",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15396
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1760-E | codeforces | 1760-E | Binary Inversions | https://codeforces.com/problemset/problem/1760/E | [
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 23264
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1760-D | codeforces | 1760-D | Challenging Valleys | https://codeforces.com/problemset/problem/1760/D | [
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 27499
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1760-C | codeforces | 1760-C | Advantage | https://codeforces.com/problemset/problem/1760/C | [
"data structures",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 44812
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1760-B | codeforces | 1760-B | Atilla's Favorite Problem | https://codeforces.com/problemset/problem/1760/B | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 54366
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1760-A | codeforces | 1760-A | Medium Number | https://codeforces.com/problemset/problem/1760/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 82364
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1759-G | codeforces | 1759-G | Restore the Permutation | https://codeforces.com/problemset/problem/1759/G | [
"binary search",
"constructive algorithms",
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5663
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1759-F | codeforces | 1759-F | All Possible Digits | https://codeforces.com/problemset/problem/1759/F | [
"binary search",
"data structures",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4572
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1759-E | codeforces | 1759-E | The Humanoid | https://codeforces.com/problemset/problem/1759/E | [
"brute force",
"dp",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12714
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1759-D | codeforces | 1759-D | Make It Round | https://codeforces.com/problemset/problem/1759/D | [
"brute force",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 21606
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1759-C | codeforces | 1759-C | Thermostat | https://codeforces.com/problemset/problem/1759/C | [
"greedy",
"math",
"shortest paths"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19615
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1759-B | codeforces | 1759-B | Lost Permutation | https://codeforces.com/problemset/problem/1759/B | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23799
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1759-A | codeforces | 1759-A | Yes-Yes? | https://codeforces.com/problemset/problem/1759/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32985
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1758-F | codeforces | 1758-F | Decent Division | https://codeforces.com/problemset/problem/1758/F | [
"constructive algorithms",
"data structures"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 253
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1758-E | codeforces | 1758-E | Tick, Tock | https://codeforces.com/problemset/problem/1758/E | [
"combinatorics",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1073
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1758-D | codeforces | 1758-D | Range = √Sum | https://codeforces.com/problemset/problem/1758/D | [
"binary search",
"brute force",
"constructive algorithms",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8762
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1758-C | codeforces | 1758-C | Almost All Multiples | https://codeforces.com/problemset/problem/1758/C | [
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15380
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1758-B | codeforces | 1758-B | XOR = Average | https://codeforces.com/problemset/problem/1758/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 900 | {
"solved_count": 24226
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1758-A | codeforces | 1758-A | SSeeeeiinngg DDoouubbllee | https://codeforces.com/problemset/problem/1758/A | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27183
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1754-B | codeforces | 1754-B | Kevin and Permutation | https://codeforces.com/problemset/problem/1754/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19770
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1754-A | codeforces | 1754-A | Technical Support | https://codeforces.com/problemset/problem/1754/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24977
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1753-F | codeforces | 1753-F | Minecraft Series | https://codeforces.com/problemset/problem/1753/F | [
"brute force",
"two pointers"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 257
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1753-E | codeforces | 1753-E | N Machines | https://codeforces.com/problemset/problem/1753/E | [
"binary search",
"brute force",
"greedy"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 455
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1753-D | codeforces | 1753-D | The Beach | https://codeforces.com/problemset/problem/1753/D | [
"constructive algorithms",
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2174
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1753-C | codeforces | 1753-C | Wish I Knew How to Sort | https://codeforces.com/problemset/problem/1753/C | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5471
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1753-B | codeforces | 1753-B | Factorial Divisibility | https://codeforces.com/problemset/problem/1753/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15258
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1753-A2 | codeforces | 1753-A2 | Make Nonzero Sum (hard version) | https://codeforces.com/problemset/problem/1753/A2 | [
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11745
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1753-A1 | codeforces | 1753-A1 | Make Nonzero Sum (easy version) | https://codeforces.com/problemset/problem/1753/A1 | [
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16588
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1750-H | codeforces | 1750-H | BinaryStringForces | https://codeforces.com/problemset/problem/1750/H | [
"constructive algorithms",
"data structures",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 126
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1750-G | codeforces | 1750-G | Doping | https://codeforces.com/problemset/problem/1750/G | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 448
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1750-F | codeforces | 1750-F | Majority | https://codeforces.com/problemset/problem/1750/F | [
"combinatorics",
"dp",
"math",
"strings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1290
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1750-E | codeforces | 1750-E | Bracket Cost | https://codeforces.com/problemset/problem/1750/E | [
"binary search",
"data structures",
"divide and conquer",
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1706
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1750-D | codeforces | 1750-D | Count GCD | https://codeforces.com/problemset/problem/1750/D | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7620
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1750-C | codeforces | 1750-C | Complementary XOR | https://codeforces.com/problemset/problem/1750/C | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10541
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1750-B | codeforces | 1750-B | Maximum Substring | https://codeforces.com/problemset/problem/1750/B | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16869
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1750-A | codeforces | 1750-A | Indirect Sort | https://codeforces.com/problemset/problem/1750/A | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17886
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1749-F | codeforces | 1749-F | Distance to the Path | https://codeforces.com/problemset/problem/1749/F | [
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 646
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1749-E | codeforces | 1749-E | Cactus Wall | https://codeforces.com/problemset/problem/1749/E | [
"constructive algorithms",
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2148
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1749-D | codeforces | 1749-D | Counting Arrays | https://codeforces.com/problemset/problem/1749/D | [
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6456
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1749-C | codeforces | 1749-C | Number Game | https://codeforces.com/problemset/problem/1749/C | [
"binary search",
"data structures",
"games",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15963
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1749-B | codeforces | 1749-B | Death's Blessing | https://codeforces.com/problemset/problem/1749/B | [
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 22815
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1749-A | codeforces | 1749-A | Cowardly Rooks | https://codeforces.com/problemset/problem/1749/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23394
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1748-F | codeforces | 1748-F | Circular Xor Reversal | https://codeforces.com/problemset/problem/1748/F | [
"bitmasks",
"constructive algorithms"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 403
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1748-E | codeforces | 1748-E | Yet Another Array Counting Problem | https://codeforces.com/problemset/problem/1748/E | [
"binary search",
"data structures",
"divide and conquer",
"dp",
"flows",
"math",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2855
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1748-D | codeforces | 1748-D | ConstructOR | https://codeforces.com/problemset/problem/1748/D | [
"bitmasks",
"chinese remainder theorem",
"combinatorics",
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3328
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1748-C | codeforces | 1748-C | Zero-Sum Prefixes | https://codeforces.com/problemset/problem/1748/C | [
"brute force",
"data structures",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13303
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1748-B | codeforces | 1748-B | Diverse Substrings | https://codeforces.com/problemset/problem/1748/B | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16975
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1748-A | codeforces | 1748-A | The Ultimate Square | https://codeforces.com/problemset/problem/1748/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25402
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1747-E | codeforces | 1747-E | List Generation | https://codeforces.com/problemset/problem/1747/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 712
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1747-D | codeforces | 1747-D | Yet Another Problem | https://codeforces.com/problemset/problem/1747/D | [
"binary search",
"bitmasks",
"constructive algorithms",
"data structures"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5682
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1747-C | codeforces | 1747-C | Swap Game | https://codeforces.com/problemset/problem/1747/C | [
"games"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 23765
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1747-B | codeforces | 1747-B | BAN BAN | https://codeforces.com/problemset/problem/1747/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 900 | {
"solved_count": 26323
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1747-A | codeforces | 1747-A | Two Groups | https://codeforces.com/problemset/problem/1747/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26579
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1746-G | codeforces | 1746-G | Olympiad Training | https://codeforces.com/problemset/problem/1746/G | [
"binary search",
"data structures",
"dp",
"flows",
"geometry",
"implementation",
"sortings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 118
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1746-F | codeforces | 1746-F | Kazaee | https://codeforces.com/problemset/problem/1746/F | [
"data structures",
"hashing",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 2829
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1746-E2 | codeforces | 1746-E2 | Joking (Hard Version) | https://codeforces.com/problemset/problem/1746/E2 | [
"dp",
"interactive"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 614
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1746-E1 | codeforces | 1746-E1 | Joking (Easy Version) | https://codeforces.com/problemset/problem/1746/E1 | [
"binary search",
"constructive algorithms",
"interactive",
"ternary search"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1831
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1746-D | codeforces | 1746-D | Paths on the Tree | https://codeforces.com/problemset/problem/1746/D | [
"dfs and similar",
"dp",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5162
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1746-C | codeforces | 1746-C | Permutation Operations | https://codeforces.com/problemset/problem/1746/C | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14190
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1746-B | codeforces | 1746-B | Rebellion | https://codeforces.com/problemset/problem/1746/B | [
"constructive algorithms",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18814
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1746-A | codeforces | 1746-A | Maxmina | https://codeforces.com/problemset/problem/1746/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21208
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1744-F | codeforces | 1744-F | MEX vs MED | https://codeforces.com/problemset/problem/1744/F | [
"math",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3936
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1744-E2 | codeforces | 1744-E2 | Divisible Numbers (hard version) | https://codeforces.com/problemset/problem/1744/E2 | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7007
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1744-E1 | codeforces | 1744-E1 | Divisible Numbers (easy version) | https://codeforces.com/problemset/problem/1744/E1 | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13039
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1744-D | codeforces | 1744-D | Divisibility by 2^n | https://codeforces.com/problemset/problem/1744/D | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 24842
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1744-C | codeforces | 1744-C | Traffic Light | https://codeforces.com/problemset/problem/1744/C | [
"binary search",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 47624
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1744-B | codeforces | 1744-B | Even-Odd Increments | https://codeforces.com/problemset/problem/1744/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25035
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1744-A | codeforces | 1744-A | Number Replacement | https://codeforces.com/problemset/problem/1744/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28969
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1743-G | codeforces | 1743-G | Antifibonacci Cut | https://codeforces.com/problemset/problem/1743/G | [
"bitmasks",
"combinatorics",
"constructive algorithms",
"data structures",
"dp",
"hashing",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 444
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1743-F | codeforces | 1743-F | Intersection and Union | https://codeforces.com/problemset/problem/1743/F | [
"data structures",
"dp",
"matrices",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1867
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1743-E | codeforces | 1743-E | FTL | https://codeforces.com/problemset/problem/1743/E | [
"binary search",
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1922
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1743-D | codeforces | 1743-D | Problem with Random Tests | https://codeforces.com/problemset/problem/1743/D | [
"brute force",
"dp",
"greedy",
"probabilities"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8478
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1743-C | codeforces | 1743-C | Save the Magazines | https://codeforces.com/problemset/problem/1743/C | [
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20848
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1743-B | codeforces | 1743-B | Permutation Value | https://codeforces.com/problemset/problem/1743/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23275
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1743-A | codeforces | 1743-A | Password | https://codeforces.com/problemset/problem/1743/A | [
"brute force",
"combinatorics",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29917
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1742-G | codeforces | 1742-G | Orray | https://codeforces.com/problemset/problem/1742/G | [
"bitmasks",
"brute force",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13708
} | 2026-08-10T02:20:32.917453+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.