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:2178-C | codeforces | 2178-C | First or Second | https://codeforces.com/problemset/problem/2178/C | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17212
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2178-B | codeforces | 2178-B | Impost or Sus | https://codeforces.com/problemset/problem/2178/B | [
"dp",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 22876
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2178-A | codeforces | 2178-A | Yes or Yes | https://codeforces.com/problemset/problem/2178/A | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27014
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2176-F | codeforces | 2176-F | Omega Numbers | https://codeforces.com/problemset/problem/2176/F | [
"bitmasks",
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1622
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2176-E | codeforces | 2176-E | Remove at the lowest cost | https://codeforces.com/problemset/problem/2176/E | [
"data structures",
"dfs and similar",
"dp",
"dsu",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1408
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2176-D | codeforces | 2176-D | Fibonacci Paths | https://codeforces.com/problemset/problem/2176/D | [
"data structures",
"dp",
"graphs",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6332
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2176-C | codeforces | 2176-C | Odd Process | https://codeforces.com/problemset/problem/2176/C | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16858
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2176-B | codeforces | 2176-B | Optimal Shifts | https://codeforces.com/problemset/problem/2176/B | [
"bitmasks",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 24335
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2176-A | codeforces | 2176-A | Operations with Inversions | https://codeforces.com/problemset/problem/2176/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30348
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2175-B | codeforces | 2175-B | XOR Array | https://codeforces.com/problemset/problem/2175/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13458
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2175-A | codeforces | 2175-A | Little Fairy's Painting | https://codeforces.com/problemset/problem/2175/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19796
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2174-F | codeforces | 2174-F | Mosaic Tree | https://codeforces.com/problemset/problem/2174/F | [
"combinatorics",
"dp",
"fft",
"math",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 525
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2174-E2 | codeforces | 2174-E2 | Game of Scientists (Version 2) | https://codeforces.com/problemset/problem/2174/E2 | [
"binary search",
"chinese remainder theorem",
"dfs and similar",
"interactive",
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 121
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2174-E1 | codeforces | 2174-E1 | Game of Scientists (Version 1) | https://codeforces.com/problemset/problem/2174/E1 | [
"chinese remainder theorem",
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 168
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2174-D | codeforces | 2174-D | Secret Message | https://codeforces.com/problemset/problem/2174/D | [
"data structures",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 339
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2174-C2 | codeforces | 2174-C2 | Beautiful Patterns (Hard Version) | https://codeforces.com/problemset/problem/2174/C2 | [
"combinatorics",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1144
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2174-C1 | codeforces | 2174-C1 | Beautiful Patterns (Easy Version) | https://codeforces.com/problemset/problem/2174/C1 | [
"combinatorics",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1298
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2174-B | codeforces | 2174-B | Wishing Cards | https://codeforces.com/problemset/problem/2174/B | [
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4395
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2174-A | codeforces | 2174-A | Needle in a Haystack | https://codeforces.com/problemset/problem/2174/A | [
"greedy",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 15771
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2173-F | codeforces | 2173-F | Isla's Memory Thresholds | https://codeforces.com/problemset/problem/2173/F | [
"binary search",
"brute force",
"data structures",
"divide and conquer",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 656
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2173-E | codeforces | 2173-E | Shiro's Mirror Duel | https://codeforces.com/problemset/problem/2173/E | [
"constructive algorithms",
"greedy",
"interactive",
"probabilities",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1679
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2173-D | codeforces | 2173-D | Taiga's Carry Chains | https://codeforces.com/problemset/problem/2173/D | [
"bitmasks",
"brute force",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3983
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2173-C | codeforces | 2173-C | Kanade's Perfect Multiples | https://codeforces.com/problemset/problem/2173/C | [
"brute force",
"constructive algorithms",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 13605
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2173-B | codeforces | 2173-B | Niko's Tactical Cards | https://codeforces.com/problemset/problem/2173/B | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19258
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2173-A | codeforces | 2173-A | Sleeping Through Classes | https://codeforces.com/problemset/problem/2173/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24902
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2172-N | codeforces | 2172-N | New Kingdom | https://codeforces.com/problemset/problem/2172/N | [
"constructive algorithms",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 184
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2172-M | codeforces | 2172-M | Maximum Distance To Port | https://codeforces.com/problemset/problem/2172/M | [
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 6840
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2172-L | codeforces | 2172-L | Maximum Color Segment | https://codeforces.com/problemset/problem/2172/L | [
"dp",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 947
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2172-K | codeforces | 2172-K | Kindergarten Homework | https://codeforces.com/problemset/problem/2172/K | [
"implementation",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 958
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2172-J | codeforces | 2172-J | Sliding Tiles | https://codeforces.com/problemset/problem/2172/J | [
"data structures",
"divide and conquer",
"dsu"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 649
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2172-I | codeforces | 2172-I | Birthday | https://codeforces.com/problemset/problem/2172/I | [
"geometry"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1233
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2172-H | codeforces | 2172-H | Shuffling Cards with Problem Solver 68! | https://codeforces.com/problemset/problem/2172/H | [
"hashing",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 344
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2172-G | codeforces | 2172-G | Gene Editor | https://codeforces.com/problemset/problem/2172/G | [] | null | null | stdin_stdout | 3,300 | {
"solved_count": 78
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2172-F | codeforces | 2172-F | Cluster Computing System | https://codeforces.com/problemset/problem/2172/F | [
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4554
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2172-E | codeforces | 2172-E | Number Maze | https://codeforces.com/problemset/problem/2172/E | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 6761
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2172-D | codeforces | 2172-D | Divisor Card Game | https://codeforces.com/problemset/problem/2172/D | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 143
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2172-C | codeforces | 2172-C | Circles Are Far from Each Other | https://codeforces.com/problemset/problem/2172/C | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 114
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2172-B | codeforces | 2172-B | Buses | https://codeforces.com/problemset/problem/2172/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2525
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2172-A | codeforces | 2172-A | ASCII Art Contest | https://codeforces.com/problemset/problem/2172/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15729
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2171-H | codeforces | 2171-H | Shiori Miyagi and Maximum Array Score | https://codeforces.com/problemset/problem/2171/H | [
"binary search",
"data structures",
"dp",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1112
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2171-G | codeforces | 2171-G | Sakura Adachi and Optimal Sequences | https://codeforces.com/problemset/problem/2171/G | [
"bitmasks",
"combinatorics",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2573
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2171-F | codeforces | 2171-F | Rae Taylor and Trees (hard version) | https://codeforces.com/problemset/problem/2171/F | [
"binary search",
"constructive algorithms",
"data structures",
"dp",
"dsu",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7936
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2171-E | codeforces | 2171-E | Anisphia Wynn Palettia and Good Permutations | https://codeforces.com/problemset/problem/2171/E | [
"constructive algorithms",
"greedy",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3911
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2171-D | codeforces | 2171-D | Rae Taylor and Trees (easy version) | https://codeforces.com/problemset/problem/2171/D | [
"binary search",
"data structures",
"dp",
"dsu",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12784
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2171-C2 | codeforces | 2171-C2 | Renako Amaori and XOR Game (hard version) | https://codeforces.com/problemset/problem/2171/C2 | [
"bitmasks",
"games",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12823
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2171-C1 | codeforces | 2171-C1 | Renako Amaori and XOR Game (easy version) | https://codeforces.com/problemset/problem/2171/C1 | [
"bitmasks",
"games",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20466
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2171-B | codeforces | 2171-B | Yuu Koito and Minimum Absolute Sum | https://codeforces.com/problemset/problem/2171/B | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 28858
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2171-A | codeforces | 2171-A | Shizuku Hoshikawa and Farm Legs | https://codeforces.com/problemset/problem/2171/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 39113
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2170-F | codeforces | 2170-F | Build XOR on a Segment | https://codeforces.com/problemset/problem/2170/F | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 901
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2170-E | codeforces | 2170-E | Binary Strings and Blocks | https://codeforces.com/problemset/problem/2170/E | [
"combinatorics",
"data structures",
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2536
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2170-D | codeforces | 2170-D | Almost Roman | https://codeforces.com/problemset/problem/2170/D | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1809
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2170-C | codeforces | 2170-C | Quotient and Remainder | https://codeforces.com/problemset/problem/2170/C | [
"binary search",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12276
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2170-B | codeforces | 2170-B | Addition on a Segment | https://codeforces.com/problemset/problem/2170/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 15784
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2170-A | codeforces | 2170-A | Maximum Neighborhood | https://codeforces.com/problemset/problem/2170/A | [
"bitmasks",
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20970
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2169-F | codeforces | 2169-F | Subsequence Problem | https://codeforces.com/problemset/problem/2169/F | [
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 366
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2169-E | codeforces | 2169-E | Points Selection | https://codeforces.com/problemset/problem/2169/E | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1194
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2169-D2 | codeforces | 2169-D2 | Removal of a Sequence (Hard Version) | https://codeforces.com/problemset/problem/2169/D2 | [
"binary search",
"divide and conquer",
"greedy",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2437
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2169-D1 | codeforces | 2169-D1 | Removal of a Sequence (Easy Version) | https://codeforces.com/problemset/problem/2169/D1 | [
"binary search",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9257
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2169-C | codeforces | 2169-C | Range Operation | https://codeforces.com/problemset/problem/2169/C | [
"dp",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13813
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2169-B | codeforces | 2169-B | Drifting Away | https://codeforces.com/problemset/problem/2169/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17260
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2169-A | codeforces | 2169-A | Alice and Bob | https://codeforces.com/problemset/problem/2169/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 20813
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2168-C | codeforces | 2168-C | Intercepting Butterflies | https://codeforces.com/problemset/problem/2168/C | [
"bitmasks",
"communication",
"constructive algorithms",
"graphs",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 946
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2168-B | codeforces | 2168-B | Locate | https://codeforces.com/problemset/problem/2168/B | [
"binary search",
"combinatorics",
"communication",
"constructive algorithms",
"greedy",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 1677
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2168-A2 | codeforces | 2168-A2 | Encode and Decode (Hard Version) | https://codeforces.com/problemset/problem/2168/A2 | [
"bitmasks",
"communication",
"interactive",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 3650
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2168-A1 | codeforces | 2168-A1 | Encode and Decode (Easy Version) | https://codeforces.com/problemset/problem/2168/A1 | [
"communication",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 5481
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2167-G | codeforces | 2167-G | Mukhammadali and the Smooth Array | https://codeforces.com/problemset/problem/2167/G | [
"data structures",
"dp"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11854
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2167-F | codeforces | 2167-F | Tree, TREE!!! | https://codeforces.com/problemset/problem/2167/F | [
"dfs and similar",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7965
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2167-E | codeforces | 2167-E | khba Loves to Sleep! | https://codeforces.com/problemset/problem/2167/E | [
"binary search",
"data structures",
"geometry",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9931
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2167-D | codeforces | 2167-D | Yet Another Array Problem | https://codeforces.com/problemset/problem/2167/D | [
"brute force",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 32560
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2167-C | codeforces | 2167-C | Isamatdin and His Magic Wand! | https://codeforces.com/problemset/problem/2167/C | [
"constructive algorithms",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 38078
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2167-B | codeforces | 2167-B | Your Name | https://codeforces.com/problemset/problem/2167/B | [
"sortings",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 56160
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2167-A | codeforces | 2167-A | Square? | https://codeforces.com/problemset/problem/2167/A | [
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 64266
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2166-B | codeforces | 2166-B | Tab Closing | https://codeforces.com/problemset/problem/2166/B | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 19615
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2166-A | codeforces | 2166-A | Same Difference | https://codeforces.com/problemset/problem/2166/A | [
"brute force",
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24244
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2165-F | codeforces | 2165-F | Arctic Acquisition | https://codeforces.com/problemset/problem/2165/F | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 284
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2165-E | codeforces | 2165-E | Rainbow Branch | https://codeforces.com/problemset/problem/2165/E | [
"constructive algorithms",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 628
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2165-D | codeforces | 2165-D | Path Split | https://codeforces.com/problemset/problem/2165/D | [
"graph matchings",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1091
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2165-C | codeforces | 2165-C | Binary Wine | https://codeforces.com/problemset/problem/2165/C | [
"bitmasks",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6286
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2165-B | codeforces | 2165-B | Marble Council | https://codeforces.com/problemset/problem/2165/B | [
"dp",
"math",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6873
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2165-A | codeforces | 2165-A | Cyclic Merging | https://codeforces.com/problemset/problem/2165/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17264
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2164-H | codeforces | 2164-H | PalindromePalindrome | https://codeforces.com/problemset/problem/2164/H | [
"data structures",
"strings"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 119
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2164-G | codeforces | 2164-G | Pointless Machine | https://codeforces.com/problemset/problem/2164/G | [
"constructive algorithms",
"graphs",
"interactive",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 356
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2164-F2 | codeforces | 2164-F2 | Chain Prefix Rank (Hard Version) | https://codeforces.com/problemset/problem/2164/F2 | [
"binary search",
"combinatorics",
"data structures",
"dfs and similar",
"dp",
"graphs",
"math",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 944
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2164-F1 | codeforces | 2164-F1 | Chain Prefix Rank (Easy Version) | https://codeforces.com/problemset/problem/2164/F1 | [
"combinatorics",
"dfs and similar",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1954
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2164-E | codeforces | 2164-E | Journey | https://codeforces.com/problemset/problem/2164/E | [
"data structures",
"dfs and similar",
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 4953
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2164-D | codeforces | 2164-D | Copy String | https://codeforces.com/problemset/problem/2164/D | [
"greedy",
"implementation",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7187
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2164-C | codeforces | 2164-C | Dungeon | https://codeforces.com/problemset/problem/2164/C | [
"binary search",
"brute force",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 13644
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2164-B | codeforces | 2164-B | Even Modulo Pair | https://codeforces.com/problemset/problem/2164/B | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 21494
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2164-A | codeforces | 2164-A | Sequence Game | https://codeforces.com/problemset/problem/2164/A | [
"brute force",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23648
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2163-E | codeforces | 2163-E | Plegma | https://codeforces.com/problemset/problem/2163/E | [
"bitmasks",
"combinatorics",
"communication",
"interactive"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 707
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2163-D2 | codeforces | 2163-D2 | Diadrash (Hard Version) | https://codeforces.com/problemset/problem/2163/D2 | [
"binary search",
"interactive",
"math",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1625
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2163-D1 | codeforces | 2163-D1 | Diadrash (Easy Version) | https://codeforces.com/problemset/problem/2163/D1 | [
"binary search",
"brute force",
"divide and conquer",
"implementation",
"interactive"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2895
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2163-C | codeforces | 2163-C | Monopati | https://codeforces.com/problemset/problem/2163/C | [
"brute force",
"combinatorics",
"dp",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9887
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2163-B | codeforces | 2163-B | Siga ta Kymata | https://codeforces.com/problemset/problem/2163/B | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9745
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2163-A | codeforces | 2163-A | Souvlaki VS. Kalamaki | https://codeforces.com/problemset/problem/2163/A | [
"brute force",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20507
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2162-H | codeforces | 2162-H | Beautiful Problem | https://codeforces.com/problemset/problem/2162/H | [
"dp"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 391
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2162-G | codeforces | 2162-G | Beautiful Tree | https://codeforces.com/problemset/problem/2162/G | [
"constructive algorithms",
"math",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2982
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2162-F | codeforces | 2162-F | Beautiful Intervals | https://codeforces.com/problemset/problem/2162/F | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3101
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2162-E | codeforces | 2162-E | Beautiful Palindromes | https://codeforces.com/problemset/problem/2162/E | [
"constructive algorithms",
"greedy",
"schedules"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10077
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2162-D | codeforces | 2162-D | Beautiful Permutation | https://codeforces.com/problemset/problem/2162/D | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 13133
} | 2026-10-19T04:16:34.136750+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.