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:2174-B | codeforces | 2174-B | Wishing Cards | https://codeforces.com/problemset/problem/2174/B | [
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4387
} | 2026-10-12T05:34:17.574904+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": 15738
} | 2026-10-12T05:34:17.574904+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": 652
} | 2026-10-12T05:34:17.574904+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": 1675
} | 2026-10-12T05:34:17.574904+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": 3973
} | 2026-10-12T05:34:17.574904+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": 13572
} | 2026-10-12T05:34:17.574904+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": 19225
} | 2026-10-12T05:34:17.574904+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": 24863
} | 2026-10-12T05:34:17.574904+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": 183
} | 2026-10-12T05:34:17.574904+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": 6789
} | 2026-10-12T05:34:17.574904+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": 942
} | 2026-10-12T05:34:17.574904+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": 952
} | 2026-10-12T05:34:17.574904+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": 647
} | 2026-10-12T05:34:17.574904+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": 1229
} | 2026-10-12T05:34:17.574904+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": 340
} | 2026-10-12T05:34:17.574904+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-12T05:34:17.574904+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": 4538
} | 2026-10-12T05:34:17.574904+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": 6691
} | 2026-10-12T05:34:17.574904+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-12T05:34:17.574904+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-12T05:34:17.574904+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": 2505
} | 2026-10-12T05:34:17.574904+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": 15682
} | 2026-10-12T05:34:17.574904+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": 1105
} | 2026-10-12T05:34:17.574904+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": 2564
} | 2026-10-12T05:34:17.574904+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": 7921
} | 2026-10-12T05:34:17.574904+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": 3903
} | 2026-10-12T05:34:17.574904+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": 12759
} | 2026-10-12T05:34:17.574904+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": 12798
} | 2026-10-12T05:34:17.574904+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": 20434
} | 2026-10-12T05:34:17.574904+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": 28812
} | 2026-10-12T05:34:17.574904+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": 39025
} | 2026-10-12T05:34:17.574904+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": 898
} | 2026-10-12T05:34:17.574904+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": 2528
} | 2026-10-12T05:34:17.574904+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": 1803
} | 2026-10-12T05:34:17.574904+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": 12243
} | 2026-10-12T05:34:17.574904+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": 15728
} | 2026-10-12T05:34:17.574904+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": 20912
} | 2026-10-12T05:34:17.574904+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": 365
} | 2026-10-12T05:34:17.574904+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": 1181
} | 2026-10-12T05:34:17.574904+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": 2434
} | 2026-10-12T05:34:17.574904+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": 9232
} | 2026-10-12T05:34:17.574904+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": 13784
} | 2026-10-12T05:34:17.574904+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": 17219
} | 2026-10-12T05:34:17.574904+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": 20757
} | 2026-10-12T05:34:17.574904+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": 941
} | 2026-10-12T05:34:17.574904+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": 1672
} | 2026-10-12T05:34:17.574904+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": 3622
} | 2026-10-12T05:34:17.574904+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": 5433
} | 2026-10-12T05:34:17.574904+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": 11833
} | 2026-10-12T05:34:17.574904+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": 7944
} | 2026-10-12T05:34:17.574904+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": 9908
} | 2026-10-12T05:34:17.574904+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": 32500
} | 2026-10-12T05:34:17.574904+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": 38013
} | 2026-10-12T05:34:17.574904+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": 56000
} | 2026-10-12T05:34:17.574904+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": 64069
} | 2026-10-12T05:34:17.574904+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": 19558
} | 2026-10-12T05:34:17.574904+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": 24174
} | 2026-10-12T05:34:17.574904+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": 278
} | 2026-10-12T05:34:17.574904+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": 626
} | 2026-10-12T05:34:17.574904+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": 1085
} | 2026-10-12T05:34:17.574904+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": 6275
} | 2026-10-12T05:34:17.574904+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": 6859
} | 2026-10-12T05:34:17.574904+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": 17209
} | 2026-10-12T05:34:17.574904+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": 118
} | 2026-10-12T05:34:17.574904+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": 355
} | 2026-10-12T05:34:17.574904+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-12T05:34:17.574904+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": 1952
} | 2026-10-12T05:34:17.574904+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": 4941
} | 2026-10-12T05:34:17.574904+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": 7176
} | 2026-10-12T05:34:17.574904+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": 13615
} | 2026-10-12T05:34:17.574904+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": 21451
} | 2026-10-12T05:34:17.574904+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": 23615
} | 2026-10-12T05:34:17.574904+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": 704
} | 2026-10-12T05:34:17.574904+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": 1619
} | 2026-10-12T05:34:17.574904+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": 2889
} | 2026-10-12T05:34:17.574904+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": 9871
} | 2026-10-12T05:34:17.574904+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": 9731
} | 2026-10-12T05:34:17.574904+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": 20472
} | 2026-10-12T05:34:17.574904+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": 389
} | 2026-10-12T05:34:17.574904+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": 2971
} | 2026-10-12T05:34:17.574904+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": 3094
} | 2026-10-12T05:34:17.574904+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": 10060
} | 2026-10-12T05:34:17.574904+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": 13122
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2162-C | codeforces | 2162-C | Beautiful XOR | https://codeforces.com/problemset/problem/2162/C | [
"bitmasks",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22731
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2162-B | codeforces | 2162-B | Beautiful String | https://codeforces.com/problemset/problem/2162/B | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 29399
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2162-A | codeforces | 2162-A | Beautiful Average | https://codeforces.com/problemset/problem/2162/A | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 43589
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2161-H | codeforces | 2161-H | Cycle Sort | https://codeforces.com/problemset/problem/2161/H | [
"data structures"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 87
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2161-G | codeforces | 2161-G | Bitwise And Equals | https://codeforces.com/problemset/problem/2161/G | [
"bitmasks",
"greedy"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 107
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2161-F | codeforces | 2161-F | SubMST | https://codeforces.com/problemset/problem/2161/F | [
"combinatorics",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 402
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2161-E | codeforces | 2161-E | Left is Always Right | https://codeforces.com/problemset/problem/2161/E | [
"combinatorics",
"implementation",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 832
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2161-D | codeforces | 2161-D | Locked Out | https://codeforces.com/problemset/problem/2161/D | [
"binary search",
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2974
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2161-C | codeforces | 2161-C | Loyalty | https://codeforces.com/problemset/problem/2161/C | [
"constructive algorithms",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 13786
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2161-B | codeforces | 2161-B | Make Connected | https://codeforces.com/problemset/problem/2161/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5689
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2161-A | codeforces | 2161-A | Round Trip | https://codeforces.com/problemset/problem/2161/A | [
"games",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16243
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2160-C | codeforces | 2160-C | Reverse XOR | https://codeforces.com/problemset/problem/2160/C | [
"bitmasks"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16138
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2160-B | codeforces | 2160-B | Distinct Elements | https://codeforces.com/problemset/problem/2160/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 18750
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2160-A | codeforces | 2160-A | MEX Partition | https://codeforces.com/problemset/problem/2160/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23232
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2159-F | codeforces | 2159-F | Grand Finale: Snakes | https://codeforces.com/problemset/problem/2159/F | [
"binary search",
"interactive",
"ternary search"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 904
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2159-E | codeforces | 2159-E | Super-Short-Polynomial-San | https://codeforces.com/problemset/problem/2159/E | [
"math",
"meet-in-the-middle"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 2374
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2159-D2 | codeforces | 2159-D2 | Inverse Minimum Partition (Hard Version) | https://codeforces.com/problemset/problem/2159/D2 | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 539
} | 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.