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:1921-G | codeforces | 1921-G | Mischievous Shooter | https://codeforces.com/problemset/problem/1921/G | [
"brute force",
"data structures",
"divide and conquer",
"dp",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1481
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1921-F | codeforces | 1921-F | Sum of Progression | https://codeforces.com/problemset/problem/1921/F | [
"brute force",
"data structures",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5107
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1921-E | codeforces | 1921-E | Eat the Chip | https://codeforces.com/problemset/problem/1921/E | [
"brute force",
"games",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11475
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1921-D | codeforces | 1921-D | Very Different Array | https://codeforces.com/problemset/problem/1921/D | [
"data structures",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 24343
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1921-C | codeforces | 1921-C | Sending Messages | https://codeforces.com/problemset/problem/1921/C | [
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 32696
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1921-B | codeforces | 1921-B | Arranging Cats | https://codeforces.com/problemset/problem/1921/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 36642
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1921-A | codeforces | 1921-A | Square | https://codeforces.com/problemset/problem/1921/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 49795
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1920-F2 | codeforces | 1920-F2 | Smooth Sailing (Hard Version) | https://codeforces.com/problemset/problem/1920/F2 | [
"binary search",
"data structures",
"dsu",
"geometry",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 644
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1920-F1 | codeforces | 1920-F1 | Smooth Sailing (Easy Version) | https://codeforces.com/problemset/problem/1920/F1 | [
"binary search",
"brute force",
"data structures",
"dfs and similar",
"dsu",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1200
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1920-E | codeforces | 1920-E | Counting Binary Strings | https://codeforces.com/problemset/problem/1920/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3407
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1920-D | codeforces | 1920-D | Array Repetition | https://codeforces.com/problemset/problem/1920/D | [
"binary search",
"brute force",
"dsu",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6532
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1920-C | codeforces | 1920-C | Partitioning the Array | https://codeforces.com/problemset/problem/1920/C | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 20237
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1920-B | codeforces | 1920-B | Summation Game | https://codeforces.com/problemset/problem/1920/B | [
"games",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 23204
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1920-A | codeforces | 1920-A | Satisfying Constraints | https://codeforces.com/problemset/problem/1920/A | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29657
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1919-H | codeforces | 1919-H | Tree Diameter | https://codeforces.com/problemset/problem/1919/H | [
"interactive",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 181
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1919-G | codeforces | 1919-G | Tree LGM | https://codeforces.com/problemset/problem/1919/G | [
"constructive algorithms",
"divide and conquer",
"games",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 210
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1919-F2 | codeforces | 1919-F2 | Wine Factory (Hard Version) | https://codeforces.com/problemset/problem/1919/F2 | [
"data structures",
"dp",
"flows",
"greedy",
"matrices"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1090
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1919-F1 | codeforces | 1919-F1 | Wine Factory (Easy Version) | https://codeforces.com/problemset/problem/1919/F1 | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2595
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1919-E | codeforces | 1919-E | Counting Prefixes | https://codeforces.com/problemset/problem/1919/E | [
"combinatorics",
"constructive algorithms",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1136
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1919-D | codeforces | 1919-D | 01 Tree | https://codeforces.com/problemset/problem/1919/D | [
"constructive algorithms",
"data structures",
"dsu",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4590
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1919-C | codeforces | 1919-C | Grouping Increases | https://codeforces.com/problemset/problem/1919/C | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 29063
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1919-B | codeforces | 1919-B | Plus-Minus Split | https://codeforces.com/problemset/problem/1919/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31686
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1919-A | codeforces | 1919-A | Wallet Exchange | https://codeforces.com/problemset/problem/1919/A | [
"games",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 36267
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1918-G | codeforces | 1918-G | Permutation of Given | https://codeforces.com/problemset/problem/1918/G | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 664
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1918-F | codeforces | 1918-F | Caterpillar on a Tree | https://codeforces.com/problemset/problem/1918/F | [
"dfs and similar",
"graphs",
"greedy",
"implementation",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1122
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1918-E | codeforces | 1918-E | ace5 and Task Order | https://codeforces.com/problemset/problem/1918/E | [
"constructive algorithms",
"divide and conquer",
"implementation",
"interactive",
"probabilities",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2079
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1918-D | codeforces | 1918-D | Blocking Elements | https://codeforces.com/problemset/problem/1918/D | [
"binary search",
"data structures",
"dp",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6269
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1918-C | codeforces | 1918-C | XOR-distance | https://codeforces.com/problemset/problem/1918/C | [
"bitmasks",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16901
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1918-B | codeforces | 1918-B | Minimize Inversions | https://codeforces.com/problemset/problem/1918/B | [
"constructive algorithms",
"data structures",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 27117
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1918-A | codeforces | 1918-A | Brick Wall | https://codeforces.com/problemset/problem/1918/A | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32420
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1917-F | codeforces | 1917-F | Construct Tree | https://codeforces.com/problemset/problem/1917/F | [
"bitmasks",
"constructive algorithms",
"dp",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1206
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1917-E | codeforces | 1917-E | Construct Matrix | https://codeforces.com/problemset/problem/1917/E | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1635
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1917-D | codeforces | 1917-D | Yet Another Inversions Problem | https://codeforces.com/problemset/problem/1917/D | [
"combinatorics",
"data structures",
"dp",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2083
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1917-C | codeforces | 1917-C | Watering an Array | https://codeforces.com/problemset/problem/1917/C | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12447
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1917-B | codeforces | 1917-B | Erase First or Second Letter | https://codeforces.com/problemset/problem/1917/B | [
"brute force",
"combinatorics",
"data structures",
"dp",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 37027
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1917-A | codeforces | 1917-A | Least Product | https://codeforces.com/problemset/problem/1917/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27311
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1916-H2 | codeforces | 1916-H2 | Matrix Rank (Hard Version) | https://codeforces.com/problemset/problem/1916/H2 | [
"combinatorics",
"dp",
"math",
"matrices",
"string suffix structures"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 634
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1916-H1 | codeforces | 1916-H1 | Matrix Rank (Easy Version) | https://codeforces.com/problemset/problem/1916/H1 | [
"brute force",
"combinatorics",
"dp",
"math",
"matrices"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 719
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1916-G | codeforces | 1916-G | Optimizations From Chelsu | https://codeforces.com/problemset/problem/1916/G | [
"divide and conquer",
"dp",
"number theory",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 236
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1916-F | codeforces | 1916-F | Group Division | https://codeforces.com/problemset/problem/1916/F | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 714
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1916-E | codeforces | 1916-E | Happy Life in University | https://codeforces.com/problemset/problem/1916/E | [
"data structures",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2657
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1916-D | codeforces | 1916-D | Mathematical Problem | https://codeforces.com/problemset/problem/1916/D | [
"brute force",
"constructive algorithms",
"geometry",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9800
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1916-C | codeforces | 1916-C | Training Before the Olympiad | https://codeforces.com/problemset/problem/1916/C | [
"constructive algorithms",
"games",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19941
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1916-B | codeforces | 1916-B | Two Divisors | https://codeforces.com/problemset/problem/1916/B | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 32113
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1916-A | codeforces | 1916-A | 2023 | https://codeforces.com/problemset/problem/1916/A | [
"constructive algorithms",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28373
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1915-G | codeforces | 1915-G | Bicycles | https://codeforces.com/problemset/problem/1915/G | [
"graphs",
"greedy",
"implementation",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9864
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1915-F | codeforces | 1915-F | Greetings | https://codeforces.com/problemset/problem/1915/F | [
"data structures",
"divide and conquer",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 22595
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1915-E | codeforces | 1915-E | Romantic Glasses | https://codeforces.com/problemset/problem/1915/E | [
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 35092
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1915-D | codeforces | 1915-D | Unnatural Language Processing | https://codeforces.com/problemset/problem/1915/D | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 35242
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1915-C | codeforces | 1915-C | Can I Square? | https://codeforces.com/problemset/problem/1915/C | [
"binary search",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 54671
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1915-B | codeforces | 1915-B | Not Quite Latin Square | https://codeforces.com/problemset/problem/1915/B | [
"bitmasks",
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 50628
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1915-A | codeforces | 1915-A | Odd One Out | https://codeforces.com/problemset/problem/1915/A | [
"bitmasks",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 80474
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1914-G2 | codeforces | 1914-G2 | Light Bulbs (Hard Version) | https://codeforces.com/problemset/problem/1914/G2 | [
"combinatorics",
"data structures",
"dfs and similar",
"dp",
"graphs",
"hashing"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1834
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1914-G1 | codeforces | 1914-G1 | Light Bulbs (Easy Version) | https://codeforces.com/problemset/problem/1914/G1 | [
"brute force",
"combinatorics",
"dfs and similar",
"dp",
"dsu",
"graphs",
"math",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2413
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1914-F | codeforces | 1914-F | Programming Competition | https://codeforces.com/problemset/problem/1914/F | [
"dfs and similar",
"dp",
"graph matchings",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5053
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1914-E2 | codeforces | 1914-E2 | Game with Marbles (Hard Version) | https://codeforces.com/problemset/problem/1914/E2 | [
"games",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14813
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1914-E1 | codeforces | 1914-E1 | Game with Marbles (Easy Version) | https://codeforces.com/problemset/problem/1914/E1 | [
"brute force",
"games",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14299
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1914-D | codeforces | 1914-D | Three Activities | https://codeforces.com/problemset/problem/1914/D | [
"brute force",
"dp",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 38842
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1914-C | codeforces | 1914-C | Quests | https://codeforces.com/problemset/problem/1914/C | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 40274
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1914-B | codeforces | 1914-B | Preparing for the Contest | https://codeforces.com/problemset/problem/1914/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33324
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1914-A | codeforces | 1914-A | Problemsolving Log | https://codeforces.com/problemset/problem/1914/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 35288
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1913-F | codeforces | 1913-F | Palindromic Problem | https://codeforces.com/problemset/problem/1913/F | [
"binary search",
"data structures",
"hashing",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 550
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1913-E | codeforces | 1913-E | Matrix Problem | https://codeforces.com/problemset/problem/1913/E | [
"flows",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1343
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1913-D | codeforces | 1913-D | Array Collapse | https://codeforces.com/problemset/problem/1913/D | [
"data structures",
"divide and conquer",
"dp",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4174
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1913-C | codeforces | 1913-C | Game with Multiset | https://codeforces.com/problemset/problem/1913/C | [
"binary search",
"bitmasks",
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17563
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1913-B | codeforces | 1913-B | Swap and Delete | https://codeforces.com/problemset/problem/1913/B | [
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 52430
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1913-A | codeforces | 1913-A | Rating Increase | https://codeforces.com/problemset/problem/1913/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27348
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1912-L | codeforces | 1912-L | LOL Lovers | https://codeforces.com/problemset/problem/1912/L | [
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 8641
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1912-K | codeforces | 1912-K | Kim's Quest | https://codeforces.com/problemset/problem/1912/K | [
"bitmasks",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4273
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1912-J | codeforces | 1912-J | Joy of Pokémon Observation | https://codeforces.com/problemset/problem/1912/J | [] | null | null | stdin_stdout | 2,300 | {
"solved_count": 734
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1912-I | codeforces | 1912-I | Innovative Washing Machine | https://codeforces.com/problemset/problem/1912/I | [
"geometry",
"math",
"two pointers"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 66
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1912-H | codeforces | 1912-H | Hypercatapult Commute | https://codeforces.com/problemset/problem/1912/H | [
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 608
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1912-G | codeforces | 1912-G | Great City Saint Petersburg | https://codeforces.com/problemset/problem/1912/G | [
"data structures"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 588
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1912-F | codeforces | 1912-F | Fugitive Frenzy | https://codeforces.com/problemset/problem/1912/F | [
"math",
"probabilities"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 142
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1912-E | codeforces | 1912-E | Evaluate It and Back Again | https://codeforces.com/problemset/problem/1912/E | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1278
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1912-D | codeforces | 1912-D | Divisibility Test | https://codeforces.com/problemset/problem/1912/D | [
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1986
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1912-C | codeforces | 1912-C | Cactus Transformation | https://codeforces.com/problemset/problem/1912/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 74
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1912-B | codeforces | 1912-B | Blueprint for Seating | https://codeforces.com/problemset/problem/1912/B | [
"combinatorics",
"divide and conquer",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1445
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1912-A | codeforces | 1912-A | Accumulator Apex | https://codeforces.com/problemset/problem/1912/A | [
"data structures",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3020
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1910-J | codeforces | 1910-J | Two Colors | https://codeforces.com/problemset/problem/1910/J | [
"*special"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 55
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1910-I | codeforces | 1910-I | Inverse Problem | https://codeforces.com/problemset/problem/1910/I | [
"*special",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 67
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1910-H | codeforces | 1910-H | Sum of Digits of Sums | https://codeforces.com/problemset/problem/1910/H | [
"*special",
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 108
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1910-G | codeforces | 1910-G | Pool Records | https://codeforces.com/problemset/problem/1910/G | [
"*special",
"greedy"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 75
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1910-F | codeforces | 1910-F | Build Railway Stations | https://codeforces.com/problemset/problem/1910/F | [
"*special",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 220
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1910-E | codeforces | 1910-E | Maximum Sum Subarrays | https://codeforces.com/problemset/problem/1910/E | [
"*special",
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 245
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1910-D | codeforces | 1910-D | Remove and Add | https://codeforces.com/problemset/problem/1910/D | [
"*special",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 412
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1910-C | codeforces | 1910-C | Poisonous Swamp | https://codeforces.com/problemset/problem/1910/C | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 737
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1910-B | codeforces | 1910-B | Security Guard | https://codeforces.com/problemset/problem/1910/B | [
"*special",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 805
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1910-A | codeforces | 1910-A | Username | https://codeforces.com/problemset/problem/1910/A | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 2002
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1909-I | codeforces | 1909-I | Short Permutation Problem | https://codeforces.com/problemset/problem/1909/I | [
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 179
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1909-H | codeforces | 1909-H | Parallel Swaps Sort | https://codeforces.com/problemset/problem/1909/H | [
"constructive algorithms",
"data structures"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 111
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1909-G | codeforces | 1909-G | Pumping Lemma | https://codeforces.com/problemset/problem/1909/G | [
"hashing",
"strings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 654
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1909-F2 | codeforces | 1909-F2 | Small Permutation Problem (Hard Version) | https://codeforces.com/problemset/problem/1909/F2 | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1233
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1909-F1 | codeforces | 1909-F1 | Small Permutation Problem (Easy Version) | https://codeforces.com/problemset/problem/1909/F1 | [
"brute force",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2264
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1909-E | codeforces | 1909-E | Multiple Lamps | https://codeforces.com/problemset/problem/1909/E | [
"bitmasks",
"brute force",
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1687
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1909-D | codeforces | 1909-D | Split Plus K | https://codeforces.com/problemset/problem/1909/D | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5142
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1909-C | codeforces | 1909-C | Heavy Intervals | https://codeforces.com/problemset/problem/1909/C | [
"constructive algorithms",
"data structures",
"dsu",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 13239
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1909-B | codeforces | 1909-B | Make Almost Equal With Mod | https://codeforces.com/problemset/problem/1909/B | [
"bitmasks",
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 31659
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1909-A | codeforces | 1909-A | Distinct Buttons | https://codeforces.com/problemset/problem/1909/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18994
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1907-G | codeforces | 1907-G | Lights | https://codeforces.com/problemset/problem/1907/G | [
"brute force",
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2344
} | 2026-06-01T05:00:40.145500+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.