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:1294-B | codeforces | 1294-B | Collecting Packages | https://codeforces.com/problemset/problem/1294/B | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 23119
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1294-A | codeforces | 1294-A | Collecting Coins | https://codeforces.com/problemset/problem/1294/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 54571
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1293-B | codeforces | 1293-B | JOE is on TV! | https://codeforces.com/problemset/problem/1293/B | [
"combinatorics",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22435
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1293-A | codeforces | 1293-A | ConneR and the A.R.C. Markland-N | https://codeforces.com/problemset/problem/1293/A | [
"binary search",
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16250
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1292-F | codeforces | 1292-F | Nora's Toy Boxes | https://codeforces.com/problemset/problem/1292/F | [
"bitmasks",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 448
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1292-E | codeforces | 1292-E | Rin and The Unknown Flower | https://codeforces.com/problemset/problem/1292/E | [
"constructive algorithms",
"greedy",
"interactive",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 480
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1292-D | codeforces | 1292-D | Chaotic V. | https://codeforces.com/problemset/problem/1292/D | [
"dp",
"graphs",
"greedy",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1060
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1292-C | codeforces | 1292-C | Xenon's Attack on the Gangs | https://codeforces.com/problemset/problem/1292/C | [
"combinatorics",
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2407
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1292-B | codeforces | 1292-B | Aroma's Search | https://codeforces.com/problemset/problem/1292/B | [
"brute force",
"constructive algorithms",
"geometry",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6826
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1292-A | codeforces | 1292-A | NEKO's Maze Game | https://codeforces.com/problemset/problem/1292/A | [
"data structures",
"dsu",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 13975
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1291-F | codeforces | 1291-F | Coffee Varieties (easy version) | https://codeforces.com/problemset/problem/1291/F | [
"graphs",
"interactive"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 812
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1291-B | codeforces | 1291-B | Array Sharpening | https://codeforces.com/problemset/problem/1291/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15536
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1291-A | codeforces | 1291-A | Even But Not Even | https://codeforces.com/problemset/problem/1291/A | [
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 20882
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1290-F | codeforces | 1290-F | Making Shapes | https://codeforces.com/problemset/problem/1290/F | [
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 611
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1290-E | codeforces | 1290-E | Cartesian Tree | https://codeforces.com/problemset/problem/1290/E | [
"data structures"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 697
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1290-D | codeforces | 1290-D | Coffee Varieties (hard version) | https://codeforces.com/problemset/problem/1290/D | [
"constructive algorithms",
"graphs",
"interactive"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1012
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1290-C | codeforces | 1290-C | Prefix Enlightenment | https://codeforces.com/problemset/problem/1290/C | [
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2112
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1290-B | codeforces | 1290-B | Irreducible Anagrams | https://codeforces.com/problemset/problem/1290/B | [
"binary search",
"constructive algorithms",
"data structures",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7434
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1290-A | codeforces | 1290-A | Mind Control | https://codeforces.com/problemset/problem/1290/A | [
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9038
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1288-F | codeforces | 1288-F | Red-Blue Graph | https://codeforces.com/problemset/problem/1288/F | [
"constructive algorithms",
"flows"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 759
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1288-E | codeforces | 1288-E | Messenger Simulator | https://codeforces.com/problemset/problem/1288/E | [
"data structures"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4241
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1288-D | codeforces | 1288-D | Minimax Problem | https://codeforces.com/problemset/problem/1288/D | [
"binary search",
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 8696
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1288-C | codeforces | 1288-C | Two Arrays | https://codeforces.com/problemset/problem/1288/C | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15830
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1288-B | codeforces | 1288-B | Yet Another Meme Problem | https://codeforces.com/problemset/problem/1288/B | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17907
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1288-A | codeforces | 1288-A | Deadline | https://codeforces.com/problemset/problem/1288/A | [
"binary search",
"brute force",
"math",
"ternary search"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19425
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1287-B | codeforces | 1287-B | Hyperset | https://codeforces.com/problemset/problem/1287/B | [
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9889
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1287-A | codeforces | 1287-A | Angry Students | https://codeforces.com/problemset/problem/1287/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23060
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1286-F | codeforces | 1286-F | Harry The Potter | https://codeforces.com/problemset/problem/1286/F | [
"brute force",
"constructive algorithms",
"dp",
"fft",
"implementation",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 541
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1286-E | codeforces | 1286-E | Fedya the Potter Strikes Back | https://codeforces.com/problemset/problem/1286/E | [
"data structures",
"strings"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 722
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1286-D | codeforces | 1286-D | LCC | https://codeforces.com/problemset/problem/1286/D | [
"data structures",
"math",
"matrices",
"probabilities"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 930
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1286-C2 | codeforces | 1286-C2 | Madhouse (Hard version) | https://codeforces.com/problemset/problem/1286/C2 | [
"brute force",
"constructive algorithms",
"hashing",
"interactive",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 773
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1286-C1 | codeforces | 1286-C1 | Madhouse (Easy version) | https://codeforces.com/problemset/problem/1286/C1 | [
"brute force",
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1628
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1286-B | codeforces | 1286-B | Numbers on Tree | https://codeforces.com/problemset/problem/1286/B | [
"constructive algorithms",
"data structures",
"dfs and similar",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5726
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1286-A | codeforces | 1286-A | Garland | https://codeforces.com/problemset/problem/1286/A | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9811
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1285-F | codeforces | 1285-F | Classical? | https://codeforces.com/problemset/problem/1285/F | [
"binary search",
"combinatorics",
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1401
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1285-E | codeforces | 1285-E | Delete a Segment | https://codeforces.com/problemset/problem/1285/E | [
"brute force",
"constructive algorithms",
"data structures",
"dp",
"graphs",
"sortings",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2037
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1285-D | codeforces | 1285-D | Dr. Evil Underscores | https://codeforces.com/problemset/problem/1285/D | [
"bitmasks",
"brute force",
"dfs and similar",
"divide and conquer",
"dp",
"greedy",
"strings",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8798
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1285-C | codeforces | 1285-C | Fadi and LCM | https://codeforces.com/problemset/problem/1285/C | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 28938
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1285-B | codeforces | 1285-B | Just Eat It! | https://codeforces.com/problemset/problem/1285/B | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 32741
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1285-A | codeforces | 1285-A | Mezo Playing Zoma | https://codeforces.com/problemset/problem/1285/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30116
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1284-G | codeforces | 1284-G | Seollal | https://codeforces.com/problemset/problem/1284/G | [
"graphs"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 241
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1284-F | codeforces | 1284-F | New Year and Social Network | https://codeforces.com/problemset/problem/1284/F | [
"data structures",
"graph matchings",
"graphs",
"math",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 427
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1284-E | codeforces | 1284-E | New Year and Castle Construction | https://codeforces.com/problemset/problem/1284/E | [
"combinatorics",
"geometry",
"math",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1433
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1284-D | codeforces | 1284-D | New Year and Conference | https://codeforces.com/problemset/problem/1284/D | [
"binary search",
"data structures",
"hashing",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3456
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1284-C | codeforces | 1284-C | New Year and Permutation | https://codeforces.com/problemset/problem/1284/C | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8977
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1284-B | codeforces | 1284-B | New Year and Ascent Sequence | https://codeforces.com/problemset/problem/1284/B | [
"binary search",
"combinatorics",
"data structures",
"dp",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11597
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1284-A | codeforces | 1284-A | New Year and Naming | https://codeforces.com/problemset/problem/1284/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18622
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1283-F | codeforces | 1283-F | DIY Garland | https://codeforces.com/problemset/problem/1283/F | [
"constructive algorithms",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2162
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1283-E | codeforces | 1283-E | New Year Parties | https://codeforces.com/problemset/problem/1283/E | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7501
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1283-D | codeforces | 1283-D | Christmas Trees | https://codeforces.com/problemset/problem/1283/D | [
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 10070
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1283-C | codeforces | 1283-C | Friends and Gifts | https://codeforces.com/problemset/problem/1283/C | [
"constructive algorithms",
"data structures",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14284
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1283-B | codeforces | 1283-B | Candies Division | https://codeforces.com/problemset/problem/1283/B | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 23226
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1283-A | codeforces | 1283-A | Minutes Before the New Year | https://codeforces.com/problemset/problem/1283/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 62326
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1282-E | codeforces | 1282-E | The Cake Is a Lie | https://codeforces.com/problemset/problem/1282/E | [
"constructive algorithms",
"data structures",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1250
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1282-D | codeforces | 1282-D | Enchanted Artifact | https://codeforces.com/problemset/problem/1282/D | [
"constructive algorithms",
"interactive",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2482
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1282-C | codeforces | 1282-C | Petya and Exam | https://codeforces.com/problemset/problem/1282/C | [
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4702
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1282-B2 | codeforces | 1282-B2 | K for the Price of One (Hard Version) | https://codeforces.com/problemset/problem/1282/B2 | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11177
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1282-B1 | codeforces | 1282-B1 | K for the Price of One (Easy Version) | https://codeforces.com/problemset/problem/1282/B1 | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12247
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1282-A | codeforces | 1282-A | Temporarily unavailable | https://codeforces.com/problemset/problem/1282/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 15566
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1281-B | codeforces | 1281-B | Azamon Web Services | https://codeforces.com/problemset/problem/1281/B | [
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8746
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1281-A | codeforces | 1281-A | Suffix Three | https://codeforces.com/problemset/problem/1281/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19000
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1280-F | codeforces | 1280-F | Intergalactic Sliding Puzzle | https://codeforces.com/problemset/problem/1280/F | [
"combinatorics",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 115
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1280-E | codeforces | 1280-E | Kirchhoff's Current Loss | https://codeforces.com/problemset/problem/1280/E | [
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 274
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1280-D | codeforces | 1280-D | Miss Punyverse | https://codeforces.com/problemset/problem/1280/D | [
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1299
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1280-C | codeforces | 1280-C | Jeremy Bearimy | https://codeforces.com/problemset/problem/1280/C | [
"dfs and similar",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3104
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1280-B | codeforces | 1280-B | Beingawesomeism | https://codeforces.com/problemset/problem/1280/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4224
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1280-A | codeforces | 1280-A | Cut and Paste | https://codeforces.com/problemset/problem/1280/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5887
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1279-F | codeforces | 1279-F | New Year and Handle Change | https://codeforces.com/problemset/problem/1279/F | [
"binary search",
"dp"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1359
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1279-E | codeforces | 1279-E | New Year Permutations | https://codeforces.com/problemset/problem/1279/E | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 486
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1279-D | codeforces | 1279-D | Santa's Bot | https://codeforces.com/problemset/problem/1279/D | [
"combinatorics",
"math",
"probabilities"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7538
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1279-C | codeforces | 1279-C | Stack of Presents | https://codeforces.com/problemset/problem/1279/C | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12518
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1279-B | codeforces | 1279-B | Verse For Santa | https://codeforces.com/problemset/problem/1279/B | [
"binary search",
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14518
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1279-A | codeforces | 1279-A | New Year Garland | https://codeforces.com/problemset/problem/1279/A | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18002
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1278-F | codeforces | 1278-F | Cards | https://codeforces.com/problemset/problem/1278/F | [
"combinatorics",
"dp",
"math",
"number theory",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 2867
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1278-E | codeforces | 1278-E | Tests for problem D | https://codeforces.com/problemset/problem/1278/E | [
"constructive algorithms",
"dfs and similar",
"divide and conquer",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2080
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1278-D | codeforces | 1278-D | Segment Tree | https://codeforces.com/problemset/problem/1278/D | [
"data structures",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4430
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1278-C | codeforces | 1278-C | Berry Jam | https://codeforces.com/problemset/problem/1278/C | [
"data structures",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8825
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1278-B | codeforces | 1278-B | A and B | https://codeforces.com/problemset/problem/1278/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14294
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1278-A | codeforces | 1278-A | Shuffle Hashing | https://codeforces.com/problemset/problem/1278/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 18564
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1277-D | codeforces | 1277-D | Let's Play the Words? | https://codeforces.com/problemset/problem/1277/D | [
"data structures",
"hashing",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3287
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1277-B | codeforces | 1277-B | Make Them Odd | https://codeforces.com/problemset/problem/1277/B | [
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17432
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1277-A | codeforces | 1277-A | Happy Birthday, Polycarp! | https://codeforces.com/problemset/problem/1277/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 14614
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1276-F | codeforces | 1276-F | Asterisk Substrings | https://codeforces.com/problemset/problem/1276/F | [
"string suffix structures"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 604
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1276-E | codeforces | 1276-E | Four Stones | https://codeforces.com/problemset/problem/1276/E | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 126
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1276-D | codeforces | 1276-D | Tree Elimination | https://codeforces.com/problemset/problem/1276/D | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 728
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1276-C | codeforces | 1276-C | Beautiful Rectangle | https://codeforces.com/problemset/problem/1276/C | [
"brute force",
"combinatorics",
"constructive algorithms",
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1801
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1276-B | codeforces | 1276-B | Two Fairs | https://codeforces.com/problemset/problem/1276/B | [
"combinatorics",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5758
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1276-A | codeforces | 1276-A | As Simple as One and Two | https://codeforces.com/problemset/problem/1276/A | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 13038
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1275-F | codeforces | 1275-F | Шардирование постов | https://codeforces.com/problemset/problem/1275/F | [
"*special",
"binary search",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 93
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1275-E3 | codeforces | 1275-E3 | Контрольная сумма | https://codeforces.com/problemset/problem/1275/E3 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 61
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1275-E2 | codeforces | 1275-E2 | Контрольная сумма | https://codeforces.com/problemset/problem/1275/E2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 138
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1275-E1 | codeforces | 1275-E1 | Контрольная сумма | https://codeforces.com/problemset/problem/1275/E1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 265
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1275-D | codeforces | 1275-D | Storage2 | https://codeforces.com/problemset/problem/1275/D | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 422
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1275-C | codeforces | 1275-C | #define Задача B ... | https://codeforces.com/problemset/problem/1275/C | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 699
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1275-B | codeforces | 1275-B | Code Review | https://codeforces.com/problemset/problem/1275/B | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 847
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1275-A | codeforces | 1275-A | Скрытый друг | https://codeforces.com/problemset/problem/1275/A | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 892
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1272-F | codeforces | 1272-F | Two Bracket Sequences | https://codeforces.com/problemset/problem/1272/F | [
"dp",
"strings",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2404
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1272-E | codeforces | 1272-E | Nearest Opposite Parity | https://codeforces.com/problemset/problem/1272/E | [
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8334
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1272-D | codeforces | 1272-D | Remove One Element | https://codeforces.com/problemset/problem/1272/D | [
"brute force",
"dp"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 19612
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1272-C | codeforces | 1272-C | Yet Another Broken Keyboard | https://codeforces.com/problemset/problem/1272/C | [
"combinatorics",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 31454
} | 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.