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:2128-F | codeforces | 2128-F | Strict Triangle | https://codeforces.com/problemset/problem/2128/F | [
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 414
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2128-E2 | codeforces | 2128-E2 | Submedians (Hard Version) | https://codeforces.com/problemset/problem/2128/E2 | [
"binary search",
"constructive algorithms",
"data structures",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 840
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2128-E1 | codeforces | 2128-E1 | Submedians (Easy Version) | https://codeforces.com/problemset/problem/2128/E1 | [
"binary search",
"data structures",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6961
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2128-D | codeforces | 2128-D | Sum of LDS | https://codeforces.com/problemset/problem/2128/D | [
"brute force",
"combinatorics",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13173
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2128-C | codeforces | 2128-C | Leftmost Below | https://codeforces.com/problemset/problem/2128/C | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 21793
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2128-B | codeforces | 2128-B | Deque Process | https://codeforces.com/problemset/problem/2128/B | [
"constructive algorithms",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22395
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2128-A | codeforces | 2128-A | Recycling Center | https://codeforces.com/problemset/problem/2128/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29340
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2127-H | codeforces | 2127-H | 23 Rises Again | https://codeforces.com/problemset/problem/2127/H | [
"brute force",
"dfs and similar",
"dp",
"flows",
"graph matchings",
"graphs",
"greedy",
"implementation",
"probabilities",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 2818
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2127-G2 | codeforces | 2127-G2 | Inter Active (Hard Version) | https://codeforces.com/problemset/problem/2127/G2 | [
"binary search",
"bitmasks",
"constructive algorithms",
"graphs",
"implementation",
"interactive",
"math",
"probabilities"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 172
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2127-G1 | codeforces | 2127-G1 | Inter Active (Easy Version) | https://codeforces.com/problemset/problem/2127/G1 | [
"binary search",
"constructive algorithms",
"interactive",
"probabilities"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 195
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2127-F | codeforces | 2127-F | Hamed and AghaBalaSar | https://codeforces.com/problemset/problem/2127/F | [
"brute force",
"combinatorics",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 3018
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2127-E | codeforces | 2127-E | Ancient Tree | https://codeforces.com/problemset/problem/2127/E | [
"constructive algorithms",
"data structures",
"dfs and similar",
"dsu",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5472
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2127-D | codeforces | 2127-D | Root was Built by Love, Broken by Destiny | https://codeforces.com/problemset/problem/2127/D | [
"combinatorics",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8498
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2127-C | codeforces | 2127-C | Trip Shopping | https://codeforces.com/problemset/problem/2127/C | [
"games",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15229
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2127-B | codeforces | 2127-B | Hamiiid, Haaamid... Hamid? | https://codeforces.com/problemset/problem/2127/B | [
"games",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15265
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2127-A | codeforces | 2127-A | Mix Mex Max | https://codeforces.com/problemset/problem/2127/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22254
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2126-G2 | codeforces | 2126-G2 | Big Wins! (hard version) | https://codeforces.com/problemset/problem/2126/G2 | [
"binary search",
"data structures",
"divide and conquer",
"dsu",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1266
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2126-G1 | codeforces | 2126-G1 | Big Wins! (easy version) | https://codeforces.com/problemset/problem/2126/G1 | [
"binary search",
"data structures",
"dp",
"dsu",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2621
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2126-F | codeforces | 2126-F | 1-1-1, Free Tree! | https://codeforces.com/problemset/problem/2126/F | [
"brute force",
"data structures",
"dfs and similar",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4522
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2126-E | codeforces | 2126-E | G-C-D, Unlucky! | https://codeforces.com/problemset/problem/2126/E | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17883
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2126-D | codeforces | 2126-D | This Is the Last Time | https://codeforces.com/problemset/problem/2126/D | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 25046
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2126-C | codeforces | 2126-C | I Will Definitely Make It | https://codeforces.com/problemset/problem/2126/C | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 27297
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2126-B | codeforces | 2126-B | No Casino in the Mountains | https://codeforces.com/problemset/problem/2126/B | [
"dp",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 38893
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2126-A | codeforces | 2126-A | Only One Digit | https://codeforces.com/problemset/problem/2126/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 54678
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2125-F | codeforces | 2125-F | Timofey and Docker | https://codeforces.com/problemset/problem/2125/F | [
"binary search",
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 468
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2125-E | codeforces | 2125-E | Sets of Complementary Sums | https://codeforces.com/problemset/problem/2125/E | [
"brute force",
"combinatorics",
"dp",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1474
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2125-D | codeforces | 2125-D | Segments Covering | https://codeforces.com/problemset/problem/2125/D | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9905
} | 2026-10-12T05:34:17.574904+00:00 |
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": 23701
} | 2026-10-12T05:34:17.574904+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": 28999
} | 2026-10-12T05:34:17.574904+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": 28819
} | 2026-10-12T05:34:17.574904+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": 778
} | 2026-10-12T05:34:17.574904+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": 266
} | 2026-10-12T05:34:17.574904+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": 769
} | 2026-10-12T05:34:17.574904+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": 1261
} | 2026-10-12T05:34:17.574904+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": 3559
} | 2026-10-12T05:34:17.574904+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": 5892
} | 2026-10-12T05:34:17.574904+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": 10151
} | 2026-10-12T05:34:17.574904+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": 17574
} | 2026-10-12T05:34:17.574904+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": 23205
} | 2026-10-12T05:34:17.574904+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": 21645
} | 2026-10-12T05:34:17.574904+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": 3493
} | 2026-10-12T05:34:17.574904+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": 10343
} | 2026-10-12T05:34:17.574904+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": 15619
} | 2026-10-12T05:34:17.574904+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": 22906
} | 2026-10-12T05:34:17.574904+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": 32259
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2123-B | codeforces | 2123-B | Tournament | https://codeforces.com/problemset/problem/2123/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 35809
} | 2026-10-12T05:34:17.574904+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": 42857
} | 2026-10-12T05:34:17.574904+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": 2441
} | 2026-10-12T05:34:17.574904+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": 216
} | 2026-10-12T05:34:17.574904+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": 3080
} | 2026-10-12T05:34:17.574904+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": 3184
} | 2026-10-12T05:34:17.574904+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": 10743
} | 2026-10-12T05:34:17.574904+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": 17878
} | 2026-10-12T05:34:17.574904+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": 21703
} | 2026-10-12T05:34:17.574904+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": 2351
} | 2026-10-12T05:34:17.574904+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": 5593
} | 2026-10-12T05:34:17.574904+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": 8499
} | 2026-10-12T05:34:17.574904+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": 15448
} | 2026-10-12T05:34:17.574904+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": 18935
} | 2026-10-12T05:34:17.574904+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": 22722
} | 2026-10-12T05:34:17.574904+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": 33125
} | 2026-10-12T05:34:17.574904+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": 40230
} | 2026-10-12T05:34:17.574904+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": 119
} | 2026-10-12T05:34:17.574904+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": 511
} | 2026-10-12T05:34:17.574904+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": 1927
} | 2026-10-12T05:34:17.574904+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": 6052
} | 2026-10-12T05:34:17.574904+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": 13191
} | 2026-10-12T05:34:17.574904+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": 18270
} | 2026-10-12T05:34:17.574904+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": 20728
} | 2026-10-12T05:34:17.574904+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": 199
} | 2026-10-12T05:34:17.574904+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": 748
} | 2026-10-12T05:34:17.574904+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": 3620
} | 2026-10-12T05:34:17.574904+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": 17057
} | 2026-10-12T05:34:17.574904+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": 19105
} | 2026-10-12T05:34:17.574904+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": 27935
} | 2026-10-12T05:34:17.574904+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": 306
} | 2026-10-12T05:34:17.574904+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": 1465
} | 2026-10-12T05:34:17.574904+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": 2612
} | 2026-10-12T05:34:17.574904+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": 8749
} | 2026-10-12T05:34:17.574904+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": 19301
} | 2026-10-12T05:34:17.574904+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": 20678
} | 2026-10-12T05:34:17.574904+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": 29632
} | 2026-10-12T05:34:17.574904+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": 1040
} | 2026-10-12T05:34:17.574904+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": 5555
} | 2026-10-12T05:34:17.574904+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": 6235
} | 2026-10-12T05:34:17.574904+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": 12544
} | 2026-10-12T05:34:17.574904+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": 23122
} | 2026-10-12T05:34:17.574904+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": 22030
} | 2026-10-12T05:34:17.574904+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": 32895
} | 2026-10-12T05:34:17.574904+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": 39178
} | 2026-10-12T05:34:17.574904+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": 18132
} | 2026-10-12T05:34:17.574904+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": 27336
} | 2026-10-12T05:34:17.574904+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": 194
} | 2026-10-12T05:34:17.574904+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": 225
} | 2026-10-12T05:34:17.574904+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": 554
} | 2026-10-12T05:34:17.574904+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": 3100
} | 2026-10-12T05:34:17.574904+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": 2124
} | 2026-10-12T05:34:17.574904+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": 6002
} | 2026-10-12T05:34:17.574904+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": 17784
} | 2026-10-12T05:34:17.574904+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": 2121
} | 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.