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:2205-C | codeforces | 2205-C | Simons and Posting Blogs | https://codeforces.com/problemset/problem/2205/C | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9043
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2205-B | codeforces | 2205-B | Simons and Cakes for Success | https://codeforces.com/problemset/problem/2205/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17958
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2205-A | codeforces | 2205-A | Simons and Making It Beautiful | https://codeforces.com/problemset/problem/2205/A | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19027
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2204-G | codeforces | 2204-G | Grid Path | https://codeforces.com/problemset/problem/2204/G | [
"dp",
"graphs",
"matrices"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 629
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2204-F | codeforces | 2204-F | Sum of Fractions | https://codeforces.com/problemset/problem/2204/F | [
"binary search",
"brute force",
"combinatorics",
"data structures",
"greedy",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1399
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2204-E | codeforces | 2204-E | Sum of Digits (and Again) | https://codeforces.com/problemset/problem/2204/E | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5406
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2204-D | codeforces | 2204-D | Alternating Path | https://codeforces.com/problemset/problem/2204/D | [
"constructive algorithms",
"dfs and similar",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10468
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2204-C | codeforces | 2204-C | Spring | https://codeforces.com/problemset/problem/2204/C | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 20471
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2204-B | codeforces | 2204-B | Right Maximum | https://codeforces.com/problemset/problem/2204/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21771
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2204-A | codeforces | 2204-A | Passing the Ball | https://codeforces.com/problemset/problem/2204/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24027
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2203-F | codeforces | 2203-F | Binary Search with One Swap | https://codeforces.com/problemset/problem/2203/F | [
"binary search",
"divide and conquer",
"dp",
"hashing",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 487
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2203-E | codeforces | 2203-E | Probabilistic Card Game | https://codeforces.com/problemset/problem/2203/E | [
"binary search",
"data structures",
"games",
"greedy",
"math",
"ternary search"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1583
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2203-D | codeforces | 2203-D | Divisibility Game | https://codeforces.com/problemset/problem/2203/D | [
"brute force",
"games",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6393
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2203-C | codeforces | 2203-C | Test Generator | https://codeforces.com/problemset/problem/2203/C | [
"binary search",
"bitmasks",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8326
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2203-B | codeforces | 2203-B | Beautiful Numbers | https://codeforces.com/problemset/problem/2203/B | [
"bitmasks",
"dp",
"fft",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17051
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2203-A | codeforces | 2203-A | Towers of Boxes | https://codeforces.com/problemset/problem/2203/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20477
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2202-G1 | codeforces | 2202-G1 | Monotone Monochrome Matrices (Easy Version) | https://codeforces.com/problemset/problem/2202/G1 | [
"data structures"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 341
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2202-B | codeforces | 2202-B | ABAB Construction | https://codeforces.com/problemset/problem/2202/B | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 13124
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2202-A | codeforces | 2202-A | Parkour Design | https://codeforces.com/problemset/problem/2202/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17829
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2201-G | codeforces | 2201-G | Codeforces Heuristic Contest 1001 | https://codeforces.com/problemset/problem/2201/G | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 86
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2201-F2 | codeforces | 2201-F2 | Monotone Monochrome Matrices (Hard Version) | https://codeforces.com/problemset/problem/2201/F2 | [
"constructive algorithms",
"data structures",
"hashing",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 487
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2201-F1 | codeforces | 2201-F1 | Monotone Monochrome Matrices (Medium Version) | https://codeforces.com/problemset/problem/2201/F1 | [
"data structures",
"hashing"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 331
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2201-E | codeforces | 2201-E | ABBA Counting | https://codeforces.com/problemset/problem/2201/E | [
"fft",
"math",
"number theory",
"strings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 316
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2201-D | codeforces | 2201-D | Binary Not Search and Queries | https://codeforces.com/problemset/problem/2201/D | [
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 895
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2201-C | codeforces | 2201-C | Rigged Bracket Sequence | https://codeforces.com/problemset/problem/2201/C | [
"combinatorics",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2315
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2201-B | codeforces | 2201-B | Recollect Numbers | https://codeforces.com/problemset/problem/2201/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5665
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2201-A2 | codeforces | 2201-A2 | Lost Civilization (Hard Version) | https://codeforces.com/problemset/problem/2201/A2 | [
"data structures",
"dp"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5745
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2201-A1 | codeforces | 2201-A1 | Lost Civilization (Easy Version) | https://codeforces.com/problemset/problem/2201/A1 | [
"data structures"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12746
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2200-H | codeforces | 2200-H | Six Seven | https://codeforces.com/problemset/problem/2200/H | [
"divide and conquer",
"math",
"number theory",
"strings",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 584
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2200-G | codeforces | 2200-G | Operation Permutation | https://codeforces.com/problemset/problem/2200/G | [
"combinatorics",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1341
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2200-F | codeforces | 2200-F | Mooclear Reactor 2 | https://codeforces.com/problemset/problem/2200/F | [
"brute force",
"data structures",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3450
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2200-E | codeforces | 2200-E | Divisive Battle | https://codeforces.com/problemset/problem/2200/E | [
"games",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9785
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2200-D | codeforces | 2200-D | Portal | https://codeforces.com/problemset/problem/2200/D | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14210
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2200-C | codeforces | 2200-C | Specialty String | https://codeforces.com/problemset/problem/2200/C | [
"brute force",
"greedy",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 25308
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2200-B | codeforces | 2200-B | Deletion Sort | https://codeforces.com/problemset/problem/2200/B | [
"bitmasks",
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29084
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2200-A | codeforces | 2200-A | Eating Game | https://codeforces.com/problemset/problem/2200/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32472
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2199-I | codeforces | 2199-I | Strange Process | https://codeforces.com/problemset/problem/2199/I | [
"*special"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 49
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2199-H | codeforces | 2199-H | Sum of MEX | https://codeforces.com/problemset/problem/2199/H | [
"*special",
"combinatorics",
"data structures",
"dp",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 120
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2199-G | codeforces | 2199-G | Jammer | https://codeforces.com/problemset/problem/2199/G | [
"*special",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 69
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2199-F | codeforces | 2199-F | Self-Produced Sequences | https://codeforces.com/problemset/problem/2199/F | [
"*special",
"combinatorics",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 192
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2199-E | codeforces | 2199-E | Supersequence | https://codeforces.com/problemset/problem/2199/E | [
"*special",
"binary search",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 199
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2199-D | codeforces | 2199-D | Two Arrays | https://codeforces.com/problemset/problem/2199/D | [
"*special",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 349
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2199-C | codeforces | 2199-C | Minesweeper | https://codeforces.com/problemset/problem/2199/C | [
"*special",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 588
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2199-B | codeforces | 2199-B | Two Towers | https://codeforces.com/problemset/problem/2199/B | [
"*special",
"greedy",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 1291
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2199-A | codeforces | 2199-A | Game | https://codeforces.com/problemset/problem/2199/A | [
"*special"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 1849
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2197-B | codeforces | 2197-B | Array and Permutation | https://codeforces.com/problemset/problem/2197/B | [
"implementation",
"schedules",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17419
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2197-A | codeforces | 2197-A | Friendly Numbers | https://codeforces.com/problemset/problem/2197/A | [
"binary search",
"brute force",
"expression parsing",
"math",
"schedules"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24559
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2196-F | codeforces | 2196-F | Indivisible | https://codeforces.com/problemset/problem/2196/F | [
"brute force",
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 145
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2196-E2 | codeforces | 2196-E2 | Fuzzy Concatenation (Hard version) | https://codeforces.com/problemset/problem/2196/E2 | [
"binary search",
"bitmasks",
"data structures",
"dp",
"greedy",
"string suffix structures"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 255
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2196-E1 | codeforces | 2196-E1 | Fuzzy Concatenation (Easy Version) | https://codeforces.com/problemset/problem/2196/E1 | [
"binary search",
"bitmasks",
"brute force",
"data structures",
"greedy",
"string suffix structures"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 329
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2196-D | codeforces | 2196-D | Double Bracket Sequence | https://codeforces.com/problemset/problem/2196/D | [
"data structures",
"dp",
"expression parsing",
"flows",
"greedy",
"strings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1114
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2196-C2 | codeforces | 2196-C2 | Interactive Graph (Hard Version) | https://codeforces.com/problemset/problem/2196/C2 | [
"combinatorics",
"dfs and similar",
"dp",
"graphs",
"interactive"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2859
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2196-C1 | codeforces | 2196-C1 | Interactive Graph (Simple Version) | https://codeforces.com/problemset/problem/2196/C1 | [
"binary search",
"combinatorics",
"dfs and similar",
"dp",
"graphs",
"interactive"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4037
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2196-B | codeforces | 2196-B | Another Problem about Beautiful Pairs | https://codeforces.com/problemset/problem/2196/B | [
"brute force",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9750
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2196-A | codeforces | 2196-A | Game with a Fraction | https://codeforces.com/problemset/problem/2196/A | [
"games",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18089
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2195-H | codeforces | 2195-H | Codeforces Heuristic Contest 001 | https://codeforces.com/problemset/problem/2195/H | [
"brute force",
"constructive algorithms",
"geometry",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 550
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2195-G | codeforces | 2195-G | Idiot First Search and Queries | https://codeforces.com/problemset/problem/2195/G | [
"binary search",
"data structures",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1246
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2195-F | codeforces | 2195-F | Parabola Independence | https://codeforces.com/problemset/problem/2195/F | [
"dp",
"graphs",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3074
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2195-E | codeforces | 2195-E | Idiot First Search | https://codeforces.com/problemset/problem/2195/E | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9929
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2195-D | codeforces | 2195-D | Absolute Cinema | https://codeforces.com/problemset/problem/2195/D | [
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15442
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2195-C | codeforces | 2195-C | Dice Roll Sequence | https://codeforces.com/problemset/problem/2195/C | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22881
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2195-B | codeforces | 2195-B | Heapify 1 | https://codeforces.com/problemset/problem/2195/B | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 27716
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2195-A | codeforces | 2195-A | Sieve of Erato67henes | https://codeforces.com/problemset/problem/2195/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 39014
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2194-F2 | codeforces | 2194-F2 | Again Trees... (hard version) | https://codeforces.com/problemset/problem/2194/F2 | [
"bitmasks",
"data structures",
"dfs and similar",
"dp",
"fft",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 240
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2194-F1 | codeforces | 2194-F1 | Again Trees... (Easy Version) | https://codeforces.com/problemset/problem/2194/F1 | [
"bitmasks",
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1039
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2194-E | codeforces | 2194-E | The Turtle Strikes Back | https://codeforces.com/problemset/problem/2194/E | [
"dp",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2987
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2194-D | codeforces | 2194-D | Table Cut | https://codeforces.com/problemset/problem/2194/D | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9043
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2194-C | codeforces | 2194-C | Secret message | https://codeforces.com/problemset/problem/2194/C | [
"bitmasks",
"brute force",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12015
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2194-B | codeforces | 2194-B | Offshores | https://codeforces.com/problemset/problem/2194/B | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 20555
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2194-A | codeforces | 2194-A | Lawn Mower | https://codeforces.com/problemset/problem/2194/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25578
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2193-H | codeforces | 2193-H | Remove the Grail Tree | https://codeforces.com/problemset/problem/2193/H | [
"dfs and similar",
"dp",
"graphs",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1189
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2193-G | codeforces | 2193-G | Paths in a Tree | https://codeforces.com/problemset/problem/2193/G | [
"dfs and similar",
"interactive",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2477
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2193-F | codeforces | 2193-F | Pizza Delivery | https://codeforces.com/problemset/problem/2193/F | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9707
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2193-E | codeforces | 2193-E | Product Queries | https://codeforces.com/problemset/problem/2193/E | [
"dp",
"math",
"number theory",
"shortest paths"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16735
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2193-D | codeforces | 2193-D | Monster Game | https://codeforces.com/problemset/problem/2193/D | [
"binary search",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 23511
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2193-C | codeforces | 2193-C | Replace and Sum | https://codeforces.com/problemset/problem/2193/C | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 31206
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2193-B | codeforces | 2193-B | Reverse a Permutation | https://codeforces.com/problemset/problem/2193/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31865
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2193-A | codeforces | 2193-A | DBMB and the Array | https://codeforces.com/problemset/problem/2193/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 45334
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2192-F | codeforces | 2192-F | Fish Fight | https://codeforces.com/problemset/problem/2192/F | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 210
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2192-E | codeforces | 2192-E | Swap to Rearrange | https://codeforces.com/problemset/problem/2192/E | [
"constructive algorithms",
"dfs and similar",
"graph matchings",
"graphs",
"greedy",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2374
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2192-D | codeforces | 2192-D | Cost of Tree | https://codeforces.com/problemset/problem/2192/D | [
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4147
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2192-C | codeforces | 2192-C | All-in-one Gun | https://codeforces.com/problemset/problem/2192/C | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12676
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2192-B | codeforces | 2192-B | Flipping Binary String | https://codeforces.com/problemset/problem/2192/B | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16425
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2192-A | codeforces | 2192-A | String Rotation Game | https://codeforces.com/problemset/problem/2192/A | [
"brute force",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19329
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2191-B | codeforces | 2191-B | MEX Reordering | https://codeforces.com/problemset/problem/2191/B | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 21411
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2191-A | codeforces | 2191-A | Array Coloring | https://codeforces.com/problemset/problem/2191/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29225
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2190-G | codeforces | 2190-G | Maximize Determinant | https://codeforces.com/problemset/problem/2190/G | [
"graphs"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 113
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2190-F | codeforces | 2190-F | Xor Product | https://codeforces.com/problemset/problem/2190/F | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 112
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2190-E | codeforces | 2190-E | Median Permutation | https://codeforces.com/problemset/problem/2190/E | [
"combinatorics"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 274
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2190-D | codeforces | 2190-D | Prufer Vertex | https://codeforces.com/problemset/problem/2190/D | [
"combinatorics",
"dsu",
"number theory",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1053
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2190-C | codeforces | 2190-C | Comparable Permutations | https://codeforces.com/problemset/problem/2190/C | [
"greedy",
"implementation",
"interactive",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1405
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2190-B2 | codeforces | 2190-B2 | Sub-RBS (Hard Version) | https://codeforces.com/problemset/problem/2190/B2 | [
"dp",
"games",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3493
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2190-B1 | codeforces | 2190-B1 | Sub-RBS (Easy Version) | https://codeforces.com/problemset/problem/2190/B1 | [
"combinatorics",
"constructive algorithms",
"dp",
"greedy",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11870
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2190-A | codeforces | 2190-A | Sorting Game | https://codeforces.com/problemset/problem/2190/A | [
"constructive algorithms",
"games",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18809
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2189-F | codeforces | 2189-F | Zhora the Vacuum Cleaner | https://codeforces.com/problemset/problem/2189/F | [
"data structures",
"dfs and similar",
"dp",
"greedy",
"implementation",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 267
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2189-E | codeforces | 2189-E | Majority Wins? | https://codeforces.com/problemset/problem/2189/E | [
"constructive algorithms",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 931
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2189-D2 | codeforces | 2189-D2 | Little String (Hard Version) | https://codeforces.com/problemset/problem/2189/D2 | [
"combinatorics",
"dp",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2132
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2189-D1 | codeforces | 2189-D1 | Little String (Easy Version) | https://codeforces.com/problemset/problem/2189/D1 | [
"combinatorics",
"dp",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4361
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2189-C2 | codeforces | 2189-C2 | XOR-convenience (Hard Version) | https://codeforces.com/problemset/problem/2189/C2 | [
"bitmasks",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6680
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2189-C1 | codeforces | 2189-C1 | XOR Convenience (Easy Version) | https://codeforces.com/problemset/problem/2189/C1 | [
"bitmasks",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15107
} | 2026-10-12T05:34:17.574904+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.