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:1165-A | codeforces | 1165-A | Remainder | https://codeforces.com/problemset/problem/1165/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 14856
} | 2026-11-02T05:37:07.883505+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": 1570
} | 2026-11-02T05:37:07.883505+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": 1072
} | 2026-11-02T05:37:07.883505+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": 1707
} | 2026-11-02T05:37:07.883505+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": 4035
} | 2026-11-02T05:37:07.883505+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": 3640
} | 2026-11-02T05:37:07.883505+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": 7899
} | 2026-11-02T05:37:07.883505+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": 7422
} | 2026-11-02T05:37:07.883505+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": 14106
} | 2026-11-02T05:37:07.883505+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": 6138
} | 2026-11-02T05:37:07.883505+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": 8819
} | 2026-11-02T05:37:07.883505+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-11-02T05:37:07.883505+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": 7903
} | 2026-11-02T05:37:07.883505+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": 13522
} | 2026-11-02T05:37:07.883505+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": 674
} | 2026-11-02T05:37:07.883505+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": 234
} | 2026-11-02T05:37:07.883505+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": 1045
} | 2026-11-02T05:37:07.883505+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": 2337
} | 2026-11-02T05:37:07.883505+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": 2427
} | 2026-11-02T05:37:07.883505+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": 8707
} | 2026-11-02T05:37:07.883505+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": 1144
} | 2026-11-02T05:37:07.883505+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": 2974
} | 2026-11-02T05:37:07.883505+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": 9443
} | 2026-11-02T05:37:07.883505+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": 4052
} | 2026-11-02T05:37:07.883505+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": 9575
} | 2026-11-02T05:37:07.883505+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": 13795
} | 2026-11-02T05:37:07.883505+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": 16072
} | 2026-11-02T05:37:07.883505+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": 16767
} | 2026-11-02T05:37:07.883505+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": 192
} | 2026-11-02T05:37:07.883505+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": 1896
} | 2026-11-02T05:37:07.883505+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": 4426
} | 2026-11-02T05:37:07.883505+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": 5198
} | 2026-11-02T05:37:07.883505+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": 6960
} | 2026-11-02T05:37:07.883505+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": 6631
} | 2026-11-02T05:37:07.883505+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": 8953
} | 2026-11-02T05:37:07.883505+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": 589
} | 2026-11-02T05:37:07.883505+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": 1729
} | 2026-11-02T05:37:07.883505+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": 8279
} | 2026-11-02T05:37:07.883505+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": 9885
} | 2026-11-02T05:37:07.883505+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": 12864
} | 2026-11-02T05:37:07.883505+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": 29478
} | 2026-11-02T05:37:07.883505+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": 3475
} | 2026-11-02T05:37:07.883505+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": 3462
} | 2026-11-02T05:37:07.883505+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": 7151
} | 2026-11-02T05:37:07.883505+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": 10717
} | 2026-11-02T05:37:07.883505+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": 11694
} | 2026-11-02T05:37:07.883505+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": 17984
} | 2026-11-02T05:37:07.883505+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": 91945
} | 2026-11-02T05:37:07.883505+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": 1027
} | 2026-11-02T05:37:07.883505+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": 1822
} | 2026-11-02T05:37:07.883505+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": 5852
} | 2026-11-02T05:37:07.883505+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": 7976
} | 2026-11-02T05:37:07.883505+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": 9446
} | 2026-11-02T05:37:07.883505+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": 12267
} | 2026-11-02T05:37:07.883505+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": 1176
} | 2026-11-02T05:37:07.883505+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": 925
} | 2026-11-02T05:37:07.883505+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": 1181
} | 2026-11-02T05:37:07.883505+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": 2624
} | 2026-11-02T05:37:07.883505+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": 7350
} | 2026-11-02T05:37:07.883505+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": 9777
} | 2026-11-02T05:37:07.883505+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": 16369
} | 2026-11-02T05:37:07.883505+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": 1725
} | 2026-11-02T05:37:07.883505+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": 3938
} | 2026-11-02T05:37:07.883505+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": 9315
} | 2026-11-02T05:37:07.883505+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": 5684
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1151-B | codeforces | 1151-B | Dima and a Bad XOR | https://codeforces.com/problemset/problem/1151/B | [
"bitmasks",
"brute force",
"constructive algorithms",
"dp"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13309
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1151-A | codeforces | 1151-A | Maxim and Biology | https://codeforces.com/problemset/problem/1151/A | [
"brute force",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 12091
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1150-B | codeforces | 1150-B | Tiling Challenge | https://codeforces.com/problemset/problem/1150/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 11978
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1150-A | codeforces | 1150-A | Stock Arbitraging | https://codeforces.com/problemset/problem/1150/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12717
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1149-E | codeforces | 1149-E | Election Promises | https://codeforces.com/problemset/problem/1149/E | [
"games",
"graphs"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 924
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1149-D | codeforces | 1149-D | Abandoning Roads | https://codeforces.com/problemset/problem/1149/D | [
"brute force",
"dp",
"graphs",
"greedy"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1217
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1149-C | codeforces | 1149-C | Tree Generator™ | https://codeforces.com/problemset/problem/1149/C | [
"data structures",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1790
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1149-B | codeforces | 1149-B | Three Religions | https://codeforces.com/problemset/problem/1149/B | [
"dp",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2095
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1149-A | codeforces | 1149-A | Prefix Sum Primes | https://codeforces.com/problemset/problem/1149/A | [
"constructive algorithms",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18535
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1148-H | codeforces | 1148-H | Holy Diver | https://codeforces.com/problemset/problem/1148/H | [
"data structures"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 415
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1148-G | codeforces | 1148-G | Gold Experience | https://codeforces.com/problemset/problem/1148/G | [
"constructive algorithms",
"graphs",
"math",
"number theory",
"probabilities"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 667
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1148-F | codeforces | 1148-F | Foo Fighters | https://codeforces.com/problemset/problem/1148/F | [
"bitmasks",
"constructive algorithms"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1203
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1148-E | codeforces | 1148-E | Earth Wind and Fire | https://codeforces.com/problemset/problem/1148/E | [
"constructive algorithms",
"greedy",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1881
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1148-D | codeforces | 1148-D | Dirty Deeds Done Dirt Cheap | https://codeforces.com/problemset/problem/1148/D | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5334
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1148-C | codeforces | 1148-C | Crazy Diamond | https://codeforces.com/problemset/problem/1148/C | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5714
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1148-B | codeforces | 1148-B | Born This Way | https://codeforces.com/problemset/problem/1148/B | [
"binary search",
"brute force",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8096
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1148-A | codeforces | 1148-A | Another One Bites The Dust | https://codeforces.com/problemset/problem/1148/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15651
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1147-F | codeforces | 1147-F | Zigzag Game | https://codeforces.com/problemset/problem/1147/F | [
"games",
"interactive"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 408
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1147-E | codeforces | 1147-E | Rainbow Coins | https://codeforces.com/problemset/problem/1147/E | [
"interactive"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 524
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1147-D | codeforces | 1147-D | Palindrome XOR | https://codeforces.com/problemset/problem/1147/D | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 887
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1147-C | codeforces | 1147-C | Thanos Nim | https://codeforces.com/problemset/problem/1147/C | [
"games"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3797
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1147-B | codeforces | 1147-B | Chladni Figure | https://codeforces.com/problemset/problem/1147/B | [
"brute force",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3136
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1147-A | codeforces | 1147-A | Hide and Seek | https://codeforces.com/problemset/problem/1147/A | [
"graphs"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5667
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1146-H | codeforces | 1146-H | Satanic Panic | https://codeforces.com/problemset/problem/1146/H | [
"dp",
"geometry"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 811
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1146-G | codeforces | 1146-G | Zoning Restrictions | https://codeforces.com/problemset/problem/1146/G | [
"dp",
"flows",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1152
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1146-F | codeforces | 1146-F | Leaf Partition | https://codeforces.com/problemset/problem/1146/F | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1433
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1146-E | codeforces | 1146-E | Hot is Cold | https://codeforces.com/problemset/problem/1146/E | [
"bitmasks",
"data structures",
"divide and conquer",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1139
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1146-D | codeforces | 1146-D | Frog Jumping | https://codeforces.com/problemset/problem/1146/D | [
"dfs and similar",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1238
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1146-C | codeforces | 1146-C | Tree Diameter | https://codeforces.com/problemset/problem/1146/C | [
"bitmasks",
"graphs",
"interactive"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4351
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1146-B | codeforces | 1146-B | Hate "A" | https://codeforces.com/problemset/problem/1146/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 9491
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1146-A | codeforces | 1146-A | Love "A" | https://codeforces.com/problemset/problem/1146/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23947
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1145-G | codeforces | 1145-G | AI Takeover | https://codeforces.com/problemset/problem/1145/G | [
"*special",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 199
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1145-F | codeforces | 1145-F | Neat Words | https://codeforces.com/problemset/problem/1145/F | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 552
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1145-E | codeforces | 1145-E | Fourier Doodles | https://codeforces.com/problemset/problem/1145/E | [] | null | null | stdin_stdout | null | {
"solved_count": 452
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1145-D | codeforces | 1145-D | Pigeon d'Or | https://codeforces.com/problemset/problem/1145/D | [
"*special",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 1203
} | 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.