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: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": 665
} | 2026-06-01T05:00:40.145500+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": 2909
} | 2026-06-01T05:00:40.145500+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": 5972
} | 2026-06-01T05:00:40.145500+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,500 | {
"solved_count": 10449
} | 2026-06-01T05:00:40.145500+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": 17229
} | 2026-06-01T05:00:40.145500+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": 25404
} | 2026-06-01T05:00:40.145500+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": 178
} | 2026-06-01T05:00:40.145500+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": 573
} | 2026-06-01T05:00:40.145500+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": 1225
} | 2026-06-01T05:00:40.145500+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": 4832
} | 2026-06-01T05:00:40.145500+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": 5587
} | 2026-06-01T05:00:40.145500+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": 13734
} | 2026-06-01T05:00:40.145500+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": 20053
} | 2026-06-01T05:00:40.145500+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": 23350
} | 2026-06-01T05:00:40.145500+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": 325
} | 2026-06-01T05:00:40.145500+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": 1007
} | 2026-06-01T05:00:40.145500+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": 6382
} | 2026-06-01T05:00:40.145500+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": 11932
} | 2026-06-01T05:00:40.145500+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": 22742
} | 2026-06-01T05:00:40.145500+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": 26543
} | 2026-06-01T05:00:40.145500+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": 203
} | 2026-06-01T05:00:40.145500+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": 925
} | 2026-06-01T05:00:40.145500+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": 1052
} | 2026-06-01T05:00:40.145500+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,500 | {
"solved_count": 1380
} | 2026-06-01T05:00:40.145500+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": 3068
} | 2026-06-01T05:00:40.145500+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": 7082
} | 2026-06-01T05:00:40.145500+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": 12706
} | 2026-06-01T05:00:40.145500+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": 13127
} | 2026-06-01T05:00:40.145500+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": 22798
} | 2026-06-01T05:00:40.145500+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": 10497
} | 2026-06-01T05:00:40.145500+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": 18131
} | 2026-06-01T05:00:40.145500+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": 192
} | 2026-06-01T05:00:40.145500+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": 205
} | 2026-06-01T05:00:40.145500+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": 604
} | 2026-06-01T05:00:40.145500+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": 1346
} | 2026-06-01T05:00:40.145500+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": 857
} | 2026-06-01T05:00:40.145500+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": 2886
} | 2026-06-01T05:00:40.145500+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": 6394
} | 2026-06-01T05:00:40.145500+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": 12137
} | 2026-06-01T05:00:40.145500+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": 2700
} | 2026-06-01T05:00:40.145500+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": 4877
} | 2026-06-01T05:00:40.145500+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": 9412
} | 2026-06-01T05:00:40.145500+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": 19608
} | 2026-06-01T05:00:40.145500+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": 28453
} | 2026-06-01T05:00:40.145500+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": 33290
} | 2026-06-01T05:00:40.145500+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": 41309
} | 2026-06-01T05:00:40.145500+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": 4241
} | 2026-06-01T05:00:40.145500+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": 6675
} | 2026-06-01T05:00:40.145500+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": 14261
} | 2026-06-01T05:00:40.145500+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": 27063
} | 2026-06-01T05:00:40.145500+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": 25600
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2148-B | codeforces | 2148-B | Lasers | https://codeforces.com/problemset/problem/2148/B | [
"geometry"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33367
} | 2026-06-01T05:00:40.145500+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": 47970
} | 2026-06-01T05:00:40.145500+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": 108
} | 2026-06-01T05:00:40.145500+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": 136
} | 2026-06-01T05:00:40.145500+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": 238
} | 2026-06-01T05:00:40.145500+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": 448
} | 2026-06-01T05:00:40.145500+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": 757
} | 2026-06-01T05:00:40.145500+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": 2159
} | 2026-06-01T05:00:40.145500+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": 7687
} | 2026-06-01T05:00:40.145500+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": 10134
} | 2026-06-01T05:00:40.145500+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": 17408
} | 2026-06-01T05:00:40.145500+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": 19022
} | 2026-06-01T05:00:40.145500+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": 311
} | 2026-06-01T05:00:40.145500+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": 2095
} | 2026-06-01T05:00:40.145500+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": 4117
} | 2026-06-01T05:00:40.145500+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": 10685
} | 2026-06-01T05:00:40.145500+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": 13514
} | 2026-06-01T05:00:40.145500+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": 16139
} | 2026-06-01T05:00:40.145500+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": 22055
} | 2026-06-01T05:00:40.145500+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": 563
} | 2026-06-01T05:00:40.145500+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": 1014
} | 2026-06-01T05:00:40.145500+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": 3122
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2145-D | codeforces | 2145-D | Inversion Value of a Permutation | https://codeforces.com/problemset/problem/2145/D | [
"constructive algorithms",
"dfs and similar",
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6766
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2145-C | codeforces | 2145-C | Monocarp's String | https://codeforces.com/problemset/problem/2145/C | [
"binary search",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15646
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2145-B | codeforces | 2145-B | Deck of Cards | https://codeforces.com/problemset/problem/2145/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 21830
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2145-A | codeforces | 2145-A | Candies for Nephews | https://codeforces.com/problemset/problem/2145/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31142
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2144-F | codeforces | 2144-F | Bracket Groups | https://codeforces.com/problemset/problem/2144/F | [
"brute force",
"constructive algorithms",
"dp",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 975
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2144-E2 | codeforces | 2144-E2 | Looking at Towers (difficult version) | https://codeforces.com/problemset/problem/2144/E2 | [
"combinatorics",
"data structures",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1465
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2144-E1 | codeforces | 2144-E1 | Looking at Towers (easy version) | https://codeforces.com/problemset/problem/2144/E1 | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2621
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2144-D | codeforces | 2144-D | Price Tags | https://codeforces.com/problemset/problem/2144/D | [
"brute force",
"dp",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7108
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2144-C | codeforces | 2144-C | Non-Descending Arrays | https://codeforces.com/problemset/problem/2144/C | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15192
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2144-B | codeforces | 2144-B | Maximum Cost Permutation | https://codeforces.com/problemset/problem/2144/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 18730
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2144-A | codeforces | 2144-A | Cut the Array | https://codeforces.com/problemset/problem/2144/A | [
"brute force",
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21877
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2143-F | codeforces | 2143-F | Increasing Xor | https://codeforces.com/problemset/problem/2143/F | [
"bitmasks",
"data structures",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 435
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2143-E | codeforces | 2143-E | Make Good | https://codeforces.com/problemset/problem/2143/E | [
"constructive algorithms",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1982
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2143-D2 | codeforces | 2143-D2 | Inversion Graph Coloring (Hard Version) | https://codeforces.com/problemset/problem/2143/D2 | [
"binary search",
"combinatorics",
"data structures",
"dp",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2837
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2143-D1 | codeforces | 2143-D1 | Inversion Graph Coloring (Easy Version) | https://codeforces.com/problemset/problem/2143/D1 | [
"combinatorics",
"data structures",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6526
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2143-C | codeforces | 2143-C | Max Tree | https://codeforces.com/problemset/problem/2143/C | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14340
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2143-B | codeforces | 2143-B | Discounts | https://codeforces.com/problemset/problem/2143/B | [
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 21277
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2143-A | codeforces | 2143-A | All Lengths Subtraction | https://codeforces.com/problemset/problem/2143/A | [
"brute force",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20952
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2141-I | codeforces | 2141-I | Color the Tree | https://codeforces.com/problemset/problem/2141/I | [
"*special"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 57
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2141-H | codeforces | 2141-H | Merging Vertices in a Graph | https://codeforces.com/problemset/problem/2141/H | [
"*special",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 84
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2141-G | codeforces | 2141-G | Good Robot Paths | https://codeforces.com/problemset/problem/2141/G | [
"*special",
"data structures",
"geometry",
"sortings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 63
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2141-F | codeforces | 2141-F | Array Reduction | https://codeforces.com/problemset/problem/2141/F | [
"*special",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 145
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2141-E | codeforces | 2141-E | Perfect Cut | https://codeforces.com/problemset/problem/2141/E | [
"*special",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 259
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2141-D | codeforces | 2141-D | Avoid Minimums | https://codeforces.com/problemset/problem/2141/D | [
"*special",
"greedy",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 477
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2141-C | codeforces | 2141-C | Minimum on Subarrays | https://codeforces.com/problemset/problem/2141/C | [
"*special",
"brute force"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 348
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2141-B | codeforces | 2141-B | Games | https://codeforces.com/problemset/problem/2141/B | [
"*special",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 1473
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2141-A | codeforces | 2141-A | Furniture Store | https://codeforces.com/problemset/problem/2141/A | [
"*special",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 1644
} | 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.