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:2159-D1 | codeforces | 2159-D1 | Inverse Minimum Partition (Easy Version) | https://codeforces.com/problemset/problem/2159/D1 | [
"binary search",
"brute force",
"dp",
"geometry",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2427
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2159-C | codeforces | 2159-C | Twin Polynomials | https://codeforces.com/problemset/problem/2159/C | [
"combinatorics",
"graph matchings",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3560
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2159-B | codeforces | 2159-B | Rectangles | https://codeforces.com/problemset/problem/2159/B | [
"brute force",
"data structures",
"dp",
"dsu",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4313
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2159-A | codeforces | 2159-A | MAD Interactive Problem | https://codeforces.com/problemset/problem/2159/A | [
"constructive algorithms",
"implementation",
"interactive"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9722
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2158-F2 | codeforces | 2158-F2 | Distinct GCDs (Hard Version) | https://codeforces.com/problemset/problem/2158/F2 | [
"combinatorics",
"constructive algorithms",
"graphs",
"math",
"number theory"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 316
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2158-F1 | codeforces | 2158-F1 | Distinct GCDs (Easy Version) | https://codeforces.com/problemset/problem/2158/F1 | [
"constructive algorithms",
"graphs",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 483
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2158-E | codeforces | 2158-E | Sink | https://codeforces.com/problemset/problem/2158/E | [
"data structures",
"divide and conquer",
"dsu",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 698
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2158-D | codeforces | 2158-D | Palindrome Flipping | https://codeforces.com/problemset/problem/2158/D | [
"brute force",
"constructive algorithms",
"graphs",
"implementation",
"shortest paths",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3561
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2158-C | codeforces | 2158-C | Annoying Game | https://codeforces.com/problemset/problem/2158/C | [
"dp",
"games",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12198
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2158-B | codeforces | 2158-B | Split | https://codeforces.com/problemset/problem/2158/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 15143
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2158-A | codeforces | 2158-A | Suspension | https://codeforces.com/problemset/problem/2158/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24640
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2157-I | codeforces | 2157-I | Hyper Smawk Bros | https://codeforces.com/problemset/problem/2157/I | [
"dp",
"games"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 226
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2157-H | codeforces | 2157-H | Keygen 3 | https://codeforces.com/problemset/problem/2157/H | [
"brute force",
"combinatorics",
"constructive algorithms",
"dfs and similar",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 571
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2157-G | codeforces | 2157-G | Isaac's Queries | https://codeforces.com/problemset/problem/2157/G | [
"bitmasks",
"brute force",
"constructive algorithms",
"dfs and similar",
"divide and conquer",
"dp",
"greedy",
"interactive",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 995
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2157-F | codeforces | 2157-F | Git Gud | https://codeforces.com/problemset/problem/2157/F | [
"brute force",
"constructive algorithms",
"divide and conquer",
"math",
"ternary search"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1899
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2157-E | codeforces | 2157-E | Adjusting Drones | https://codeforces.com/problemset/problem/2157/E | [
"binary search",
"brute force",
"data structures",
"dp",
"dsu",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5736
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2157-D | codeforces | 2157-D | Billion Players Game | https://codeforces.com/problemset/problem/2157/D | [
"binary search",
"greedy",
"math",
"sortings",
"ternary search",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8486
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2157-C | codeforces | 2157-C | Meximum Array 2 | https://codeforces.com/problemset/problem/2157/C | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12048
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2157-B | codeforces | 2157-B | Expansion Plan 2 | https://codeforces.com/problemset/problem/2157/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 15670
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2157-A | codeforces | 2157-A | Dungeon Equilibrium | https://codeforces.com/problemset/problem/2157/A | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19251
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2156-F2 | codeforces | 2156-F2 | Strange Operation (Hard Version) | https://codeforces.com/problemset/problem/2156/F2 | [
"data structures",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 292
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2156-F1 | codeforces | 2156-F1 | Strange Operation (Easy Version) | https://codeforces.com/problemset/problem/2156/F1 | [
"brute force",
"data structures",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1715
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2156-E | codeforces | 2156-E | Best Time to Buy and Sell Stock | https://codeforces.com/problemset/problem/2156/E | [
"binary search",
"brute force",
"data structures",
"dp",
"games",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1025
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2156-D | codeforces | 2156-D | Find the Last Number | https://codeforces.com/problemset/problem/2156/D | [
"binary search",
"bitmasks",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5656
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2156-C | codeforces | 2156-C | Maximum GCD on Whiteboard | https://codeforces.com/problemset/problem/2156/C | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 13161
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2156-B | codeforces | 2156-B | Strange Machine | https://codeforces.com/problemset/problem/2156/B | [
"binary search",
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22008
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2156-A | codeforces | 2156-A | Pizza Time | https://codeforces.com/problemset/problem/2156/A | [
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28035
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2155-F | codeforces | 2155-F | Juan's Colorful Tree | https://codeforces.com/problemset/problem/2155/F | [
"data structures",
"dfs and similar",
"dsu",
"graphs",
"meet-in-the-middle",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 763
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2155-E | codeforces | 2155-E | Mimo & Yuyu | https://codeforces.com/problemset/problem/2155/E | [
"games",
"greedy",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3160
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2155-D | codeforces | 2155-D | Batteries | https://codeforces.com/problemset/problem/2155/D | [
"brute force",
"constructive algorithms",
"graph matchings",
"graphs",
"interactive",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6358
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2155-C | codeforces | 2155-C | The Ancient Wizards' Capes | https://codeforces.com/problemset/problem/2155/C | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11176
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2155-B | codeforces | 2155-B | Abraham's Great Escape | https://codeforces.com/problemset/problem/2155/B | [
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 18180
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2155-A | codeforces | 2155-A | El fucho | https://codeforces.com/problemset/problem/2155/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26330
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2154-F2 | codeforces | 2154-F2 | Bombing (Hard Version) | https://codeforces.com/problemset/problem/2154/F2 | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 231
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2154-F1 | codeforces | 2154-F1 | Bombing (Easy Version) | https://codeforces.com/problemset/problem/2154/F1 | [
"brute force",
"combinatorics",
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 616
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2154-E | codeforces | 2154-E | No Mind To Think | https://codeforces.com/problemset/problem/2154/E | [
"binary search",
"divide and conquer",
"greedy",
"sortings",
"ternary search",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1283
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2154-D | codeforces | 2154-D | Catshock | https://codeforces.com/problemset/problem/2154/D | [
"constructive algorithms",
"dfs and similar",
"graphs",
"trees",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5249
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2154-C2 | codeforces | 2154-C2 | No Cost Too Great (Hard Version) | https://codeforces.com/problemset/problem/2154/C2 | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5846
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2154-C1 | codeforces | 2154-C1 | No Cost Too Great (Easy Version) | https://codeforces.com/problemset/problem/2154/C1 | [
"greedy",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14540
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2154-B | codeforces | 2154-B | Make it Zigzag | https://codeforces.com/problemset/problem/2154/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 21018
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2154-A | codeforces | 2154-A | Notelock | https://codeforces.com/problemset/problem/2154/A | [
"greedy",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24131
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2153-F | codeforces | 2153-F | Odd Queries on Odd Array | https://codeforces.com/problemset/problem/2153/F | [
"bitmasks",
"brute force",
"data structures",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 348
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2153-E | codeforces | 2153-E | Zero Trailing Factorial | https://codeforces.com/problemset/problem/2153/E | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1062
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2153-D | codeforces | 2153-D | Not Alone | https://codeforces.com/problemset/problem/2153/D | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6753
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2153-C | codeforces | 2153-C | Symmetrical Polygons | https://codeforces.com/problemset/problem/2153/C | [
"constructive algorithms",
"geometry",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12573
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2153-B | codeforces | 2153-B | Bitwise Reversion | https://codeforces.com/problemset/problem/2153/B | [
"bitmasks",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23498
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2153-A | codeforces | 2153-A | Circle of Apple Trees | https://codeforces.com/problemset/problem/2153/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27296
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2152-H2 | codeforces | 2152-H2 | Victorious Coloring (Hard Version) | https://codeforces.com/problemset/problem/2152/H2 | [
"data structures",
"greedy",
"schedules"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 272
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2152-H1 | codeforces | 2152-H1 | Victorious Coloring (Easy Version) | https://codeforces.com/problemset/problem/2152/H1 | [
"dfs and similar",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 2710
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2152-G | codeforces | 2152-G | Query Jungle | https://codeforces.com/problemset/problem/2152/G | [
"data structures",
"implementation",
"math",
"matrices",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 4084
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2152-F | codeforces | 2152-F | Triple Attack | https://codeforces.com/problemset/problem/2152/F | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 4063
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2152-E | codeforces | 2152-E | Monotone Subsequence | https://codeforces.com/problemset/problem/2152/E | [
"constructive algorithms",
"graphs",
"greedy",
"interactive",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4819
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2152-D | codeforces | 2152-D | Division Versus Addition | https://codeforces.com/problemset/problem/2152/D | [
"games",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9108
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2152-C | codeforces | 2152-C | Triple Removal | https://codeforces.com/problemset/problem/2152/C | [
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15102
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2152-B | codeforces | 2152-B | Catching the Krug | https://codeforces.com/problemset/problem/2152/B | [
"games"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15087
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2152-A | codeforces | 2152-A | Increase or Smash | https://codeforces.com/problemset/problem/2152/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25186
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2151-C | codeforces | 2151-C | Incremental Stay | https://codeforces.com/problemset/problem/2151/C | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11237
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2151-A | codeforces | 2151-A | Incremental Subarray | https://codeforces.com/problemset/problem/2151/A | [
"math",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18801
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2150-G | codeforces | 2150-G | Counting Is Fun: The Finale | https://codeforces.com/problemset/problem/2150/G | [
"combinatorics",
"implementation"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 455
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2150-F | codeforces | 2150-F | Cycle Closing | https://codeforces.com/problemset/problem/2150/F | [
"constructive algorithms",
"graphs",
"implementation",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 321
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2150-E2 | codeforces | 2150-E2 | Hidden Single (Version 2) | https://codeforces.com/problemset/problem/2150/E2 | [
"binary search",
"divide and conquer",
"interactive",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 913
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2150-E1 | codeforces | 2150-E1 | Hidden Single (Version 1) | https://codeforces.com/problemset/problem/2150/E1 | [
"divide and conquer",
"interactive",
"math",
"probabilities",
"sortings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 2933
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2150-D | codeforces | 2150-D | Attraction Theory | https://codeforces.com/problemset/problem/2150/D | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1404
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2150-C | codeforces | 2150-C | Limited Edition Shop | https://codeforces.com/problemset/problem/2150/C | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4771
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2150-B | codeforces | 2150-B | Grid Counting | https://codeforces.com/problemset/problem/2150/B | [
"combinatorics",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8548
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2150-A | codeforces | 2150-A | Incremental Path | https://codeforces.com/problemset/problem/2150/A | [
"data structures",
"hashing",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14488
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2149-G | codeforces | 2149-G | Buratsuta 3 | https://codeforces.com/problemset/problem/2149/G | [
"binary search",
"brute force",
"data structures",
"divide and conquer",
"probabilities"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2920
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2149-F | codeforces | 2149-F | Nezuko in the Clearing | https://codeforces.com/problemset/problem/2149/F | [
"binary search",
"math",
"ternary search"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5127
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2149-E | codeforces | 2149-E | Hidden Knowledge of the Ancients | https://codeforces.com/problemset/problem/2149/E | [
"data structures",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9996
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2149-D | codeforces | 2149-D | A and B | https://codeforces.com/problemset/problem/2149/D | [
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 20899
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2149-C | codeforces | 2149-C | MEX rose | https://codeforces.com/problemset/problem/2149/C | [
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 29852
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2149-B | codeforces | 2149-B | Unconventional Pairs | https://codeforces.com/problemset/problem/2149/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34523
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2149-A | codeforces | 2149-A | Be Positive | https://codeforces.com/problemset/problem/2149/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 43703
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2148-G | codeforces | 2148-G | Farmer John's Last Wish | https://codeforces.com/problemset/problem/2148/G | [
"binary search",
"data structures",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4477
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2148-F | codeforces | 2148-F | Gravity Falls | https://codeforces.com/problemset/problem/2148/F | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7089
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2148-E | codeforces | 2148-E | Split | https://codeforces.com/problemset/problem/2148/E | [
"binary search",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 15181
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2148-D | codeforces | 2148-D | Destruction of the Dandelion Fields | https://codeforces.com/problemset/problem/2148/D | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 28446
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2148-C | codeforces | 2148-C | Pacer | https://codeforces.com/problemset/problem/2148/C | [
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 26833
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2148-B | codeforces | 2148-B | Lasers | https://codeforces.com/problemset/problem/2148/B | [
"geometry"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34935
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2148-A | codeforces | 2148-A | Sublime Sequence | https://codeforces.com/problemset/problem/2148/A | [
"brute force",
"hashing",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 51036
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2147-I2 | codeforces | 2147-I2 | Longest Increasing Path (Hard Version) | https://codeforces.com/problemset/problem/2147/I2 | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 187
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2147-I1 | codeforces | 2147-I1 | Longest Increasing Path (Easy Version) | https://codeforces.com/problemset/problem/2147/I1 | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 209
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2147-H | codeforces | 2147-H | Maxflow GCD Coloring | https://codeforces.com/problemset/problem/2147/H | [
"constructive algorithms",
"flows",
"graphs"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 568
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2147-G | codeforces | 2147-G | Modular Tetration | https://codeforces.com/problemset/problem/2147/G | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 1317
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2147-F | codeforces | 2147-F | Exchange Queries | https://codeforces.com/problemset/problem/2147/F | [
"combinatorics",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1749
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2147-E | codeforces | 2147-E | Maximum OR Popcount | https://codeforces.com/problemset/problem/2147/E | [
"binary search",
"bitmasks",
"brute force",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2390
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2147-D | codeforces | 2147-D | Game on Array | https://codeforces.com/problemset/problem/2147/D | [
"games",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9325
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2147-C | codeforces | 2147-C | Rabbits | https://codeforces.com/problemset/problem/2147/C | [
"constructive algorithms",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12508
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2147-B | codeforces | 2147-B | Multiple Construction | https://codeforces.com/problemset/problem/2147/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19968
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2147-A | codeforces | 2147-A | Shortest Increasing Path | https://codeforces.com/problemset/problem/2147/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21411
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2146-F | codeforces | 2146-F | Bubble Sort | https://codeforces.com/problemset/problem/2146/F | [
"brute force",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 354
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2146-E | codeforces | 2146-E | Yet Another MEX Problem | https://codeforces.com/problemset/problem/2146/E | [
"brute force",
"constructive algorithms",
"data structures",
"divide and conquer",
"greedy",
"hashing"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2228
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2146-D2 | codeforces | 2146-D2 | Max Sum OR (Hard Version) | https://codeforces.com/problemset/problem/2146/D2 | [
"bitmasks",
"constructive algorithms",
"divide and conquer",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4346
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2146-D1 | codeforces | 2146-D1 | Max Sum OR (Easy Version) | https://codeforces.com/problemset/problem/2146/D1 | [
"bitmasks",
"constructive algorithms",
"divide and conquer",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11457
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2146-C | codeforces | 2146-C | Wrong Binary Search | https://codeforces.com/problemset/problem/2146/C | [
"binary search",
"constructive algorithms"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14253
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2146-B | codeforces | 2146-B | Merging the Sets | https://codeforces.com/problemset/problem/2146/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16933
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2146-A | codeforces | 2146-A | Equal Occurrences | https://codeforces.com/problemset/problem/2146/A | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22782
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2145-G | codeforces | 2145-G | Cost of Coloring | https://codeforces.com/problemset/problem/2145/G | [
"combinatorics",
"divide and conquer",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 656
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2145-F | codeforces | 2145-F | Long Journey | https://codeforces.com/problemset/problem/2145/F | [
"dfs and similar",
"divide and conquer",
"dp",
"graphs",
"greedy",
"math",
"matrices",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1108
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2145-E | codeforces | 2145-E | Predicting Popularity | https://codeforces.com/problemset/problem/2145/E | [
"binary search",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3315
} | 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.