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:2082-B | codeforces | 2082-B | Floor or Ceil | https://codeforces.com/problemset/problem/2082/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8805
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2082-A | codeforces | 2082-A | Binary Matrix | https://codeforces.com/problemset/problem/2082/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 11397
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2081-G2 | codeforces | 2081-G2 | Hard Formula (Hard Version) | https://codeforces.com/problemset/problem/2081/G2 | [
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 61
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2081-G1 | codeforces | 2081-G1 | Hard Formula | https://codeforces.com/problemset/problem/2081/G1 | [
"math",
"number theory"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 85
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2081-F | codeforces | 2081-F | Hot Matrix | https://codeforces.com/problemset/problem/2081/F | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 150
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2081-E | codeforces | 2081-E | Quantifier | https://codeforces.com/problemset/problem/2081/E | [
"combinatorics",
"dp",
"implementation"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 92
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2081-D | codeforces | 2081-D | MST in Modulo Graph | https://codeforces.com/problemset/problem/2081/D | [
"constructive algorithms",
"dsu",
"graphs",
"greedy",
"math",
"number theory",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1462
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2081-C | codeforces | 2081-C | Quaternary Matrix | https://codeforces.com/problemset/problem/2081/C | [
"bitmasks",
"constructive algorithms",
"greedy",
"implementation",
"matrices"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 410
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2081-B | codeforces | 2081-B | Balancing | https://codeforces.com/problemset/problem/2081/B | [
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1050
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2081-A | codeforces | 2081-A | Math Division | https://codeforces.com/problemset/problem/2081/A | [
"bitmasks",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4440
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2080-D | codeforces | 2080-D | Order Statistics | https://codeforces.com/problemset/problem/2080/D | [
"*special",
"binary search"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 50
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2080-C | codeforces | 2080-C | Card Flip | https://codeforces.com/problemset/problem/2080/C | [
"*special"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 223
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2080-B | codeforces | 2080-B | Best Runner | https://codeforces.com/problemset/problem/2080/B | [
"*special"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 541
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2080-A | codeforces | 2080-A | Strong Connectivity Strikes Back | https://codeforces.com/problemset/problem/2080/A | [
"*special",
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 55
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2079-D | codeforces | 2079-D | Cute Subsequences | https://codeforces.com/problemset/problem/2079/D | [
"*special",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 726
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2079-C | codeforces | 2079-C | Dreaming Is Not Harmful | https://codeforces.com/problemset/problem/2079/C | [
"*special"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 236
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2079-B | codeforces | 2079-B | Arithmetic Exercise | https://codeforces.com/problemset/problem/2079/B | [
"*special",
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 187
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2079-A | codeforces | 2079-A | Alice, Bob, And Two Arrays | https://codeforces.com/problemset/problem/2079/A | [
"*special",
"data structures",
"dp",
"games"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 49
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2078-D | codeforces | 2078-D | Scammy Game Ad | https://codeforces.com/problemset/problem/2078/D | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6830
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2078-B | codeforces | 2078-B | Vicious Labyrinth | https://codeforces.com/problemset/problem/2078/B | [
"constructive algorithms",
"graphs",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 18823
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2078-A | codeforces | 2078-A | Final Verdict | https://codeforces.com/problemset/problem/2078/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23610
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2077-G | codeforces | 2077-G | RGB Walking | https://codeforces.com/problemset/problem/2077/G | [
"bitmasks",
"chinese remainder theorem",
"dfs and similar",
"graphs",
"number theory"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 176
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2077-F | codeforces | 2077-F | AND x OR | https://codeforces.com/problemset/problem/2077/F | [
"bitmasks",
"constructive algorithms",
"dp"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 280
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2077-E | codeforces | 2077-E | Another Folding Strip | https://codeforces.com/problemset/problem/2077/E | [
"combinatorics",
"constructive algorithms",
"data structures",
"divide and conquer",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 648
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2077-D | codeforces | 2077-D | Maximum Polygon | https://codeforces.com/problemset/problem/2077/D | [
"brute force",
"data structures",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 487
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2077-C | codeforces | 2077-C | Binary Subsequence Value Sum | https://codeforces.com/problemset/problem/2077/C | [
"combinatorics",
"data structures",
"dp",
"fft",
"math",
"matrices"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2479
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2077-B | codeforces | 2077-B | Finding OR Sum | https://codeforces.com/problemset/problem/2077/B | [
"bitmasks",
"constructive algorithms",
"implementation",
"interactive",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3854
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2077-A | codeforces | 2077-A | Breach of Faith | https://codeforces.com/problemset/problem/2077/A | [
"constructive algorithms",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15194
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2075-F | codeforces | 2075-F | Beautiful Sequence Returns | https://codeforces.com/problemset/problem/2075/F | [
"binary search",
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 554
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2075-E | codeforces | 2075-E | XOR Matrix | https://codeforces.com/problemset/problem/2075/E | [
"bitmasks",
"combinatorics",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1228
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2075-D | codeforces | 2075-D | Equalization | https://codeforces.com/problemset/problem/2075/D | [
"bitmasks",
"brute force",
"dp",
"graphs",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6202
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2075-C | codeforces | 2075-C | Two Colors | https://codeforces.com/problemset/problem/2075/C | [
"binary search",
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15059
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2075-B | codeforces | 2075-B | Array Recoloring | https://codeforces.com/problemset/problem/2075/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 19590
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2075-A | codeforces | 2075-A | To Zero | https://codeforces.com/problemset/problem/2075/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28353
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2074-G | codeforces | 2074-G | Game With Triangles: Season 2 | https://codeforces.com/problemset/problem/2074/G | [
"dp",
"geometry"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2284
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2074-F | codeforces | 2074-F | Counting Necessary Nodes | https://codeforces.com/problemset/problem/2074/F | [
"bitmasks",
"divide and conquer",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2567
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2074-E | codeforces | 2074-E | Empty Triangle | https://codeforces.com/problemset/problem/2074/E | [
"geometry",
"interactive",
"probabilities"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6990
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2074-D | codeforces | 2074-D | Counting Points | https://codeforces.com/problemset/problem/2074/D | [
"brute force",
"data structures",
"geometry",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12535
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2074-C | codeforces | 2074-C | XOR and Triangle | https://codeforces.com/problemset/problem/2074/C | [
"bitmasks",
"brute force",
"geometry",
"greedy",
"probabilities"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22670
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2074-B | codeforces | 2074-B | The Third Side | https://codeforces.com/problemset/problem/2074/B | [
"geometry",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 35828
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2074-A | codeforces | 2074-A | Draw a Square | https://codeforces.com/problemset/problem/2074/A | [
"geometry",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 45844
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2073-M | codeforces | 2073-M | Can You Reach There? | https://codeforces.com/problemset/problem/2073/M | [] | null | null | stdin_stdout | 3,300 | {
"solved_count": 86
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2073-L | codeforces | 2073-L | Boarding Queue | https://codeforces.com/problemset/problem/2073/L | [] | null | null | stdin_stdout | 1,300 | {
"solved_count": 1868
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2073-K | codeforces | 2073-K | Book Sorting | https://codeforces.com/problemset/problem/2073/K | [] | null | null | stdin_stdout | 2,900 | {
"solved_count": 260
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2073-J | codeforces | 2073-J | Gathering Sharks | https://codeforces.com/problemset/problem/2073/J | [] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1233
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2073-I | codeforces | 2073-I | Squares on Grid Lines | https://codeforces.com/problemset/problem/2073/I | [] | null | null | stdin_stdout | 3,100 | {
"solved_count": 131
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2073-H | codeforces | 2073-H | Secret Lilies and Roses | https://codeforces.com/problemset/problem/2073/H | [
"interactive"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 394
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2073-G | codeforces | 2073-G | Corrupted File | https://codeforces.com/problemset/problem/2073/G | [] | null | null | stdin_stdout | 2,200 | {
"solved_count": 959
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2073-F | codeforces | 2073-F | Hold the Star | https://codeforces.com/problemset/problem/2073/F | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 87
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2073-E | codeforces | 2073-E | Minus Operator | https://codeforces.com/problemset/problem/2073/E | [
"interactive"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 87
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2073-D | codeforces | 2073-D | Tower of Hanoi | https://codeforces.com/problemset/problem/2073/D | [] | null | null | stdin_stdout | 2,400 | {
"solved_count": 602
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2073-C | codeforces | 2073-C | Cactus Connectivity | https://codeforces.com/problemset/problem/2073/C | [] | null | null | stdin_stdout | 2,700 | {
"solved_count": 349
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2073-B | codeforces | 2073-B | Three-Dimensional Embedding | https://codeforces.com/problemset/problem/2073/B | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 85
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2073-A | codeforces | 2073-A | Control Towers | https://codeforces.com/problemset/problem/2073/A | [] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1297
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2072-G | codeforces | 2072-G | I've Been Flipping Numbers for 300 Years and Calculated the Sum | https://codeforces.com/problemset/problem/2072/G | [
"binary search",
"brute force",
"combinatorics",
"divide and conquer",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2231
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2072-F | codeforces | 2072-F | Goodbye, Banker Life | https://codeforces.com/problemset/problem/2072/F | [
"2-sat",
"bitmasks",
"combinatorics",
"constructive algorithms",
"fft",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8857
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2072-E | codeforces | 2072-E | Do You Love Your Hero and His Two-Hit Multi-Target Attacks? | https://codeforces.com/problemset/problem/2072/E | [
"binary search",
"brute force",
"constructive algorithms",
"dp",
"geometry",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12865
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2072-D | codeforces | 2072-D | For Wizards, the Exam Is Easy, but I Couldn't Handle It | https://codeforces.com/problemset/problem/2072/D | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18242
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2072-C | codeforces | 2072-C | Creating Keys for StORages Has Become My Main Skill | https://codeforces.com/problemset/problem/2072/C | [
"bitmasks",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 20311
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2072-B | codeforces | 2072-B | Having Been a Treasurer in the Past, I Help Goblins Deceive | https://codeforces.com/problemset/problem/2072/B | [
"combinatorics",
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 31906
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2072-A | codeforces | 2072-A | New World, New Me, New Array | https://codeforces.com/problemset/problem/2072/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 41696
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2071-F | codeforces | 2071-F | Towering Arrays | https://codeforces.com/problemset/problem/2071/F | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 367
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2071-E | codeforces | 2071-E | LeaFall | https://codeforces.com/problemset/problem/2071/E | [
"combinatorics",
"dp",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 857
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2071-D2 | codeforces | 2071-D2 | Infinite Sequence (Hard Version) | https://codeforces.com/problemset/problem/2071/D2 | [
"bitmasks",
"brute force",
"constructive algorithms",
"data structures",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1147
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2071-D1 | codeforces | 2071-D1 | Infinite Sequence (Easy Version) | https://codeforces.com/problemset/problem/2071/D1 | [
"bitmasks",
"brute force",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6959
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2071-C | codeforces | 2071-C | Trapmigiano Reggiano | https://codeforces.com/problemset/problem/2071/C | [
"constructive algorithms",
"data structures",
"dfs and similar",
"dp",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10091
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2071-B | codeforces | 2071-B | Perfecto | https://codeforces.com/problemset/problem/2071/B | [
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21543
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2071-A | codeforces | 2071-A | The Play Never Ends | https://codeforces.com/problemset/problem/2071/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28395
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2070-F | codeforces | 2070-F | Friends and Pizza | https://codeforces.com/problemset/problem/2070/F | [
"bitmasks",
"divide and conquer",
"dp",
"fft"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 397
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2070-E | codeforces | 2070-E | Game with Binary String | https://codeforces.com/problemset/problem/2070/E | [
"constructive algorithms",
"data structures",
"divide and conquer",
"games",
"greedy",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1988
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2070-D | codeforces | 2070-D | Tree Jumps | https://codeforces.com/problemset/problem/2070/D | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11876
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2070-C | codeforces | 2070-C | Limited Repainting | https://codeforces.com/problemset/problem/2070/C | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14524
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2070-B | codeforces | 2070-B | Robot Program | https://codeforces.com/problemset/problem/2070/B | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20237
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2070-A | codeforces | 2070-A | FizzBuzz Remixed | https://codeforces.com/problemset/problem/2070/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26924
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2069-F | codeforces | 2069-F | Graph Inclusion | https://codeforces.com/problemset/problem/2069/F | [
"data structures",
"dfs and similar",
"divide and conquer",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 840
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2069-E | codeforces | 2069-E | A, B, AB and BA | https://codeforces.com/problemset/problem/2069/E | [
"constructive algorithms",
"greedy",
"sortings",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2029
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2069-D | codeforces | 2069-D | Palindrome Shuffle | https://codeforces.com/problemset/problem/2069/D | [
"binary search",
"greedy",
"hashing",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7352
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2069-C | codeforces | 2069-C | Beautiful Sequence | https://codeforces.com/problemset/problem/2069/C | [
"combinatorics",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15620
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2069-B | codeforces | 2069-B | Set of Strangers | https://codeforces.com/problemset/problem/2069/B | [
"greedy",
"matrices"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19390
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2069-A | codeforces | 2069-A | Was there an Array? | https://codeforces.com/problemset/problem/2069/A | [
"graph matchings",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26926
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2068-K | codeforces | 2068-K | Amusement Park Rides | https://codeforces.com/problemset/problem/2068/K | [
"flows",
"graphs"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 259
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2068-J | codeforces | 2068-J | The Ultimate Wine Tasting Event | https://codeforces.com/problemset/problem/2068/J | [
"combinatorics",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1706
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2068-I | codeforces | 2068-I | Pinball | https://codeforces.com/problemset/problem/2068/I | [
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 86
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2068-H | codeforces | 2068-H | Statues | https://codeforces.com/problemset/problem/2068/H | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 441
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2068-G | codeforces | 2068-G | A Very Long Hike | https://codeforces.com/problemset/problem/2068/G | [
"shortest paths"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 86
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2068-F | codeforces | 2068-F | Mascot Naming | https://codeforces.com/problemset/problem/2068/F | [
"brute force",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1604
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2068-E | codeforces | 2068-E | Porto Vs. Benfica | https://codeforces.com/problemset/problem/2068/E | [
"data structures",
"dfs and similar",
"dsu",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 395
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2068-D | codeforces | 2068-D | Morse Code | https://codeforces.com/problemset/problem/2068/D | [
"dp",
"sortings",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 280
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2068-C | codeforces | 2068-C | Ads | https://codeforces.com/problemset/problem/2068/C | [
"binary search",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1753
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2068-B | codeforces | 2068-B | Urban Planning | https://codeforces.com/problemset/problem/2068/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 154
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2068-A | codeforces | 2068-A | Condorcet Elections | https://codeforces.com/problemset/problem/2068/A | [
"constructive algorithms",
"graphs",
"greedy",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1064
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2067-C | codeforces | 2067-C | Devyatkino | https://codeforces.com/problemset/problem/2067/C | [
"brute force",
"dfs and similar",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13245
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2067-B | codeforces | 2067-B | Two Large Bags | https://codeforces.com/problemset/problem/2067/B | [
"brute force",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19735
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2067-A | codeforces | 2067-A | Adjacent Digit Sums | https://codeforces.com/problemset/problem/2067/A | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26159
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2066-F | codeforces | 2066-F | Curse | https://codeforces.com/problemset/problem/2066/F | [
"constructive algorithms",
"dp",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 81
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2066-E | codeforces | 2066-E | Tropical Season | https://codeforces.com/problemset/problem/2066/E | [
"binary search",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 478
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2066-D2 | codeforces | 2066-D2 | Club of Young Aircraft Builders (hard version) | https://codeforces.com/problemset/problem/2066/D2 | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 696
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2066-D1 | codeforces | 2066-D1 | Club of Young Aircraft Builders (easy version) | https://codeforces.com/problemset/problem/2066/D1 | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1564
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2066-C | codeforces | 2066-C | Bitwise Slides | https://codeforces.com/problemset/problem/2066/C | [
"bitmasks",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2615
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2066-B | codeforces | 2066-B | White Magic | https://codeforces.com/problemset/problem/2066/B | [
"constructive algorithms",
"data structures",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5693
} | 2026-10-26T04:20:41.456672+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.