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:1272-B | codeforces | 1272-B | Snow Walking Robot | https://codeforces.com/problemset/problem/1272/B | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14751
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1272-A | codeforces | 1272-A | Three Friends | https://codeforces.com/problemset/problem/1272/A | [
"brute force",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 22240
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1271-F | codeforces | 1271-F | Divide The Students | https://codeforces.com/problemset/problem/1271/F | [
"brute force"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 323
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1271-E | codeforces | 1271-E | Common Number | https://codeforces.com/problemset/problem/1271/E | [
"binary search",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3830
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1271-D | codeforces | 1271-D | Portals | https://codeforces.com/problemset/problem/1271/D | [
"data structures",
"dp",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3476
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1271-C | codeforces | 1271-C | Shawarma Tent | https://codeforces.com/problemset/problem/1271/C | [
"brute force",
"geometry",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11207
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1271-B | codeforces | 1271-B | Blocks | https://codeforces.com/problemset/problem/1271/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12153
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1271-A | codeforces | 1271-A | Suits | https://codeforces.com/problemset/problem/1271/A | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15735
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1270-I | codeforces | 1270-I | Xor on Figures | https://codeforces.com/problemset/problem/1270/I | [
"constructive algorithms",
"fft",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 417
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1270-H | codeforces | 1270-H | Number of Components | https://codeforces.com/problemset/problem/1270/H | [
"data structures"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 1017
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1270-G | codeforces | 1270-G | Subset with Zero Sum | https://codeforces.com/problemset/problem/1270/G | [
"constructive algorithms",
"dfs and similar",
"graphs",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 3183
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1270-F | codeforces | 1270-F | Awesome Substrings | https://codeforces.com/problemset/problem/1270/F | [
"math",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1387
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1270-E | codeforces | 1270-E | Divide Points | https://codeforces.com/problemset/problem/1270/E | [
"constructive algorithms",
"geometry",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2781
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1270-D | codeforces | 1270-D | Strange Device | https://codeforces.com/problemset/problem/1270/D | [
"constructive algorithms",
"interactive",
"math",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5002
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1270-C | codeforces | 1270-C | Make Good | https://codeforces.com/problemset/problem/1270/C | [
"bitmasks",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15214
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1270-B | codeforces | 1270-B | Interesting Subarray | https://codeforces.com/problemset/problem/1270/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17527
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1270-A | codeforces | 1270-A | Card Game | https://codeforces.com/problemset/problem/1270/A | [
"games",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17895
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1269-B | codeforces | 1269-B | Modulo Equality | https://codeforces.com/problemset/problem/1269/B | [
"brute force",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9761
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1269-A | codeforces | 1269-A | Equation | https://codeforces.com/problemset/problem/1269/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24476
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1268-E | codeforces | 1268-E | Happy Cactus | https://codeforces.com/problemset/problem/1268/E | [
"dp"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 336
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1268-D | codeforces | 1268-D | Invertation in Tournament | https://codeforces.com/problemset/problem/1268/D | [
"brute force",
"divide and conquer",
"graphs",
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 963
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1268-C | codeforces | 1268-C | K Integers | https://codeforces.com/problemset/problem/1268/C | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1995
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1268-B | codeforces | 1268-B | Domino for Young | https://codeforces.com/problemset/problem/1268/B | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6566
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1268-A | codeforces | 1268-A | Long Beautiful Integer | https://codeforces.com/problemset/problem/1268/A | [
"constructive algorithms",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9197
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1267-L | codeforces | 1267-L | Lexicography | https://codeforces.com/problemset/problem/1267/L | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3389
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1267-K | codeforces | 1267-K | Key Storage | https://codeforces.com/problemset/problem/1267/K | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2184
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1267-J | codeforces | 1267-J | Just Arrange the Icons | https://codeforces.com/problemset/problem/1267/J | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3129
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1267-I | codeforces | 1267-I | Intriguing Selection | https://codeforces.com/problemset/problem/1267/I | [
"brute force",
"constructive algorithms",
"implementation",
"interactive",
"sortings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1075
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1267-H | codeforces | 1267-H | Help BerLine | https://codeforces.com/problemset/problem/1267/H | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 238
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1267-G | codeforces | 1267-G | Game Relics | https://codeforces.com/problemset/problem/1267/G | [
"math",
"probabilities"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 854
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1267-F | codeforces | 1267-F | Foolprüf Security | https://codeforces.com/problemset/problem/1267/F | [
"graphs"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 723
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1267-E | codeforces | 1267-E | Elections | https://codeforces.com/problemset/problem/1267/E | [
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3627
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1267-D | codeforces | 1267-D | DevOps Best Practices | https://codeforces.com/problemset/problem/1267/D | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 301
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1267-C | codeforces | 1267-C | Cactus Revenge | https://codeforces.com/problemset/problem/1267/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 393
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1267-B | codeforces | 1267-B | Balls of Buma | https://codeforces.com/problemset/problem/1267/B | [] | null | null | stdin_stdout | 900 | {
"solved_count": 4750
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1267-A | codeforces | 1267-A | Apprentice Learning Trajectory | https://codeforces.com/problemset/problem/1267/A | [] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1070
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1266-H | codeforces | 1266-H | Red-Blue Graph | https://codeforces.com/problemset/problem/1266/H | [
"dp",
"graphs",
"math",
"matrices",
"meet-in-the-middle"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 144
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1266-G | codeforces | 1266-G | Permutation Concatenation | https://codeforces.com/problemset/problem/1266/G | [
"string suffix structures"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 143
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1266-F | codeforces | 1266-F | Almost Same Distance | https://codeforces.com/problemset/problem/1266/F | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 440
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1266-E | codeforces | 1266-E | Spaceship Solitaire | https://codeforces.com/problemset/problem/1266/E | [
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2458
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1266-D | codeforces | 1266-D | Decreasing Debts | https://codeforces.com/problemset/problem/1266/D | [
"constructive algorithms",
"data structures",
"graphs",
"greedy",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3961
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1266-C | codeforces | 1266-C | Diverse Matrix | https://codeforces.com/problemset/problem/1266/C | [
"constructive algorithms",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10112
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1266-B | codeforces | 1266-B | Dice Tower | https://codeforces.com/problemset/problem/1266/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16744
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1266-A | codeforces | 1266-A | Competitive Programmer | https://codeforces.com/problemset/problem/1266/A | [
"chinese remainder theorem",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17818
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1265-E | codeforces | 1265-E | Beautiful Mirrors | https://codeforces.com/problemset/problem/1265/E | [
"data structures",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4701
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1265-B | codeforces | 1265-B | Beautiful Numbers | https://codeforces.com/problemset/problem/1265/B | [
"data structures",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13686
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1265-A | codeforces | 1265-A | Beautiful String | https://codeforces.com/problemset/problem/1265/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16038
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1264-F | codeforces | 1264-F | Beautiful Fibonacci Problem | https://codeforces.com/problemset/problem/1264/F | [
"constructive algorithms",
"number theory"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 1162
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1264-E | codeforces | 1264-E | Beautiful League | https://codeforces.com/problemset/problem/1264/E | [
"constructive algorithms",
"flows",
"graph matchings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 989
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1264-D2 | codeforces | 1264-D2 | Beautiful Bracket Sequence (hard version) | https://codeforces.com/problemset/problem/1264/D2 | [
"combinatorics",
"probabilities"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1579
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1264-D1 | codeforces | 1264-D1 | Beautiful Bracket Sequence (easy version) | https://codeforces.com/problemset/problem/1264/D1 | [
"combinatorics",
"dp",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1629
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1264-C | codeforces | 1264-C | Beautiful Mirrors with queries | https://codeforces.com/problemset/problem/1264/C | [
"data structures",
"probabilities"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1369
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1264-B | codeforces | 1264-B | Beautiful Sequence | https://codeforces.com/problemset/problem/1264/B | [
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6080
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1264-A | codeforces | 1264-A | Beautiful Regional Contest | https://codeforces.com/problemset/problem/1264/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10489
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1263-F | codeforces | 1263-F | Economic Difficulties | https://codeforces.com/problemset/problem/1263/F | [
"data structures",
"dfs and similar",
"dp",
"flows",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 985
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1263-E | codeforces | 1263-E | Editor | https://codeforces.com/problemset/problem/1263/E | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3073
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1263-D | codeforces | 1263-D | Secret Passwords | https://codeforces.com/problemset/problem/1263/D | [
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 16684
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1263-C | codeforces | 1263-C | Everyone is a Winner! | https://codeforces.com/problemset/problem/1263/C | [
"binary search",
"math",
"meet-in-the-middle",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14811
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1263-B | codeforces | 1263-B | PIN Codes | https://codeforces.com/problemset/problem/1263/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11852
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1263-A | codeforces | 1263-A | Sweet Problem | https://codeforces.com/problemset/problem/1263/A | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17383
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1261-F | codeforces | 1261-F | Xor-Set | https://codeforces.com/problemset/problem/1261/F | [
"bitmasks",
"divide and conquer",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 538
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1260-F | codeforces | 1260-F | Colored Tree | https://codeforces.com/problemset/problem/1260/F | [
"data structures",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 683
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1260-E | codeforces | 1260-E | Tournament | https://codeforces.com/problemset/problem/1260/E | [
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1993
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1260-D | codeforces | 1260-D | A Game with Traps | https://codeforces.com/problemset/problem/1260/D | [
"binary search",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4299
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1260-C | codeforces | 1260-C | Infinite Fence | https://codeforces.com/problemset/problem/1260/C | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8939
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1260-B | codeforces | 1260-B | Obtain Two Zeroes | https://codeforces.com/problemset/problem/1260/B | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16891
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1260-A | codeforces | 1260-A | Heating | https://codeforces.com/problemset/problem/1260/A | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16047
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1257-G | codeforces | 1257-G | Divisor Set | https://codeforces.com/problemset/problem/1257/G | [
"divide and conquer",
"fft",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 803
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1257-F | codeforces | 1257-F | Make Them Similar | https://codeforces.com/problemset/problem/1257/F | [
"bitmasks",
"brute force",
"hashing",
"meet-in-the-middle"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2430
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1257-E | codeforces | 1257-E | The Contest | https://codeforces.com/problemset/problem/1257/E | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4699
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1257-D | codeforces | 1257-D | Yet Another Monster Killing Problem | https://codeforces.com/problemset/problem/1257/D | [
"binary search",
"data structures",
"dp",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8268
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1257-C | codeforces | 1257-C | Dominated Subarray | https://codeforces.com/problemset/problem/1257/C | [
"greedy",
"implementation",
"sortings",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17395
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1257-B | codeforces | 1257-B | Magic Stick | https://codeforces.com/problemset/problem/1257/B | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22729
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1257-A | codeforces | 1257-A | Two Rival Students | https://codeforces.com/problemset/problem/1257/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21736
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1256-F | codeforces | 1256-F | Equalizing Two Strings | https://codeforces.com/problemset/problem/1256/F | [
"constructive algorithms",
"sortings",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3676
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1256-E | codeforces | 1256-E | Yet Another Division Into Teams | https://codeforces.com/problemset/problem/1256/E | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4783
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1256-D | codeforces | 1256-D | Binary String Minimizing | https://codeforces.com/problemset/problem/1256/D | [
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12868
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1256-C | codeforces | 1256-C | Platforms Jumping | https://codeforces.com/problemset/problem/1256/C | [
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7375
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1256-B | codeforces | 1256-B | Minimize the Permutation | https://codeforces.com/problemset/problem/1256/B | [
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 13778
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1256-A | codeforces | 1256-A | Payment Without Change | https://codeforces.com/problemset/problem/1256/A | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 32755
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1255-C | codeforces | 1255-C | League of Leesins | https://codeforces.com/problemset/problem/1255/C | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7305
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1255-B | codeforces | 1255-B | Fridge Lockers | https://codeforces.com/problemset/problem/1255/B | [
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12673
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1255-A | codeforces | 1255-A | Changing Volume | https://codeforces.com/problemset/problem/1255/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18113
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1254-E | codeforces | 1254-E | Send Tree to Charlie | https://codeforces.com/problemset/problem/1254/E | [
"combinatorics",
"dfs and similar",
"dsu",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 483
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1254-D | codeforces | 1254-D | Tree Queries | https://codeforces.com/problemset/problem/1254/D | [
"data structures",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1724
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1254-C | codeforces | 1254-C | Point Ordering | https://codeforces.com/problemset/problem/1254/C | [
"constructive algorithms",
"geometry",
"interactive",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1816
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1254-B2 | codeforces | 1254-B2 | Send Boxes to Alice (Hard Version) | https://codeforces.com/problemset/problem/1254/B2 | [
"constructive algorithms",
"greedy",
"math",
"number theory",
"ternary search",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3566
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1254-B1 | codeforces | 1254-B1 | Send Boxes to Alice (Easy Version) | https://codeforces.com/problemset/problem/1254/B1 | [
"constructive algorithms",
"greedy",
"math",
"number theory",
"ternary search",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5071
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1254-A | codeforces | 1254-A | Feeding Chicken | https://codeforces.com/problemset/problem/1254/A | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5774
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1253-F | codeforces | 1253-F | Cheap Robot | https://codeforces.com/problemset/problem/1253/F | [
"binary search",
"dsu",
"graphs",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2397
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1253-E | codeforces | 1253-E | Antenna Coverage | https://codeforces.com/problemset/problem/1253/E | [
"data structures",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3186
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1253-D | codeforces | 1253-D | Harmonious Graph | https://codeforces.com/problemset/problem/1253/D | [
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10628
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1253-C | codeforces | 1253-C | Sweets Eating | https://codeforces.com/problemset/problem/1253/C | [
"dp",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15626
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1253-B | codeforces | 1253-B | Silly Mistake | https://codeforces.com/problemset/problem/1253/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11762
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1253-A | codeforces | 1253-A | Single Push | https://codeforces.com/problemset/problem/1253/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19555
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1252-L | codeforces | 1252-L | Road Construction | https://codeforces.com/problemset/problem/1252/L | [
"flows",
"graphs"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 673
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1252-K | codeforces | 1252-K | Addition Robot | https://codeforces.com/problemset/problem/1252/K | [
"data structures",
"math",
"matrices"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2118
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1252-J | codeforces | 1252-J | Tiling Terrace | https://codeforces.com/problemset/problem/1252/J | [
"brute force",
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 815
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1252-I | codeforces | 1252-I | Mission Possible | https://codeforces.com/problemset/problem/1252/I | [] | null | null | stdin_stdout | 3,000 | {
"solved_count": 61
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1252-H | codeforces | 1252-H | Twin Buildings | https://codeforces.com/problemset/problem/1252/H | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2956
} | 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.