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:2132-B | codeforces | 2132-B | The Secret Number | https://codeforces.com/problemset/problem/2132/B | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 32262
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2132-A | codeforces | 2132-A | Homework | https://codeforces.com/problemset/problem/2132/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 42511
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2131-H | codeforces | 2131-H | Sea, You & copriMe | https://codeforces.com/problemset/problem/2131/H | [
"brute force",
"constructive algorithms",
"graphs",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 855
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2131-G | codeforces | 2131-G | Wafu! | https://codeforces.com/problemset/problem/2131/G | [
"bitmasks",
"brute force",
"data structures",
"dfs and similar",
"dp",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3620
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2131-F | codeforces | 2131-F | Unjust Binary Life | https://codeforces.com/problemset/problem/2131/F | [
"binary search",
"data structures",
"greedy",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4627
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2131-E | codeforces | 2131-E | Adjacent XOR | https://codeforces.com/problemset/problem/2131/E | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16595
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2131-D | codeforces | 2131-D | Arboris Contractio | https://codeforces.com/problemset/problem/2131/D | [
"data structures",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 13863
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2131-C | codeforces | 2131-C | Make it Equal | https://codeforces.com/problemset/problem/2131/C | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21189
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2131-B | codeforces | 2131-B | Alternating Series | https://codeforces.com/problemset/problem/2131/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30531
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2131-A | codeforces | 2131-A | Lever | https://codeforces.com/problemset/problem/2131/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 38109
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2130-B | codeforces | 2130-B | Pathless | https://codeforces.com/problemset/problem/2130/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20799
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2130-A | codeforces | 2130-A | Submission is All You Need | https://codeforces.com/problemset/problem/2130/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27985
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2129-F2 | codeforces | 2129-F2 | Top-K Tracker (Hard Version) | https://codeforces.com/problemset/problem/2129/F2 | [
"interactive"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 89
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2129-F1 | codeforces | 2129-F1 | Top-K Tracker (Easy Version) | https://codeforces.com/problemset/problem/2129/F1 | [
"interactive"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 114
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2129-E | codeforces | 2129-E | Induced Subgraph Queries | https://codeforces.com/problemset/problem/2129/E | [
"data structures",
"graphs",
"sortings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 451
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2129-D | codeforces | 2129-D | Permutation Blackhole | https://codeforces.com/problemset/problem/2129/D | [
"brute force",
"combinatorics",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 917
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2129-C3 | codeforces | 2129-C3 | Interactive RBS (Hard Version) | https://codeforces.com/problemset/problem/2129/C3 | [
"binary search",
"bitmasks",
"constructive algorithms",
"dp",
"interactive"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1608
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2129-C2 | codeforces | 2129-C2 | Interactive RBS (Medium Version) | https://codeforces.com/problemset/problem/2129/C2 | [
"binary search",
"bitmasks",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2402
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2129-C1 | codeforces | 2129-C1 | Interactive RBS (Easy Version) | https://codeforces.com/problemset/problem/2129/C1 | [
"binary search",
"bitmasks",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3691
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2129-B | codeforces | 2129-B | Stay or Mirror | https://codeforces.com/problemset/problem/2129/B | [
"brute force",
"data structures",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12766
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2129-A | codeforces | 2129-A | Double Perspective | https://codeforces.com/problemset/problem/2129/A | [
"constructive algorithms",
"dp",
"dsu",
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16126
} | 2026-03-09T02:48:10.180324+00:00 |
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": 366
} | 2026-03-09T02:48:10.180324+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": 770
} | 2026-03-09T02:48:10.180324+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": 6265
} | 2026-03-09T02:48:10.180324+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": 11787
} | 2026-03-09T02:48:10.180324+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": 19946
} | 2026-03-09T02:48:10.180324+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": 20866
} | 2026-03-09T02:48:10.180324+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": 27934
} | 2026-03-09T02:48:10.180324+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": 493
} | 2026-03-09T02:48:10.180324+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": 99
} | 2026-03-09T02:48:10.180324+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": 95
} | 2026-03-09T02:48:10.180324+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": 995
} | 2026-03-09T02:48:10.180324+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": 2598
} | 2026-03-09T02:48:10.180324+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": 5992
} | 2026-03-09T02:48:10.180324+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": 11875
} | 2026-03-09T02:48:10.180324+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": 13216
} | 2026-03-09T02:48:10.180324+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": 19319
} | 2026-03-09T02:48:10.180324+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": 1109
} | 2026-03-09T02:48:10.180324+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": 2400
} | 2026-03-09T02:48:10.180324+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": 4204
} | 2026-03-09T02:48:10.180324+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": 16605
} | 2026-03-09T02:48:10.180324+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": 23467
} | 2026-03-09T02:48:10.180324+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": 25860
} | 2026-03-09T02:48:10.180324+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": 37049
} | 2026-03-09T02:48:10.180324+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": 49879
} | 2026-03-09T02:48:10.180324+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": 387
} | 2026-03-09T02:48:10.180324+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": 1365
} | 2026-03-09T02:48:10.180324+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": 9025
} | 2026-03-09T02:48:10.180324+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": 22351
} | 2026-03-09T02:48:10.180324+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": 26727
} | 2026-03-09T02:48:10.180324+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": 27639
} | 2026-03-09T02:48:10.180324+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": 176
} | 2026-03-09T02:48:10.180324+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": 184
} | 2026-03-09T02:48:10.180324+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": 292
} | 2026-03-09T02:48:10.180324+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": 554
} | 2026-03-09T02:48:10.180324+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": 1513
} | 2026-03-09T02:48:10.180324+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": 3738
} | 2026-03-09T02:48:10.180324+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": 7934
} | 2026-03-09T02:48:10.180324+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": 14168
} | 2026-03-09T02:48:10.180324+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": 19751
} | 2026-03-09T02:48:10.180324+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": 18982
} | 2026-03-09T02:48:10.180324+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": 3135
} | 2026-03-09T02:48:10.180324+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": 9540
} | 2026-03-09T02:48:10.180324+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": 14569
} | 2026-03-09T02:48:10.180324+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": 21416
} | 2026-03-09T02:48:10.180324+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": 30287
} | 2026-03-09T02:48:10.180324+00:00 |
codeforces:2123-B | codeforces | 2123-B | Tournament | https://codeforces.com/problemset/problem/2123/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34432
} | 2026-03-09T02:48:10.180324+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": 41058
} | 2026-03-09T02:48:10.180324+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": 235
} | 2026-03-09T02:48:10.180324+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": 128
} | 2026-03-09T02:48:10.180324+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": 1034
} | 2026-03-09T02:48:10.180324+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": 2432
} | 2026-03-09T02:48:10.180324+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": 8174
} | 2026-03-09T02:48:10.180324+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": 14985
} | 2026-03-09T02:48:10.180324+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": 18975
} | 2026-03-09T02:48:10.180324+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": 2153
} | 2026-03-09T02:48:10.180324+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": 5238
} | 2026-03-09T02:48:10.180324+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": 7872
} | 2026-03-09T02:48:10.180324+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": 14320
} | 2026-03-09T02:48:10.180324+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": 17877
} | 2026-03-09T02:48:10.180324+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": 21288
} | 2026-03-09T02:48:10.180324+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": 32152
} | 2026-03-09T02:48:10.180324+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": 38726
} | 2026-03-09T02:48:10.180324+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": 105
} | 2026-03-09T02:48:10.180324+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": 419
} | 2026-03-09T02:48:10.180324+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": 1783
} | 2026-03-09T02:48:10.180324+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": 5634
} | 2026-03-09T02:48:10.180324+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": 12172
} | 2026-03-09T02:48:10.180324+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": 17398
} | 2026-03-09T02:48:10.180324+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": 19941
} | 2026-03-09T02:48:10.180324+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": 159
} | 2026-03-09T02:48:10.180324+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": 668
} | 2026-03-09T02:48:10.180324+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": 3340
} | 2026-03-09T02:48:10.180324+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": 15892
} | 2026-03-09T02:48:10.180324+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": 17915
} | 2026-03-09T02:48:10.180324+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": 26702
} | 2026-03-09T02:48:10.180324+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": 271
} | 2026-03-09T02:48:10.180324+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": 1398
} | 2026-03-09T02:48:10.180324+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": 2419
} | 2026-03-09T02:48:10.180324+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": 8284
} | 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.