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:1993-E | codeforces | 1993-E | Xor-Grid Problem | https://codeforces.com/problemset/problem/1993/E | [
"bitmasks",
"constructive algorithms",
"dp",
"implementation"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 749
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1993-D | codeforces | 1993-D | Med-imize | https://codeforces.com/problemset/problem/1993/D | [
"binary search",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4641
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1993-C | codeforces | 1993-C | Light Switches | https://codeforces.com/problemset/problem/1993/C | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16653
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1993-B | codeforces | 1993-B | Parity and Sum | https://codeforces.com/problemset/problem/1993/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 27145
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1993-A | codeforces | 1993-A | Question Marks | https://codeforces.com/problemset/problem/1993/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33628
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1992-G | codeforces | 1992-G | Ultra-Meow | https://codeforces.com/problemset/problem/1992/G | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4406
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1992-F | codeforces | 1992-F | Valuable Cards | https://codeforces.com/problemset/problem/1992/F | [
"brute force",
"dp",
"greedy",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8015
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1992-E | codeforces | 1992-E | Novice's Mistake | https://codeforces.com/problemset/problem/1992/E | [
"brute force",
"constructive algorithms",
"implementation",
"math",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11112
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1992-D | codeforces | 1992-D | Test of Love | https://codeforces.com/problemset/problem/1992/D | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 24826
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1992-C | codeforces | 1992-C | Gorilla and Permutation | https://codeforces.com/problemset/problem/1992/C | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 34168
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1992-B | codeforces | 1992-B | Angry Monk | https://codeforces.com/problemset/problem/1992/B | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 38805
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1992-A | codeforces | 1992-A | Only Pluses | https://codeforces.com/problemset/problem/1992/A | [
"brute force",
"constructive algorithms",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 50722
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1991-I | codeforces | 1991-I | Grid Game | https://codeforces.com/problemset/problem/1991/I | [
"constructive algorithms",
"games",
"graph matchings",
"greedy",
"interactive"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 173
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1991-H | codeforces | 1991-H | Prime Split Game | https://codeforces.com/problemset/problem/1991/H | [
"bitmasks",
"dp",
"fft",
"games",
"math",
"number theory"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 591
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1991-G | codeforces | 1991-G | Grid Reset | https://codeforces.com/problemset/problem/1991/G | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 768
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1991-F | codeforces | 1991-F | Triangle Formation | https://codeforces.com/problemset/problem/1991/F | [
"brute force",
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2887
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1991-E | codeforces | 1991-E | Coloring Game | https://codeforces.com/problemset/problem/1991/E | [
"constructive algorithms",
"dfs and similar",
"games",
"graphs",
"greedy",
"interactive"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5329
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1991-D | codeforces | 1991-D | Prime XOR Coloring | https://codeforces.com/problemset/problem/1991/D | [
"bitmasks",
"constructive algorithms",
"graphs",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8162
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1991-C | codeforces | 1991-C | Absolute Zero | https://codeforces.com/problemset/problem/1991/C | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18240
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1991-B | codeforces | 1991-B | AND Reconstruction | https://codeforces.com/problemset/problem/1991/B | [
"bitmasks",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19353
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1991-A | codeforces | 1991-A | Maximize the Last Element | https://codeforces.com/problemset/problem/1991/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24693
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1990-F | codeforces | 1990-F | Polygonal Segments | https://codeforces.com/problemset/problem/1990/F | [
"brute force",
"data structures",
"divide and conquer",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 492
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1990-E2 | codeforces | 1990-E2 | Catch the Mole(Hard Version) | https://codeforces.com/problemset/problem/1990/E2 | [
"binary search",
"data structures",
"dfs and similar",
"divide and conquer",
"interactive",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1234
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1990-E1 | codeforces | 1990-E1 | Catch the Mole(Easy Version) | https://codeforces.com/problemset/problem/1990/E1 | [
"binary search",
"data structures",
"dfs and similar",
"interactive",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1258
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1990-D | codeforces | 1990-D | Grid Puzzle | https://codeforces.com/problemset/problem/1990/D | [
"bitmasks",
"brute force",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8063
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1990-C | codeforces | 1990-C | Mad MAD Sum | https://codeforces.com/problemset/problem/1990/C | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15084
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1990-B | codeforces | 1990-B | Array Craft | https://codeforces.com/problemset/problem/1990/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 20311
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1990-A | codeforces | 1990-A | Submission Bait | https://codeforces.com/problemset/problem/1990/A | [
"brute force",
"games",
"greedy",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 27543
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1989-F | codeforces | 1989-F | Simultaneous Coloring | https://codeforces.com/problemset/problem/1989/F | [
"dfs and similar",
"divide and conquer",
"graphs"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 647
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1989-E | codeforces | 1989-E | Distance to Different | https://codeforces.com/problemset/problem/1989/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2636
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1989-D | codeforces | 1989-D | Smithing Skill | https://codeforces.com/problemset/problem/1989/D | [
"brute force",
"data structures",
"dp",
"greedy",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7351
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1989-C | codeforces | 1989-C | Two Movies | https://codeforces.com/problemset/problem/1989/C | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 23362
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1989-B | codeforces | 1989-B | Substring and Subsequence | https://codeforces.com/problemset/problem/1989/B | [
"brute force",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 23843
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1989-A | codeforces | 1989-A | Catch the Coin | https://codeforces.com/problemset/problem/1989/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29960
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1988-F | codeforces | 1988-F | Heartbeat | https://codeforces.com/problemset/problem/1988/F | [
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 605
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1988-E | codeforces | 1988-E | Range Minimum Sum | https://codeforces.com/problemset/problem/1988/E | [
"binary search",
"brute force",
"data structures",
"divide and conquer",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1901
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1988-D | codeforces | 1988-D | The Omnipotent Monster Killer | https://codeforces.com/problemset/problem/1988/D | [
"brute force",
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6295
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1988-C | codeforces | 1988-C | Increasing Sequence with Fixed OR | https://codeforces.com/problemset/problem/1988/C | [
"bitmasks",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 20845
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1988-B | codeforces | 1988-B | Make Majority | https://codeforces.com/problemset/problem/1988/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 27049
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1988-A | codeforces | 1988-A | Split the Multiset | https://codeforces.com/problemset/problem/1988/A | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 27625
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1987-H | codeforces | 1987-H | Fumo Temple | https://codeforces.com/problemset/problem/1987/H | [
"interactive"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 171
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1987-G2 | codeforces | 1987-G2 | Spinning Round (Hard Version) | https://codeforces.com/problemset/problem/1987/G2 | [
"divide and conquer",
"dp",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 257
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1987-G1 | codeforces | 1987-G1 | Spinning Round (Easy Version) | https://codeforces.com/problemset/problem/1987/G1 | [
"divide and conquer",
"dp",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 364
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1987-F2 | codeforces | 1987-F2 | Interesting Problem (Hard Version) | https://codeforces.com/problemset/problem/1987/F2 | [
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1425
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1987-F1 | codeforces | 1987-F1 | Interesting Problem (Easy Version) | https://codeforces.com/problemset/problem/1987/F1 | [
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1441
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1987-E | codeforces | 1987-E | Wonderful Tree! | https://codeforces.com/problemset/problem/1987/E | [
"brute force",
"data structures",
"dfs and similar",
"dsu",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4234
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1987-D | codeforces | 1987-D | World is Mine | https://codeforces.com/problemset/problem/1987/D | [
"dp",
"games"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9120
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1987-C | codeforces | 1987-C | Basil's Garden | https://codeforces.com/problemset/problem/1987/C | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 21397
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1987-B | codeforces | 1987-B | K-Sort | https://codeforces.com/problemset/problem/1987/B | [
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 24487
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1987-A | codeforces | 1987-A | Upload More RAM | https://codeforces.com/problemset/problem/1987/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29571
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1986-G2 | codeforces | 1986-G2 | Permutation Problem (Hard Version) | https://codeforces.com/problemset/problem/1986/G2 | [
"brute force",
"data structures",
"hashing",
"math",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1567
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1986-G1 | codeforces | 1986-G1 | Permutation Problem (Simple Version) | https://codeforces.com/problemset/problem/1986/G1 | [
"binary search",
"brute force",
"combinatorics",
"data structures",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2009
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1986-F | codeforces | 1986-F | Non-academic Problem | https://codeforces.com/problemset/problem/1986/F | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7101
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1986-E | codeforces | 1986-E | Beautiful Array | https://codeforces.com/problemset/problem/1986/E | [
"greedy",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11268
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1986-D | codeforces | 1986-D | Mathematical Problem | https://codeforces.com/problemset/problem/1986/D | [
"brute force",
"dp",
"greedy",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 18491
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1986-C | codeforces | 1986-C | Update Queries | https://codeforces.com/problemset/problem/1986/C | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 26521
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1986-B | codeforces | 1986-B | Matrix Stabilization | https://codeforces.com/problemset/problem/1986/B | [
"brute force",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 30662
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1986-A | codeforces | 1986-A | X Axis | https://codeforces.com/problemset/problem/1986/A | [
"brute force",
"geometry",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 49191
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1985-H2 | codeforces | 1985-H2 | Maximize the Largest Component (Hard Version) | https://codeforces.com/problemset/problem/1985/H2 | [
"data structures",
"dfs and similar",
"dp",
"dsu",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2039
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1985-H1 | codeforces | 1985-H1 | Maximize the Largest Component (Easy Version) | https://codeforces.com/problemset/problem/1985/H1 | [
"brute force",
"data structures",
"dfs and similar",
"dsu",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7589
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1985-G | codeforces | 1985-G | D-Function | https://codeforces.com/problemset/problem/1985/G | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12821
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1985-F | codeforces | 1985-F | Final Boss | https://codeforces.com/problemset/problem/1985/F | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 20965
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1985-E | codeforces | 1985-E | Secret Box | https://codeforces.com/problemset/problem/1985/E | [
"brute force",
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 24148
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1985-D | codeforces | 1985-D | Manhattan Circle | https://codeforces.com/problemset/problem/1985/D | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 42527
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1985-C | codeforces | 1985-C | Good Prefixes | https://codeforces.com/problemset/problem/1985/C | [
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 41764
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1985-B | codeforces | 1985-B | Maximum Multiple Sum | https://codeforces.com/problemset/problem/1985/B | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 58783
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1985-A | codeforces | 1985-A | Creating Words | https://codeforces.com/problemset/problem/1985/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 76116
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1984-H | codeforces | 1984-H | Tower Capturing | https://codeforces.com/problemset/problem/1984/H | [
"combinatorics",
"dp",
"geometry"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 311
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1984-G | codeforces | 1984-G | Magic Trick II | https://codeforces.com/problemset/problem/1984/G | [
"constructive algorithms",
"implementation",
"sortings"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 338
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1984-F | codeforces | 1984-F | Reconstruction | https://codeforces.com/problemset/problem/1984/F | [
"brute force",
"dp",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1203
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1984-E | codeforces | 1984-E | Shuffle | https://codeforces.com/problemset/problem/1984/E | [
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1936
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1984-D | codeforces | 1984-D | ''a'' String Problem | https://codeforces.com/problemset/problem/1984/D | [
"brute force",
"hashing",
"implementation",
"math",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4021
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1984-C2 | codeforces | 1984-C2 | Magnitude (Hard Version) | https://codeforces.com/problemset/problem/1984/C2 | [
"combinatorics",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8962
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1984-C1 | codeforces | 1984-C1 | Magnitude (Easy Version) | https://codeforces.com/problemset/problem/1984/C1 | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 20840
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1984-B | codeforces | 1984-B | Large Addition | https://codeforces.com/problemset/problem/1984/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21396
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1984-A | codeforces | 1984-A | Strange Splitting | https://codeforces.com/problemset/problem/1984/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23060
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1983-G | codeforces | 1983-G | Your Loss | https://codeforces.com/problemset/problem/1983/G | [
"bitmasks",
"brute force",
"dp",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 370
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1983-F | codeforces | 1983-F | array-value | https://codeforces.com/problemset/problem/1983/F | [
"binary search",
"bitmasks",
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1646
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1983-E | codeforces | 1983-E | I Love Balls | https://codeforces.com/problemset/problem/1983/E | [
"combinatorics",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2622
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1983-D | codeforces | 1983-D | Swap Dilemma | https://codeforces.com/problemset/problem/1983/D | [
"constructive algorithms",
"data structures",
"divide and conquer",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11906
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1983-C | codeforces | 1983-C | Have Your Cake and Eat It Too | https://codeforces.com/problemset/problem/1983/C | [
"binary search",
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15087
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1983-B | codeforces | 1983-B | Corner Twist | https://codeforces.com/problemset/problem/1983/B | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18761
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1983-A | codeforces | 1983-A | Array Divisibility | https://codeforces.com/problemset/problem/1983/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28366
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1982-F | codeforces | 1982-F | Sorting Problem Again | https://codeforces.com/problemset/problem/1982/F | [
"binary search",
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1427
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1982-E | codeforces | 1982-E | Number of k-good subarrays | https://codeforces.com/problemset/problem/1982/E | [
"bitmasks",
"brute force",
"combinatorics",
"divide and conquer",
"dp",
"math",
"meet-in-the-middle"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1975
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1982-D | codeforces | 1982-D | Beauty of the mountains | https://codeforces.com/problemset/problem/1982/D | [
"brute force",
"data structures",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10544
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1982-C | codeforces | 1982-C | Boring Day | https://codeforces.com/problemset/problem/1982/C | [
"binary search",
"data structures",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 22629
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1982-B | codeforces | 1982-B | Collatz Conjecture | https://codeforces.com/problemset/problem/1982/B | [
"brute force",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 20217
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1982-A | codeforces | 1982-A | Soccer | https://codeforces.com/problemset/problem/1982/A | [
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27772
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1981-F | codeforces | 1981-F | Turtle and Paths on a Tree | https://codeforces.com/problemset/problem/1981/F | [
"data structures",
"dp",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 382
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1981-E | codeforces | 1981-E | Turtle and Intersected Segments | https://codeforces.com/problemset/problem/1981/E | [
"data structures",
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1379
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1981-D | codeforces | 1981-D | Turtle and Multiplication | https://codeforces.com/problemset/problem/1981/D | [
"constructive algorithms",
"dfs and similar",
"graphs",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2276
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1981-C | codeforces | 1981-C | Turtle and an Incomplete Sequence | https://codeforces.com/problemset/problem/1981/C | [
"bitmasks",
"brute force",
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6519
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1981-B | codeforces | 1981-B | Turtle and an Infinite Sequence | https://codeforces.com/problemset/problem/1981/B | [
"bitmasks",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16965
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1981-A | codeforces | 1981-A | Turtle and Piggy Are Playing a Game | https://codeforces.com/problemset/problem/1981/A | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24453
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1980-G | codeforces | 1980-G | Yasya and the Mysterious Tree | https://codeforces.com/problemset/problem/1980/G | [
"bitmasks",
"data structures",
"dfs and similar",
"graphs",
"greedy",
"strings",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1837
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1980-F2 | codeforces | 1980-F2 | Field Division (hard version) | https://codeforces.com/problemset/problem/1980/F2 | [
"math",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1292
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1980-F1 | codeforces | 1980-F1 | Field Division (easy version) | https://codeforces.com/problemset/problem/1980/F1 | [
"data structures",
"math",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4543
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1980-E | codeforces | 1980-E | Permutation of Rows and Columns | https://codeforces.com/problemset/problem/1980/E | [
"constructive algorithms",
"data structures",
"greedy",
"hashing",
"implementation",
"math",
"matrices",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13511
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:1980-D | codeforces | 1980-D | GCD-sequence | https://codeforces.com/problemset/problem/1980/D | [
"greedy",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17936
} | 2026-10-26T04:20:41.456672+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.