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:166-D | codeforces | 166-D | Shoe Store | https://codeforces.com/problemset/problem/166/D | [
"dp",
"graph matchings",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 423
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:166-C | codeforces | 166-C | Median | https://codeforces.com/problemset/problem/166/C | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7708
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:166-B | codeforces | 166-B | Polygons | https://codeforces.com/problemset/problem/166/B | [
"geometry",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3432
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:166-A | codeforces | 166-A | Rank List | https://codeforces.com/problemset/problem/166/A | [
"binary search",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21784
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:165-E | codeforces | 165-E | Compatible Numbers | https://codeforces.com/problemset/problem/165/E | [
"bitmasks",
"brute force",
"dfs and similar",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 10534
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:165-D | codeforces | 165-D | Beard Graph | https://codeforces.com/problemset/problem/165/D | [
"data structures",
"dsu",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2015
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:165-C | codeforces | 165-C | Another Problem on Strings | https://codeforces.com/problemset/problem/165/C | [
"binary search",
"brute force",
"dp",
"math",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14251
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:165-B | codeforces | 165-B | Burning Midnight Oil | https://codeforces.com/problemset/problem/165/B | [
"binary search",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 25304
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:165-A | codeforces | 165-A | Supercentral Point | https://codeforces.com/problemset/problem/165/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 26853
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:164-E | codeforces | 164-E | Polycarpus and Tasks | https://codeforces.com/problemset/problem/164/E | [] | null | null | stdin_stdout | 3,100 | {
"solved_count": 137
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:164-D | codeforces | 164-D | Minimum Diameter | https://codeforces.com/problemset/problem/164/D | [
"binary search",
"brute force"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 400
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:164-C | codeforces | 164-C | Machine Programming | https://codeforces.com/problemset/problem/164/C | [
"flows",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1063
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:164-B | codeforces | 164-B | Ancient Berland Hieroglyphs | https://codeforces.com/problemset/problem/164/B | [
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 560
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:164-A | codeforces | 164-A | Variable, or There and Back Again | https://codeforces.com/problemset/problem/164/A | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1276
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:163-E | codeforces | 163-E | e-Government | https://codeforces.com/problemset/problem/163/E | [
"data structures",
"dfs and similar",
"dp",
"strings",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 2422
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:163-D | codeforces | 163-D | Large Refrigerator | https://codeforces.com/problemset/problem/163/D | [
"brute force"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 595
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:163-C | codeforces | 163-C | Conveyor | https://codeforces.com/problemset/problem/163/C | [
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 647
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:163-B | codeforces | 163-B | Lemmings | https://codeforces.com/problemset/problem/163/B | [
"binary search"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1216
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:163-A | codeforces | 163-A | Substring and Subsequence | https://codeforces.com/problemset/problem/163/A | [
"dp"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3070
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:162-J | codeforces | 162-J | Brackets | https://codeforces.com/problemset/problem/162/J | [
"*special"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 140
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:162-I | codeforces | 162-I | Truncatable primes | https://codeforces.com/problemset/problem/162/I | [
"*special"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 97
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:162-H | codeforces | 162-H | Alternating case | https://codeforces.com/problemset/problem/162/H | [
"*special"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 227
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:162-G | codeforces | 162-G | Non-decimal sum | https://codeforces.com/problemset/problem/162/G | [
"*special"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 90
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:162-F | codeforces | 162-F | Factorial zeros | https://codeforces.com/problemset/problem/162/F | [
"*special"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 235
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:162-E | codeforces | 162-E | HQ9+ | https://codeforces.com/problemset/problem/162/E | [
"*special"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 187
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:162-D | codeforces | 162-D | Remove digits | https://codeforces.com/problemset/problem/162/D | [
"*special"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 234
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:162-C | codeforces | 162-C | Prime factorization | https://codeforces.com/problemset/problem/162/C | [
"*special"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1443
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:162-B | codeforces | 162-B | Binary notation | https://codeforces.com/problemset/problem/162/B | [
"*special"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 328
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:162-A | codeforces | 162-A | Pentagonal numbers | https://codeforces.com/problemset/problem/162/A | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 850
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:161-E | codeforces | 161-E | Polycarpus the Safecracker | https://codeforces.com/problemset/problem/161/E | [
"brute force",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 545
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:161-D | codeforces | 161-D | Distance in Tree | https://codeforces.com/problemset/problem/161/D | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 21075
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:161-C | codeforces | 161-C | Abracadabra | https://codeforces.com/problemset/problem/161/C | [
"divide and conquer"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 722
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:161-B | codeforces | 161-B | Discounts | https://codeforces.com/problemset/problem/161/B | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2109
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:161-A | codeforces | 161-A | Dress'em in Vests! | https://codeforces.com/problemset/problem/161/A | [
"binary search",
"brute force",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 5656
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:160-E | codeforces | 160-E | Buses and People | https://codeforces.com/problemset/problem/160/E | [
"binary search",
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 785
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:160-D | codeforces | 160-D | Edges in MST | https://codeforces.com/problemset/problem/160/D | [
"dfs and similar",
"dsu",
"graphs",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3710
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:160-C | codeforces | 160-C | Find Pair | https://codeforces.com/problemset/problem/160/C | [
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3798
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:160-B | codeforces | 160-B | Unlucky Ticket | https://codeforces.com/problemset/problem/160/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15952
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:160-A | codeforces | 160-A | Twins | https://codeforces.com/problemset/problem/160/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 154495
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:159-E | codeforces | 159-E | Zebra Tower | https://codeforces.com/problemset/problem/159/E | [
"*special",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1107
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:159-D | codeforces | 159-D | Palindrome pairs | https://codeforces.com/problemset/problem/159/D | [
"*special",
"brute force",
"dp",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4776
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:159-C | codeforces | 159-C | String Manipulation 1.0 | https://codeforces.com/problemset/problem/159/C | [
"*special",
"binary search",
"brute force",
"data structures",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 3260
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:159-B | codeforces | 159-B | Matchmaker | https://codeforces.com/problemset/problem/159/B | [
"*special",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 4253
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:159-A | codeforces | 159-A | Friends or Not | https://codeforces.com/problemset/problem/159/A | [
"*special",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 2685
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:158-E | codeforces | 158-E | Phone Talks | https://codeforces.com/problemset/problem/158/E | [
"*special",
"dp",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1553
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:158-D | codeforces | 158-D | Ice Sculptures | https://codeforces.com/problemset/problem/158/D | [
"*special",
"brute force",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6563
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:158-C | codeforces | 158-C | Cd and pwd commands | https://codeforces.com/problemset/problem/158/C | [
"*special",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10746
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:158-B | codeforces | 158-B | Taxi | https://codeforces.com/problemset/problem/158/B | [
"*special",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 110197
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:158-A | codeforces | 158-A | Next Round | https://codeforces.com/problemset/problem/158/A | [
"*special",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 347096
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:157-B | codeforces | 157-B | Trace | https://codeforces.com/problemset/problem/157/B | [
"geometry",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 14356
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:157-A | codeforces | 157-A | Game Outcome | https://codeforces.com/problemset/problem/157/A | [
"brute force"
] | null | null | stdin_stdout | 800 | {
"solved_count": 8871
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:156-E | codeforces | 156-E | Mrs. Hudson's Pancakes | https://codeforces.com/problemset/problem/156/E | [
"brute force",
"dp"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 248
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:156-D | codeforces | 156-D | Clues | https://codeforces.com/problemset/problem/156/D | [
"combinatorics",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2188
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:156-C | codeforces | 156-C | Cipher | https://codeforces.com/problemset/problem/156/C | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2733
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:156-B | codeforces | 156-B | Suspects | https://codeforces.com/problemset/problem/156/B | [
"constructive algorithms",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2515
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:156-A | codeforces | 156-A | Message | https://codeforces.com/problemset/problem/156/A | [
"brute force"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3292
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:155-B | codeforces | 155-B | Combination | https://codeforces.com/problemset/problem/155/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 11067
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:155-A | codeforces | 155-A | I_love_\%username\% | https://codeforces.com/problemset/problem/155/A | [
"brute force"
] | null | null | stdin_stdout | 800 | {
"solved_count": 98576
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:154-E | codeforces | 154-E | Martian Colony | https://codeforces.com/problemset/problem/154/E | [
"geometry"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 125
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:154-D | codeforces | 154-D | Flatland Fencing | https://codeforces.com/problemset/problem/154/D | [
"games",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 532
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:154-C | codeforces | 154-C | Double Profiles | https://codeforces.com/problemset/problem/154/C | [
"graphs",
"hashing",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3511
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:154-B | codeforces | 154-B | Colliders | https://codeforces.com/problemset/problem/154/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6402
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:154-A | codeforces | 154-A | Hometask | https://codeforces.com/problemset/problem/154/A | [
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4368
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:153-E | codeforces | 153-E | Euclidean Distance | https://codeforces.com/problemset/problem/153/E | [
"*special"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 87
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:153-D | codeforces | 153-D | Date Change | https://codeforces.com/problemset/problem/153/D | [
"*special"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 91
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:153-C | codeforces | 153-C | Caesar Cipher | https://codeforces.com/problemset/problem/153/C | [
"*special"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 418
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:153-B | codeforces | 153-B | Binary notation | https://codeforces.com/problemset/problem/153/B | [
"*special"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 171
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:153-A | codeforces | 153-A | A + B | https://codeforces.com/problemset/problem/153/A | [
"*special"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 962
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:152-E | codeforces | 152-E | Garden | https://codeforces.com/problemset/problem/152/E | [
"bitmasks",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 635
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:152-D | codeforces | 152-D | Frames | https://codeforces.com/problemset/problem/152/D | [
"brute force"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 272
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:152-C | codeforces | 152-C | Pocket Book | https://codeforces.com/problemset/problem/152/C | [
"combinatorics"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11845
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:152-B | codeforces | 152-B | Steps | https://codeforces.com/problemset/problem/152/B | [
"binary search",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 7551
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:152-A | codeforces | 152-A | Marks | https://codeforces.com/problemset/problem/152/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 19052
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:151-B | codeforces | 151-B | Phone Numbers | https://codeforces.com/problemset/problem/151/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 7004
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:151-A | codeforces | 151-A | Soft Drinking | https://codeforces.com/problemset/problem/151/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 100541
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:150-E | codeforces | 150-E | Freezing with Style | https://codeforces.com/problemset/problem/150/E | [
"binary search",
"data structures",
"divide and conquer",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1174
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:150-D | codeforces | 150-D | Mission Impassable | https://codeforces.com/problemset/problem/150/D | [
"dp",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 798
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:150-C | codeforces | 150-C | Smart Cheater | https://codeforces.com/problemset/problem/150/C | [
"data structures",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 790
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:150-B | codeforces | 150-B | Quantity of Strings | https://codeforces.com/problemset/problem/150/B | [
"combinatorics",
"dfs and similar",
"graphs",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5672
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:150-A | codeforces | 150-A | Win or Freeze | https://codeforces.com/problemset/problem/150/A | [
"games",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8841
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:149-E | codeforces | 149-E | Martian Strings | https://codeforces.com/problemset/problem/149/E | [
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2658
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:149-D | codeforces | 149-D | Coloring Brackets | https://codeforces.com/problemset/problem/149/D | [
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4969
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:149-C | codeforces | 149-C | Division into Teams | https://codeforces.com/problemset/problem/149/C | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5840
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:149-B | codeforces | 149-B | Martian Clock | https://codeforces.com/problemset/problem/149/B | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2412
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:149-A | codeforces | 149-A | Business trip | https://codeforces.com/problemset/problem/149/A | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 47837
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:148-E | codeforces | 148-E | Porcelain | https://codeforces.com/problemset/problem/148/E | [
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5142
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:148-D | codeforces | 148-D | Bag of mice | https://codeforces.com/problemset/problem/148/D | [
"dp",
"games",
"math",
"probabilities"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9851
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:148-C | codeforces | 148-C | Terse princess | https://codeforces.com/problemset/problem/148/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3436
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:148-B | codeforces | 148-B | Escape | https://codeforces.com/problemset/problem/148/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6120
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:148-A | codeforces | 148-A | Insomnia cure | https://codeforces.com/problemset/problem/148/A | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 117981
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:147-B | codeforces | 147-B | Smile House | https://codeforces.com/problemset/problem/147/B | [
"binary search",
"graphs",
"matrices"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1031
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:147-A | codeforces | 147-A | Punctuation | https://codeforces.com/problemset/problem/147/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4379
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:146-B | codeforces | 146-B | Lucky Mask | https://codeforces.com/problemset/problem/146/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 5187
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:146-A | codeforces | 146-A | Lucky Ticket | https://codeforces.com/problemset/problem/146/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17477
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:145-E | codeforces | 145-E | Lucky Queries | https://codeforces.com/problemset/problem/145/E | [
"data structures"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 4340
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:145-D | codeforces | 145-D | Lucky Pair | https://codeforces.com/problemset/problem/145/D | [
"combinatorics",
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 322
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:145-C | codeforces | 145-C | Lucky Subsequence | https://codeforces.com/problemset/problem/145/C | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2248
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:145-B | codeforces | 145-B | Lucky Number 2 | https://codeforces.com/problemset/problem/145/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2477
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:145-A | codeforces | 145-A | Lucky Conversion | https://codeforces.com/problemset/problem/145/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8085
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:144-E | codeforces | 144-E | Competition | https://codeforces.com/problemset/problem/144/E | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 723
} | 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.