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: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": 45717
} | 2026-03-09T02:48:10.180324+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": 97
} | 2026-03-09T02:48:10.180324+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": 127
} | 2026-03-09T02:48:10.180324+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": 150
} | 2026-03-09T02:48:10.180324+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": 316
} | 2026-03-09T02:48:10.180324+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": 629
} | 2026-03-09T02:48:10.180324+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": 2077
} | 2026-03-09T02:48:10.180324+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": 7235
} | 2026-03-09T02:48:10.180324+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": 9290
} | 2026-03-09T02:48:10.180324+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": 16298
} | 2026-03-09T02:48:10.180324+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": 18140
} | 2026-03-09T02:48:10.180324+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": 284
} | 2026-03-09T02:48:10.180324+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": 1926
} | 2026-03-09T02:48:10.180324+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": 3832
} | 2026-03-09T02:48:10.180324+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": 9893
} | 2026-03-09T02:48:10.180324+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": 12803
} | 2026-03-09T02:48:10.180324+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": 15300
} | 2026-03-09T02:48:10.180324+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": 21243
} | 2026-03-09T02:48:10.180324+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": 453
} | 2026-03-09T02:48:10.180324+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": 916
} | 2026-03-09T02:48:10.180324+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": 2854
} | 2026-03-09T02:48:10.180324+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": 6358
} | 2026-03-09T02:48:10.180324+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": 14791
} | 2026-03-09T02:48:10.180324+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": 20788
} | 2026-03-09T02:48:10.180324+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": 29731
} | 2026-03-09T02:48:10.180324+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": 767
} | 2026-03-09T02:48:10.180324+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": 1346
} | 2026-03-09T02:48:10.180324+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": 2422
} | 2026-03-09T02:48:10.180324+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": 6711
} | 2026-03-09T02:48:10.180324+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": 14415
} | 2026-03-09T02:48:10.180324+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": 17838
} | 2026-03-09T02:48:10.180324+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": 21102
} | 2026-03-09T02:48:10.180324+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": 392
} | 2026-03-09T02:48:10.180324+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": 1701
} | 2026-03-09T02:48:10.180324+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": 2591
} | 2026-03-09T02:48:10.180324+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": 6050
} | 2026-03-09T02:48:10.180324+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": 13481
} | 2026-03-09T02:48:10.180324+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": 19942
} | 2026-03-09T02:48:10.180324+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": 20155
} | 2026-03-09T02:48:10.180324+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": 55
} | 2026-03-09T02:48:10.180324+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": 83
} | 2026-03-09T02:48:10.180324+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": 60
} | 2026-03-09T02:48:10.180324+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": 134
} | 2026-03-09T02:48:10.180324+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": 252
} | 2026-03-09T02:48:10.180324+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": 461
} | 2026-03-09T02:48:10.180324+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": 336
} | 2026-03-09T02:48:10.180324+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": 1347
} | 2026-03-09T02:48:10.180324+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": 1564
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2140-F | codeforces | 2140-F | Sum Minimisation | https://codeforces.com/problemset/problem/2140/F | [
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 286
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2140-E2 | codeforces | 2140-E2 | Prime Gaming (Hard Version) | https://codeforces.com/problemset/problem/2140/E2 | [
"bitmasks",
"combinatorics",
"dp",
"probabilities"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1154
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2140-E1 | codeforces | 2140-E1 | Prime Gaming (Easy Version) | https://codeforces.com/problemset/problem/2140/E1 | [
"bitmasks",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2003
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2140-D | codeforces | 2140-D | A Cruel Segment's Thesis | https://codeforces.com/problemset/problem/2140/D | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4614
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2140-C | codeforces | 2140-C | Ultimate Value | https://codeforces.com/problemset/problem/2140/C | [
"data structures",
"games",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11826
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2140-B | codeforces | 2140-B | Another Divisibility Problem | https://codeforces.com/problemset/problem/2140/B | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 21346
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2140-A | codeforces | 2140-A | Shift Sort | https://codeforces.com/problemset/problem/2140/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21718
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2139-B | codeforces | 2139-B | Cake Collection | https://codeforces.com/problemset/problem/2139/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20299
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2139-A | codeforces | 2139-A | Maple and Multiplication | https://codeforces.com/problemset/problem/2139/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25178
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2138-F | codeforces | 2138-F | Ode to the Bridge Builder | https://codeforces.com/problemset/problem/2138/F | [
"constructive algorithms",
"geometry"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 76
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2138-E2 | codeforces | 2138-E2 | Determinant Construction (Hard Version) | https://codeforces.com/problemset/problem/2138/E2 | [
"brute force",
"constructive algorithms",
"math",
"matrices",
"number theory"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 175
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2138-E1 | codeforces | 2138-E1 | Determinant Construction (Easy Version) | https://codeforces.com/problemset/problem/2138/E1 | [
"brute force",
"constructive algorithms",
"math",
"matrices",
"number theory"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 203
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2138-D | codeforces | 2138-D | Antiamuny and Slider Movement | https://codeforces.com/problemset/problem/2138/D | [
"brute force",
"combinatorics",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 598
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2138-C2 | codeforces | 2138-C2 | Maple and Tree Beauty (Hard Version) | https://codeforces.com/problemset/problem/2138/C2 | [
"bitmasks",
"brute force",
"dfs and similar",
"dp",
"fft",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3224
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2138-C1 | codeforces | 2138-C1 | Maple and Tree Beauty (Easy Version) | https://codeforces.com/problemset/problem/2138/C1 | [
"brute force",
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5204
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2138-B | codeforces | 2138-B | Antiamuny Wants to Learn Swap | https://codeforces.com/problemset/problem/2138/B | [
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5105
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2138-A | codeforces | 2138-A | Cake Assignment | https://codeforces.com/problemset/problem/2138/A | [
"bitmasks",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16448
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2137-G | codeforces | 2137-G | Cry Me a River | https://codeforces.com/problemset/problem/2137/G | [
"dfs and similar",
"dp",
"games",
"graphs"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1882
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2137-F | codeforces | 2137-F | Prefix Maximum Invariance | https://codeforces.com/problemset/problem/2137/F | [
"binary search",
"combinatorics",
"data structures",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3938
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2137-E | codeforces | 2137-E | Mexification | https://codeforces.com/problemset/problem/2137/E | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9838
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2137-D | codeforces | 2137-D | Replace with Occurrences | https://codeforces.com/problemset/problem/2137/D | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19010
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2137-C | codeforces | 2137-C | Maximum Even Sum | https://codeforces.com/problemset/problem/2137/C | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22358
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2137-B | codeforces | 2137-B | Fun Permutation | https://codeforces.com/problemset/problem/2137/B | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 25869
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2137-A | codeforces | 2137-A | Collatz Conjecture | https://codeforces.com/problemset/problem/2137/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34665
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2136-B | codeforces | 2136-B | Like the Bitset | https://codeforces.com/problemset/problem/2136/B | [
"constructive algorithms",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 900 | {
"solved_count": 20328
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2136-A | codeforces | 2136-A | In the Dream | https://codeforces.com/problemset/problem/2136/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25520
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2135-F | codeforces | 2135-F | To the Infinity | https://codeforces.com/problemset/problem/2135/F | [
"data structures",
"hashing",
"math",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 204
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2135-E2 | codeforces | 2135-E2 | Beyond the Palindrome (Hard Version) | https://codeforces.com/problemset/problem/2135/E2 | [
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 143
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2135-E1 | codeforces | 2135-E1 | Beyond the Palindrome (Easy Version) | https://codeforces.com/problemset/problem/2135/E1 | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 212
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2135-D2 | codeforces | 2135-D2 | From the Unknown (Hard Version) | https://codeforces.com/problemset/problem/2135/D2 | [
"brute force",
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 967
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2135-D1 | codeforces | 2135-D1 | From the Unknown (Easy Version) | https://codeforces.com/problemset/problem/2135/D1 | [
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2304
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2135-C | codeforces | 2135-C | By the Assignment | https://codeforces.com/problemset/problem/2135/C | [
"binary search",
"bitmasks",
"combinatorics",
"dfs and similar",
"dsu",
"graphs",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3641
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2135-B | codeforces | 2135-B | For the Champion | https://codeforces.com/problemset/problem/2135/B | [
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7045
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2135-A | codeforces | 2135-A | Against the Difference | https://codeforces.com/problemset/problem/2135/A | [
"data structures",
"dp"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17704
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2134-F | codeforces | 2134-F | Permutation Oddness | https://codeforces.com/problemset/problem/2134/F | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 587
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2134-E | codeforces | 2134-E | Power Boxes | https://codeforces.com/problemset/problem/2134/E | [
"constructive algorithms",
"dp",
"implementation",
"interactive"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2275
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2134-D | codeforces | 2134-D | Sliding Tree | https://codeforces.com/problemset/problem/2134/D | [
"constructive algorithms",
"dfs and similar",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3570
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2134-C | codeforces | 2134-C | Even Larger | https://codeforces.com/problemset/problem/2134/C | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18087
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2134-B | codeforces | 2134-B | Add 0 or K | https://codeforces.com/problemset/problem/2134/B | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 20174
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2134-A | codeforces | 2134-A | Painting With Two Colors | https://codeforces.com/problemset/problem/2134/A | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26052
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2133-F | codeforces | 2133-F | Flint and Steel | https://codeforces.com/problemset/problem/2133/F | [
"data structures",
"dp",
"graphs"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 446
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2133-E | codeforces | 2133-E | I Yearned For The Mines | https://codeforces.com/problemset/problem/2133/E | [
"constructive algorithms",
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1577
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2133-D | codeforces | 2133-D | Chicken Jockey | https://codeforces.com/problemset/problem/2133/D | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7260
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2133-C | codeforces | 2133-C | The Nether | https://codeforces.com/problemset/problem/2133/C | [
"graphs",
"interactive"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12280
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2133-B | codeforces | 2133-B | Villagers | https://codeforces.com/problemset/problem/2133/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25073
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2133-A | codeforces | 2133-A | Redstone? | https://codeforces.com/problemset/problem/2133/A | [
"brute force",
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30242
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2132-G | codeforces | 2132-G | Famous Choreographer | https://codeforces.com/problemset/problem/2132/G | [
"hashing",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 501
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2132-F | codeforces | 2132-F | Rada and the Chamomile Valley | https://codeforces.com/problemset/problem/2132/F | [
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2631
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2132-E | codeforces | 2132-E | Arithmetics Competition | https://codeforces.com/problemset/problem/2132/E | [
"binary search",
"data structures",
"greedy",
"sortings",
"ternary search"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7345
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2132-D | codeforces | 2132-D | From 1 to Infinity | https://codeforces.com/problemset/problem/2132/D | [
"binary search",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8604
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2132-C2 | codeforces | 2132-C2 | The Cunning Seller (hard version) | https://codeforces.com/problemset/problem/2132/C2 | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 13026
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2132-C1 | codeforces | 2132-C1 | The Cunning Seller (easy version) | https://codeforces.com/problemset/problem/2132/C1 | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 27202
} | 2026-03-09T02:48:10.180324+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.