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:1178-C | codeforces | 1178-C | Tiles | https://codeforces.com/problemset/problem/1178/C | [
"combinatorics",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13520
} | 2026-08-17T01:43:56.191071+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": 23170
} | 2026-08-17T01:43:56.191071+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": 11331
} | 2026-08-17T01:43:56.191071+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": 3124
} | 2026-08-17T01:43:56.191071+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": 6899
} | 2026-08-17T01:43:56.191071+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": 2369
} | 2026-08-17T01:43:56.191071+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": 14085
} | 2026-08-17T01:43:56.191071+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": 5884
} | 2026-08-17T01:43:56.191071+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": 15232
} | 2026-08-17T01:43:56.191071+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": 18457
} | 2026-08-17T01:43:56.191071+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": 25374
} | 2026-08-17T01:43:56.191071+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": 914
} | 2026-08-17T01:43:56.191071+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": 2920
} | 2026-08-17T01:43:56.191071+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": 4792
} | 2026-08-17T01:43:56.191071+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": 7157
} | 2026-08-17T01:43:56.191071+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": 7306
} | 2026-08-17T01:43:56.191071+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": 12818
} | 2026-08-17T01:43:56.191071+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": 20138
} | 2026-08-17T01:43:56.191071+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": 2068
} | 2026-08-17T01:43:56.191071+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": 1850
} | 2026-08-17T01:43:56.191071+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": 5126
} | 2026-08-17T01:43:56.191071+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": 12862
} | 2026-08-17T01:43:56.191071+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": 16990
} | 2026-08-17T01:43:56.191071+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": 19439
} | 2026-08-17T01:43:56.191071+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": 9480
} | 2026-08-17T01:43:56.191071+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": 17379
} | 2026-08-17T01:43:56.191071+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": 914
} | 2026-08-17T01:43:56.191071+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": 380
} | 2026-08-17T01:43:56.191071+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": 740
} | 2026-08-17T01:43:56.191071+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": 1059
} | 2026-08-17T01:43:56.191071+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": 1261
} | 2026-08-17T01:43:56.191071+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": 4460
} | 2026-08-17T01:43:56.191071+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": 5292
} | 2026-08-17T01:43:56.191071+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": 47
} | 2026-08-17T01:43:56.191071+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": 57
} | 2026-08-17T01:43:56.191071+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": 85
} | 2026-08-17T01:43:56.191071+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": 136
} | 2026-08-17T01:43:56.191071+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": 275
} | 2026-08-17T01:43:56.191071+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": 532
} | 2026-08-17T01:43:56.191071+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": 836
} | 2026-08-17T01:43:56.191071+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": 1151
} | 2026-08-17T01:43:56.191071+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": 1565
} | 2026-08-17T01:43:56.191071+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": 10828
} | 2026-08-17T01:43:56.191071+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": 12785
} | 2026-08-17T01:43:56.191071+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": 450
} | 2026-08-17T01:43:56.191071+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": 576
} | 2026-08-17T01:43:56.191071+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": 2782
} | 2026-08-17T01:43:56.191071+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": 3828
} | 2026-08-17T01:43:56.191071+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": 7765
} | 2026-08-17T01:43:56.191071+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": 223
} | 2026-08-17T01:43:56.191071+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": 1926
} | 2026-08-17T01:43:56.191071+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": 2990
} | 2026-08-17T01:43:56.191071+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": 7405
} | 2026-08-17T01:43:56.191071+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": 27796
} | 2026-08-17T01:43:56.191071+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": 17467
} | 2026-08-17T01:43:56.191071+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": 20811
} | 2026-08-17T01:43:56.191071+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": 852
} | 2026-08-17T01:43:56.191071+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": 3041
} | 2026-08-17T01:43:56.191071+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": 2313
} | 2026-08-17T01:43:56.191071+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": 11260
} | 2026-08-17T01:43:56.191071+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": 11984
} | 2026-08-17T01:43:56.191071+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": 15184
} | 2026-08-17T01:43:56.191071+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": 2519
} | 2026-08-17T01:43:56.191071+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": 2198
} | 2026-08-17T01:43:56.191071+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": 10339
} | 2026-08-17T01:43:56.191071+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": 20319
} | 2026-08-17T01:43:56.191071+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": 14565
} | 2026-08-17T01:43:56.191071+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": 24855
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1165-A | codeforces | 1165-A | Remainder | https://codeforces.com/problemset/problem/1165/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 14790
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1163-F | codeforces | 1163-F | Indecisive Taxi Fee | https://codeforces.com/problemset/problem/1163/F | [
"data structures",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1532
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1163-E | codeforces | 1163-E | Magical Permutation | https://codeforces.com/problemset/problem/1163/E | [
"bitmasks",
"brute force",
"constructive algorithms",
"data structures",
"graphs",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1053
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1163-D | codeforces | 1163-D | Mysterious Code | https://codeforces.com/problemset/problem/1163/D | [
"dp",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1672
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1163-C2 | codeforces | 1163-C2 | Power Transmission (Hard Edition) | https://codeforces.com/problemset/problem/1163/C2 | [
"data structures",
"geometry",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4017
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1163-C1 | codeforces | 1163-C1 | Power Transmission (Easy Edition) | https://codeforces.com/problemset/problem/1163/C1 | [
"brute force",
"geometry"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3628
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1163-B2 | codeforces | 1163-B2 | Cat Party (Hard Edition) | https://codeforces.com/problemset/problem/1163/B2 | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7706
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1163-B1 | codeforces | 1163-B1 | Cat Party (Easy Edition) | https://codeforces.com/problemset/problem/1163/B1 | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7384
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1163-A | codeforces | 1163-A | Eating Soup | https://codeforces.com/problemset/problem/1163/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 14025
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1162-B | codeforces | 1162-B | Double Matrix | https://codeforces.com/problemset/problem/1162/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 6123
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1162-A | codeforces | 1162-A | Zoning Restrictions Again | https://codeforces.com/problemset/problem/1162/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 8794
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1160-A2 | codeforces | 1160-A2 | Collaboration | https://codeforces.com/problemset/problem/1160/A2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 0
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1159-B | codeforces | 1159-B | Expansion coefficient of the array | https://codeforces.com/problemset/problem/1159/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 7881
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1159-A | codeforces | 1159-A | A pile of stones | https://codeforces.com/problemset/problem/1159/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 13479
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1158-F | codeforces | 1158-F | Density of subarrays | https://codeforces.com/problemset/problem/1158/F | [
"dp",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 653
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1158-E | codeforces | 1158-E | Strange device | https://codeforces.com/problemset/problem/1158/E | [
"binary search",
"interactive",
"math",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 232
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1158-D | codeforces | 1158-D | Winding polygonal line | https://codeforces.com/problemset/problem/1158/D | [
"constructive algorithms",
"geometry",
"greedy",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1024
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1158-C | codeforces | 1158-C | Permutation recovery | https://codeforces.com/problemset/problem/1158/C | [
"constructive algorithms",
"data structures",
"dfs and similar",
"graphs",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2322
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1158-B | codeforces | 1158-B | The minimal unique substring | https://codeforces.com/problemset/problem/1158/B | [
"constructive algorithms",
"math",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2406
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1158-A | codeforces | 1158-A | The Party and Sweets | https://codeforces.com/problemset/problem/1158/A | [
"binary search",
"constructive algorithms",
"greedy",
"implementation",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8553
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1157-G | codeforces | 1157-G | Inverse of Rows and Columns | https://codeforces.com/problemset/problem/1157/G | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1131
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1157-F | codeforces | 1157-F | Maximum Balanced Circle | https://codeforces.com/problemset/problem/1157/F | [
"constructive algorithms",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2945
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1157-E | codeforces | 1157-E | Minimum Array | https://codeforces.com/problemset/problem/1157/E | [
"binary search",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9363
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1157-D | codeforces | 1157-D | N Problems During K Days | https://codeforces.com/problemset/problem/1157/D | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4032
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1157-C2 | codeforces | 1157-C2 | Increasing Subsequence (hard version) | https://codeforces.com/problemset/problem/1157/C2 | [
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9268
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1157-C1 | codeforces | 1157-C1 | Increasing Subsequence (easy version) | https://codeforces.com/problemset/problem/1157/C1 | [
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13667
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1157-B | codeforces | 1157-B | Long Number | https://codeforces.com/problemset/problem/1157/B | [
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15978
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1157-A | codeforces | 1157-A | Reachable Numbers | https://codeforces.com/problemset/problem/1157/A | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16690
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1156-G | codeforces | 1156-G | Optimizer | https://codeforces.com/problemset/problem/1156/G | [
"graphs",
"greedy",
"hashing",
"implementation"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 190
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1156-F | codeforces | 1156-F | Card Bag | https://codeforces.com/problemset/problem/1156/F | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1772
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1156-E | codeforces | 1156-E | Special Segments of Permutation | https://codeforces.com/problemset/problem/1156/E | [
"data structures",
"divide and conquer",
"dsu",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4227
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1156-D | codeforces | 1156-D | 0-1-Tree | https://codeforces.com/problemset/problem/1156/D | [
"dfs and similar",
"divide and conquer",
"dp",
"dsu",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4908
} | 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.