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:1145-C | codeforces | 1145-C | Mystery Circuit | https://codeforces.com/problemset/problem/1145/C | [
"*special",
"bitmasks",
"brute force"
] | null | null | stdin_stdout | null | {
"solved_count": 842
} | 2026-11-02T05:37:07.883505+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": 1516
} | 2026-11-02T05:37:07.883505+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": 9450
} | 2026-11-02T05:37:07.883505+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": 2527
} | 2026-11-02T05:37:07.883505+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": 15435
} | 2026-11-02T05:37:07.883505+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": 4505
} | 2026-11-02T05:37:07.883505+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": 10955
} | 2026-11-02T05:37:07.883505+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": 16655
} | 2026-11-02T05:37:07.883505+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": 18528
} | 2026-11-02T05:37:07.883505+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": 22362
} | 2026-11-02T05:37:07.883505+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": 19453
} | 2026-11-02T05:37:07.883505+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": 11834
} | 2026-11-02T05:37:07.883505+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": 14250
} | 2026-11-02T05:37:07.883505+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": 653
} | 2026-11-02T05:37:07.883505+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": 707
} | 2026-11-02T05:37:07.883505+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": 1632
} | 2026-11-02T05:37:07.883505+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": 4153
} | 2026-11-02T05:37:07.883505+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": 3607
} | 2026-11-02T05:37:07.883505+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": 2693
} | 2026-11-02T05:37:07.883505+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": 4748
} | 2026-11-02T05:37:07.883505+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": 4250
} | 2026-11-02T05:37:07.883505+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": 7189
} | 2026-11-02T05:37:07.883505+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": 9084
} | 2026-11-02T05:37:07.883505+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": 12458
} | 2026-11-02T05:37:07.883505+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": 23581
} | 2026-11-02T05:37:07.883505+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": 41162
} | 2026-11-02T05:37:07.883505+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": 682
} | 2026-11-02T05:37:07.883505+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": 1721
} | 2026-11-02T05:37:07.883505+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": 2218
} | 2026-11-02T05:37:07.883505+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": 13371
} | 2026-11-02T05:37:07.883505+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": 10668
} | 2026-11-02T05:37:07.883505+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": 11912
} | 2026-11-02T05:37:07.883505+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": 12945
} | 2026-11-02T05:37:07.883505+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": 744
} | 2026-11-02T05:37:07.883505+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": 2560
} | 2026-11-02T05:37:07.883505+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": 2874
} | 2026-11-02T05:37:07.883505+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": 18111
} | 2026-11-02T05:37:07.883505+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": 20079
} | 2026-11-02T05:37:07.883505+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": 17845
} | 2026-11-02T05:37:07.883505+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": 4247
} | 2026-11-02T05:37:07.883505+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": 23071
} | 2026-11-02T05:37:07.883505+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": 541
} | 2026-11-02T05:37:07.883505+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": 667
} | 2026-11-02T05:37:07.883505+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": 2358
} | 2026-11-02T05:37:07.883505+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": 1425
} | 2026-11-02T05:37:07.883505+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": 7322
} | 2026-11-02T05:37:07.883505+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": 4735
} | 2026-11-02T05:37:07.883505+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": 1265
} | 2026-11-02T05:37:07.883505+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": 4058
} | 2026-11-02T05:37:07.883505+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": 8071
} | 2026-11-02T05:37:07.883505+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": 12393
} | 2026-11-02T05:37:07.883505+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": 17360
} | 2026-11-02T05:37:07.883505+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": 3929
} | 2026-11-02T05:37:07.883505+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": 8980
} | 2026-11-02T05:37:07.883505+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": 6757
} | 2026-11-02T05:37:07.883505+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": 17993
} | 2026-11-02T05:37:07.883505+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": 29868
} | 2026-11-02T05:37:07.883505+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": 14669
} | 2026-11-02T05:37:07.883505+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": 20193
} | 2026-11-02T05:37:07.883505+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": 1330
} | 2026-11-02T05:37:07.883505+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": 12168
} | 2026-11-02T05:37:07.883505+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": 2190
} | 2026-11-02T05:37:07.883505+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": 2379
} | 2026-11-02T05:37:07.883505+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": 5801
} | 2026-11-02T05:37:07.883505+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": 14222
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1132-A | codeforces | 1132-A | Regular Bracket Sequence | https://codeforces.com/problemset/problem/1132/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10268
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1131-G | codeforces | 1131-G | Most Dangerous Shark | https://codeforces.com/problemset/problem/1131/G | [
"data structures",
"dp",
"two pointers"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 578
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1131-F | codeforces | 1131-F | Asya And Kittens | https://codeforces.com/problemset/problem/1131/F | [
"constructive algorithms",
"dsu"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8055
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1131-E | codeforces | 1131-E | String Multiplication | https://codeforces.com/problemset/problem/1131/E | [
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1301
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1131-D | codeforces | 1131-D | Gourmet choice | https://codeforces.com/problemset/problem/1131/D | [
"dfs and similar",
"dp",
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3774
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1131-C | codeforces | 1131-C | Birthday | https://codeforces.com/problemset/problem/1131/C | [
"binary search",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 15878
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1131-B | codeforces | 1131-B | Draw! | https://codeforces.com/problemset/problem/1131/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10455
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1131-A | codeforces | 1131-A | Sea Battle | https://codeforces.com/problemset/problem/1131/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12909
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1130-C | codeforces | 1130-C | Connect | https://codeforces.com/problemset/problem/1130/C | [
"brute force",
"dfs and similar",
"dsu"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9634
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1130-B | codeforces | 1130-B | Two Cakes | https://codeforces.com/problemset/problem/1130/B | [
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8511
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1130-A | codeforces | 1130-A | Be Positive | https://codeforces.com/problemset/problem/1130/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12347
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1129-E | codeforces | 1129-E | Legendary Tree | https://codeforces.com/problemset/problem/1129/E | [
"binary search",
"interactive",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 695
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1129-D | codeforces | 1129-D | Isolation | https://codeforces.com/problemset/problem/1129/D | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1457
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1129-C | codeforces | 1129-C | Morse Code | https://codeforces.com/problemset/problem/1129/C | [
"binary search",
"data structures",
"dp",
"hashing",
"sortings",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1072
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1129-B | codeforces | 1129-B | Wrong Answer | https://codeforces.com/problemset/problem/1129/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2365
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1129-A2 | codeforces | 1129-A2 | Toy Train | https://codeforces.com/problemset/problem/1129/A2 | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4252
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1129-A1 | codeforces | 1129-A1 | Toy Train (Simplified) | https://codeforces.com/problemset/problem/1129/A1 | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3967
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1121-C | codeforces | 1121-C | System Testing | https://codeforces.com/problemset/problem/1121/C | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2147
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1121-B | codeforces | 1121-B | Mike and Children | https://codeforces.com/problemset/problem/1121/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10265
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1121-A | codeforces | 1121-A | Technogoblet of Fire | https://codeforces.com/problemset/problem/1121/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 7543
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1120-F | codeforces | 1120-F | Secret Letters | https://codeforces.com/problemset/problem/1120/F | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 350
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1120-E | codeforces | 1120-E | The very same Munchhausen | https://codeforces.com/problemset/problem/1120/E | [
"brute force"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 150
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1120-D | codeforces | 1120-D | Power Tree | https://codeforces.com/problemset/problem/1120/D | [
"dfs and similar",
"dp",
"dsu",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1883
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1120-C | codeforces | 1120-C | Compress String | https://codeforces.com/problemset/problem/1120/C | [
"dp",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2652
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1120-B | codeforces | 1120-B | Once in a casino | https://codeforces.com/problemset/problem/1120/B | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 491
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1120-A | codeforces | 1120-A | Diana and Liana | https://codeforces.com/problemset/problem/1120/A | [
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1777
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1119-H | codeforces | 1119-H | Triple | https://codeforces.com/problemset/problem/1119/H | [
"fft",
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 988
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1119-G | codeforces | 1119-G | Get Ready for the Battle | https://codeforces.com/problemset/problem/1119/G | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 653
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1119-F | codeforces | 1119-F | Niyaz and Small Degrees | https://codeforces.com/problemset/problem/1119/F | [
"data structures",
"dp",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 1012
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1119-E | codeforces | 1119-E | Pavel and Triangles | https://codeforces.com/problemset/problem/1119/E | [
"brute force",
"dp",
"fft",
"greedy",
"ternary search"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5674
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1119-D | codeforces | 1119-D | Frets On Fire | https://codeforces.com/problemset/problem/1119/D | [
"binary search",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5220
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1119-C | codeforces | 1119-C | Ramesses and Corner Inversion | https://codeforces.com/problemset/problem/1119/C | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7307
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1119-B | codeforces | 1119-B | Alyona and a Narrow Fridge | https://codeforces.com/problemset/problem/1119/B | [
"binary search",
"flows",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18434
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1119-A | codeforces | 1119-A | Ilya and a Colorful Walk | https://codeforces.com/problemset/problem/1119/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 11876
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1118-F2 | codeforces | 1118-F2 | Tree Cutting (Hard Version) | https://codeforces.com/problemset/problem/1118/F2 | [
"combinatorics",
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 721
} | 2026-11-02T05:37:07.883505+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.