The full dataset viewer is not available (click to read why). Only showing a preview of the rows.
The information about the size of the dataset is not coherent.
Error code: UnexpectedError
Need help to make the dataset viewer work? Make sure to review how to configure the dataset viewer, and open a discussion for direct support.
uid string | source string | native_id string | title string | url string | tags list | time_limit_ms null | memory_limit_mb null | io_type string | difficulty_rating int64 | stats dict | last_scraped_at string |
|---|---|---|---|---|---|---|---|---|---|---|---|
codeforces:2256-B | codeforces | 2256-B | Domino Tiles | https://codeforces.com/problemset/problem/2256/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 13485
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2256-A | codeforces | 2256-A | Three Numbers on the Blackboard | https://codeforces.com/problemset/problem/2256/A | [
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19246
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2255-F | codeforces | 2255-F | Who Will Witness the End? | https://codeforces.com/problemset/problem/2255/F | [
"fft",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 117
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2255-E2 | codeforces | 2255-E2 | What Will Remain at the End? (Hard Version) | https://codeforces.com/problemset/problem/2255/E2 | [
"data structures"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 80
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2255-E1 | codeforces | 2255-E1 | What Will Remain at the End? (Easy Version) | https://codeforces.com/problemset/problem/2255/E1 | [
"brute force",
"data structures"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 142
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2255-D | codeforces | 2255-D | How Long Until Nothing Remains? | https://codeforces.com/problemset/problem/2255/D | [
"binary search",
"bitmasks",
"data structures",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1135
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2255-C | codeforces | 2255-C | Even If the World Turns | https://codeforces.com/problemset/problem/2255/C | [
"communication",
"constructive algorithms",
"expression parsing",
"greedy",
"interactive",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1213
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2255-B | codeforces | 2255-B | A Ribbon for Tomorrow | https://codeforces.com/problemset/problem/2255/B | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5497
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2255-A | codeforces | 2255-A | Hot Potatoes at the Fairy Warehouse | https://codeforces.com/problemset/problem/2255/A | [
"games",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10846
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2254-G | codeforces | 2254-G | Nightcrawler | https://codeforces.com/problemset/problem/2254/G | [
"data structures",
"dfs and similar",
"dp",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 826
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2254-F | codeforces | 2254-F | Whiplash | https://codeforces.com/problemset/problem/2254/F | [
"bitmasks",
"constructive algorithms",
"math",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2527
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2254-E | codeforces | 2254-E | Chronostasis | https://codeforces.com/problemset/problem/2254/E | [
"binary search",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6052
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2254-D | codeforces | 2254-D | Silhouette | https://codeforces.com/problemset/problem/2254/D | [
"constructive algorithms",
"math",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 8559
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2254-C2 | codeforces | 2254-C2 | Marenol (hard version) | https://codeforces.com/problemset/problem/2254/C2 | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12006
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2254-C1 | codeforces | 2254-C1 | Marenol (easy version) | https://codeforces.com/problemset/problem/2254/C1 | [
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16763
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2254-B | codeforces | 2254-B | Evanescent | https://codeforces.com/problemset/problem/2254/B | [
"implementation",
"strings",
"two pointers"
] | null | null | stdin_stdout | 900 | {
"solved_count": 21505
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2254-A | codeforces | 2254-A | Riptide | https://codeforces.com/problemset/problem/2254/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30074
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2253-F | codeforces | 2253-F | 4-beauty | https://codeforces.com/problemset/problem/2253/F | [
"bitmasks",
"dp",
"graphs",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 263
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2253-E | codeforces | 2253-E | Diameter Intersections | https://codeforces.com/problemset/problem/2253/E | [
"brute force",
"dfs and similar",
"fft",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 997
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2253-D | codeforces | 2253-D | Hypercarp and Interdimensional Jumps | https://codeforces.com/problemset/problem/2253/D | [
"binary search",
"brute force",
"geometry",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2696
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2253-C | codeforces | 2253-C | Sum of Distinct Values in a Matrix | https://codeforces.com/problemset/problem/2253/C | [
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6404
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2253-B | codeforces | 2253-B | Hypercarp and the Control Panel | https://codeforces.com/problemset/problem/2253/B | [
"brute force",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10523
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2253-A | codeforces | 2253-A | The Best Card | https://codeforces.com/problemset/problem/2253/A | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17458
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2252-F | codeforces | 2252-F | Spectral Components | https://codeforces.com/problemset/problem/2252/F | [
"dfs and similar",
"dp",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 313
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2252-E | codeforces | 2252-E | Generational Triplets | https://codeforces.com/problemset/problem/2252/E | [
"bitmasks",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1301
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2252-D | codeforces | 2252-D | Array Replacement | https://codeforces.com/problemset/problem/2252/D | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4274
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2252-C | codeforces | 2252-C | Risky Tower | https://codeforces.com/problemset/problem/2252/C | [
"binary search",
"brute force",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8156
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2252-B | codeforces | 2252-B | Always Changing | https://codeforces.com/problemset/problem/2252/B | [
"dp",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 11213
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2252-A | codeforces | 2252-A | Boss Fight | https://codeforces.com/problemset/problem/2252/A | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16322
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2250-B | codeforces | 2250-B | String Construction | https://codeforces.com/problemset/problem/2250/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 13930
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2250-A | codeforces | 2250-A | Threshold Movement | https://codeforces.com/problemset/problem/2250/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17644
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2249-F | codeforces | 2249-F | Even Simple Path | https://codeforces.com/problemset/problem/2249/F | [
"constructive algorithms",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 147
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2249-E2 | codeforces | 2249-E2 | String (Hard Version) | https://codeforces.com/problemset/problem/2249/E2 | [
"divide and conquer",
"implementation",
"strings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 155
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2249-E1 | codeforces | 2249-E1 | String (Easy Version) | https://codeforces.com/problemset/problem/2249/E1 | [
"divide and conquer",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 177
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2249-D | codeforces | 2249-D | Xor Permutation Matrix | https://codeforces.com/problemset/problem/2249/D | [
"bitmasks",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 975
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2249-C | codeforces | 2249-C | Double-Rift Dial | https://codeforces.com/problemset/problem/2249/C | [
"data structures",
"dfs and similar",
"dsu",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1520
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2249-B | codeforces | 2249-B | Permutation Cuts | https://codeforces.com/problemset/problem/2249/B | [
"combinatorics",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3984
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2249-A | codeforces | 2249-A | Rank Subsequence | https://codeforces.com/problemset/problem/2249/A | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9477
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2248-G | codeforces | 2248-G | No Balance Left | https://codeforces.com/problemset/problem/2248/G | [
"bitmasks",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 125
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2248-F | codeforces | 2248-F | Matrix Elimination | https://codeforces.com/problemset/problem/2248/F | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 438
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2248-E | codeforces | 2248-E | Excuse for Breaks | https://codeforces.com/problemset/problem/2248/E | [
"binary search",
"brute force",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1741
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2248-D | codeforces | 2248-D | Good Pair Queries | https://codeforces.com/problemset/problem/2248/D | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 6370
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2248-C | codeforces | 2248-C | Maximize the Score | https://codeforces.com/problemset/problem/2248/C | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 8897
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2248-B | codeforces | 2248-B | Merge to Match | https://codeforces.com/problemset/problem/2248/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 13370
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2248-A | codeforces | 2248-A | You Delete, I Delete | https://codeforces.com/problemset/problem/2248/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18703
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2247-F | codeforces | 2247-F | Paths on a Grid | https://codeforces.com/problemset/problem/2247/F | [
"data structures",
"dp",
"hashing"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 424
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2247-E | codeforces | 2247-E | Build a Tree | https://codeforces.com/problemset/problem/2247/E | [
"constructive algorithms",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1010
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2247-D2 | codeforces | 2247-D2 | XOR Sorting (Hard Version) | https://codeforces.com/problemset/problem/2247/D2 | [
"bitmasks",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2236
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2247-D1 | codeforces | 2247-D1 | XOR Sorting (Easy Version) | https://codeforces.com/problemset/problem/2247/D1 | [
"bitmasks",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6254
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2247-C | codeforces | 2247-C | Inversion of a Subsequence | https://codeforces.com/problemset/problem/2247/C | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12321
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2247-B | codeforces | 2247-B | Yet Another Constructive | https://codeforces.com/problemset/problem/2247/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 900 | {
"solved_count": 15157
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2247-A | codeforces | 2247-A | Zero Sum | https://codeforces.com/problemset/problem/2247/A | [
"constructive algorithms",
"dp",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20444
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2246-F | codeforces | 2246-F | Whoname and Unsorted Array | https://codeforces.com/problemset/problem/2246/F | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 234
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2246-E | codeforces | 2246-E | lce4113 and Security Game | https://codeforces.com/problemset/problem/2246/E | [
"bitmasks",
"interactive",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 598
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2246-D | codeforces | 2246-D | diss_quack and Array Game | https://codeforces.com/problemset/problem/2246/D | [
"bitmasks",
"brute force",
"games",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3047
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2246-C | codeforces | 2246-C | 0mar and Alternating Sums | https://codeforces.com/problemset/problem/2246/C | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8566
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2246-B | codeforces | 2246-B | ezraft and Array | https://codeforces.com/problemset/problem/2246/B | [
"constructive algorithms",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16411
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2246-A | codeforces | 2246-A | farmpiggie and Subset Sum | https://codeforces.com/problemset/problem/2246/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18799
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2245-H | codeforces | 2245-H | Connect Connect See | https://codeforces.com/problemset/problem/2245/H | [
"brute force",
"data structures"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 67
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2245-G | codeforces | 2245-G | NPC Challenge | https://codeforces.com/problemset/problem/2245/G | [
"divide and conquer",
"interactive"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 132
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2245-F | codeforces | 2245-F | Familiar? | https://codeforces.com/problemset/problem/2245/F | [
"brute force",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 289
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2245-E | codeforces | 2245-E | Tom and Jerry | https://codeforces.com/problemset/problem/2245/E | [
"dfs and similar",
"dsu",
"games",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1033
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2245-D2 | codeforces | 2245-D2 | Construct an Array (Hard Version) | https://codeforces.com/problemset/problem/2245/D2 | [
"2-sat",
"constructive algorithms",
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1986
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2245-D1 | codeforces | 2245-D1 | Construct an Array (Easy Version) | https://codeforces.com/problemset/problem/2245/D1 | [
"dfs and similar",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3543
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2245-C | codeforces | 2245-C | MEXOR | https://codeforces.com/problemset/problem/2245/C | [
"bitmasks",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 6527
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2245-B | codeforces | 2245-B | Delete and Concatenate | https://codeforces.com/problemset/problem/2245/B | [
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10215
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2245-A | codeforces | 2245-A | Who Watches the Watchpig? | https://codeforces.com/problemset/problem/2245/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 13199
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2244-G | codeforces | 2244-G | Yura and Deadlines | https://codeforces.com/problemset/problem/2244/G | [
"data structures",
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2552
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2244-F | codeforces | 2244-F | Anya Loves Trees! | https://codeforces.com/problemset/problem/2244/F | [
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4021
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2244-E | codeforces | 2244-E | Masha and the Garland | https://codeforces.com/problemset/problem/2244/E | [
"data structures",
"dp",
"greedy",
"implementation",
"math",
"number theory",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8358
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2244-D | codeforces | 2244-D | Yaroslav and Productivity | https://codeforces.com/problemset/problem/2244/D | [
"constructive algorithms",
"dp",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12539
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2244-C | codeforces | 2244-C | Stepan and Permutation | https://codeforces.com/problemset/problem/2244/C | [
"constructive algorithms",
"dfs and similar",
"dsu",
"greedy",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16839
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2244-B | codeforces | 2244-B | Nikita and Books | https://codeforces.com/problemset/problem/2244/B | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23419
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2244-A | codeforces | 2244-A | Iskander and Drawings | https://codeforces.com/problemset/problem/2244/A | [
"dp",
"games",
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28730
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2242-F | codeforces | 2242-F | Summer Vacation | https://codeforces.com/problemset/problem/2242/F | [
"data structures",
"dp",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 446
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2242-E | codeforces | 2242-E | Product of Closures | https://codeforces.com/problemset/problem/2242/E | [
"bitmasks",
"brute force",
"constructive algorithms",
"greedy",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1477
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2242-D | codeforces | 2242-D | Two Digit Strings | https://codeforces.com/problemset/problem/2242/D | [
"dp",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7468
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2242-C | codeforces | 2242-C | Unstable Elements | https://codeforces.com/problemset/problem/2242/C | [
"brute force",
"data structures",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11193
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2242-B | codeforces | 2242-B | Predominant Frequency Division | https://codeforces.com/problemset/problem/2242/B | [
"data structures",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17289
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2242-A | codeforces | 2242-A | Bigrams | https://codeforces.com/problemset/problem/2242/A | [
"sortings",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24238
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2241-G | codeforces | 2241-G | Summmon | https://codeforces.com/problemset/problem/2241/G | [
"binary search",
"data structures",
"greedy",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 924
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2241-F | codeforces | 2241-F | A Bit Odd | https://codeforces.com/problemset/problem/2241/F | [
"data structures",
"games",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4788
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2241-E | codeforces | 2241-E | Fair and Square | https://codeforces.com/problemset/problem/2241/E | [
"combinatorics",
"dp",
"graphs",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6242
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2241-D | codeforces | 2241-D | An Alternative Way | https://codeforces.com/problemset/problem/2241/D | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16263
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2241-C | codeforces | 2241-C | RemovevomeR | https://codeforces.com/problemset/problem/2241/C | [
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 21214
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2241-B | codeforces | 2241-B | Good times Good times | https://codeforces.com/problemset/problem/2241/B | [
"constructive algorithms",
"dfs and similar",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20660
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2241-A | codeforces | 2241-A | Divide and Conquer | https://codeforces.com/problemset/problem/2241/A | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33783
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2240-B | codeforces | 2240-B | AI Finds Nothing Here | https://codeforces.com/problemset/problem/2240/B | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10932
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2240-A | codeforces | 2240-A | Another Popcount Problem | https://codeforces.com/problemset/problem/2240/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16710
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2239-F | codeforces | 2239-F | Colorful Works | https://codeforces.com/problemset/problem/2239/F | [
"dp",
"fft",
"games",
"implementation"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 215
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2239-E | codeforces | 2239-E | The end of this world, | https://codeforces.com/problemset/problem/2239/E | [
"data structures",
"divide and conquer",
"dsu",
"graphs"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 169
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2239-D | codeforces | 2239-D | Hunting the Beast | https://codeforces.com/problemset/problem/2239/D | [
"combinatorics",
"dp",
"graphs",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 638
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2239-C | codeforces | 2239-C | Revival | https://codeforces.com/problemset/problem/2239/C | [
"binary search",
"data structures",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1332
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2239-B | codeforces | 2239-B | Decidophobia | https://codeforces.com/problemset/problem/2239/B | [
"greedy",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7031
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2239-A | codeforces | 2239-A | Nim Game Is XOR Game | https://codeforces.com/problemset/problem/2239/A | [
"constructive algorithms",
"games",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9135
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2238-F | codeforces | 2238-F | Infinite Work | https://codeforces.com/problemset/problem/2238/F | [
"combinatorics",
"graphs",
"greedy",
"math",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 451
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2238-E | codeforces | 2238-E | Cake Trial | https://codeforces.com/problemset/problem/2238/E | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1907
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2238-D | codeforces | 2238-D | Storming Arasaka | https://codeforces.com/problemset/problem/2238/D | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7654
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2238-C | codeforces | 2238-C | Village Guilds | https://codeforces.com/problemset/problem/2238/C | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9144
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:2238-B | codeforces | 2238-B | Crimson Triples | https://codeforces.com/problemset/problem/2238/B | [
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16031
} | 2026-08-17T01:43:56.191071+00:00 |
End of preview.