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:1767-D | codeforces | 1767-D | Playoff | https://codeforces.com/problemset/problem/1767/D | [
"combinatorics",
"constructive algorithms",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11453
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1767-C | codeforces | 1767-C | Count Binary Strings | https://codeforces.com/problemset/problem/1767/C | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3238
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1767-B | codeforces | 1767-B | Block Towers | https://codeforces.com/problemset/problem/1767/B | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22315
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1767-A | codeforces | 1767-A | Cut the Triangle | https://codeforces.com/problemset/problem/1767/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21726
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1766-F | codeforces | 1766-F | MCF | https://codeforces.com/problemset/problem/1766/F | [
"flows"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 442
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1766-E | codeforces | 1766-E | Decomposition | https://codeforces.com/problemset/problem/1766/E | [
"binary search",
"brute force",
"data structures",
"divide and conquer",
"dp",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1573
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1766-D | codeforces | 1766-D | Lucky Chains | https://codeforces.com/problemset/problem/1766/D | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11115
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1766-C | codeforces | 1766-C | Hamiltonian Wall | https://codeforces.com/problemset/problem/1766/C | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15246
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1766-B | codeforces | 1766-B | Notepad# | https://codeforces.com/problemset/problem/1766/B | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 24267
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1766-A | codeforces | 1766-A | Extremely Round | https://codeforces.com/problemset/problem/1766/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 53399
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1765-N | codeforces | 1765-N | Number Reduction | https://codeforces.com/problemset/problem/1765/N | [
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6247
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1765-M | codeforces | 1765-M | Minimum LCM | https://codeforces.com/problemset/problem/1765/M | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 37422
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1765-L | codeforces | 1765-L | Project Manager | https://codeforces.com/problemset/problem/1765/L | [
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 708
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1765-K | codeforces | 1765-K | Torus Path | https://codeforces.com/problemset/problem/1765/K | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6986
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1765-J | codeforces | 1765-J | Hero to Zero | https://codeforces.com/problemset/problem/1765/J | [
"graph matchings",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 404
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1765-I | codeforces | 1765-I | Infinite Chess | https://codeforces.com/problemset/problem/1765/I | [
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 324
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1765-H | codeforces | 1765-H | Hospital Queue | https://codeforces.com/problemset/problem/1765/H | [
"binary search",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1643
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1765-G | codeforces | 1765-G | Guess the String | https://codeforces.com/problemset/problem/1765/G | [
"constructive algorithms",
"interactive",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 511
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1765-F | codeforces | 1765-F | Chemistry Lab | https://codeforces.com/problemset/problem/1765/F | [
"dp",
"geometry",
"probabilities"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 814
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1765-E | codeforces | 1765-E | Exchange | https://codeforces.com/problemset/problem/1765/E | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 12174
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1765-D | codeforces | 1765-D | Watch the Videos | https://codeforces.com/problemset/problem/1765/D | [
"binary search",
"constructive algorithms",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5034
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1765-C | codeforces | 1765-C | Card Guessing | https://codeforces.com/problemset/problem/1765/C | [
"combinatorics",
"dp",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 722
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1765-B | codeforces | 1765-B | Broken Keyboard | https://codeforces.com/problemset/problem/1765/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 10043
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1765-A | codeforces | 1765-A | Access Levels | https://codeforces.com/problemset/problem/1765/A | [
"bitmasks",
"dsu",
"flows",
"graph matchings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 904
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1764-H | codeforces | 1764-H | Doremy's Paint 2 | https://codeforces.com/problemset/problem/1764/H | [
"data structures"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 308
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1764-G3 | codeforces | 1764-G3 | Doremy's Perfect DS Class (Hard Version) | https://codeforces.com/problemset/problem/1764/G3 | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 698
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1764-G2 | codeforces | 1764-G2 | Doremy's Perfect DS Class (Medium Version) | https://codeforces.com/problemset/problem/1764/G2 | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 812
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1764-G1 | codeforces | 1764-G1 | Doremy's Perfect DS Class (Easy Version) | https://codeforces.com/problemset/problem/1764/G1 | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 860
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1764-F | codeforces | 1764-F | Doremy's Experimental Tree | https://codeforces.com/problemset/problem/1764/F | [
"brute force",
"constructive algorithms",
"dfs and similar",
"dsu",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1293
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1764-E | codeforces | 1764-E | Doremy's Number Line | https://codeforces.com/problemset/problem/1764/E | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1482
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1764-D | codeforces | 1764-D | Doremy's Pegging Game | https://codeforces.com/problemset/problem/1764/D | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3273
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1764-C | codeforces | 1764-C | Doremy's City Construction | https://codeforces.com/problemset/problem/1764/C | [
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10616
} | 2026-11-02T05:37:07.883505+00:00 |
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": 18310
} | 2026-11-02T05:37:07.883505+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": 17600
} | 2026-11-02T05:37:07.883505+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": 983
} | 2026-11-02T05:37:07.883505+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": 2314
} | 2026-11-02T05:37:07.883505+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": 2441
} | 2026-11-02T05:37:07.883505+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": 8101
} | 2026-11-02T05:37:07.883505+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": 17031
} | 2026-11-02T05:37:07.883505+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": 17271
} | 2026-11-02T05:37:07.883505+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": 164
} | 2026-11-02T05:37:07.883505+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": 1031
} | 2026-11-02T05:37:07.883505+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": 1008
} | 2026-11-02T05:37:07.883505+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": 4656
} | 2026-11-02T05:37:07.883505+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": 10296
} | 2026-11-02T05:37:07.883505+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": 18916
} | 2026-11-02T05:37:07.883505+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": 20860
} | 2026-11-02T05:37:07.883505+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": 161
} | 2026-11-02T05:37:07.883505+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": 124
} | 2026-11-02T05:37:07.883505+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": 354
} | 2026-11-02T05:37:07.883505+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": 2252
} | 2026-11-02T05:37:07.883505+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": 2927
} | 2026-11-02T05:37:07.883505+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": 10885
} | 2026-11-02T05:37:07.883505+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": 14929
} | 2026-11-02T05:37:07.883505+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": 43149
} | 2026-11-02T05:37:07.883505+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": 11240
} | 2026-11-02T05:37:07.883505+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": 15711
} | 2026-11-02T05:37:07.883505+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": 23490
} | 2026-11-02T05:37:07.883505+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": 27843
} | 2026-11-02T05:37:07.883505+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": 45611
} | 2026-11-02T05:37:07.883505+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": 55200
} | 2026-11-02T05:37:07.883505+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": 85352
} | 2026-11-02T05:37:07.883505+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": 5766
} | 2026-11-02T05:37:07.883505+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": 4605
} | 2026-11-02T05:37:07.883505+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": 12867
} | 2026-11-02T05:37:07.883505+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": 22501
} | 2026-11-02T05:37:07.883505+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": 19753
} | 2026-11-02T05:37:07.883505+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": 23911
} | 2026-11-02T05:37:07.883505+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": 33242
} | 2026-11-02T05:37:07.883505+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": 262
} | 2026-11-02T05:37:07.883505+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": 1099
} | 2026-11-02T05:37:07.883505+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": 8851
} | 2026-11-02T05:37:07.883505+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": 15474
} | 2026-11-02T05:37:07.883505+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": 24443
} | 2026-11-02T05:37:07.883505+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": 27338
} | 2026-11-02T05:37:07.883505+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": 19832
} | 2026-11-02T05:37:07.883505+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": 25071
} | 2026-11-02T05:37:07.883505+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": 258
} | 2026-11-02T05:37:07.883505+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": 459
} | 2026-11-02T05:37:07.883505+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": 2208
} | 2026-11-02T05:37:07.883505+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": 5593
} | 2026-11-02T05:37:07.883505+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": 15474
} | 2026-11-02T05:37:07.883505+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": 11887
} | 2026-11-02T05:37:07.883505+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": 16680
} | 2026-11-02T05:37:07.883505+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": 130
} | 2026-11-02T05:37:07.883505+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": 518
} | 2026-11-02T05:37:07.883505+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": 1311
} | 2026-11-02T05:37:07.883505+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": 1739
} | 2026-11-02T05:37:07.883505+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": 7849
} | 2026-11-02T05:37:07.883505+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": 10598
} | 2026-11-02T05:37:07.883505+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": 16912
} | 2026-11-02T05:37:07.883505+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": 17957
} | 2026-11-02T05:37:07.883505+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": 685
} | 2026-11-02T05:37:07.883505+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": 2211
} | 2026-11-02T05:37:07.883505+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": 6533
} | 2026-11-02T05:37:07.883505+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": 16104
} | 2026-11-02T05:37:07.883505+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": 23003
} | 2026-11-02T05:37:07.883505+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": 23521
} | 2026-11-02T05:37:07.883505+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": 421
} | 2026-11-02T05:37:07.883505+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": 3011
} | 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.