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:2261-C | codeforces | 2261-C | I Know About a Million Things | https://codeforces.com/problemset/problem/2261/C | [
"games",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 8748
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2261-B | codeforces | 2261-B | What's the Capital of France? | https://codeforces.com/problemset/problem/2261/B | [
"bitmasks",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 7997
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2261-A | codeforces | 2261-A | Hey, It's Me, Souvlakity | https://codeforces.com/problemset/problem/2261/A | [
"games",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 10602
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2260-G | codeforces | 2260-G | Sortable Permutations | https://codeforces.com/problemset/problem/2260/G | [
"brute force",
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 277
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2260-F | codeforces | 2260-F | Edge Three-Coloring | https://codeforces.com/problemset/problem/2260/F | [
"brute force",
"dfs and similar",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 675
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2260-E | codeforces | 2260-E | Cyclic Balance | https://codeforces.com/problemset/problem/2260/E | [
"binary search",
"constructive algorithms",
"dp",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2207
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2260-D | codeforces | 2260-D | Signs of Prefix Sums | https://codeforces.com/problemset/problem/2260/D | [
"brute force",
"constructive algorithms",
"dfs and similar",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5446
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2260-C | codeforces | 2260-C | Maximize XOR, Minimize Operations | https://codeforces.com/problemset/problem/2260/C | [
"bitmasks",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11093
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2260-B | codeforces | 2260-B | Monocarp and Projects | https://codeforces.com/problemset/problem/2260/B | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16886
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2260-A | codeforces | 2260-A | Monocarp's Contest | https://codeforces.com/problemset/problem/2260/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21755
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2259-H | codeforces | 2259-H | Treasure Map Destruction (Counting Version) | https://codeforces.com/problemset/problem/2259/H | [
"dfs and similar",
"dp",
"dsu",
"graphs",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1051
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2259-G | codeforces | 2259-G | Index Removal | https://codeforces.com/problemset/problem/2259/G | [
"binary search",
"data structures",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2836
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2259-F | codeforces | 2259-F | Binary Bubble Sort Inversions | https://codeforces.com/problemset/problem/2259/F | [
"data structures",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3769
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2259-E | codeforces | 2259-E | Treasure Map Destruction (Constructive Version) | https://codeforces.com/problemset/problem/2259/E | [
"2-sat",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6893
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2259-D | codeforces | 2259-D | MEX Multiset | https://codeforces.com/problemset/problem/2259/D | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14223
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2259-C | codeforces | 2259-C | 101 | https://codeforces.com/problemset/problem/2259/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19442
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2259-B | codeforces | 2259-B | Minus Two | https://codeforces.com/problemset/problem/2259/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25892
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2259-A | codeforces | 2259-A | Moo Language School | https://codeforces.com/problemset/problem/2259/A | [
"brute force",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28869
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2258-F | codeforces | 2258-F | Plus Minus Tree | https://codeforces.com/problemset/problem/2258/F | [
"data structures",
"dfs and similar",
"dp",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 350
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2258-E | codeforces | 2258-E | DivMEX | https://codeforces.com/problemset/problem/2258/E | [
"data structures",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1023
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2258-D | codeforces | 2258-D | Magic Tiles | https://codeforces.com/problemset/problem/2258/D | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 595
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2258-C | codeforces | 2258-C | Far Cities | https://codeforces.com/problemset/problem/2258/C | [
"interactive",
"trees",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5631
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2258-B2 | codeforces | 2258-B2 | Carrot Chopdown (Hard Version) | https://codeforces.com/problemset/problem/2258/B2 | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5377
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2258-B1 | codeforces | 2258-B1 | Carrot Chopdown (Easy Version) | https://codeforces.com/problemset/problem/2258/B1 | [
"brute force",
"games",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16348
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2258-A | codeforces | 2258-A | Odd Eraser | https://codeforces.com/problemset/problem/2258/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20305
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2257-F2 | codeforces | 2257-F2 | Beaver's Jumping Track (Hard Version) | https://codeforces.com/problemset/problem/2257/F2 | [
"data structures",
"dp",
"matrices"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 493
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2257-F1 | codeforces | 2257-F1 | Beaver's Jumping Track (Easy Version) | https://codeforces.com/problemset/problem/2257/F1 | [
"data structures",
"dp",
"matrices"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 765
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2257-E | codeforces | 2257-E | Busy Beaver | https://codeforces.com/problemset/problem/2257/E | [
"brute force",
"data structures",
"divide and conquer",
"dp",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2309
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2257-D | codeforces | 2257-D | Bermuda Rectangle | https://codeforces.com/problemset/problem/2257/D | [
"binary search",
"implementation",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6928
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2257-C | codeforces | 2257-C | Spying on the Beaver | https://codeforces.com/problemset/problem/2257/C | [
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12708
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2257-B | codeforces | 2257-B | Gigantomachy | https://codeforces.com/problemset/problem/2257/B | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19765
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2257-A | codeforces | 2257-A | Creating Abbreviations | https://codeforces.com/problemset/problem/2257/A | [
"brute force",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21626
} | 2026-11-02T05:37:07.883505+00:00 |
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": 17630
} | 2026-11-02T05:37:07.883505+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": 26634
} | 2026-11-02T05:37:07.883505+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": 317
} | 2026-11-02T05:37:07.883505+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": 285
} | 2026-11-02T05:37:07.883505+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": 312
} | 2026-11-02T05:37:07.883505+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": 1783
} | 2026-11-02T05:37:07.883505+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": 1711
} | 2026-11-02T05:37:07.883505+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": 7684
} | 2026-11-02T05:37:07.883505+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": 14549
} | 2026-11-02T05:37:07.883505+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": 1385
} | 2026-11-02T05:37:07.883505+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": 3740
} | 2026-11-02T05:37:07.883505+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": 8738
} | 2026-11-02T05:37:07.883505+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": 11586
} | 2026-11-02T05:37:07.883505+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": 15039
} | 2026-11-02T05:37:07.883505+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": 21149
} | 2026-11-02T05:37:07.883505+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": 26631
} | 2026-11-02T05:37:07.883505+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": 38351
} | 2026-11-02T05:37:07.883505+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": 592
} | 2026-11-02T05:37:07.883505+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,200 | {
"solved_count": 1522
} | 2026-11-02T05:37:07.883505+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": 3799
} | 2026-11-02T05:37:07.883505+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": 8546
} | 2026-11-02T05:37:07.883505+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": 13124
} | 2026-11-02T05:37:07.883505+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": 22539
} | 2026-11-02T05:37:07.883505+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": 608
} | 2026-11-02T05:37:07.883505+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": 2124
} | 2026-11-02T05:37:07.883505+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": 5956
} | 2026-11-02T05:37:07.883505+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": 10728
} | 2026-11-02T05:37:07.883505+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": 13530
} | 2026-11-02T05:37:07.883505+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": 19580
} | 2026-11-02T05:37:07.883505+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": 15688
} | 2026-11-02T05:37:07.883505+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": 19747
} | 2026-11-02T05:37:07.883505+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": 226
} | 2026-11-02T05:37:07.883505+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": 272
} | 2026-11-02T05:37:07.883505+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": 312
} | 2026-11-02T05:37:07.883505+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": 1223
} | 2026-11-02T05:37:07.883505+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": 1933
} | 2026-11-02T05:37:07.883505+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": 4746
} | 2026-11-02T05:37:07.883505+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": 10946
} | 2026-11-02T05:37:07.883505+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": 267
} | 2026-11-02T05:37:07.883505+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": 759
} | 2026-11-02T05:37:07.883505+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 | 2,000 | {
"solved_count": 2149
} | 2026-11-02T05:37:07.883505+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": 7942
} | 2026-11-02T05:37:07.883505+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": 10840
} | 2026-11-02T05:37:07.883505+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": 15590
} | 2026-11-02T05:37:07.883505+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": 21536
} | 2026-11-02T05:37:07.883505+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": 637
} | 2026-11-02T05:37:07.883505+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": 1233
} | 2026-11-02T05:37:07.883505+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": 2652
} | 2026-11-02T05:37:07.883505+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": 7240
} | 2026-11-02T05:37:07.883505+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": 13893
} | 2026-11-02T05:37:07.883505+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": 16975
} | 2026-11-02T05:37:07.883505+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": 23517
} | 2026-11-02T05:37:07.883505+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": 369
} | 2026-11-02T05:37:07.883505+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": 760
} | 2026-11-02T05:37:07.883505+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": 3548
} | 2026-11-02T05:37:07.883505+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": 9707
} | 2026-11-02T05:37:07.883505+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": 18218
} | 2026-11-02T05:37:07.883505+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": 20319
} | 2026-11-02T05:37:07.883505+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": 121
} | 2026-11-02T05:37:07.883505+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": 203
} | 2026-11-02T05:37:07.883505+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": 470
} | 2026-11-02T05:37:07.883505+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": 1245
} | 2026-11-02T05:37:07.883505+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": 2357
} | 2026-11-02T05:37:07.883505+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": 4118
} | 2026-11-02T05:37:07.883505+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": 7578
} | 2026-11-02T05:37:07.883505+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": 11501
} | 2026-11-02T05:37:07.883505+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": 14659
} | 2026-11-02T05:37:07.883505+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": 3240
} | 2026-11-02T05:37:07.883505+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.