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:1211-A | codeforces | 1211-A | Three Problems | https://codeforces.com/problemset/problem/1211/A | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 1617
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1210-G | codeforces | 1210-G | Mateusz and Escape Room | https://codeforces.com/problemset/problem/1210/G | [
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 387
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1210-F2 | codeforces | 1210-F2 | Marek and Matching (hard version) | https://codeforces.com/problemset/problem/1210/F2 | [
"brute force",
"probabilities"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 528
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1210-F1 | codeforces | 1210-F1 | Marek and Matching (easy version) | https://codeforces.com/problemset/problem/1210/F1 | [
"brute force",
"probabilities"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 503
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1210-E | codeforces | 1210-E | Wojtek and Card Tricks | https://codeforces.com/problemset/problem/1210/E | [
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 472
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1210-D | codeforces | 1210-D | Konrad and Company Evaluation | https://codeforces.com/problemset/problem/1210/D | [
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1670
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1210-C | codeforces | 1210-C | Kamil and Making a Stream | https://codeforces.com/problemset/problem/1210/C | [
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3667
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1210-B | codeforces | 1210-B | Marcin and Training Camp | https://codeforces.com/problemset/problem/1210/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6124
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1210-A | codeforces | 1210-A | Anadi and Domino | https://codeforces.com/problemset/problem/1210/A | [
"brute force",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5573
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1209-H | codeforces | 1209-H | Moving Walkways | https://codeforces.com/problemset/problem/1209/H | [
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 373
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1209-G2 | codeforces | 1209-G2 | Into Blocks (hard version) | https://codeforces.com/problemset/problem/1209/G2 | [
"data structures"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 596
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1209-G1 | codeforces | 1209-G1 | Into Blocks (easy version) | https://codeforces.com/problemset/problem/1209/G1 | [
"data structures",
"dsu",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4113
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1209-F | codeforces | 1209-F | Koala and Notebook | https://codeforces.com/problemset/problem/1209/F | [
"data structures",
"dfs and similar",
"graphs",
"shortest paths",
"strings",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1424
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1209-E2 | codeforces | 1209-E2 | Rotate Columns (hard version) | https://codeforces.com/problemset/problem/1209/E2 | [
"bitmasks",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2420
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1209-E1 | codeforces | 1209-E1 | Rotate Columns (easy version) | https://codeforces.com/problemset/problem/1209/E1 | [
"bitmasks",
"brute force",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3313
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1209-D | codeforces | 1209-D | Cow and Snacks | https://codeforces.com/problemset/problem/1209/D | [
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10931
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1209-C | codeforces | 1209-C | Paint the Digits | https://codeforces.com/problemset/problem/1209/C | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7902
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1209-B | codeforces | 1209-B | Koala and Lights | https://codeforces.com/problemset/problem/1209/B | [
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 8590
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1209-A | codeforces | 1209-A | Paint the Numbers | https://codeforces.com/problemset/problem/1209/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12927
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1208-H | codeforces | 1208-H | Red Blue Tree | https://codeforces.com/problemset/problem/1208/H | [
"data structures",
"implementation",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 327
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1208-G | codeforces | 1208-G | Polygons | https://codeforces.com/problemset/problem/1208/G | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 980
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1208-F | codeforces | 1208-F | Bits And Pieces | https://codeforces.com/problemset/problem/1208/F | [
"bitmasks",
"dfs and similar",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 3604
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1208-E | codeforces | 1208-E | Let Them Slide | https://codeforces.com/problemset/problem/1208/E | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2241
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1208-D | codeforces | 1208-D | Restore Permutation | https://codeforces.com/problemset/problem/1208/D | [
"binary search",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5622
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1208-C | codeforces | 1208-C | Magic Grid | https://codeforces.com/problemset/problem/1208/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6446
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1208-B | codeforces | 1208-B | Uniqueness | https://codeforces.com/problemset/problem/1208/B | [
"binary search",
"brute force",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11811
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1208-A | codeforces | 1208-A | XORinacci | https://codeforces.com/problemset/problem/1208/A | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18311
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1207-G | codeforces | 1207-G | Indie Album | https://codeforces.com/problemset/problem/1207/G | [
"data structures",
"dfs and similar",
"hashing",
"string suffix structures",
"strings",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1311
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1207-F | codeforces | 1207-F | Remainder Problem | https://codeforces.com/problemset/problem/1207/F | [
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 7095
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1207-E | codeforces | 1207-E | XOR Guessing | https://codeforces.com/problemset/problem/1207/E | [
"bitmasks",
"interactive",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6786
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1207-D | codeforces | 1207-D | Number Of Permutations | https://codeforces.com/problemset/problem/1207/D | [
"combinatorics"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6774
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1207-C | codeforces | 1207-C | Gas Pipeline | https://codeforces.com/problemset/problem/1207/C | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10567
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1207-B | codeforces | 1207-B | Square Filling | https://codeforces.com/problemset/problem/1207/B | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 13807
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1207-A | codeforces | 1207-A | There Are Two Types Of Burgers | https://codeforces.com/problemset/problem/1207/A | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23613
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1206-B | codeforces | 1206-B | Make Product Equal One | https://codeforces.com/problemset/problem/1206/B | [
"dp",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 29840
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1206-A | codeforces | 1206-A | Choose Two Numbers | https://codeforces.com/problemset/problem/1206/A | [
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26247
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1205-F | codeforces | 1205-F | Beauty of a Permutation | https://codeforces.com/problemset/problem/1205/F | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 187
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1205-E | codeforces | 1205-E | Expected Value Again | https://codeforces.com/problemset/problem/1205/E | [
"combinatorics",
"strings"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 543
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1205-D | codeforces | 1205-D | Almost All | https://codeforces.com/problemset/problem/1205/D | [
"constructive algorithms",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 797
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1205-C | codeforces | 1205-C | Palindromic Paths | https://codeforces.com/problemset/problem/1205/C | [
"implementation",
"interactive"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1299
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1205-B | codeforces | 1205-B | Shortest Cycle | https://codeforces.com/problemset/problem/1205/B | [
"bitmasks",
"brute force",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7637
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1205-A | codeforces | 1205-A | Almost Equal | https://codeforces.com/problemset/problem/1205/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14789
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1204-E | codeforces | 1204-E | Natasha, Sasha and the Prefix Sums | https://codeforces.com/problemset/problem/1204/E | [
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2274
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1204-D2 | codeforces | 1204-D2 | Kirk and a Binary String (hard version) | https://codeforces.com/problemset/problem/1204/D2 | [
"data structures",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3429
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1204-D1 | codeforces | 1204-D1 | Kirk and a Binary String (easy version) | https://codeforces.com/problemset/problem/1204/D1 | [
"brute force",
"greedy",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3306
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1204-C | codeforces | 1204-C | Anna, Svyatoslav and Maps | https://codeforces.com/problemset/problem/1204/C | [
"dp",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7462
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1204-B | codeforces | 1204-B | Mislove Has Lost an Array | https://codeforces.com/problemset/problem/1204/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18414
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1204-A | codeforces | 1204-A | BowWow and the Timetable | https://codeforces.com/problemset/problem/1204/A | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22524
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1203-F2 | codeforces | 1203-F2 | Complete the Projects (hard version) | https://codeforces.com/problemset/problem/1203/F2 | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3405
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1203-F1 | codeforces | 1203-F1 | Complete the Projects (easy version) | https://codeforces.com/problemset/problem/1203/F1 | [
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4142
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1203-E | codeforces | 1203-E | Boxers | https://codeforces.com/problemset/problem/1203/E | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15232
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1203-D2 | codeforces | 1203-D2 | Remove the Substring (hard version) | https://codeforces.com/problemset/problem/1203/D2 | [
"binary search",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8255
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1203-D1 | codeforces | 1203-D1 | Remove the Substring (easy version) | https://codeforces.com/problemset/problem/1203/D1 | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9622
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1203-C | codeforces | 1203-C | Common Divisors | https://codeforces.com/problemset/problem/1203/C | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 25251
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1203-B | codeforces | 1203-B | Equal Rectangles | https://codeforces.com/problemset/problem/1203/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17094
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1203-A | codeforces | 1203-A | Circle of Students | https://codeforces.com/problemset/problem/1203/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17802
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1202-F | codeforces | 1202-F | You Are Given Some Letters... | https://codeforces.com/problemset/problem/1202/F | [
"binary search",
"implementation",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 666
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1202-E | codeforces | 1202-E | You Are Given Some Strings... | https://codeforces.com/problemset/problem/1202/E | [
"brute force",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2919
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1202-D | codeforces | 1202-D | Print a 1337-string... | https://codeforces.com/problemset/problem/1202/D | [
"combinatorics",
"constructive algorithms",
"math",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5506
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1202-C | codeforces | 1202-C | You Are Given a WASD-string... | https://codeforces.com/problemset/problem/1202/C | [
"brute force",
"data structures",
"dp",
"greedy",
"implementation",
"math",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2801
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1202-B | codeforces | 1202-B | You Are Given a Decimal String... | https://codeforces.com/problemset/problem/1202/B | [
"brute force",
"dp",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4866
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1202-A | codeforces | 1202-A | You Are Given Two Binary Strings... | https://codeforces.com/problemset/problem/1202/A | [
"bitmasks",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10911
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1201-E2 | codeforces | 1201-E2 | Knightmare (hard) | https://codeforces.com/problemset/problem/1201/E2 | [
"graphs",
"interactive",
"shortest paths"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 176
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1201-E1 | codeforces | 1201-E1 | Knightmare (easy) | https://codeforces.com/problemset/problem/1201/E1 | [
"graphs",
"interactive",
"shortest paths"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 239
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1201-D | codeforces | 1201-D | Treasure Hunting | https://codeforces.com/problemset/problem/1201/D | [
"binary search",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2575
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1201-C | codeforces | 1201-C | Maximum Median | https://codeforces.com/problemset/problem/1201/C | [
"binary search",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 36010
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1201-B | codeforces | 1201-B | Zero Array | https://codeforces.com/problemset/problem/1201/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 26664
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1201-A | codeforces | 1201-A | Important Exam | https://codeforces.com/problemset/problem/1201/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 17173
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1200-F | codeforces | 1200-F | Graph Traveler | https://codeforces.com/problemset/problem/1200/F | [
"brute force",
"data structures",
"dfs and similar",
"dp",
"graphs",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1198
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1200-E | codeforces | 1200-E | Compress Words | https://codeforces.com/problemset/problem/1200/E | [
"brute force",
"hashing",
"implementation",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 9943
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1200-D | codeforces | 1200-D | White Lines | https://codeforces.com/problemset/problem/1200/D | [
"brute force",
"data structures",
"dp",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4421
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1200-C | codeforces | 1200-C | Round Corridor | https://codeforces.com/problemset/problem/1200/C | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10705
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1200-B | codeforces | 1200-B | Block Adventure | https://codeforces.com/problemset/problem/1200/B | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14770
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1200-A | codeforces | 1200-A | Hotelier | https://codeforces.com/problemset/problem/1200/A | [
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22214
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1199-B | codeforces | 1199-B | Water Lily | https://codeforces.com/problemset/problem/1199/B | [
"geometry",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22689
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1199-A | codeforces | 1199-A | City Day | https://codeforces.com/problemset/problem/1199/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16526
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1198-F | codeforces | 1198-F | GCD Groups 2 | https://codeforces.com/problemset/problem/1198/F | [
"greedy",
"number theory",
"probabilities"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1115
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1198-E | codeforces | 1198-E | Rectangle Painting 2 | https://codeforces.com/problemset/problem/1198/E | [
"flows",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1355
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1198-D | codeforces | 1198-D | Rectangle Painting 1 | https://codeforces.com/problemset/problem/1198/D | [
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3832
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1198-C | codeforces | 1198-C | Matching vs Independent Set | https://codeforces.com/problemset/problem/1198/C | [
"constructive algorithms",
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4220
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1198-B | codeforces | 1198-B | Welfare State | https://codeforces.com/problemset/problem/1198/B | [
"binary search",
"brute force",
"data structures",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10107
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1198-A | codeforces | 1198-A | MP3 | https://codeforces.com/problemset/problem/1198/A | [
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10205
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1197-F | codeforces | 1197-F | Coloring Game | https://codeforces.com/problemset/problem/1197/F | [
"dp",
"games",
"matrices"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 383
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1197-E | codeforces | 1197-E | Culture Code | https://codeforces.com/problemset/problem/1197/E | [
"binary search",
"combinatorics",
"data structures",
"dp",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1907
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1197-D | codeforces | 1197-D | Yet Another Subarray Problem | https://codeforces.com/problemset/problem/1197/D | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5851
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1197-C | codeforces | 1197-C | Array Splitting | https://codeforces.com/problemset/problem/1197/C | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15393
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1197-B | codeforces | 1197-B | Pillars | https://codeforces.com/problemset/problem/1197/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 14581
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1197-A | codeforces | 1197-A | DIY Wooden Ladder | https://codeforces.com/problemset/problem/1197/A | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 14103
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1196-F | codeforces | 1196-F | K-th Path | https://codeforces.com/problemset/problem/1196/F | [
"brute force",
"constructive algorithms",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3340
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1196-E | codeforces | 1196-E | Connected Component on a Chessboard | https://codeforces.com/problemset/problem/1196/E | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3931
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1196-D2 | codeforces | 1196-D2 | RGB Substring (hard version) | https://codeforces.com/problemset/problem/1196/D2 | [
"data structures",
"dp",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10557
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1196-D1 | codeforces | 1196-D1 | RGB Substring (easy version) | https://codeforces.com/problemset/problem/1196/D1 | [
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11220
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1196-C | codeforces | 1196-C | Robot Breakout | https://codeforces.com/problemset/problem/1196/C | [
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9814
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1196-B | codeforces | 1196-B | Odd Sum Segments | https://codeforces.com/problemset/problem/1196/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17630
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1196-A | codeforces | 1196-A | Three Piles of Candies | https://codeforces.com/problemset/problem/1196/A | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29298
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1195-F | codeforces | 1195-F | Geometers Anonymous Club | https://codeforces.com/problemset/problem/1195/F | [
"data structures",
"geometry",
"math",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1117
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1195-E | codeforces | 1195-E | OpenStreetMap | https://codeforces.com/problemset/problem/1195/E | [
"data structures",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3649
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1195-D2 | codeforces | 1195-D2 | Submarine in the Rybinsk Sea (hard edition) | https://codeforces.com/problemset/problem/1195/D2 | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4922
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1195-D1 | codeforces | 1195-D1 | Submarine in the Rybinsk Sea (easy edition) | https://codeforces.com/problemset/problem/1195/D1 | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8242
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1195-C | codeforces | 1195-C | Basketball Exercise | https://codeforces.com/problemset/problem/1195/C | [
"dp"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 37086
} | 2026-08-17T01:43:56.191071+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.