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:2125-C | codeforces | 2125-C | Count Good Numbers | https://codeforces.com/problemset/problem/2125/C | [
"bitmasks",
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22943
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2125-B | codeforces | 2125-B | Left and Down | https://codeforces.com/problemset/problem/2125/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 27677
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2125-A | codeforces | 2125-A | Difficult Contest | https://codeforces.com/problemset/problem/2125/A | [
"constructive algorithms",
"implementation",
"sortings",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28212
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2124-I | codeforces | 2124-I | Lexicographic Partition | https://codeforces.com/problemset/problem/2124/I | [
"constructive algorithms",
"math",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 220
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2124-H | codeforces | 2124-H | Longest Good Subsequence | https://codeforces.com/problemset/problem/2124/H | [
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 222
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2124-G | codeforces | 2124-G | Maximise Sum | https://codeforces.com/problemset/problem/2124/G | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 334
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2124-F2 | codeforces | 2124-F2 | Appending Permutations (Hard Version) | https://codeforces.com/problemset/problem/2124/F2 | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 603
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2124-F1 | codeforces | 2124-F1 | Appending Permutations (Easy Version) | https://codeforces.com/problemset/problem/2124/F1 | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1792
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2124-E | codeforces | 2124-E | Make it Zero | https://codeforces.com/problemset/problem/2124/E | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4026
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2124-D | codeforces | 2124-D | Make a Palindrome | https://codeforces.com/problemset/problem/2124/D | [
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8305
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2124-C | codeforces | 2124-C | Subset Multiplication | https://codeforces.com/problemset/problem/2124/C | [
"constructive algorithms",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15026
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2124-B | codeforces | 2124-B | Minimise Sum | https://codeforces.com/problemset/problem/2124/B | [
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 20714
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2124-A | codeforces | 2124-A | Deranged Deletions | https://codeforces.com/problemset/problem/2124/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19557
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2123-G | codeforces | 2123-G | Modular Sorting | https://codeforces.com/problemset/problem/2123/G | [
"brute force",
"data structures",
"greedy",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3285
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2123-F | codeforces | 2123-F | Minimize Fixed Points | https://codeforces.com/problemset/problem/2123/F | [
"constructive algorithms",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9853
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2123-E | codeforces | 2123-E | MEX Count | https://codeforces.com/problemset/problem/2123/E | [
"binary search",
"data structures",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15047
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2123-D | codeforces | 2123-D | Binary String Battle | https://codeforces.com/problemset/problem/2123/D | [
"constructive algorithms",
"games",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 22079
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2123-C | codeforces | 2123-C | Prefix Min and Suffix Max | https://codeforces.com/problemset/problem/2123/C | [
"brute force",
"data structures"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 31105
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2123-B | codeforces | 2123-B | Tournament | https://codeforces.com/problemset/problem/2123/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 35114
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2123-A | codeforces | 2123-A | Blackboard Game | https://codeforces.com/problemset/problem/2123/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 41924
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2122-G | codeforces | 2122-G | Tree Parking | https://codeforces.com/problemset/problem/2122/G | [
"combinatorics",
"fft",
"math",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 519
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2122-F | codeforces | 2122-F | Colorful Polygon | https://codeforces.com/problemset/problem/2122/F | [
"constructive algorithms",
"divide and conquer",
"geometry"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 134
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2122-E | codeforces | 2122-E | Greedy Grid Counting | https://codeforces.com/problemset/problem/2122/E | [
"combinatorics",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1260
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2122-D | codeforces | 2122-D | Traffic Lights | https://codeforces.com/problemset/problem/2122/D | [
"brute force",
"data structures",
"divide and conquer",
"dp",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2536
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2122-C | codeforces | 2122-C | Manhattan Pairs | https://codeforces.com/problemset/problem/2122/C | [
"constructive algorithms",
"geometry",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8686
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2122-B | codeforces | 2122-B | Pile Shuffling | https://codeforces.com/problemset/problem/2122/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15553
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2122-A | codeforces | 2122-A | Greedy Grid | https://codeforces.com/problemset/problem/2122/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19553
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2121-H | codeforces | 2121-H | Ice Baby | https://codeforces.com/problemset/problem/2121/H | [
"binary search",
"brute force",
"data structures",
"dp",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2273
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2121-G | codeforces | 2121-G | Gangsta | https://codeforces.com/problemset/problem/2121/G | [
"data structures",
"divide and conquer",
"math",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5407
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2121-F | codeforces | 2121-F | Yamakasi | https://codeforces.com/problemset/problem/2121/F | [
"binary search",
"brute force",
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8192
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2121-E | codeforces | 2121-E | Sponsor of Your Problems | https://codeforces.com/problemset/problem/2121/E | [
"dp",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14838
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2121-D | codeforces | 2121-D | 1709 | https://codeforces.com/problemset/problem/2121/D | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18362
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2121-C | codeforces | 2121-C | Those Who Are With Us | https://codeforces.com/problemset/problem/2121/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 21941
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2121-B | codeforces | 2121-B | Above the Clouds | https://codeforces.com/problemset/problem/2121/B | [
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32624
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2121-A | codeforces | 2121-A | Letter Home | https://codeforces.com/problemset/problem/2121/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 39487
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2120-G | codeforces | 2120-G | Eulerian Line Graph | https://codeforces.com/problemset/problem/2120/G | [
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 110
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2120-F | codeforces | 2120-F | Superb Graphs | https://codeforces.com/problemset/problem/2120/F | [
"2-sat",
"graphs"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 488
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2120-E | codeforces | 2120-E | Lanes of Cars | https://codeforces.com/problemset/problem/2120/E | [
"binary search",
"dp",
"ternary search"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1880
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2120-D | codeforces | 2120-D | Matrix game | https://codeforces.com/problemset/problem/2120/D | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5834
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2120-C | codeforces | 2120-C | Divine Tree | https://codeforces.com/problemset/problem/2120/C | [
"constructive algorithms",
"greedy",
"math",
"sortings",
"trees"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12724
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2120-B | codeforces | 2120-B | Square Pool | https://codeforces.com/problemset/problem/2120/B | [
"geometry"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17848
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2120-A | codeforces | 2120-A | Square of Rectangles | https://codeforces.com/problemset/problem/2120/A | [
"geometry",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20433
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2119-F | codeforces | 2119-F | Volcanic Eruptions | https://codeforces.com/problemset/problem/2119/F | [
"dfs and similar",
"dp",
"greedy",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 175
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2119-E | codeforces | 2119-E | And Constraint | https://codeforces.com/problemset/problem/2119/E | [
"bitmasks",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 713
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2119-D | codeforces | 2119-D | Token Removing | https://codeforces.com/problemset/problem/2119/D | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3500
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2119-C | codeforces | 2119-C | A Good Problem | https://codeforces.com/problemset/problem/2119/C | [
"bitmasks",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16442
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2119-B | codeforces | 2119-B | Line Segments | https://codeforces.com/problemset/problem/2119/B | [
"geometry",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18442
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2119-A | codeforces | 2119-A | Add or XOR | https://codeforces.com/problemset/problem/2119/A | [
"bitmasks",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27380
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2118-F | codeforces | 2118-F | Shifts and Swaps | https://codeforces.com/problemset/problem/2118/F | [
"data structures",
"graphs",
"hashing",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 285
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2118-E | codeforces | 2118-E | Grid Coloring | https://codeforces.com/problemset/problem/2118/E | [
"constructive algorithms",
"geometry",
"greedy",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1432
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2118-D2 | codeforces | 2118-D2 | Red Light, Green Light (Hard version) | https://codeforces.com/problemset/problem/2118/D2 | [
"binary search",
"brute force",
"data structures",
"dfs and similar",
"dp",
"graphs",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2519
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2118-D1 | codeforces | 2118-D1 | Red Light, Green Light (Easy version) | https://codeforces.com/problemset/problem/2118/D1 | [
"brute force",
"dfs and similar",
"dp",
"graphs",
"implementation",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8524
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2118-C | codeforces | 2118-C | Make It Beautiful | https://codeforces.com/problemset/problem/2118/C | [
"bitmasks",
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18629
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2118-B | codeforces | 2118-B | Make It Permutation | https://codeforces.com/problemset/problem/2118/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 20158
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2118-A | codeforces | 2118-A | Equal Subsequences | https://codeforces.com/problemset/problem/2118/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29239
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2117-H | codeforces | 2117-H | Incessant Rain | https://codeforces.com/problemset/problem/2117/H | [
"data structures",
"divide and conquer",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 992
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2117-G | codeforces | 2117-G | Omg Graph | https://codeforces.com/problemset/problem/2117/G | [
"brute force",
"dsu",
"graphs",
"greedy",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5199
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2117-F | codeforces | 2117-F | Wildflower | https://codeforces.com/problemset/problem/2117/F | [
"combinatorics",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5971
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2117-E | codeforces | 2117-E | Lost Soul | https://codeforces.com/problemset/problem/2117/E | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11992
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2117-D | codeforces | 2117-D | Retaliation | https://codeforces.com/problemset/problem/2117/D | [
"binary search",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 22288
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2117-C | codeforces | 2117-C | Cool Partition | https://codeforces.com/problemset/problem/2117/C | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 21213
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2117-B | codeforces | 2117-B | Shrink | https://codeforces.com/problemset/problem/2117/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32325
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2117-A | codeforces | 2117-A | False Alarm | https://codeforces.com/problemset/problem/2117/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 38279
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2116-B | codeforces | 2116-B | Gellyfish and Baby's Breath | https://codeforces.com/problemset/problem/2116/B | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17677
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2116-A | codeforces | 2116-A | Gellyfish and Tricolor Pansy | https://codeforces.com/problemset/problem/2116/A | [
"games",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27084
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2115-F2 | codeforces | 2115-F2 | Gellyfish and Lycoris Radiata (Hard Version) | https://codeforces.com/problemset/problem/2115/F2 | [
"data structures"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 115
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2115-F1 | codeforces | 2115-F1 | Gellyfish and Lycoris Radiata (Easy Version) | https://codeforces.com/problemset/problem/2115/F1 | [
"data structures"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 124
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2115-E | codeforces | 2115-E | Gellyfish and Mayflower | https://codeforces.com/problemset/problem/2115/E | [
"dp",
"graphs"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 244
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2115-D | codeforces | 2115-D | Gellyfish and Forget-Me-Not | https://codeforces.com/problemset/problem/2115/D | [
"bitmasks",
"dp",
"games",
"greedy",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1292
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2115-C | codeforces | 2115-C | Gellyfish and Eternal Violet | https://codeforces.com/problemset/problem/2115/C | [
"combinatorics",
"dp",
"greedy",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 970
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2115-B | codeforces | 2115-B | Gellyfish and Camellia Japonica | https://codeforces.com/problemset/problem/2115/B | [
"brute force",
"constructive algorithms",
"dfs and similar",
"dp",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4171
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2115-A | codeforces | 2115-A | Gellyfish and Flaming Peony | https://codeforces.com/problemset/problem/2115/A | [
"constructive algorithms",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15345
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2114-G | codeforces | 2114-G | Build an Array | https://codeforces.com/problemset/problem/2114/G | [
"brute force",
"constructive algorithms",
"dp",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2049
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2114-F | codeforces | 2114-F | Small Operations | https://codeforces.com/problemset/problem/2114/F | [
"binary search",
"brute force",
"dfs and similar",
"dp",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5535
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2114-E | codeforces | 2114-E | Kirei Attacks the Estate | https://codeforces.com/problemset/problem/2114/E | [
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14139
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2114-D | codeforces | 2114-D | Come a Little Closer | https://codeforces.com/problemset/problem/2114/D | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14772
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2114-C | codeforces | 2114-C | Need More Arrays | https://codeforces.com/problemset/problem/2114/C | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 31084
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2114-B | codeforces | 2114-B | Not Quite a Palindromic String | https://codeforces.com/problemset/problem/2114/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 30674
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2114-A | codeforces | 2114-A | Square Year | https://codeforces.com/problemset/problem/2114/A | [
"binary search",
"brute force",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 43470
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2113-F | codeforces | 2113-F | Two Arrays | https://codeforces.com/problemset/problem/2113/F | [
"constructive algorithms",
"dfs and similar",
"graphs",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 959
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2113-E | codeforces | 2113-E | From Kazan with Love | https://codeforces.com/problemset/problem/2113/E | [
"dfs and similar",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 414
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2113-D | codeforces | 2113-D | Cheater | https://codeforces.com/problemset/problem/2113/D | [
"binary search",
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2911
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2113-C | codeforces | 2113-C | Smilo and Minecraft | https://codeforces.com/problemset/problem/2113/C | [
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8065
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2113-B | codeforces | 2113-B | Good Start | https://codeforces.com/problemset/problem/2113/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14760
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2113-A | codeforces | 2113-A | Shashliks | https://codeforces.com/problemset/problem/2113/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20588
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2112-F | codeforces | 2112-F | Variables and Operations | https://codeforces.com/problemset/problem/2112/F | [
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 648
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2112-E | codeforces | 2112-E | Tree Colorings | https://codeforces.com/problemset/problem/2112/E | [
"combinatorics",
"dfs and similar",
"dp",
"graphs",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3411
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2112-D | codeforces | 2112-D | Reachability and Tree | https://codeforces.com/problemset/problem/2112/D | [
"constructive algorithms",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9555
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2112-C | codeforces | 2112-C | Coloring Game | https://codeforces.com/problemset/problem/2112/C | [
"binary search",
"brute force",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17885
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2112-B | codeforces | 2112-B | Shrinking Array | https://codeforces.com/problemset/problem/2112/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21262
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2112-A | codeforces | 2112-A | Race | https://codeforces.com/problemset/problem/2112/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29438
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2111-G | codeforces | 2111-G | Divisible Subarrays | https://codeforces.com/problemset/problem/2111/G | [
"binary search",
"bitmasks",
"brute force",
"data structures",
"interactive"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 402
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2111-F | codeforces | 2111-F | Puzzle | https://codeforces.com/problemset/problem/2111/F | [
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1433
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2111-E | codeforces | 2111-E | Changing the String | https://codeforces.com/problemset/problem/2111/E | [
"binary search",
"data structures",
"greedy",
"implementation",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5431
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2111-D | codeforces | 2111-D | Creating a Schedule | https://codeforces.com/problemset/problem/2111/D | [
"constructive algorithms",
"data structures",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12124
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2111-C | codeforces | 2111-C | Equal Values | https://codeforces.com/problemset/problem/2111/C | [
"brute force",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19607
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2111-B | codeforces | 2111-B | Fibonacci Cubes | https://codeforces.com/problemset/problem/2111/B | [
"brute force",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 18010
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2111-A | codeforces | 2111-A | Energy Crystals | https://codeforces.com/problemset/problem/2111/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20797
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2110-F | codeforces | 2110-F | Faculty | https://codeforces.com/problemset/problem/2110/F | [
"brute force",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1926
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2110-E | codeforces | 2110-E | Melody | https://codeforces.com/problemset/problem/2110/E | [
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2757
} | 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.