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:1808-B | codeforces | 1808-B | Playing in a Casino | https://codeforces.com/problemset/problem/1808/B | [
"math",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 32120
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1808-A | codeforces | 1808-A | Lucky Numbers | https://codeforces.com/problemset/problem/1808/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 21058
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1807-G2 | codeforces | 1807-G2 | Subsequence Addition (Hard Version) | https://codeforces.com/problemset/problem/1807/G2 | [
"bitmasks",
"dp",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 29619
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1807-G1 | codeforces | 1807-G1 | Subsequence Addition (Easy Version) | https://codeforces.com/problemset/problem/1807/G1 | [
"brute force",
"data structures",
"dp",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22767
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1807-F | codeforces | 1807-F | Bouncy Ball | https://codeforces.com/problemset/problem/1807/F | [
"brute force",
"dfs and similar",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7449
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1807-E | codeforces | 1807-E | Interview | https://codeforces.com/problemset/problem/1807/E | [
"binary search",
"implementation",
"interactive"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17275
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1807-D | codeforces | 1807-D | Odd Queries | https://codeforces.com/problemset/problem/1807/D | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 61628
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1807-C | codeforces | 1807-C | Find and Replace | https://codeforces.com/problemset/problem/1807/C | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34811
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1807-B | codeforces | 1807-B | Grab the Candies | https://codeforces.com/problemset/problem/1807/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 50286
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1807-A | codeforces | 1807-A | Plus or Minus | https://codeforces.com/problemset/problem/1807/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 87588
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1806-F2 | codeforces | 1806-F2 | GCD Master (hard version) | https://codeforces.com/problemset/problem/1806/F2 | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 489
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1806-F1 | codeforces | 1806-F1 | GCD Master (easy version) | https://codeforces.com/problemset/problem/1806/F1 | [
"greedy",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 485
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1806-E | codeforces | 1806-E | Tree Master | https://codeforces.com/problemset/problem/1806/E | [
"brute force",
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3525
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1806-D | codeforces | 1806-D | DSU Master | https://codeforces.com/problemset/problem/1806/D | [
"combinatorics",
"dp",
"dsu",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1266
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1806-C | codeforces | 1806-C | Sequence Master | https://codeforces.com/problemset/problem/1806/C | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8782
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1806-B | codeforces | 1806-B | Mex Master | https://codeforces.com/problemset/problem/1806/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 19972
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1806-A | codeforces | 1806-A | Walking Master | https://codeforces.com/problemset/problem/1806/A | [
"geometry",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 47233
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1805-F2 | codeforces | 1805-F2 | Survival of the Weakest (hard version) | https://codeforces.com/problemset/problem/1805/F2 | [
"greedy",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 536
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1805-F1 | codeforces | 1805-F1 | Survival of the Weakest (easy version) | https://codeforces.com/problemset/problem/1805/F1 | [
"binary search",
"brute force",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1428
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1805-E | codeforces | 1805-E | There Should Be a Lot of Maximums | https://codeforces.com/problemset/problem/1805/E | [
"brute force",
"data structures",
"dfs and similar",
"dp",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1963
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1805-D | codeforces | 1805-D | A Wide, Wide Graph | https://codeforces.com/problemset/problem/1805/D | [
"dfs and similar",
"dp",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9653
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1805-C | codeforces | 1805-C | Place for a Selfie | https://codeforces.com/problemset/problem/1805/C | [
"binary search",
"data structures",
"geometry",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14395
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1805-B | codeforces | 1805-B | The String Has a Target | https://codeforces.com/problemset/problem/1805/B | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20471
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1805-A | codeforces | 1805-A | We Need the Zero | https://codeforces.com/problemset/problem/1805/A | [
"bitmasks",
"brute force"
] | null | null | stdin_stdout | 800 | {
"solved_count": 45761
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1804-H | codeforces | 1804-H | Code Lock | https://codeforces.com/problemset/problem/1804/H | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 277
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1804-G | codeforces | 1804-G | Flow Control | https://codeforces.com/problemset/problem/1804/G | [
"data structures",
"dsu",
"implementation"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 336
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1804-F | codeforces | 1804-F | Approximate Diameter | https://codeforces.com/problemset/problem/1804/F | [
"binary search",
"divide and conquer",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1213
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1804-E | codeforces | 1804-E | Routing | https://codeforces.com/problemset/problem/1804/E | [
"bitmasks",
"brute force",
"dfs and similar",
"dp",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1746
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1804-D | codeforces | 1804-D | Accommodation | https://codeforces.com/problemset/problem/1804/D | [
"brute force",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5352
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1804-C | codeforces | 1804-C | Pull Your Luck | https://codeforces.com/problemset/problem/1804/C | [
"brute force",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14027
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1804-B | codeforces | 1804-B | Vaccination | https://codeforces.com/problemset/problem/1804/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 15789
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1804-A | codeforces | 1804-A | Lame King | https://codeforces.com/problemset/problem/1804/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18764
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1802-B | codeforces | 1802-B | Settlement of Guinea Pigs | https://codeforces.com/problemset/problem/1802/B | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 14857
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1802-A | codeforces | 1802-A | Likes | https://codeforces.com/problemset/problem/1802/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16775
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1801-G | codeforces | 1801-G | A task for substrings | https://codeforces.com/problemset/problem/1801/G | [
"data structures",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 742
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1801-F | codeforces | 1801-F | Another n-dimensional chocolate bar | https://codeforces.com/problemset/problem/1801/F | [
"dp",
"math",
"meet-in-the-middle",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 759
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1801-E | codeforces | 1801-E | Gasoline prices | https://codeforces.com/problemset/problem/1801/E | [
"data structures",
"divide and conquer",
"dsu",
"hashing",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 778
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1801-D | codeforces | 1801-D | The way home | https://codeforces.com/problemset/problem/1801/D | [
"binary search",
"data structures",
"dp",
"graphs",
"greedy",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2966
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1801-C | codeforces | 1801-C | Music Festival | https://codeforces.com/problemset/problem/1801/C | [
"binary search",
"data structures",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4180
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1801-B | codeforces | 1801-B | Buying gifts | https://codeforces.com/problemset/problem/1801/B | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7756
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1801-A | codeforces | 1801-A | The Very Beautiful Blanket | https://codeforces.com/problemset/problem/1801/A | [
"bitmasks",
"constructive algorithms"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9903
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1800-G | codeforces | 1800-G | Symmetree | https://codeforces.com/problemset/problem/1800/G | [
"dfs and similar",
"hashing",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2649
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1800-F | codeforces | 1800-F | Dasha and Nightmares | https://codeforces.com/problemset/problem/1800/F | [
"bitmasks",
"hashing",
"meet-in-the-middle",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4890
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1800-E2 | codeforces | 1800-E2 | Unforgivable Curse (hard version) | https://codeforces.com/problemset/problem/1800/E2 | [
"brute force",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15625
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1800-E1 | codeforces | 1800-E1 | Unforgivable Curse (easy version) | https://codeforces.com/problemset/problem/1800/E1 | [
"brute force",
"constructive algorithms",
"dsu",
"graphs",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15976
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1800-D | codeforces | 1800-D | Remove Two Letters | https://codeforces.com/problemset/problem/1800/D | [
"data structures",
"greedy",
"hashing",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 30293
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1800-C2 | codeforces | 1800-C2 | Powering the Hero (hard version) | https://codeforces.com/problemset/problem/1800/C2 | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 27856
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1800-C1 | codeforces | 1800-C1 | Powering the Hero (easy version) | https://codeforces.com/problemset/problem/1800/C1 | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 27614
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1800-B | codeforces | 1800-B | Count the Number of Pairs | https://codeforces.com/problemset/problem/1800/B | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 29004
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1800-A | codeforces | 1800-A | Is It a Cat? | https://codeforces.com/problemset/problem/1800/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 37484
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1799-H | codeforces | 1799-H | Tree Cutting | https://codeforces.com/problemset/problem/1799/H | [
"bitmasks",
"dfs and similar",
"dp"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 493
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1799-G | codeforces | 1799-G | Count Voting | https://codeforces.com/problemset/problem/1799/G | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1121
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1799-F | codeforces | 1799-F | Halve or Subtract | https://codeforces.com/problemset/problem/1799/F | [
"binary search",
"brute force",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1113
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1799-E | codeforces | 1799-E | City Union | https://codeforces.com/problemset/problem/1799/E | [
"constructive algorithms",
"dfs and similar",
"dsu",
"geometry",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1435
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1799-D2 | codeforces | 1799-D2 | Hot Start Up (hard version) | https://codeforces.com/problemset/problem/1799/D2 | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3162
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1799-D1 | codeforces | 1799-D1 | Hot Start Up (easy version) | https://codeforces.com/problemset/problem/1799/D1 | [
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6032
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1799-C | codeforces | 1799-C | Double Lexicographically Minimum | https://codeforces.com/problemset/problem/1799/C | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7038
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1799-B | codeforces | 1799-B | Equalize by Divide | https://codeforces.com/problemset/problem/1799/B | [
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12971
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1799-A | codeforces | 1799-A | Recent Actions | https://codeforces.com/problemset/problem/1799/A | [
"data structures",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12458
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1798-F | codeforces | 1798-F | Gifts from Grandfather Ahmed | https://codeforces.com/problemset/problem/1798/F | [
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 693
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1798-E | codeforces | 1798-E | Multitest Generator | https://codeforces.com/problemset/problem/1798/E | [
"brute force",
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2116
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1798-D | codeforces | 1798-D | Shocking Arrangement | https://codeforces.com/problemset/problem/1798/D | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14873
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1798-C | codeforces | 1798-C | Candy Store | https://codeforces.com/problemset/problem/1798/C | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9572
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1798-B | codeforces | 1798-B | Three Sevens | https://codeforces.com/problemset/problem/1798/B | [
"brute force",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19056
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1798-A | codeforces | 1798-A | Showstopper | https://codeforces.com/problemset/problem/1798/A | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21167
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1797-F | codeforces | 1797-F | Li Hua and Path | https://codeforces.com/problemset/problem/1797/F | [
"data structures",
"dfs and similar",
"divide and conquer",
"dsu",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 706
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1797-E | codeforces | 1797-E | Li Hua and Array | https://codeforces.com/problemset/problem/1797/E | [
"brute force",
"data structures",
"dsu",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1697
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1797-D | codeforces | 1797-D | Li Hua and Tree | https://codeforces.com/problemset/problem/1797/D | [
"brute force",
"data structures",
"dfs and similar",
"dp",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4713
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1797-C | codeforces | 1797-C | Li Hua and Chess | https://codeforces.com/problemset/problem/1797/C | [
"constructive algorithms",
"greedy",
"interactive"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9088
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1797-B | codeforces | 1797-B | Li Hua and Pattern | https://codeforces.com/problemset/problem/1797/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 26403
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1797-A | codeforces | 1797-A | Li Hua and Maze | https://codeforces.com/problemset/problem/1797/A | [
"constructive algorithms",
"flows",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19684
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1796-F | codeforces | 1796-F | Strange Triples | https://codeforces.com/problemset/problem/1796/F | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 261
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1796-E | codeforces | 1796-E | Colored Subgraphs | https://codeforces.com/problemset/problem/1796/E | [
"dfs and similar",
"dp",
"games",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1078
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1796-D | codeforces | 1796-D | Maximum Subarray | https://codeforces.com/problemset/problem/1796/D | [
"data structures",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5582
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1796-C | codeforces | 1796-C | Maximum Set | https://codeforces.com/problemset/problem/1796/C | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12390
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1796-B | codeforces | 1796-B | Asterisk-Minor Template | https://codeforces.com/problemset/problem/1796/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 18514
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1796-A | codeforces | 1796-A | Typical Interview Problem | https://codeforces.com/problemset/problem/1796/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19776
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1795-G | codeforces | 1795-G | Removal Sequences | https://codeforces.com/problemset/problem/1795/G | [
"bitmasks",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 855
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1795-F | codeforces | 1795-F | Blocking Chips | https://codeforces.com/problemset/problem/1795/F | [
"binary search",
"constructive algorithms",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1413
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1795-E | codeforces | 1795-E | Explosions? | https://codeforces.com/problemset/problem/1795/E | [
"binary search",
"data structures",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2444
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1795-D | codeforces | 1795-D | Triangle Coloring | https://codeforces.com/problemset/problem/1795/D | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13811
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1795-C | codeforces | 1795-C | Tea Tasting | https://codeforces.com/problemset/problem/1795/C | [
"binary search",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 19089
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1795-B | codeforces | 1795-B | Ideal Point | https://codeforces.com/problemset/problem/1795/B | [
"brute force",
"geometry",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 24413
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1795-A | codeforces | 1795-A | Two Towers | https://codeforces.com/problemset/problem/1795/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24795
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1794-E | codeforces | 1794-E | Labeling the Tree with Distances | https://codeforces.com/problemset/problem/1794/E | [
"data structures",
"dp",
"greedy",
"hashing",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1587
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1794-D | codeforces | 1794-D | Counting Factorizations | https://codeforces.com/problemset/problem/1794/D | [
"combinatorics",
"divide and conquer",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4629
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1794-C | codeforces | 1794-C | Scoring Subsequences | https://codeforces.com/problemset/problem/1794/C | [
"binary search",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 23596
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1794-B | codeforces | 1794-B | Not Dividing | https://codeforces.com/problemset/problem/1794/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 43359
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1794-A | codeforces | 1794-A | Prefix and Suffix Array | https://codeforces.com/problemset/problem/1794/A | [
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19083
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1793-F | codeforces | 1793-F | Rebrending | https://codeforces.com/problemset/problem/1793/F | [
"brute force",
"data structures",
"divide and conquer",
"implementation"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1667
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1793-E | codeforces | 1793-E | Velepin and Marketing | https://codeforces.com/problemset/problem/1793/E | [
"binary search",
"data structures",
"dp",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1374
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1793-D | codeforces | 1793-D | Moscow Gorillas | https://codeforces.com/problemset/problem/1793/D | [
"binary search",
"dp",
"greedy",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7247
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1793-C | codeforces | 1793-C | Dora and Search | https://codeforces.com/problemset/problem/1793/C | [
"constructive algorithms",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 35530
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1793-B | codeforces | 1793-B | Fedya and Array | https://codeforces.com/problemset/problem/1793/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17263
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1793-A | codeforces | 1793-A | Yet Another Promotion | https://codeforces.com/problemset/problem/1793/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18905
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1792-F2 | codeforces | 1792-F2 | Graph Coloring (hard version) | https://codeforces.com/problemset/problem/1792/F2 | [
"brute force",
"combinatorics",
"divide and conquer",
"dp",
"fft",
"graphs"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 570
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1792-F1 | codeforces | 1792-F1 | Graph Coloring (easy version) | https://codeforces.com/problemset/problem/1792/F1 | [
"combinatorics",
"dp",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1045
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1792-E | codeforces | 1792-E | Divisors and Table | https://codeforces.com/problemset/problem/1792/E | [
"brute force",
"dfs and similar",
"dp",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1633
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1792-D | codeforces | 1792-D | Fixed Prefix Permutations | https://codeforces.com/problemset/problem/1792/D | [
"binary search",
"bitmasks",
"data structures",
"hashing",
"math",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8371
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1792-C | codeforces | 1792-C | Min Max Sort | https://codeforces.com/problemset/problem/1792/C | [
"binary search",
"brute force",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 17124
} | 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.