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:2276-G | codeforces | 2276-G | Elimination of Players | https://codeforces.com/problemset/problem/2276/G | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 123
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2276-F | codeforces | 2276-F | Permutation Coloring Game | https://codeforces.com/problemset/problem/2276/F | [
"dp",
"dsu",
"games",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 490
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2276-E | codeforces | 2276-E | Good Substrings | https://codeforces.com/problemset/problem/2276/E | [
"combinatorics",
"data structures",
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | null | {
"solved_count": 2322
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2276-D | codeforces | 2276-D | Caveman | https://codeforces.com/problemset/problem/2276/D | [
"combinatorics",
"graphs"
] | null | null | stdin_stdout | null | {
"solved_count": 5659
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2276-C | codeforces | 2276-C | Subarrays | https://codeforces.com/problemset/problem/2276/C | [
"math",
"number theory"
] | null | null | stdin_stdout | null | {
"solved_count": 8868
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2276-B | codeforces | 2276-B | Replace and Compress | https://codeforces.com/problemset/problem/2276/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | null | {
"solved_count": 10045
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2276-A | codeforces | 2276-A | Perfect Sandwiches | https://codeforces.com/problemset/problem/2276/A | [
"greedy",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 14087
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2275-H | codeforces | 2275-H | A Problem to Warm Up the Eyebrows | https://codeforces.com/problemset/problem/2275/H | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 554
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2275-G | codeforces | 2275-G | Copper Squander | https://codeforces.com/problemset/problem/2275/G | [
"binary search",
"data structures",
"dsu",
"graphs",
"greedy",
"math",
"sortings",
"ternary search"
] | null | null | stdin_stdout | null | {
"solved_count": 1346
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2275-F | codeforces | 2275-F | Tea Blend | https://codeforces.com/problemset/problem/2275/F | [
"hashing",
"math",
"number theory"
] | null | null | stdin_stdout | null | {
"solved_count": 2240
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2275-E | codeforces | 2275-E | Repentance Is Already on the Way | https://codeforces.com/problemset/problem/2275/E | [
"dp",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 4541
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2275-D | codeforces | 2275-D | Precision Alignment | https://codeforces.com/problemset/problem/2275/D | [
"binary search",
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 7474
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2275-C | codeforces | 2275-C | Unrequited Love | https://codeforces.com/problemset/problem/2275/C | [
"brute force",
"data structures"
] | null | null | stdin_stdout | null | {
"solved_count": 14107
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2275-B | codeforces | 2275-B | Did Not Go to Print | https://codeforces.com/problemset/problem/2275/B | [
"data structures",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 20161
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2275-A | codeforces | 2275-A | In Search of Convenience | https://codeforces.com/problemset/problem/2275/A | [
"geometry",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 24445
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2274-B | codeforces | 2274-B | Prefix | https://codeforces.com/problemset/problem/2274/B | [
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 4434
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2274-A | codeforces | 2274-A | The Projections of Paco | https://codeforces.com/problemset/problem/2274/A | [
"dfs and similar",
"dp",
"hashing",
"implementation",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 6473
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2273-F | codeforces | 2273-F | Pancho's Permutation | https://codeforces.com/problemset/problem/2273/F | [
"constructive algorithms",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 87
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2273-E | codeforces | 2273-E | Six-Seven Bags | https://codeforces.com/problemset/problem/2273/E | [
"brute force",
"greedy",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 93
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2273-D | codeforces | 2273-D | Aura Battle | https://codeforces.com/problemset/problem/2273/D | [
"brute force",
"implementation",
"interactive",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 225
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2273-C | codeforces | 2273-C | Matrix Puzzle | https://codeforces.com/problemset/problem/2273/C | [
"brute force",
"data structures",
"implementation",
"math",
"matrices"
] | null | null | stdin_stdout | null | {
"solved_count": 568
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2273-B | codeforces | 2273-B | Robot Championship | https://codeforces.com/problemset/problem/2273/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 1318
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2273-A | codeforces | 2273-A | Lavencia Oranges | https://codeforces.com/problemset/problem/2273/A | [
"binary search",
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 3627
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2271-H2 | codeforces | 2271-H2 | Personal Issues (Hard Version) | https://codeforces.com/problemset/problem/2271/H2 | [
"games",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 65
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2271-H1 | codeforces | 2271-H1 | Personal Issues (Easy Version) | https://codeforces.com/problemset/problem/2271/H1 | [
"dp",
"games",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 123
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2271-G | codeforces | 2271-G | Grid Filling | https://codeforces.com/problemset/problem/2271/G | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 102
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2271-F | codeforces | 2271-F | Beautiful Pillers | https://codeforces.com/problemset/problem/2271/F | [
"constructive algorithms",
"data structures",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 874
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2271-E | codeforces | 2271-E | Array Emptying | https://codeforces.com/problemset/problem/2271/E | [
"binary search",
"data structures",
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 1277
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2271-D | codeforces | 2271-D | Target Infection | https://codeforces.com/problemset/problem/2271/D | [
"binary search",
"brute force",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | null | {
"solved_count": 2619
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2271-C | codeforces | 2271-C | XOR Problem | https://codeforces.com/problemset/problem/2271/C | [
"bitmasks",
"constructive algorithms",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 4782
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2271-B | codeforces | 2271-B | MEX Game | https://codeforces.com/problemset/problem/2271/B | [
"games"
] | null | null | stdin_stdout | null | {
"solved_count": 8245
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2271-A | codeforces | 2271-A | Robot Odd Moves | https://codeforces.com/problemset/problem/2271/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 10448
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2269-B | codeforces | 2269-B | KiaKio and Squared Numbers | https://codeforces.com/problemset/problem/2269/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 12880
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2269-A | codeforces | 2269-A | SauSaGe Bank | https://codeforces.com/problemset/problem/2269/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19998
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2268-F | codeforces | 2268-F | Deglado | https://codeforces.com/problemset/problem/2268/F | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 276
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2268-E | codeforces | 2268-E | Kia Kio and Tree of Life | https://codeforces.com/problemset/problem/2268/E | [
"data structures",
"fft",
"math",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 400
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2268-D | codeforces | 2268-D | AghaBalaSar and Hamed | https://codeforces.com/problemset/problem/2268/D | [
"data structures",
"dp",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 716
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2268-C | codeforces | 2268-C | KiaKio and Energy Intervals | https://codeforces.com/problemset/problem/2268/C | [
"binary search",
"bitmasks",
"data structures",
"divide and conquer",
"dsu",
"greedy",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1149
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2268-B | codeforces | 2268-B | What a SauSaGe! It's All Meat | https://codeforces.com/problemset/problem/2268/B | [
"bitmasks",
"brute force",
"data structures",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6519
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2268-A | codeforces | 2268-A | K Is Important | https://codeforces.com/problemset/problem/2268/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 11843
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2267-G | codeforces | 2267-G | New LRT | https://codeforces.com/problemset/problem/2267/G | [
"divide and conquer",
"dp",
"fft"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 294
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2267-F2 | codeforces | 2267-F2 | XOR Transformations (Hard Version) | https://codeforces.com/problemset/problem/2267/F2 | [
"bitmasks",
"brute force",
"data structures",
"dfs and similar",
"greedy",
"math",
"sortings",
"strings",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 933
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2267-F1 | codeforces | 2267-F1 | XOR Transformations (Easy Version) | https://codeforces.com/problemset/problem/2267/F1 | [
"bitmasks",
"brute force",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4161
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2267-E | codeforces | 2267-E | Clean Substrings | https://codeforces.com/problemset/problem/2267/E | [
"combinatorics",
"data structures",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2004
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2267-D | codeforces | 2267-D | Backrooms Hill | https://codeforces.com/problemset/problem/2267/D | [
"constructive algorithms",
"dp",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7937
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2267-C | codeforces | 2267-C | GCD Treasury | https://codeforces.com/problemset/problem/2267/C | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10889
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2267-B | codeforces | 2267-B | Fashionable Array | https://codeforces.com/problemset/problem/2267/B | [
"brute force",
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15999
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2267-A | codeforces | 2267-A | Turn Into a Palindrome | https://codeforces.com/problemset/problem/2267/A | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19968
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2266-H | codeforces | 2266-H | Deque Malfunction | https://codeforces.com/problemset/problem/2266/H | [
"binary search",
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 439
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2266-G | codeforces | 2266-G | Modular Tree | https://codeforces.com/problemset/problem/2266/G | [
"dfs and similar",
"dp",
"greedy",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 992
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2266-F | codeforces | 2266-F | MEX Replacement | https://codeforces.com/problemset/problem/2266/F | [
"binary search",
"brute force",
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1957
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2266-E | codeforces | 2266-E | Prime Destruction | https://codeforces.com/problemset/problem/2266/E | [
"brute force",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7319
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2266-D | codeforces | 2266-D | Falling Concrete | https://codeforces.com/problemset/problem/2266/D | [
"constructive algorithms",
"data structures",
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9114
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2266-C | codeforces | 2266-C | AND, OR, Sort! | https://codeforces.com/problemset/problem/2266/C | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17280
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2266-B | codeforces | 2266-B | Three Piles | https://codeforces.com/problemset/problem/2266/B | [
"games",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26394
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2266-A | codeforces | 2266-A | Good Contest | https://codeforces.com/problemset/problem/2266/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30152
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2264-F | codeforces | 2264-F | Deranged Calculator | https://codeforces.com/problemset/problem/2264/F | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 401
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2264-E2 | codeforces | 2264-E2 | A Prime Flood (Hard Version) | https://codeforces.com/problemset/problem/2264/E2 | [
"brute force",
"combinatorics",
"dp",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 458
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2264-E1 | codeforces | 2264-E1 | A Prime Flood (Easy Version) | https://codeforces.com/problemset/problem/2264/E1 | [
"combinatorics",
"dp",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1374
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2264-D | codeforces | 2264-D | Dr. Agos's Dark Mode | https://codeforces.com/problemset/problem/2264/D | [
"brute force",
"chinese remainder theorem",
"constructive algorithms",
"math",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2458
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2264-C | codeforces | 2264-C | Madamant's Skating Dynasty | https://codeforces.com/problemset/problem/2264/C | [
"combinatorics",
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7394
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2264-B | codeforces | 2264-B | Knife's Pill Farm | https://codeforces.com/problemset/problem/2264/B | [
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 11787
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2264-A | codeforces | 2264-A | Rumb Needs a Hand | https://codeforces.com/problemset/problem/2264/A | [
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16239
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2263-B | codeforces | 2263-B | Min Matrices | https://codeforces.com/problemset/problem/2263/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 900 | {
"solved_count": 13550
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2263-A | codeforces | 2263-A | Min Max Game | https://codeforces.com/problemset/problem/2263/A | [
"games"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18302
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2262-F | codeforces | 2262-F | Rank Removal | https://codeforces.com/problemset/problem/2262/F | [
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 226
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2262-E | codeforces | 2262-E | Paired Bracket Sequences | https://codeforces.com/problemset/problem/2262/E | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 222
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2262-D | codeforces | 2262-D | PLUSworld | https://codeforces.com/problemset/problem/2262/D | [
"constructive algorithms",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 374
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2262-C | codeforces | 2262-C | Traveling the World | https://codeforces.com/problemset/problem/2262/C | [
"combinatorics",
"constructive algorithms",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1019
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2262-B | codeforces | 2262-B | Culling Game | https://codeforces.com/problemset/problem/2262/B | [
"binary search",
"data structures",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2069
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2262-A2 | codeforces | 2262-A2 | Floor of MEX (Hard Version) | https://codeforces.com/problemset/problem/2262/A2 | [
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3160
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2262-A1 | codeforces | 2262-A1 | Floor of MEX (Easy Version) | https://codeforces.com/problemset/problem/2262/A1 | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10111
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2261-H | codeforces | 2261-H | Oh Tree Tree Tree, No Need to Leave | https://codeforces.com/problemset/problem/2261/H | [
"bitmasks",
"communication",
"dfs and similar",
"interactive",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 43
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2261-G | codeforces | 2261-G | 1 2 3 and XOR, Where Did Everybody Go? | https://codeforces.com/problemset/problem/2261/G | [
"bitmasks",
"data structures",
"divide and conquer",
"dp",
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 174
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2261-F2 | codeforces | 2261-F2 | Plegma II: Ask Me Any Cell (Hard Version) | https://codeforces.com/problemset/problem/2261/F2 | [
"constructive algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": 29
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2261-F1 | codeforces | 2261-F1 | Plegma II: Ask Me Any Cell (Easy Version) | https://codeforces.com/problemset/problem/2261/F1 | [
"brute force",
"constructive algorithms",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 264
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2261-E | codeforces | 2261-E | What Does the Cow Say? | https://codeforces.com/problemset/problem/2261/E | [
"binary search",
"data structures",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 1727
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2261-D2 | codeforces | 2261-D2 | Come Be My Friend, Don't Be So Scared (Hard Version) | https://codeforces.com/problemset/problem/2261/D2 | [
"constructive algorithms",
"data structures",
"dsu",
"graphs",
"hashing",
"trees",
"two pointers"
] | null | null | stdin_stdout | null | {
"solved_count": 405
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2261-D1 | codeforces | 2261-D1 | Come Be My Friend, Don't Be So Scared (Easy Version) | https://codeforces.com/problemset/problem/2261/D1 | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 4890
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2261-C | codeforces | 2261-C | I Know About a Million Things | https://codeforces.com/problemset/problem/2261/C | [
"games",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 7028
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2261-B | codeforces | 2261-B | What's the Capital of France? | https://codeforces.com/problemset/problem/2261/B | [
"bitmasks",
"greedy",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 6496
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2261-A | codeforces | 2261-A | Hey, It's Me, Souvlakity | https://codeforces.com/problemset/problem/2261/A | [
"games",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 8627
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2260-G | codeforces | 2260-G | Sortable Permutations | https://codeforces.com/problemset/problem/2260/G | [
"brute force",
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 248
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2260-F | codeforces | 2260-F | Edge Three-Coloring | https://codeforces.com/problemset/problem/2260/F | [
"brute force",
"dfs and similar",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 634
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2260-E | codeforces | 2260-E | Cyclic Balance | https://codeforces.com/problemset/problem/2260/E | [
"binary search",
"constructive algorithms",
"dp",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2068
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2260-D | codeforces | 2260-D | Signs of Prefix Sums | https://codeforces.com/problemset/problem/2260/D | [
"brute force",
"constructive algorithms",
"dfs and similar",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5249
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2260-C | codeforces | 2260-C | Maximize XOR, Minimize Operations | https://codeforces.com/problemset/problem/2260/C | [
"bitmasks",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 10814
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2260-B | codeforces | 2260-B | Monocarp and Projects | https://codeforces.com/problemset/problem/2260/B | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16451
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2260-A | codeforces | 2260-A | Monocarp's Contest | https://codeforces.com/problemset/problem/2260/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21205
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2259-H | codeforces | 2259-H | Treasure Map Destruction (Counting Version) | https://codeforces.com/problemset/problem/2259/H | [
"dfs and similar",
"dp",
"dsu",
"graphs",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1016
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2259-G | codeforces | 2259-G | Index Removal | https://codeforces.com/problemset/problem/2259/G | [
"binary search",
"data structures",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2738
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2259-F | codeforces | 2259-F | Binary Bubble Sort Inversions | https://codeforces.com/problemset/problem/2259/F | [
"data structures",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3663
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2259-E | codeforces | 2259-E | Treasure Map Destruction (Constructive Version) | https://codeforces.com/problemset/problem/2259/E | [
"2-sat",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6695
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2259-D | codeforces | 2259-D | MEX Multiset | https://codeforces.com/problemset/problem/2259/D | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 13891
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2259-C | codeforces | 2259-C | 101 | https://codeforces.com/problemset/problem/2259/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19030
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2259-B | codeforces | 2259-B | Minus Two | https://codeforces.com/problemset/problem/2259/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25379
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2259-A | codeforces | 2259-A | Moo Language School | https://codeforces.com/problemset/problem/2259/A | [
"brute force",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28281
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2258-F | codeforces | 2258-F | Plus Minus Tree | https://codeforces.com/problemset/problem/2258/F | [
"data structures",
"dfs and similar",
"dp",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 330
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2258-E | codeforces | 2258-E | DivMEX | https://codeforces.com/problemset/problem/2258/E | [
"data structures",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 956
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2258-D | codeforces | 2258-D | Magic Tiles | https://codeforces.com/problemset/problem/2258/D | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 576
} | 2026-10-19T04:16:34.136750+00:00 |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 69