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: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-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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": 1564
} | 2026-06-01T05:00:40.145500+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": 10760
} | 2026-06-01T05:00:40.145500+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": 12708
} | 2026-06-01T05:00:40.145500+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": 432
} | 2026-06-01T05:00:40.145500+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": 441
} | 2026-06-01T05:00:40.145500+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": 2738
} | 2026-06-01T05:00:40.145500+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": 3814
} | 2026-06-01T05:00:40.145500+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": 7631
} | 2026-06-01T05:00:40.145500+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": 169
} | 2026-06-01T05:00:40.145500+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": 1899
} | 2026-06-01T05:00:40.145500+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": 2933
} | 2026-06-01T05:00:40.145500+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": 7376
} | 2026-06-01T05:00:40.145500+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": 26395
} | 2026-06-01T05:00:40.145500+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": 16679
} | 2026-06-01T05:00:40.145500+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": 20321
} | 2026-06-01T05:00:40.145500+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": 815
} | 2026-06-01T05:00:40.145500+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": 3012
} | 2026-06-01T05:00:40.145500+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": 2286
} | 2026-06-01T05:00:40.145500+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": 11085
} | 2026-06-01T05:00:40.145500+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": 11931
} | 2026-06-01T05:00:40.145500+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": 15101
} | 2026-06-01T05:00:40.145500+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": 2467
} | 2026-06-01T05:00:40.145500+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": 2163
} | 2026-06-01T05:00:40.145500+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": 10069
} | 2026-06-01T05:00:40.145500+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": 19841
} | 2026-06-01T05:00:40.145500+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": 14432
} | 2026-06-01T05:00:40.145500+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": 24456
} | 2026-06-01T05:00:40.145500+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": 14705
} | 2026-06-01T05:00:40.145500+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": 1309
} | 2026-06-01T05:00:40.145500+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": 1018
} | 2026-06-01T05:00:40.145500+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": 1564
} | 2026-06-01T05:00:40.145500+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": 3965
} | 2026-06-01T05:00:40.145500+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": 3589
} | 2026-06-01T05:00:40.145500+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": 7661
} | 2026-06-01T05:00:40.145500+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": 7338
} | 2026-06-01T05:00:40.145500+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": 13925
} | 2026-06-01T05:00:40.145500+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": 6064
} | 2026-06-01T05:00:40.145500+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": 8772
} | 2026-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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": 7858
} | 2026-06-01T05:00:40.145500+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": 13419
} | 2026-06-01T05:00:40.145500+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": 504
} | 2026-06-01T05:00:40.145500+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": 230
} | 2026-06-01T05:00:40.145500+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": 927
} | 2026-06-01T05:00:40.145500+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": 2127
} | 2026-06-01T05:00:40.145500+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": 2388
} | 2026-06-01T05:00:40.145500+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": 8378
} | 2026-06-01T05:00:40.145500+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": 1010
} | 2026-06-01T05:00:40.145500+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": 2889
} | 2026-06-01T05:00:40.145500+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": 9206
} | 2026-06-01T05:00:40.145500+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": 4004
} | 2026-06-01T05:00:40.145500+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": 9122
} | 2026-06-01T05:00:40.145500+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": 13483
} | 2026-06-01T05:00:40.145500+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": 15669
} | 2026-06-01T05:00:40.145500+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": 16585
} | 2026-06-01T05:00:40.145500+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": 156
} | 2026-06-01T05:00:40.145500+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": 1722
} | 2026-06-01T05:00:40.145500+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": 4073
} | 2026-06-01T05:00:40.145500+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": 4687
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1156-C | codeforces | 1156-C | Match Points | https://codeforces.com/problemset/problem/1156/C | [
"binary search",
"greedy",
"sortings",
"ternary search",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6705
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1156-B | codeforces | 1156-B | Ugly Pairs | https://codeforces.com/problemset/problem/1156/B | [
"dfs and similar",
"greedy",
"implementation",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6586
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1156-A | codeforces | 1156-A | Inscribed Figures | https://codeforces.com/problemset/problem/1156/A | [
"geometry"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8718
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1155-F | codeforces | 1155-F | Delivery Oligopoly | https://codeforces.com/problemset/problem/1155/F | [
"brute force",
"dp",
"graphs"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 517
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1155-E | codeforces | 1155-E | Guess the Root | https://codeforces.com/problemset/problem/1155/E | [
"brute force",
"interactive",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1604
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1155-D | codeforces | 1155-D | Beautiful Array | https://codeforces.com/problemset/problem/1155/D | [
"brute force",
"data structures",
"divide and conquer",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7763
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1155-C | codeforces | 1155-C | Alarm Clocks Everywhere | https://codeforces.com/problemset/problem/1155/C | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9795
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1155-B | codeforces | 1155-B | Game with Telephone Numbers | https://codeforces.com/problemset/problem/1155/B | [
"games",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12562
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1155-A | codeforces | 1155-A | Reverse a Substring | https://codeforces.com/problemset/problem/1155/A | [
"implementation",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 26517
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1154-G | codeforces | 1154-G | Minimum Possible LCM | https://codeforces.com/problemset/problem/1154/G | [
"brute force",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3294
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1154-F | codeforces | 1154-F | Shovels Shop | https://codeforces.com/problemset/problem/1154/F | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3353
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1154-E | codeforces | 1154-E | Two Teams | https://codeforces.com/problemset/problem/1154/E | [
"data structures",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6969
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1154-D | codeforces | 1154-D | Walking Robot | https://codeforces.com/problemset/problem/1154/D | [
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10561
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1154-C | codeforces | 1154-C | Gourmet Cat | https://codeforces.com/problemset/problem/1154/C | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11551
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1154-B | codeforces | 1154-B | Make Them Equal | https://codeforces.com/problemset/problem/1154/B | [
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17708
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1154-A | codeforces | 1154-A | Restoring Three Numbers | https://codeforces.com/problemset/problem/1154/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 87660
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1153-F | codeforces | 1153-F | Serval and Bonus Problem | https://codeforces.com/problemset/problem/1153/F | [
"combinatorics",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 932
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1153-E | codeforces | 1153-E | Serval and Snake | https://codeforces.com/problemset/problem/1153/E | [
"binary search",
"brute force",
"interactive"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1760
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1153-D | codeforces | 1153-D | Serval and Rooted Tree | https://codeforces.com/problemset/problem/1153/D | [
"binary search",
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5569
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1153-C | codeforces | 1153-C | Serval and Parenthesis Sequence | https://codeforces.com/problemset/problem/1153/C | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7806
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1153-B | codeforces | 1153-B | Serval and Toy Bricks | https://codeforces.com/problemset/problem/1153/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9410
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1153-A | codeforces | 1153-A | Serval and Bus | https://codeforces.com/problemset/problem/1153/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 12126
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1152-F2 | codeforces | 1152-F2 | Neko Rules the Catniverse (Large Version) | https://codeforces.com/problemset/problem/1152/F2 | [
"bitmasks",
"dp",
"matrices"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 925
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1152-F1 | codeforces | 1152-F1 | Neko Rules the Catniverse (Small Version) | https://codeforces.com/problemset/problem/1152/F1 | [
"bitmasks",
"dp",
"matrices"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 756
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1152-E | codeforces | 1152-E | Neko and Flashback | https://codeforces.com/problemset/problem/1152/E | [
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1124
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1152-D | codeforces | 1152-D | Neko and Aki's Prank | https://codeforces.com/problemset/problem/1152/D | [
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2582
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1152-C | codeforces | 1152-C | Neko does Maths | https://codeforces.com/problemset/problem/1152/C | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7099
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1152-B | codeforces | 1152-B | Neko Performs Cat Furrier Transform | https://codeforces.com/problemset/problem/1152/B | [
"bitmasks",
"constructive algorithms",
"dfs and similar",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9354
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1152-A | codeforces | 1152-A | Neko Finds Grapes | https://codeforces.com/problemset/problem/1152/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16233
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1151-F | codeforces | 1151-F | Sonya and Informatics | https://codeforces.com/problemset/problem/1151/F | [
"combinatorics",
"dp",
"matrices",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1464
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1151-E | codeforces | 1151-E | Number of Components | https://codeforces.com/problemset/problem/1151/E | [
"combinatorics",
"data structures",
"dp",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3789
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1151-D | codeforces | 1151-D | Stas and the Queue at the Buffet | https://codeforces.com/problemset/problem/1151/D | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9109
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1151-C | codeforces | 1151-C | Problem for Nazar | https://codeforces.com/problemset/problem/1151/C | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5611
} | 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.