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 stringdate 2026-02-23 02:50:05 2026-02-23 02:50:05 |
|---|---|---|---|---|---|---|---|---|---|---|---|
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": 0
} | 2026-02-23T02:50:05.415469+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": 0
} | 2026-02-23T02:50:05.415469+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": 1
} | 2026-02-23T02:50:05.415469+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": 5
} | 2026-02-23T02:50:05.415469+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": 5
} | 2026-02-23T02:50:05.415469+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": 5
} | 2026-02-23T02:50:05.415469+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": 26
} | 2026-02-23T02:50:05.415469+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": 27
} | 2026-02-23T02:50:05.415469+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": 77
} | 2026-02-23T02:50:05.415469+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": 151
} | 2026-02-23T02:50:05.415469+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": 24
} | 2026-02-23T02:50:05.415469+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": 25
} | 2026-02-23T02:50:05.415469+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": 0
} | 2026-02-23T02:50:05.415469+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": 0
} | 2026-02-23T02:50:05.415469+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": 4
} | 2026-02-23T02:50:05.415469+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": 1
} | 2026-02-23T02:50:05.415469+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": 6
} | 2026-02-23T02:50:05.415469+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": 26
} | 2026-02-23T02:50:05.415469+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": 0
} | 2026-02-23T02:50:05.415469+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": 0
} | 2026-02-23T02:50:05.415469+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": 0
} | 2026-02-23T02:50:05.415469+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": 2
} | 2026-02-23T02:50:05.415469+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": 2
} | 2026-02-23T02:50:05.415469+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": 1
} | 2026-02-23T02:50:05.415469+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": 8
} | 2026-02-23T02:50:05.415469+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": 13
} | 2026-02-23T02:50:05.415469+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": 14
} | 2026-02-23T02:50:05.415469+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": 0
} | 2026-02-23T02:50:05.415469+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": 0
} | 2026-02-23T02:50:05.415469+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": 1
} | 2026-02-23T02:50:05.415469+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": 6
} | 2026-02-23T02:50:05.415469+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": 9
} | 2026-02-23T02:50:05.415469+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": 22
} | 2026-02-23T02:50:05.415469+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": 1
} | 2026-02-23T02:50:05.415469+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": 3
} | 2026-02-23T02:50:05.415469+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": 3
} | 2026-02-23T02:50:05.415469+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": 2
} | 2026-02-23T02:50:05.415469+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": 5
} | 2026-02-23T02:50:05.415469+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": 11
} | 2026-02-23T02:50:05.415469+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": 16
} | 2026-02-23T02:50:05.415469+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": 31
} | 2026-02-23T02:50:05.415469+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": 0
} | 2026-02-23T02:50:05.415469+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": 0
} | 2026-02-23T02:50:05.415469+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": 0
} | 2026-02-23T02:50:05.415469+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": 1
} | 2026-02-23T02:50:05.415469+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": 3
} | 2026-02-23T02:50:05.415469+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": 17
} | 2026-02-23T02:50:05.415469+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": 2
} | 2026-02-23T02:50:05.415469+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": 7
} | 2026-02-23T02:50:05.415469+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": 9
} | 2026-02-23T02:50:05.415469+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": 15
} | 2026-02-23T02:50:05.415469+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": 16
} | 2026-02-23T02:50:05.415469+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": 0
} | 2026-02-23T02:50:05.415469+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": 0
} | 2026-02-23T02:50:05.415469+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": 0
} | 2026-02-23T02:50:05.415469+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": 0
} | 2026-02-23T02:50:05.415469+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": 1
} | 2026-02-23T02:50:05.415469+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": 1
} | 2026-02-23T02:50:05.415469+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": 5
} | 2026-02-23T02:50:05.415469+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": 0
} | 2026-02-23T02:50:05.415469+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": 0
} | 2026-02-23T02:50:05.415469+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": 0
} | 2026-02-23T02:50:05.415469+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": 5
} | 2026-02-23T02:50:05.415469+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": 16
} | 2026-02-23T02:50:05.415469+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": 20
} | 2026-02-23T02:50:05.415469+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": 67
} | 2026-02-23T02:50:05.415469+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": 0
} | 2026-02-23T02:50:05.415469+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": 0
} | 2026-02-23T02:50:05.415469+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": 1
} | 2026-02-23T02:50:05.415469+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": 2
} | 2026-02-23T02:50:05.415469+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": 4
} | 2026-02-23T02:50:05.415469+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": 3
} | 2026-02-23T02:50:05.415469+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": 7
} | 2026-02-23T02:50:05.415469+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": 16
} | 2026-02-23T02:50:05.415469+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": 19
} | 2026-02-23T02:50:05.415469+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": 1
} | 2026-02-23T02:50:05.415469+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": 2
} | 2026-02-23T02:50:05.415469+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": 1
} | 2026-02-23T02:50:05.415469+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": 4
} | 2026-02-23T02:50:05.415469+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": 9
} | 2026-02-23T02:50:05.415469+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": 21
} | 2026-02-23T02:50:05.415469+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": 18
} | 2026-02-23T02:50:05.415469+00:00 |
codeforces:2155-F | codeforces | 2155-F | Juan's Colorful Tree | https://codeforces.com/problemset/problem/2155/F | [
"data structures",
"dfs and similar",
"dsu",
"graphs",
"meet-in-the-middle",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1
} | 2026-02-23T02:50:05.415469+00:00 |
codeforces:2155-E | codeforces | 2155-E | Mimo & Yuyu | https://codeforces.com/problemset/problem/2155/E | [
"games",
"greedy",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4
} | 2026-02-23T02:50:05.415469+00:00 |
codeforces:2155-D | codeforces | 2155-D | Batteries | https://codeforces.com/problemset/problem/2155/D | [
"brute force",
"constructive algorithms",
"graph matchings",
"graphs",
"interactive",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7
} | 2026-02-23T02:50:05.415469+00:00 |
codeforces:2155-C | codeforces | 2155-C | The Ancient Wizards' Capes | https://codeforces.com/problemset/problem/2155/C | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7
} | 2026-02-23T02:50:05.415469+00:00 |
codeforces:2155-B | codeforces | 2155-B | Abraham's Great Escape | https://codeforces.com/problemset/problem/2155/B | [
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15
} | 2026-02-23T02:50:05.415469+00:00 |
codeforces:2155-A | codeforces | 2155-A | El fucho | https://codeforces.com/problemset/problem/2155/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20
} | 2026-02-23T02:50:05.415469+00:00 |
codeforces:2154-F2 | codeforces | 2154-F2 | Bombing (Hard Version) | https://codeforces.com/problemset/problem/2154/F2 | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 3
} | 2026-02-23T02:50:05.415469+00:00 |
codeforces:2154-F1 | codeforces | 2154-F1 | Bombing (Easy Version) | https://codeforces.com/problemset/problem/2154/F1 | [
"brute force",
"combinatorics",
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 2
} | 2026-02-23T02:50:05.415469+00:00 |
codeforces:2154-E | codeforces | 2154-E | No Mind To Think | https://codeforces.com/problemset/problem/2154/E | [
"binary search",
"divide and conquer",
"greedy",
"sortings",
"ternary search",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 4
} | 2026-02-23T02:50:05.415469+00:00 |
codeforces:2154-D | codeforces | 2154-D | Catshock | https://codeforces.com/problemset/problem/2154/D | [
"constructive algorithms",
"dfs and similar",
"graphs",
"trees",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6
} | 2026-02-23T02:50:05.415469+00:00 |
codeforces:2154-C2 | codeforces | 2154-C2 | No Cost Too Great (Hard Version) | https://codeforces.com/problemset/problem/2154/C2 | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2
} | 2026-02-23T02:50:05.415469+00:00 |
codeforces:2154-C1 | codeforces | 2154-C1 | No Cost Too Great (Easy Version) | https://codeforces.com/problemset/problem/2154/C1 | [
"greedy",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9
} | 2026-02-23T02:50:05.415469+00:00 |
codeforces:2154-B | codeforces | 2154-B | Make it Zigzag | https://codeforces.com/problemset/problem/2154/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17
} | 2026-02-23T02:50:05.415469+00:00 |
codeforces:2154-A | codeforces | 2154-A | Notelock | https://codeforces.com/problemset/problem/2154/A | [
"greedy",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20
} | 2026-02-23T02:50:05.415469+00:00 |
codeforces:2153-F | codeforces | 2153-F | Odd Queries on Odd Array | https://codeforces.com/problemset/problem/2153/F | [
"bitmasks",
"brute force",
"data structures",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1
} | 2026-02-23T02:50:05.415469+00:00 |
codeforces:2153-E | codeforces | 2153-E | Zero Trailing Factorial | https://codeforces.com/problemset/problem/2153/E | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1
} | 2026-02-23T02:50:05.415469+00:00 |
codeforces:2153-D | codeforces | 2153-D | Not Alone | https://codeforces.com/problemset/problem/2153/D | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 12
} | 2026-02-23T02:50:05.415469+00:00 |
codeforces:2153-C | codeforces | 2153-C | Symmetrical Polygons | https://codeforces.com/problemset/problem/2153/C | [
"constructive algorithms",
"geometry",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4
} | 2026-02-23T02:50:05.415469+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.