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:1140-A | codeforces | 1140-A | Detective Book | https://codeforces.com/problemset/problem/1140/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 12914
} | 2026-08-17T01:43:56.191071+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": 729
} | 2026-08-17T01:43:56.191071+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": 2484
} | 2026-08-17T01:43:56.191071+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": 2821
} | 2026-08-17T01:43:56.191071+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": 17572
} | 2026-08-17T01:43:56.191071+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": 19833
} | 2026-08-17T01:43:56.191071+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": 17724
} | 2026-08-17T01:43:56.191071+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": 4223
} | 2026-08-17T01:43:56.191071+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": 22713
} | 2026-08-17T01:43:56.191071+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": 535
} | 2026-08-17T01:43:56.191071+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": 647
} | 2026-08-17T01:43:56.191071+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": 2261
} | 2026-08-17T01:43:56.191071+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": 1391
} | 2026-08-17T01:43:56.191071+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": 7162
} | 2026-08-17T01:43:56.191071+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": 4716
} | 2026-08-17T01:43:56.191071+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": 1226
} | 2026-08-17T01:43:56.191071+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": 4020
} | 2026-08-17T01:43:56.191071+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": 8050
} | 2026-08-17T01:43:56.191071+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": 12336
} | 2026-08-17T01:43:56.191071+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": 17321
} | 2026-08-17T01:43:56.191071+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": 3878
} | 2026-08-17T01:43:56.191071+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": 8889
} | 2026-08-17T01:43:56.191071+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": 6635
} | 2026-08-17T01:43:56.191071+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": 17454
} | 2026-08-17T01:43:56.191071+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": 29090
} | 2026-08-17T01:43:56.191071+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": 14542
} | 2026-08-17T01:43:56.191071+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": 20010
} | 2026-08-17T01:43:56.191071+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": 1300
} | 2026-08-17T01:43:56.191071+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": 11655
} | 2026-08-17T01:43:56.191071+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": 2146
} | 2026-08-17T01:43:56.191071+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": 2324
} | 2026-08-17T01:43:56.191071+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": 5757
} | 2026-08-17T01:43:56.191071+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": 14114
} | 2026-08-17T01:43:56.191071+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": 10243
} | 2026-08-17T01:43:56.191071+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": 571
} | 2026-08-17T01:43:56.191071+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": 7947
} | 2026-08-17T01:43:56.191071+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": 1294
} | 2026-08-17T01:43:56.191071+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": 3712
} | 2026-08-17T01:43:56.191071+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": 15806
} | 2026-08-17T01:43:56.191071+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": 10430
} | 2026-08-17T01:43:56.191071+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": 12856
} | 2026-08-17T01:43:56.191071+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": 9538
} | 2026-08-17T01:43:56.191071+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": 8485
} | 2026-08-17T01:43:56.191071+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": 12310
} | 2026-08-17T01:43:56.191071+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": 673
} | 2026-08-17T01:43:56.191071+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": 1409
} | 2026-08-17T01:43:56.191071+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": 1034
} | 2026-08-17T01:43:56.191071+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": 2354
} | 2026-08-17T01:43:56.191071+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": 4246
} | 2026-08-17T01:43:56.191071+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": 3952
} | 2026-08-17T01:43:56.191071+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": 2139
} | 2026-08-17T01:43:56.191071+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": 10180
} | 2026-08-17T01:43:56.191071+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": 7506
} | 2026-08-17T01:43:56.191071+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": 332
} | 2026-08-17T01:43:56.191071+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": 144
} | 2026-08-17T01:43:56.191071+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": 1818
} | 2026-08-17T01:43:56.191071+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": 2520
} | 2026-08-17T01:43:56.191071+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": 483
} | 2026-08-17T01:43:56.191071+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": 1753
} | 2026-08-17T01:43:56.191071+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": 978
} | 2026-08-17T01:43:56.191071+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": 638
} | 2026-08-17T01:43:56.191071+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": 995
} | 2026-08-17T01:43:56.191071+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": 5615
} | 2026-08-17T01:43:56.191071+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": 5193
} | 2026-08-17T01:43:56.191071+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": 7214
} | 2026-08-17T01:43:56.191071+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": 17694
} | 2026-08-17T01:43:56.191071+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": 11714
} | 2026-08-17T01:43:56.191071+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": 710
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1118-F1 | codeforces | 1118-F1 | Tree Cutting (Easy Version) | https://codeforces.com/problemset/problem/1118/F1 | [
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6867
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1118-E | codeforces | 1118-E | Yet Another Ball Problem | https://codeforces.com/problemset/problem/1118/E | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4495
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1118-D2 | codeforces | 1118-D2 | Coffee and Coursework (Hard Version) | https://codeforces.com/problemset/problem/1118/D2 | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6948
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1118-D1 | codeforces | 1118-D1 | Coffee and Coursework (Easy version) | https://codeforces.com/problemset/problem/1118/D1 | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6166
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1118-C | codeforces | 1118-C | Palindromic Matrix | https://codeforces.com/problemset/problem/1118/C | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6135
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1118-B | codeforces | 1118-B | Tanya and Candies | https://codeforces.com/problemset/problem/1118/B | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 13393
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1118-A | codeforces | 1118-A | Water Buying | https://codeforces.com/problemset/problem/1118/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21846
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1117-G | codeforces | 1117-G | Recursive Queries | https://codeforces.com/problemset/problem/1117/G | [
"data structures"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 977
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1117-F | codeforces | 1117-F | Crisp String | https://codeforces.com/problemset/problem/1117/F | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 708
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1117-E | codeforces | 1117-E | Decypher the String | https://codeforces.com/problemset/problem/1117/E | [
"bitmasks",
"chinese remainder theorem",
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1670
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1117-D | codeforces | 1117-D | Magic Gems | https://codeforces.com/problemset/problem/1117/D | [
"dp",
"math",
"matrices"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5609
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1117-C | codeforces | 1117-C | Magic Ship | https://codeforces.com/problemset/problem/1117/C | [
"binary search"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 9593
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1117-B | codeforces | 1117-B | Emotes | https://codeforces.com/problemset/problem/1117/B | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 15984
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1117-A | codeforces | 1117-A | Best Subsegment | https://codeforces.com/problemset/problem/1117/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 11572
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1116-D6 | codeforces | 1116-D6 | Hessenberg matrix | https://codeforces.com/problemset/problem/1116/D6 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 82
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1116-D5 | codeforces | 1116-D5 | Creeper | https://codeforces.com/problemset/problem/1116/D5 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 153
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1116-D4 | codeforces | 1116-D4 | TIE fighter | https://codeforces.com/problemset/problem/1116/D4 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 172
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1116-D3 | codeforces | 1116-D3 | X-wing fighter | https://codeforces.com/problemset/problem/1116/D3 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 208
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1116-D2 | codeforces | 1116-D2 | Pattern of increasing blocks | https://codeforces.com/problemset/problem/1116/D2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 237
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1116-D1 | codeforces | 1116-D1 | Block diagonal matrix | https://codeforces.com/problemset/problem/1116/D1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 279
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1116-C3 | codeforces | 1116-C3 | ``Is the number of ones divisible by 3?'' oracle | https://codeforces.com/problemset/problem/1116/C3 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 188
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1116-C2 | codeforces | 1116-C2 | ``Is the bit string periodic?'' oracle | https://codeforces.com/problemset/problem/1116/C2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 190
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1116-C1 | codeforces | 1116-C1 | Alternating bits oracle | https://codeforces.com/problemset/problem/1116/C1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 268
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1116-B2 | codeforces | 1116-B2 | Not A, not B or not C? | https://codeforces.com/problemset/problem/1116/B2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 63
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1116-B1 | codeforces | 1116-B1 | Distinguish three-qubit states | https://codeforces.com/problemset/problem/1116/B1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 137
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1116-A2 | codeforces | 1116-A2 | Generate equal superposition of four basis states | https://codeforces.com/problemset/problem/1116/A2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 185
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1116-A1 | codeforces | 1116-A1 | Generate state |00⟩ + |01⟩ + |10⟩ | https://codeforces.com/problemset/problem/1116/A1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 329
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1115-U3 | codeforces | 1115-U3 | Block unitary | https://codeforces.com/problemset/problem/1115/U3 | [
"*special"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 201
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1115-U2 | codeforces | 1115-U2 | Chessboard unitary | https://codeforces.com/problemset/problem/1115/U2 | [
"*special"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 241
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1115-U1 | codeforces | 1115-U1 | Anti-diagonal unitary | https://codeforces.com/problemset/problem/1115/U1 | [
"*special"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 271
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1115-G3 | codeforces | 1115-G3 | Palindrome checker oracle | https://codeforces.com/problemset/problem/1115/G3 | [
"*special"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 238
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1115-G2 | codeforces | 1115-G2 | OR oracle | https://codeforces.com/problemset/problem/1115/G2 | [
"*special"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 318
} | 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.