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: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": 2777
} | 2026-11-02T05:37:07.883505+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": 2319
} | 2026-11-02T05:37:07.883505+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": 5659
} | 2026-11-02T05:37:07.883505+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": 22568
} | 2026-11-02T05:37:07.883505+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": 15408
} | 2026-11-02T05:37:07.883505+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": 19963
} | 2026-11-02T05:37:07.883505+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": 27433
} | 2026-11-02T05:37:07.883505+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": 456
} | 2026-11-02T05:37:07.883505+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": 3541
} | 2026-11-02T05:37:07.883505+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": 1063
} | 2026-11-02T05:37:07.883505+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": 4622
} | 2026-11-02T05:37:07.883505+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": 12141
} | 2026-11-02T05:37:07.883505+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": 36664
} | 2026-11-02T05:37:07.883505+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": 549
} | 2026-11-02T05:37:07.883505+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": 678
} | 2026-11-02T05:37:07.883505+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": 2999
} | 2026-11-02T05:37:07.883505+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": 3505
} | 2026-11-02T05:37:07.883505+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": 6820
} | 2026-11-02T05:37:07.883505+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": 15213
} | 2026-11-02T05:37:07.883505+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": 10195
} | 2026-11-02T05:37:07.883505+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": 28020
} | 2026-11-02T05:37:07.883505+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": 208
} | 2026-11-02T05:37:07.883505+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": 1096
} | 2026-11-02T05:37:07.883505+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": 2728
} | 2026-11-02T05:37:07.883505+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": 4721
} | 2026-11-02T05:37:07.883505+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": 12350
} | 2026-11-02T05:37:07.883505+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": 300
} | 2026-11-02T05:37:07.883505+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": 683
} | 2026-11-02T05:37:07.883505+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": 1126
} | 2026-11-02T05:37:07.883505+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": 2379
} | 2026-11-02T05:37:07.883505+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": 4768
} | 2026-11-02T05:37:07.883505+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": 8044
} | 2026-11-02T05:37:07.883505+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": 13689
} | 2026-11-02T05:37:07.883505+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": 24139
} | 2026-11-02T05:37:07.883505+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": 11392
} | 2026-11-02T05:37:07.883505+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": 3207
} | 2026-11-02T05:37:07.883505+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": 6970
} | 2026-11-02T05:37:07.883505+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": 2481
} | 2026-11-02T05:37:07.883505+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": 14617
} | 2026-11-02T05:37:07.883505+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": 6112
} | 2026-11-02T05:37:07.883505+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": 15374
} | 2026-11-02T05:37:07.883505+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": 18552
} | 2026-11-02T05:37:07.883505+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": 25540
} | 2026-11-02T05:37:07.883505+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": 957
} | 2026-11-02T05:37:07.883505+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": 3066
} | 2026-11-02T05:37:07.883505+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": 4920
} | 2026-11-02T05:37:07.883505+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": 7268
} | 2026-11-02T05:37:07.883505+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": 7483
} | 2026-11-02T05:37:07.883505+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": 13058
} | 2026-11-02T05:37:07.883505+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": 20378
} | 2026-11-02T05:37:07.883505+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": 2158
} | 2026-11-02T05:37:07.883505+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": 1892
} | 2026-11-02T05:37:07.883505+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": 5156
} | 2026-11-02T05:37:07.883505+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": 13041
} | 2026-11-02T05:37:07.883505+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": 17114
} | 2026-11-02T05:37:07.883505+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": 19708
} | 2026-11-02T05:37:07.883505+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": 9505
} | 2026-11-02T05:37:07.883505+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": 17601
} | 2026-11-02T05:37:07.883505+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": 927
} | 2026-11-02T05:37:07.883505+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": 385
} | 2026-11-02T05:37:07.883505+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": 753
} | 2026-11-02T05:37:07.883505+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": 1073
} | 2026-11-02T05:37:07.883505+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": 1272
} | 2026-11-02T05:37:07.883505+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": 4489
} | 2026-11-02T05:37:07.883505+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": 5310
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1170-I | codeforces | 1170-I | Good Subsets | https://codeforces.com/problemset/problem/1170/I | [
"*special",
"dp"
] | null | null | stdin_stdout | null | {
"solved_count": 48
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1170-H | codeforces | 1170-H | Longest Saw | https://codeforces.com/problemset/problem/1170/H | [
"*special",
"constructive algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": 58
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1170-G | codeforces | 1170-G | Graph Decomposition | https://codeforces.com/problemset/problem/1170/G | [
"*special",
"graphs"
] | null | null | stdin_stdout | null | {
"solved_count": 86
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1170-F | codeforces | 1170-F | Wheels | https://codeforces.com/problemset/problem/1170/F | [
"*special",
"binary search",
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 137
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1170-E | codeforces | 1170-E | Sliding Doors | https://codeforces.com/problemset/problem/1170/E | [
"*special",
"binary search"
] | null | null | stdin_stdout | null | {
"solved_count": 276
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1170-D | codeforces | 1170-D | Decoding of Integer Sequences | https://codeforces.com/problemset/problem/1170/D | [
"*special",
"data structures",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 541
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1170-C | codeforces | 1170-C | Minus and Minus Give Plus | https://codeforces.com/problemset/problem/1170/C | [
"*special",
"implementation",
"strings"
] | null | null | stdin_stdout | null | {
"solved_count": 837
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1170-B | codeforces | 1170-B | Bad Days | https://codeforces.com/problemset/problem/1170/B | [
"*special",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 1153
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1170-A | codeforces | 1170-A | Three Integers Again | https://codeforces.com/problemset/problem/1170/A | [
"*special",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 1571
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1169-B | codeforces | 1169-B | Pairs | https://codeforces.com/problemset/problem/1169/B | [
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10931
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1169-A | codeforces | 1169-A | Circle Metro | https://codeforces.com/problemset/problem/1169/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 12847
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1168-E | codeforces | 1168-E | Xor Permutations | https://codeforces.com/problemset/problem/1168/E | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 462
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1168-D | codeforces | 1168-D | Anagram Paths | https://codeforces.com/problemset/problem/1168/D | [
"dp",
"implementation",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 598
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1168-C | codeforces | 1168-C | And Reachability | https://codeforces.com/problemset/problem/1168/C | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2800
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1168-B | codeforces | 1168-B | Good Triple | https://codeforces.com/problemset/problem/1168/B | [
"brute force",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3841
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1168-A | codeforces | 1168-A | Increasing by Modulo | https://codeforces.com/problemset/problem/1168/A | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7839
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1167-G | codeforces | 1167-G | Low Budget Inception | https://codeforces.com/problemset/problem/1167/G | [
"brute force",
"geometry"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 225
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1167-F | codeforces | 1167-F | Scalar Queries | https://codeforces.com/problemset/problem/1167/F | [
"combinatorics",
"data structures",
"math",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2065
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1167-E | codeforces | 1167-E | Range Deleting | https://codeforces.com/problemset/problem/1167/E | [
"binary search",
"combinatorics",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3100
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1167-D | codeforces | 1167-D | Bicolored RBS | https://codeforces.com/problemset/problem/1167/D | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7437
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1167-C | codeforces | 1167-C | News Distribution | https://codeforces.com/problemset/problem/1167/C | [
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 28843
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1167-B | codeforces | 1167-B | Lost Numbers | https://codeforces.com/problemset/problem/1167/B | [
"brute force",
"divide and conquer",
"interactive",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 18083
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1167-A | codeforces | 1167-A | Telephone Number | https://codeforces.com/problemset/problem/1167/A | [
"brute force",
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20916
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1166-F | codeforces | 1166-F | Vicky's Delivery Service | https://codeforces.com/problemset/problem/1166/F | [
"data structures",
"dsu",
"graphs",
"hashing"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 869
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1166-E | codeforces | 1166-E | The LCMs Must be Large | https://codeforces.com/problemset/problem/1166/E | [
"bitmasks",
"brute force",
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3053
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1166-D | codeforces | 1166-D | Cute Sequences | https://codeforces.com/problemset/problem/1166/D | [
"binary search",
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2322
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1166-C | codeforces | 1166-C | A Tale of Two Lands | https://codeforces.com/problemset/problem/1166/C | [
"binary search",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11383
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1166-B | codeforces | 1166-B | All the Vowels Please | https://codeforces.com/problemset/problem/1166/B | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12029
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1166-A | codeforces | 1166-A | Silent Classroom | https://codeforces.com/problemset/problem/1166/A | [
"combinatorics",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 15370
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1165-F2 | codeforces | 1165-F2 | Microtransactions (hard version) | https://codeforces.com/problemset/problem/1165/F2 | [
"binary search",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2556
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1165-F1 | codeforces | 1165-F1 | Microtransactions (easy version) | https://codeforces.com/problemset/problem/1165/F1 | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2225
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1165-E | codeforces | 1165-E | Two Arrays and Sum of Functions | https://codeforces.com/problemset/problem/1165/E | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10674
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1165-D | codeforces | 1165-D | Almost All Divisors | https://codeforces.com/problemset/problem/1165/D | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 20680
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1165-C | codeforces | 1165-C | Good String | https://codeforces.com/problemset/problem/1165/C | [
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14666
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1165-B | codeforces | 1165-B | Polycarp Training | https://codeforces.com/problemset/problem/1165/B | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 25238
} | 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.