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: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": 10210
} | 2026-06-01T05:00:40.145500+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": 540
} | 2026-06-01T05:00:40.145500+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": 7785
} | 2026-06-01T05:00:40.145500+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": 1264
} | 2026-06-01T05:00:40.145500+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": 3647
} | 2026-06-01T05:00:40.145500+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": 15682
} | 2026-06-01T05:00:40.145500+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": 10402
} | 2026-06-01T05:00:40.145500+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": 12815
} | 2026-06-01T05:00:40.145500+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": 9474
} | 2026-06-01T05:00:40.145500+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": 8361
} | 2026-06-01T05:00:40.145500+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": 12249
} | 2026-06-01T05:00:40.145500+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": 572
} | 2026-06-01T05:00:40.145500+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": 1321
} | 2026-06-01T05:00:40.145500+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": 1005
} | 2026-06-01T05:00:40.145500+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": 2331
} | 2026-06-01T05:00:40.145500+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": 4243
} | 2026-06-01T05:00:40.145500+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": 3946
} | 2026-06-01T05:00:40.145500+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": 2127
} | 2026-06-01T05:00:40.145500+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": 10048
} | 2026-06-01T05:00:40.145500+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": 7483
} | 2026-06-01T05:00:40.145500+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": 330
} | 2026-06-01T05:00:40.145500+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": 143
} | 2026-06-01T05:00:40.145500+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": 1782
} | 2026-06-01T05:00:40.145500+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": 2458
} | 2026-06-01T05:00:40.145500+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": 480
} | 2026-06-01T05:00:40.145500+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": 1746
} | 2026-06-01T05:00:40.145500+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": 803
} | 2026-06-01T05:00:40.145500+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": 571
} | 2026-06-01T05:00:40.145500+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": 876
} | 2026-06-01T05:00:40.145500+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": 5570
} | 2026-06-01T05:00:40.145500+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": 5176
} | 2026-06-01T05:00:40.145500+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": 7182
} | 2026-06-01T05:00:40.145500+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": 16647
} | 2026-06-01T05:00:40.145500+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": 11516
} | 2026-06-01T05:00:40.145500+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": 649
} | 2026-06-01T05:00:40.145500+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": 6731
} | 2026-06-01T05:00:40.145500+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": 4462
} | 2026-06-01T05:00:40.145500+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": 6830
} | 2026-06-01T05:00:40.145500+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": 6100
} | 2026-06-01T05:00:40.145500+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": 6104
} | 2026-06-01T05:00:40.145500+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": 13282
} | 2026-06-01T05:00:40.145500+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": 21701
} | 2026-06-01T05:00:40.145500+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": 919
} | 2026-06-01T05:00:40.145500+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": 675
} | 2026-06-01T05:00:40.145500+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": 1647
} | 2026-06-01T05:00:40.145500+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": 5279
} | 2026-06-01T05:00:40.145500+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": 9205
} | 2026-06-01T05:00:40.145500+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": 15791
} | 2026-06-01T05:00:40.145500+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": 11470
} | 2026-06-01T05:00:40.145500+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": 81
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1116-D5 | codeforces | 1116-D5 | Creeper | https://codeforces.com/problemset/problem/1116/D5 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 152
} | 2026-06-01T05:00:40.145500+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": 171
} | 2026-06-01T05:00:40.145500+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": 207
} | 2026-06-01T05:00:40.145500+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": 236
} | 2026-06-01T05:00:40.145500+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": 278
} | 2026-06-01T05:00:40.145500+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": 187
} | 2026-06-01T05:00:40.145500+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": 189
} | 2026-06-01T05:00:40.145500+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": 267
} | 2026-06-01T05:00:40.145500+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": 62
} | 2026-06-01T05:00:40.145500+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": 136
} | 2026-06-01T05:00:40.145500+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": 184
} | 2026-06-01T05:00:40.145500+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": 328
} | 2026-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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": 239
} | 2026-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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-06-01T05:00:40.145500+00:00 |
codeforces:1115-G1 | codeforces | 1115-G1 | AND oracle | https://codeforces.com/problemset/problem/1115/G1 | [
"*special"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 404
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1114-F | codeforces | 1114-F | Please, another Queries on Array? | https://codeforces.com/problemset/problem/1114/F | [
"bitmasks",
"data structures",
"divide and conquer",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2458
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1114-E | codeforces | 1114-E | Arithmetic Progression | https://codeforces.com/problemset/problem/1114/E | [
"binary search",
"interactive",
"number theory",
"probabilities"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3200
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1114-D | codeforces | 1114-D | Flood Fill | https://codeforces.com/problemset/problem/1114/D | [
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8042
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1114-C | codeforces | 1114-C | Trailing Loves (or L'oeufs?) | https://codeforces.com/problemset/problem/1114/C | [
"brute force",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7916
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1114-B | codeforces | 1114-B | Yet Another Array Partitioning Task | https://codeforces.com/problemset/problem/1114/B | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9404
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1114-A | codeforces | 1114-A | Got Any Grapes? | https://codeforces.com/problemset/problem/1114/A | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19780
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1113-B | codeforces | 1113-B | Sasha and Magnetic Machines | https://codeforces.com/problemset/problem/1113/B | [
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 8182
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1113-A | codeforces | 1113-A | Sasha and His Trip | https://codeforces.com/problemset/problem/1113/A | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18368
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1111-E | codeforces | 1111-E | Tree | https://codeforces.com/problemset/problem/1111/E | [
"data structures",
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1121
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1111-D | codeforces | 1111-D | Destroy the Colony | https://codeforces.com/problemset/problem/1111/D | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1160
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1111-C | codeforces | 1111-C | Creative Snap | https://codeforces.com/problemset/problem/1111/C | [
"binary search",
"brute force",
"divide and conquer",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7059
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1111-B | codeforces | 1111-B | Average Superhero Gang Power | https://codeforces.com/problemset/problem/1111/B | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6549
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1111-A | codeforces | 1111-A | Superhero Transformation | https://codeforces.com/problemset/problem/1111/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 18158
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1110-H | codeforces | 1110-H | Modest Substrings | https://codeforces.com/problemset/problem/1110/H | [
"dp",
"strings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 435
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1110-G | codeforces | 1110-G | Tree-Tac-Toe | https://codeforces.com/problemset/problem/1110/G | [
"constructive algorithms",
"games",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 754
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1110-F | codeforces | 1110-F | Nearest Leaf | https://codeforces.com/problemset/problem/1110/F | [
"data structures",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 2075
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1110-E | codeforces | 1110-E | Magic Stones | https://codeforces.com/problemset/problem/1110/E | [
"constructive algorithms",
"math",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4743
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1110-D | codeforces | 1110-D | Jongmah | https://codeforces.com/problemset/problem/1110/D | [
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4005
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1110-C | codeforces | 1110-C | Meaningless Operations | https://codeforces.com/problemset/problem/1110/C | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10031
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1110-B | codeforces | 1110-B | Tape | https://codeforces.com/problemset/problem/1110/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16847
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1110-A | codeforces | 1110-A | Parity | https://codeforces.com/problemset/problem/1110/A | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16092
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1109-F | codeforces | 1109-F | Sasha and Algorithm of Silence's Sounds | https://codeforces.com/problemset/problem/1109/F | [
"data structures",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 368
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1109-E | codeforces | 1109-E | Sasha and a Very Easy Test | https://codeforces.com/problemset/problem/1109/E | [
"data structures",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 599
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1109-D | codeforces | 1109-D | Sasha and Interesting Fact from Graph Theory | https://codeforces.com/problemset/problem/1109/D | [
"brute force",
"combinatorics",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1506
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1109-C | codeforces | 1109-C | Sasha and a Patient Friend | https://codeforces.com/problemset/problem/1109/C | [
"binary search",
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 288
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1109-B | codeforces | 1109-B | Sasha and One More Name | https://codeforces.com/problemset/problem/1109/B | [
"constructive algorithms",
"hashing",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4546
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1109-A | codeforces | 1109-A | Sasha and a Bit of Relax | https://codeforces.com/problemset/problem/1109/A | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9075
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1108-F | codeforces | 1108-F | MST Unification | https://codeforces.com/problemset/problem/1108/F | [
"binary search",
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3603
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1108-E2 | codeforces | 1108-E2 | Array and Segments (Hard version) | https://codeforces.com/problemset/problem/1108/E2 | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2535
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1108-E1 | codeforces | 1108-E1 | Array and Segments (Easy version) | https://codeforces.com/problemset/problem/1108/E1 | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4918
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1108-D | codeforces | 1108-D | Diverse Garland | https://codeforces.com/problemset/problem/1108/D | [
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16515
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1108-C | codeforces | 1108-C | Nice Garland | https://codeforces.com/problemset/problem/1108/C | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12715
} | 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.