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:1151-B | codeforces | 1151-B | Dima and a Bad XOR | https://codeforces.com/problemset/problem/1151/B | [
"bitmasks",
"brute force",
"constructive algorithms",
"dp"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12914
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1151-A | codeforces | 1151-A | Maxim and Biology | https://codeforces.com/problemset/problem/1151/A | [
"brute force",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 11905
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1150-B | codeforces | 1150-B | Tiling Challenge | https://codeforces.com/problemset/problem/1150/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 11868
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1150-A | codeforces | 1150-A | Stock Arbitraging | https://codeforces.com/problemset/problem/1150/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12534
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1149-E | codeforces | 1149-E | Election Promises | https://codeforces.com/problemset/problem/1149/E | [
"games",
"graphs"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 673
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1149-D | codeforces | 1149-D | Abandoning Roads | https://codeforces.com/problemset/problem/1149/D | [
"brute force",
"dp",
"graphs",
"greedy"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 970
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1149-C | codeforces | 1149-C | Tree Generator™ | https://codeforces.com/problemset/problem/1149/C | [
"data structures",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1678
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1149-B | codeforces | 1149-B | Three Religions | https://codeforces.com/problemset/problem/1149/B | [
"dp",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2049
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1149-A | codeforces | 1149-A | Prefix Sum Primes | https://codeforces.com/problemset/problem/1149/A | [
"constructive algorithms",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17965
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1148-H | codeforces | 1148-H | Holy Diver | https://codeforces.com/problemset/problem/1148/H | [
"data structures"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 323
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1148-G | codeforces | 1148-G | Gold Experience | https://codeforces.com/problemset/problem/1148/G | [
"constructive algorithms",
"graphs",
"math",
"number theory",
"probabilities"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 390
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1148-F | codeforces | 1148-F | Foo Fighters | https://codeforces.com/problemset/problem/1148/F | [
"bitmasks",
"constructive algorithms"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1135
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1148-E | codeforces | 1148-E | Earth Wind and Fire | https://codeforces.com/problemset/problem/1148/E | [
"constructive algorithms",
"greedy",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1828
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1148-D | codeforces | 1148-D | Dirty Deeds Done Dirt Cheap | https://codeforces.com/problemset/problem/1148/D | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5271
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1148-C | codeforces | 1148-C | Crazy Diamond | https://codeforces.com/problemset/problem/1148/C | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5633
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1148-B | codeforces | 1148-B | Born This Way | https://codeforces.com/problemset/problem/1148/B | [
"binary search",
"brute force",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7974
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1148-A | codeforces | 1148-A | Another One Bites The Dust | https://codeforces.com/problemset/problem/1148/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15569
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1147-F | codeforces | 1147-F | Zigzag Game | https://codeforces.com/problemset/problem/1147/F | [
"games",
"interactive"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 340
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1147-E | codeforces | 1147-E | Rainbow Coins | https://codeforces.com/problemset/problem/1147/E | [
"interactive"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 477
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1147-D | codeforces | 1147-D | Palindrome XOR | https://codeforces.com/problemset/problem/1147/D | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 860
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1147-C | codeforces | 1147-C | Thanos Nim | https://codeforces.com/problemset/problem/1147/C | [
"games"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3660
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1147-B | codeforces | 1147-B | Chladni Figure | https://codeforces.com/problemset/problem/1147/B | [
"brute force",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3115
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1147-A | codeforces | 1147-A | Hide and Seek | https://codeforces.com/problemset/problem/1147/A | [
"graphs"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5595
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1146-H | codeforces | 1146-H | Satanic Panic | https://codeforces.com/problemset/problem/1146/H | [
"dp",
"geometry"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 683
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1146-G | codeforces | 1146-G | Zoning Restrictions | https://codeforces.com/problemset/problem/1146/G | [
"dp",
"flows",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1055
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1146-F | codeforces | 1146-F | Leaf Partition | https://codeforces.com/problemset/problem/1146/F | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1339
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1146-E | codeforces | 1146-E | Hot is Cold | https://codeforces.com/problemset/problem/1146/E | [
"bitmasks",
"data structures",
"divide and conquer",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1022
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1146-D | codeforces | 1146-D | Frog Jumping | https://codeforces.com/problemset/problem/1146/D | [
"dfs and similar",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1207
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1146-C | codeforces | 1146-C | Tree Diameter | https://codeforces.com/problemset/problem/1146/C | [
"bitmasks",
"graphs",
"interactive"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4225
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1146-B | codeforces | 1146-B | Hate "A" | https://codeforces.com/problemset/problem/1146/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 9337
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1146-A | codeforces | 1146-A | Love "A" | https://codeforces.com/problemset/problem/1146/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23701
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1145-G | codeforces | 1145-G | AI Takeover | https://codeforces.com/problemset/problem/1145/G | [
"*special",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 192
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1145-F | codeforces | 1145-F | Neat Words | https://codeforces.com/problemset/problem/1145/F | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 541
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1145-E | codeforces | 1145-E | Fourier Doodles | https://codeforces.com/problemset/problem/1145/E | [] | null | null | stdin_stdout | null | {
"solved_count": 444
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1145-D | codeforces | 1145-D | Pigeon d'Or | https://codeforces.com/problemset/problem/1145/D | [
"*special",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 1197
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1145-C | codeforces | 1145-C | Mystery Circuit | https://codeforces.com/problemset/problem/1145/C | [
"bitmasks",
"brute force"
] | null | null | stdin_stdout | null | {
"solved_count": 834
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1145-B | codeforces | 1145-B | Kanban Numbers | https://codeforces.com/problemset/problem/1145/B | [
"*special",
"brute force"
] | null | null | stdin_stdout | null | {
"solved_count": 1503
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1145-A | codeforces | 1145-A | Thanos Sort | https://codeforces.com/problemset/problem/1145/A | [
"*special",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 9287
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1144-G | codeforces | 1144-G | Two Merged Sequences | https://codeforces.com/problemset/problem/1144/G | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2341
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1144-F | codeforces | 1144-F | Graph Without Long Directed Paths | https://codeforces.com/problemset/problem/1144/F | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 14356
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1144-E | codeforces | 1144-E | Median String | https://codeforces.com/problemset/problem/1144/E | [
"bitmasks",
"math",
"number theory",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4433
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1144-D | codeforces | 1144-D | Equalize Them All | https://codeforces.com/problemset/problem/1144/D | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10853
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1144-C | codeforces | 1144-C | Two Shuffled Sequences | https://codeforces.com/problemset/problem/1144/C | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16410
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1144-B | codeforces | 1144-B | Parity Alternated Deletions | https://codeforces.com/problemset/problem/1144/B | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18362
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1144-A | codeforces | 1144-A | Diverse Strings | https://codeforces.com/problemset/problem/1144/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22099
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1143-C | codeforces | 1143-C | Queen | https://codeforces.com/problemset/problem/1143/C | [
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17901
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1143-B | codeforces | 1143-B | Nirvana | https://codeforces.com/problemset/problem/1143/B | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 11614
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1143-A | codeforces | 1143-A | The Doors | https://codeforces.com/problemset/problem/1143/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14057
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1142-E | codeforces | 1142-E | Pink Floyd | https://codeforces.com/problemset/problem/1142/E | [
"graphs",
"interactive"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 638
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1142-D | codeforces | 1142-D | Foreigner | https://codeforces.com/problemset/problem/1142/D | [
"dp"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 618
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1142-C | codeforces | 1142-C | U2 | https://codeforces.com/problemset/problem/1142/C | [
"geometry"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1551
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1142-B | codeforces | 1142-B | Lynyrd Skynyrd | https://codeforces.com/problemset/problem/1142/B | [
"data structures",
"dfs and similar",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3821
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1142-A | codeforces | 1142-A | The Beatles | https://codeforces.com/problemset/problem/1142/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3584
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1141-G | codeforces | 1141-G | Privatization of Roads in Treeland | https://codeforces.com/problemset/problem/1141/G | [
"binary search",
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2550
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1141-F2 | codeforces | 1141-F2 | Same Sum Blocks (Hard) | https://codeforces.com/problemset/problem/1141/F2 | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4592
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1141-F1 | codeforces | 1141-F1 | Same Sum Blocks (Easy) | https://codeforces.com/problemset/problem/1141/F1 | [
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4166
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1141-E | codeforces | 1141-E | Superhero Battle | https://codeforces.com/problemset/problem/1141/E | [
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7115
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1141-D | codeforces | 1141-D | Colored Boots | https://codeforces.com/problemset/problem/1141/D | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8989
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1141-C | codeforces | 1141-C | Polycarp Restores Permutation | https://codeforces.com/problemset/problem/1141/C | [
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12315
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1141-B | codeforces | 1141-B | Maximal Continuous Rest | https://codeforces.com/problemset/problem/1141/B | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 23141
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1141-A | codeforces | 1141-A | Game 23 | https://codeforces.com/problemset/problem/1141/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 39758
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1140-G | codeforces | 1140-G | Double Tree | https://codeforces.com/problemset/problem/1140/G | [
"data structures",
"divide and conquer",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 619
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1140-F | codeforces | 1140-F | Extending Set of Points | https://codeforces.com/problemset/problem/1140/F | [
"data structures",
"divide and conquer",
"dsu"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1569
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1140-E | codeforces | 1140-E | Palindrome-less Arrays | https://codeforces.com/problemset/problem/1140/E | [
"combinatorics",
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2117
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1140-D | codeforces | 1140-D | Minimum Triangulation | https://codeforces.com/problemset/problem/1140/D | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 13231
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1140-C | codeforces | 1140-C | Playlist | https://codeforces.com/problemset/problem/1140/C | [
"brute force",
"data structures",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10432
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1140-B | codeforces | 1140-B | Good String | https://codeforces.com/problemset/problem/1140/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 11732
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1140-A | codeforces | 1140-A | Detective Book | https://codeforces.com/problemset/problem/1140/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 12828
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1139-F | codeforces | 1139-F | Dish Shopping | https://codeforces.com/problemset/problem/1139/F | [
"data structures",
"divide and conquer"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 512
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1139-E | codeforces | 1139-E | Maximize Mex | https://codeforces.com/problemset/problem/1139/E | [
"flows",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2306
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1139-D | codeforces | 1139-D | Steps to One | https://codeforces.com/problemset/problem/1139/D | [
"dp",
"math",
"number theory",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2711
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1139-C | codeforces | 1139-C | Edgy Trees | https://codeforces.com/problemset/problem/1139/C | [
"dfs and similar",
"dsu",
"graphs",
"math",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 16854
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1139-B | codeforces | 1139-B | Chocolates | https://codeforces.com/problemset/problem/1139/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19505
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1139-A | codeforces | 1139-A | Even Substrings | https://codeforces.com/problemset/problem/1139/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17667
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1138-B | codeforces | 1138-B | Circus | https://codeforces.com/problemset/problem/1138/B | [
"brute force",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4206
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1138-A | codeforces | 1138-A | Sushi for Two | https://codeforces.com/problemset/problem/1138/A | [
"binary search",
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 22254
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1137-F | codeforces | 1137-F | Matches Are Not a Child's Play | https://codeforces.com/problemset/problem/1137/F | [
"data structures",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 527
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1137-E | codeforces | 1137-E | Train Car Selection | https://codeforces.com/problemset/problem/1137/E | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 603
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1137-D | codeforces | 1137-D | Cooperative Game | https://codeforces.com/problemset/problem/1137/D | [
"constructive algorithms",
"interactive",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2172
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1137-C | codeforces | 1137-C | Museums Tour | https://codeforces.com/problemset/problem/1137/C | [
"dp",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1326
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1137-B | codeforces | 1137-B | Camp Schedule | https://codeforces.com/problemset/problem/1137/B | [
"greedy",
"hashing",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7049
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1137-A | codeforces | 1137-A | Skyscrapers | https://codeforces.com/problemset/problem/1137/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4680
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1136-E | codeforces | 1136-E | Nastya Hasn't Written a Legend | https://codeforces.com/problemset/problem/1136/E | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1191
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1136-D | codeforces | 1136-D | Nastya Is Buying Lunch | https://codeforces.com/problemset/problem/1136/D | [
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4006
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1136-C | codeforces | 1136-C | Nastya Is Transposing Matrices | https://codeforces.com/problemset/problem/1136/C | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8035
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1136-B | codeforces | 1136-B | Nastya Is Playing Computer Games | https://codeforces.com/problemset/problem/1136/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 12284
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1136-A | codeforces | 1136-A | Nastya Is Reading a Book | https://codeforces.com/problemset/problem/1136/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17272
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1133-F2 | codeforces | 1133-F2 | Spanning Tree with One Fixed Degree | https://codeforces.com/problemset/problem/1133/F2 | [
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3838
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1133-F1 | codeforces | 1133-F1 | Spanning Tree with Maximum Degree | https://codeforces.com/problemset/problem/1133/F1 | [
"graphs"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8800
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1133-E | codeforces | 1133-E | K Balanced Teams | https://codeforces.com/problemset/problem/1133/E | [
"dp",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6493
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1133-D | codeforces | 1133-D | Zero Quantity Maximization | https://codeforces.com/problemset/problem/1133/D | [
"hashing",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 16670
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1133-C | codeforces | 1133-C | Balanced Team | https://codeforces.com/problemset/problem/1133/C | [
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 28499
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1133-B | codeforces | 1133-B | Preparation for International Women's Day | https://codeforces.com/problemset/problem/1133/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14429
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1133-A | codeforces | 1133-A | Middle of the Contest | https://codeforces.com/problemset/problem/1133/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19777
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1132-G | codeforces | 1132-G | Greedy Subsequences | https://codeforces.com/problemset/problem/1132/G | [
"data structures",
"dp",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1239
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1132-F | codeforces | 1132-F | Clear the String | https://codeforces.com/problemset/problem/1132/F | [
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 10860
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1132-E | codeforces | 1132-E | Knapsack | https://codeforces.com/problemset/problem/1132/E | [
"dfs and similar",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1978
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1132-D | codeforces | 1132-D | Stressful Training | https://codeforces.com/problemset/problem/1132/D | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2274
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1132-C | codeforces | 1132-C | Painting the Fence | https://codeforces.com/problemset/problem/1132/C | [
"brute force"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5724
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1132-B | codeforces | 1132-B | Discounts | https://codeforces.com/problemset/problem/1132/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 14033
} | 2026-06-01T05:00:40.145500+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.