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: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": 12045
} | 2026-06-01T05:00:40.145500+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": 19488
} | 2026-06-01T05:00:40.145500+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": 27438
} | 2026-06-01T05:00:40.145500+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": 37566
} | 2026-06-01T05:00:40.145500+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": 799
} | 2026-06-01T05:00:40.145500+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": 2364
} | 2026-06-01T05:00:40.145500+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": 1708
} | 2026-06-01T05:00:40.145500+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": 11451
} | 2026-06-01T05:00:40.145500+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": 14576
} | 2026-06-01T05:00:40.145500+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": 20187
} | 2026-06-01T05:00:40.145500+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,700 | {
"solved_count": 343
} | 2026-06-01T05:00:40.145500+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": 1096
} | 2026-06-01T05:00:40.145500+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": 2309
} | 2026-06-01T05:00:40.145500+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": 8693
} | 2026-06-01T05:00:40.145500+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": 12890
} | 2026-06-01T05:00:40.145500+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": 16337
} | 2026-06-01T05:00:40.145500+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": 19386
} | 2026-06-01T05:00:40.145500+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": 881
} | 2026-06-01T05:00:40.145500+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": 1585
} | 2026-06-01T05:00:40.145500+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": 3397
} | 2026-06-01T05:00:40.145500+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": 5087
} | 2026-06-01T05:00:40.145500+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": 11183
} | 2026-06-01T05:00:40.145500+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": 7252
} | 2026-06-01T05:00:40.145500+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": 9217
} | 2026-06-01T05:00:40.145500+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": 30633
} | 2026-06-01T05:00:40.145500+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": 36390
} | 2026-06-01T05:00:40.145500+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": 52603
} | 2026-06-01T05:00:40.145500+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": 59470
} | 2026-06-01T05:00:40.145500+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": 18375
} | 2026-06-01T05:00:40.145500+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": 23126
} | 2026-06-01T05:00:40.145500+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": 197
} | 2026-06-01T05:00:40.145500+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": 307
} | 2026-06-01T05:00:40.145500+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,500 | {
"solved_count": 908
} | 2026-06-01T05:00:40.145500+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": 3859
} | 2026-06-01T05:00:40.145500+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": 4836
} | 2026-06-01T05:00:40.145500+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": 14537
} | 2026-06-01T05:00:40.145500+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": 46
} | 2026-06-01T05:00:40.145500+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": 228
} | 2026-06-01T05:00:40.145500+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": 491
} | 2026-06-01T05:00:40.145500+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": 747
} | 2026-06-01T05:00:40.145500+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": 1903
} | 2026-06-01T05:00:40.145500+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": 5272
} | 2026-06-01T05:00:40.145500+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": 11119
} | 2026-06-01T05:00:40.145500+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": 18730
} | 2026-06-01T05:00:40.145500+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": 21245
} | 2026-06-01T05:00:40.145500+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": 645
} | 2026-06-01T05:00:40.145500+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": 1518
} | 2026-06-01T05:00:40.145500+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": 2756
} | 2026-06-01T05:00:40.145500+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": 9196
} | 2026-06-01T05:00:40.145500+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": 9257
} | 2026-06-01T05:00:40.145500+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": 19746
} | 2026-06-01T05:00:40.145500+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": 319
} | 2026-06-01T05:00:40.145500+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": 2833
} | 2026-06-01T05:00:40.145500+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": 2952
} | 2026-06-01T05:00:40.145500+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": 9479
} | 2026-06-01T05:00:40.145500+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": 12505
} | 2026-06-01T05:00:40.145500+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": 21590
} | 2026-06-01T05:00:40.145500+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": 28183
} | 2026-06-01T05:00:40.145500+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": 41957
} | 2026-06-01T05:00:40.145500+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": 67
} | 2026-06-01T05:00:40.145500+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": 92
} | 2026-06-01T05:00:40.145500+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": 353
} | 2026-06-01T05:00:40.145500+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": 791
} | 2026-06-01T05:00:40.145500+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": 2801
} | 2026-06-01T05:00:40.145500+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": 12799
} | 2026-06-01T05:00:40.145500+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": 5433
} | 2026-06-01T05:00:40.145500+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": 15818
} | 2026-06-01T05:00:40.145500+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": 15343
} | 2026-06-01T05:00:40.145500+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": 17950
} | 2026-06-01T05:00:40.145500+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": 22611
} | 2026-06-01T05:00:40.145500+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": 416
} | 2026-06-01T05:00:40.145500+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": 363
} | 2026-06-01T05:00:40.145500+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": 399
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2159-D1 | codeforces | 2159-D1 | Inverse Minimum Partition (Easy Version) | https://codeforces.com/problemset/problem/2159/D1 | [
"binary search",
"brute force",
"dp",
"geometry",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1111
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2159-C | codeforces | 2159-C | Twin Polynomials | https://codeforces.com/problemset/problem/2159/C | [
"combinatorics",
"graph matchings",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1904
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2159-B | codeforces | 2159-B | Rectangles | https://codeforces.com/problemset/problem/2159/B | [
"brute force",
"data structures",
"dp",
"dsu",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2561
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2159-A | codeforces | 2159-A | MAD Interactive Problem | https://codeforces.com/problemset/problem/2159/A | [
"constructive algorithms",
"implementation",
"interactive"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8382
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2158-F2 | codeforces | 2158-F2 | Distinct GCDs (Hard Version) | https://codeforces.com/problemset/problem/2158/F2 | [
"combinatorics",
"constructive algorithms",
"graphs",
"math",
"number theory"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 261
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2158-F1 | codeforces | 2158-F1 | Distinct GCDs (Easy Version) | https://codeforces.com/problemset/problem/2158/F1 | [
"constructive algorithms",
"graphs",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 420
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2158-E | codeforces | 2158-E | Sink | https://codeforces.com/problemset/problem/2158/E | [
"data structures",
"divide and conquer",
"dsu",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 641
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2158-D | codeforces | 2158-D | Palindrome Flipping | https://codeforces.com/problemset/problem/2158/D | [
"brute force",
"constructive algorithms",
"graphs",
"implementation",
"shortest paths",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3340
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2158-C | codeforces | 2158-C | Annoying Game | https://codeforces.com/problemset/problem/2158/C | [
"dp",
"games",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11328
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2158-B | codeforces | 2158-B | Split | https://codeforces.com/problemset/problem/2158/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14207
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2158-A | codeforces | 2158-A | Suspension | https://codeforces.com/problemset/problem/2158/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23648
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2157-I | codeforces | 2157-I | Hyper Smawk Bros | https://codeforces.com/problemset/problem/2157/I | [
"dp",
"games"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 173
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2157-H | codeforces | 2157-H | Keygen 3 | https://codeforces.com/problemset/problem/2157/H | [
"brute force",
"combinatorics",
"constructive algorithms",
"dfs and similar",
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 133
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2157-G | codeforces | 2157-G | Isaac's Queries | https://codeforces.com/problemset/problem/2157/G | [
"bitmasks",
"brute force",
"constructive algorithms",
"dfs and similar",
"divide and conquer",
"dp",
"greedy",
"interactive",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 460
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2157-F | codeforces | 2157-F | Git Gud | https://codeforces.com/problemset/problem/2157/F | [
"brute force",
"constructive algorithms",
"divide and conquer",
"math",
"ternary search"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1370
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2157-E | codeforces | 2157-E | Adjusting Drones | https://codeforces.com/problemset/problem/2157/E | [
"binary search",
"brute force",
"data structures",
"dp",
"dsu",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3779
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2157-D | codeforces | 2157-D | Billion Players Game | https://codeforces.com/problemset/problem/2157/D | [
"binary search",
"greedy",
"math",
"sortings",
"ternary search",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6365
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2157-C | codeforces | 2157-C | Meximum Array 2 | https://codeforces.com/problemset/problem/2157/C | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9718
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2157-B | codeforces | 2157-B | Expansion Plan 2 | https://codeforces.com/problemset/problem/2157/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 13366
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2157-A | codeforces | 2157-A | Dungeon Equilibrium | https://codeforces.com/problemset/problem/2157/A | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16965
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2156-F2 | codeforces | 2156-F2 | Strange Operation (Hard Version) | https://codeforces.com/problemset/problem/2156/F2 | [
"data structures",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 249
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2156-F1 | codeforces | 2156-F1 | Strange Operation (Easy Version) | https://codeforces.com/problemset/problem/2156/F1 | [
"brute force",
"data structures",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1630
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2156-E | codeforces | 2156-E | Best Time to Buy and Sell Stock | https://codeforces.com/problemset/problem/2156/E | [
"binary search",
"brute force",
"data structures",
"dp",
"games",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 972
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2156-D | codeforces | 2156-D | Find the Last Number | https://codeforces.com/problemset/problem/2156/D | [
"binary search",
"bitmasks",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5425
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2156-C | codeforces | 2156-C | Maximum GCD on Whiteboard | https://codeforces.com/problemset/problem/2156/C | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12451
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2156-B | codeforces | 2156-B | Strange Machine | https://codeforces.com/problemset/problem/2156/B | [
"binary search",
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 21011
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2156-A | codeforces | 2156-A | Pizza Time | https://codeforces.com/problemset/problem/2156/A | [
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27080
} | 2026-06-01T05:00:40.145500+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.