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:1187-F | codeforces | 1187-F | Expected Square Beauty | https://codeforces.com/problemset/problem/1187/F | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1123
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1187-E | codeforces | 1187-E | Tree Painting | https://codeforces.com/problemset/problem/1187/E | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 11434
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1187-D | codeforces | 1187-D | Subarray Sorting | https://codeforces.com/problemset/problem/1187/D | [
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 3010
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1187-C | codeforces | 1187-C | Vasya And Array | https://codeforces.com/problemset/problem/1187/C | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6792
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1187-B | codeforces | 1187-B | Letters Shop | https://codeforces.com/problemset/problem/1187/B | [
"binary search",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12906
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1187-A | codeforces | 1187-A | Stickers and Toys | https://codeforces.com/problemset/problem/1187/A | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 15564
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1186-F | codeforces | 1186-F | Vus the Cossack and a Graph | https://codeforces.com/problemset/problem/1186/F | [
"dfs and similar",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1047
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1186-E | codeforces | 1186-E | Vus the Cossack and a Field | https://codeforces.com/problemset/problem/1186/E | [
"divide and conquer",
"implementation",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 683
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1186-D | codeforces | 1186-D | Vus the Cossack and Numbers | https://codeforces.com/problemset/problem/1186/D | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9331
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1186-C | codeforces | 1186-C | Vus the Cossack and Strings | https://codeforces.com/problemset/problem/1186/C | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6574
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1186-A | codeforces | 1186-A | Vus the Cossack and a Contest | https://codeforces.com/problemset/problem/1186/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 42705
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1185-G2 | codeforces | 1185-G2 | Playlist for Polycarp (hard version) | https://codeforces.com/problemset/problem/1185/G2 | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 930
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1185-G1 | codeforces | 1185-G1 | Playlist for Polycarp (easy version) | https://codeforces.com/problemset/problem/1185/G1 | [
"bitmasks",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3210
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1185-F | codeforces | 1185-F | Two Pizzas | https://codeforces.com/problemset/problem/1185/F | [
"bitmasks",
"brute force"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2244
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1185-E | codeforces | 1185-E | Polycarp and Snakes | https://codeforces.com/problemset/problem/1185/E | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2811
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1185-D | codeforces | 1185-D | Extra Element | https://codeforces.com/problemset/problem/1185/D | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7064
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1185-C2 | codeforces | 1185-C2 | Exam in BerSU (hard version) | https://codeforces.com/problemset/problem/1185/C2 | [
"brute force",
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7836
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1185-C1 | codeforces | 1185-C1 | Exam in BerSU (easy version) | https://codeforces.com/problemset/problem/1185/C1 | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 11915
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1185-B | codeforces | 1185-B | Email from Polycarp | https://codeforces.com/problemset/problem/1185/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14246
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1185-A | codeforces | 1185-A | Ropewalkers | https://codeforces.com/problemset/problem/1185/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15405
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1184-E3 | codeforces | 1184-E3 | Daleks' Invasion (hard) | https://codeforces.com/problemset/problem/1184/E3 | [
"data structures",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 669
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1184-E2 | codeforces | 1184-E2 | Daleks' Invasion (medium) | https://codeforces.com/problemset/problem/1184/E2 | [
"dfs and similar",
"graphs",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1061
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1184-E1 | codeforces | 1184-E1 | Daleks' Invasion (easy) | https://codeforces.com/problemset/problem/1184/E1 | [
"graphs",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1867
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1184-D2 | codeforces | 1184-D2 | Parallel Universes (Hard) | https://codeforces.com/problemset/problem/1184/D2 | [
"math",
"matrices"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 129
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1184-D1 | codeforces | 1184-D1 | Parallel Universes (Easy) | https://codeforces.com/problemset/problem/1184/D1 | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2793
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1184-C3 | codeforces | 1184-C3 | Heidi and the Turing Test (Hard) | https://codeforces.com/problemset/problem/1184/C3 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 45
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1184-C2 | codeforces | 1184-C2 | Heidi and the Turing Test (Medium) | https://codeforces.com/problemset/problem/1184/C2 | [
"data structures"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 771
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1184-C1 | codeforces | 1184-C1 | Heidi and the Turing Test (Easy) | https://codeforces.com/problemset/problem/1184/C1 | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2947
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1184-B3 | codeforces | 1184-B3 | The Doctor Meets Vader (Hard) | https://codeforces.com/problemset/problem/1184/B3 | [
"flows",
"shortest paths"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 248
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1184-B2 | codeforces | 1184-B2 | The Doctor Meets Vader (Medium) | https://codeforces.com/problemset/problem/1184/B2 | [
"flows",
"graph matchings",
"graphs",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 692
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1184-B1 | codeforces | 1184-B1 | The Doctor Meets Vader (Easy) | https://codeforces.com/problemset/problem/1184/B1 | [
"binary search",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 6230
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1184-A3 | codeforces | 1184-A3 | Heidi Learns Hashing (Hard) | https://codeforces.com/problemset/problem/1184/A3 | [
"fft",
"math",
"number theory"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 155
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1184-A2 | codeforces | 1184-A2 | Heidi Learns Hashing (Medium) | https://codeforces.com/problemset/problem/1184/A2 | [
"brute force",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1130
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1184-A1 | codeforces | 1184-A1 | Heidi Learns Hashing (Easy) | https://codeforces.com/problemset/problem/1184/A1 | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 6599
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1183-H | codeforces | 1183-H | Subsequences (hard version) | https://codeforces.com/problemset/problem/1183/H | [
"dp",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3660
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1183-G | codeforces | 1183-G | Candy Box (hard version) | https://codeforces.com/problemset/problem/1183/G | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2675
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1183-F | codeforces | 1183-F | Topforces Strikes Back | https://codeforces.com/problemset/problem/1183/F | [
"brute force",
"math",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2255
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1183-E | codeforces | 1183-E | Subsequences (easy version) | https://codeforces.com/problemset/problem/1183/E | [
"dp",
"graphs",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5445
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1183-D | codeforces | 1183-D | Candy Box (easy version) | https://codeforces.com/problemset/problem/1183/D | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 20730
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1183-C | codeforces | 1183-C | Computer Game | https://codeforces.com/problemset/problem/1183/C | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15071
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1183-B | codeforces | 1183-B | Equalize Prices | https://codeforces.com/problemset/problem/1183/B | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 19721
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1183-A | codeforces | 1183-A | Nearest Interesting Number | https://codeforces.com/problemset/problem/1183/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27071
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1182-F | codeforces | 1182-F | Maximum Sine | https://codeforces.com/problemset/problem/1182/F | [
"binary search",
"data structures",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 402
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1182-E | codeforces | 1182-E | Product Oriented Recurrence | https://codeforces.com/problemset/problem/1182/E | [
"dp",
"math",
"matrices",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3379
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1182-D | codeforces | 1182-D | Complete Mirror | https://codeforces.com/problemset/problem/1182/D | [
"constructive algorithms",
"dfs and similar",
"dp",
"hashing",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1019
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1182-C | codeforces | 1182-C | Beautiful Lyrics | https://codeforces.com/problemset/problem/1182/C | [
"data structures",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4598
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1182-B | codeforces | 1182-B | Plus from Picture | https://codeforces.com/problemset/problem/1182/B | [
"dfs and similar",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12023
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1182-A | codeforces | 1182-A | Filling Shapes | https://codeforces.com/problemset/problem/1182/A | [
"dp",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 35757
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1181-E2 | codeforces | 1181-E2 | A Story of One Country (Hard) | https://codeforces.com/problemset/problem/1181/E2 | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 400
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1181-E1 | codeforces | 1181-E1 | A Story of One Country (Easy) | https://codeforces.com/problemset/problem/1181/E1 | [
"brute force",
"divide and conquer",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 624
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1181-D | codeforces | 1181-D | Irrigation | https://codeforces.com/problemset/problem/1181/D | [
"binary search",
"data structures",
"implementation",
"sortings",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2827
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1181-C | codeforces | 1181-C | Flag | https://codeforces.com/problemset/problem/1181/C | [
"brute force",
"combinatorics",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3406
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1181-B | codeforces | 1181-B | Split a Number | https://codeforces.com/problemset/problem/1181/B | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6621
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1181-A | codeforces | 1181-A | Chunga-Changa | https://codeforces.com/problemset/problem/1181/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 14839
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1180-B | codeforces | 1180-B | Nick and Array | https://codeforces.com/problemset/problem/1180/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10116
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1180-A | codeforces | 1180-A | Alex and a Rhombus | https://codeforces.com/problemset/problem/1180/A | [
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27505
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1179-E | codeforces | 1179-E | Alesya and Discrete Math | https://codeforces.com/problemset/problem/1179/E | [
"divide and conquer",
"interactive"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 203
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1179-D | codeforces | 1179-D | Fedor Runs for President | https://codeforces.com/problemset/problem/1179/D | [
"data structures",
"dp",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1037
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1179-C | codeforces | 1179-C | Serge and Dining Room | https://codeforces.com/problemset/problem/1179/C | [
"binary search",
"data structures",
"graph matchings",
"greedy",
"implementation",
"math",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2468
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1179-B | codeforces | 1179-B | Tolik and His Uncle | https://codeforces.com/problemset/problem/1179/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4600
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1179-A | codeforces | 1179-A | Valeriy and Deque | https://codeforces.com/problemset/problem/1179/A | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11850
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1178-H | codeforces | 1178-H | Stock Exchange | https://codeforces.com/problemset/problem/1178/H | [
"binary search",
"flows",
"graphs"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 299
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1178-G | codeforces | 1178-G | The Awesomest Vertex | https://codeforces.com/problemset/problem/1178/G | [
"data structures",
"dfs and similar"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 604
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1178-F2 | codeforces | 1178-F2 | Long Colorful Strip | https://codeforces.com/problemset/problem/1178/F2 | [
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1052
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1178-F1 | codeforces | 1178-F1 | Short Colorful Strip | https://codeforces.com/problemset/problem/1178/F1 | [
"combinatorics",
"dfs and similar",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2292
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1178-E | codeforces | 1178-E | Archaeology | https://codeforces.com/problemset/problem/1178/E | [
"brute force",
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4510
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1178-D | codeforces | 1178-D | Prime Graph | https://codeforces.com/problemset/problem/1178/D | [
"constructive algorithms",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7933
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1178-C | codeforces | 1178-C | Tiles | https://codeforces.com/problemset/problem/1178/C | [
"combinatorics",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13270
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1178-B | codeforces | 1178-B | WOW Factor | https://codeforces.com/problemset/problem/1178/B | [
"dp",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 22024
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1178-A | codeforces | 1178-A | Prime Minister | https://codeforces.com/problemset/problem/1178/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 11299
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1177-B | codeforces | 1177-B | Digits Sequence (Hard Edition) | https://codeforces.com/problemset/problem/1177/B | [
"binary search",
"divide and conquer",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3002
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1177-A | codeforces | 1177-A | Digits Sequence (Easy Edition) | https://codeforces.com/problemset/problem/1177/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 6791
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1176-F | codeforces | 1176-F | Destroy it! | https://codeforces.com/problemset/problem/1176/F | [
"dp",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2326
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1176-E | codeforces | 1176-E | Cover it! | https://codeforces.com/problemset/problem/1176/E | [
"dfs and similar",
"dsu",
"graphs",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 13693
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1176-D | codeforces | 1176-D | Recover it! | https://codeforces.com/problemset/problem/1176/D | [
"dfs and similar",
"graphs",
"greedy",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5843
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1176-C | codeforces | 1176-C | Lose it! | https://codeforces.com/problemset/problem/1176/C | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15128
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1176-B | codeforces | 1176-B | Merge it! | https://codeforces.com/problemset/problem/1176/B | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 18371
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1176-A | codeforces | 1176-A | Divide it! | https://codeforces.com/problemset/problem/1176/A | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25047
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1175-G | codeforces | 1175-G | Yet Another Partiton Problem | https://codeforces.com/problemset/problem/1175/G | [
"data structures",
"divide and conquer",
"dp",
"geometry",
"two pointers"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 714
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1175-F | codeforces | 1175-F | The Number of Subpermutations | https://codeforces.com/problemset/problem/1175/F | [
"brute force",
"data structures",
"divide and conquer",
"hashing",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2696
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1175-E | codeforces | 1175-E | Minimal Segment Cover | https://codeforces.com/problemset/problem/1175/E | [
"data structures",
"dfs and similar",
"divide and conquer",
"dp",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4573
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1175-D | codeforces | 1175-D | Array Splitting | https://codeforces.com/problemset/problem/1175/D | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7089
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1175-C | codeforces | 1175-C | Electrification | https://codeforces.com/problemset/problem/1175/C | [
"binary search",
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7278
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1175-B | codeforces | 1175-B | Catch Overflow! | https://codeforces.com/problemset/problem/1175/B | [
"data structures",
"expression parsing",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12497
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1175-A | codeforces | 1175-A | From Hero to Zero | https://codeforces.com/problemset/problem/1175/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 19822
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1174-F | codeforces | 1174-F | Ehab and the Big Finale | https://codeforces.com/problemset/problem/1174/F | [
"constructive algorithms",
"divide and conquer",
"graphs",
"implementation",
"interactive",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1974
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1174-E | codeforces | 1174-E | Ehab and the Expected GCD Problem | https://codeforces.com/problemset/problem/1174/E | [
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1784
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1174-D | codeforces | 1174-D | Ehab and the Expected XOR Problem | https://codeforces.com/problemset/problem/1174/D | [
"bitmasks",
"constructive algorithms"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5052
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1174-C | codeforces | 1174-C | Ehab and a Special Coloring Problem | https://codeforces.com/problemset/problem/1174/C | [
"constructive algorithms",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12807
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1174-B | codeforces | 1174-B | Ehab Is an Odd Person | https://codeforces.com/problemset/problem/1174/B | [
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 16888
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1174-A | codeforces | 1174-A | Ehab Fails to Be Thanos | https://codeforces.com/problemset/problem/1174/A | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19256
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1173-B | codeforces | 1173-B | Nauuo and Chess | https://codeforces.com/problemset/problem/1173/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 9448
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1173-A | codeforces | 1173-A | Nauuo and Votes | https://codeforces.com/problemset/problem/1173/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17283
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1172-F | codeforces | 1172-F | Nauuo and Bug | https://codeforces.com/problemset/problem/1172/F | [
"data structures"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 594
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1172-E | codeforces | 1172-E | Nauuo and ODT | https://codeforces.com/problemset/problem/1172/E | [
"data structures"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 361
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1172-D | codeforces | 1172-D | Nauuo and Portals | https://codeforces.com/problemset/problem/1172/D | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 702
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1172-C2 | codeforces | 1172-C2 | Nauuo and Pictures (hard version) | https://codeforces.com/problemset/problem/1172/C2 | [
"dp",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 999
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1172-C1 | codeforces | 1172-C1 | Nauuo and Pictures (easy version) | https://codeforces.com/problemset/problem/1172/C1 | [
"dp",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1231
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1172-B | codeforces | 1172-B | Nauuo and Circle | https://codeforces.com/problemset/problem/1172/B | [
"combinatorics",
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4423
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1172-A | codeforces | 1172-A | Nauuo and Cards | https://codeforces.com/problemset/problem/1172/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5184
} | 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.