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:794-E | codeforces | 794-E | Choosing Carrot | https://codeforces.com/problemset/problem/794/E | [
"games",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1248
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:794-D | codeforces | 794-D | Labelling Cities | https://codeforces.com/problemset/problem/794/D | [
"dfs and similar",
"graphs",
"hashing"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 963
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:794-C | codeforces | 794-C | Naming Company | https://codeforces.com/problemset/problem/794/C | [
"games",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3366
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:794-B | codeforces | 794-B | Cutting Carrot | https://codeforces.com/problemset/problem/794/B | [
"geometry",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 7552
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:794-A | codeforces | 794-A | Bank Robbery | https://codeforces.com/problemset/problem/794/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 8098
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:793-G | codeforces | 793-G | Oleg and chess | https://codeforces.com/problemset/problem/793/G | [
"data structures",
"divide and conquer",
"flows",
"graph matchings"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 580
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:793-F | codeforces | 793-F | Julia the snail | https://codeforces.com/problemset/problem/793/F | [
"data structures",
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 911
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:793-E | codeforces | 793-E | Problem of offices | https://codeforces.com/problemset/problem/793/E | [
"constructive algorithms",
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 338
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:793-D | codeforces | 793-D | Presents in Bankopolis | https://codeforces.com/problemset/problem/793/D | [
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1760
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:793-C | codeforces | 793-C | Mice problem | https://codeforces.com/problemset/problem/793/C | [
"geometry",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1410
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:793-B | codeforces | 793-B | Igor and his way to work | https://codeforces.com/problemset/problem/793/B | [
"dfs and similar",
"graphs",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4976
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:793-A | codeforces | 793-A | Oleg and shares | https://codeforces.com/problemset/problem/793/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 8303
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:792-F | codeforces | 792-F | Mages and Monsters | https://codeforces.com/problemset/problem/792/F | [
"data structures",
"geometry"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 433
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:792-E | codeforces | 792-E | Colored Balls | https://codeforces.com/problemset/problem/792/E | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1317
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:792-D | codeforces | 792-D | Paths in a Complete Binary Tree | https://codeforces.com/problemset/problem/792/D | [
"bitmasks",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3510
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:792-C | codeforces | 792-C | Divide by Three | https://codeforces.com/problemset/problem/792/C | [
"dp",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5158
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:792-B | codeforces | 792-B | Counting-out Rhyme | https://codeforces.com/problemset/problem/792/B | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6616
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:792-A | codeforces | 792-A | New Bus Route | https://codeforces.com/problemset/problem/792/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 9957
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:791-A | codeforces | 791-A | Bear and Big Brother | https://codeforces.com/problemset/problem/791/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 277971
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:789-B | codeforces | 789-B | Masha and geometric depression | https://codeforces.com/problemset/problem/789/B | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5178
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:789-A | codeforces | 789-A | Anastasia and pebbles | https://codeforces.com/problemset/problem/789/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 9979
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:788-E | codeforces | 788-E | New task | https://codeforces.com/problemset/problem/788/E | [
"data structures"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 451
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:788-D | codeforces | 788-D | Finding lines | https://codeforces.com/problemset/problem/788/D | [
"constructive algorithms",
"divide and conquer",
"interactive"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 425
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:788-C | codeforces | 788-C | The Great Mixing | https://codeforces.com/problemset/problem/788/C | [
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2725
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:788-B | codeforces | 788-B | Weird journey | https://codeforces.com/problemset/problem/788/B | [
"combinatorics",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2997
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:788-A | codeforces | 788-A | Functions again | https://codeforces.com/problemset/problem/788/A | [
"dp",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10384
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:787-B | codeforces | 787-B | Not Afraid | https://codeforces.com/problemset/problem/787/B | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 5846
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:787-A | codeforces | 787-A | The Monster | https://codeforces.com/problemset/problem/787/A | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12341
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:786-E | codeforces | 786-E | ALT | https://codeforces.com/problemset/problem/786/E | [
"data structures",
"flows",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 923
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:786-D | codeforces | 786-D | Rap God | https://codeforces.com/problemset/problem/786/D | [
"data structures",
"dfs and similar",
"hashing",
"strings",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 199
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:786-C | codeforces | 786-C | Till I Collapse | https://codeforces.com/problemset/problem/786/C | [
"data structures",
"divide and conquer"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 4076
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:786-B | codeforces | 786-B | Legacy | https://codeforces.com/problemset/problem/786/B | [
"data structures",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 8789
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:786-A | codeforces | 786-A | Berzerk | https://codeforces.com/problemset/problem/786/A | [
"dfs and similar",
"dp",
"games"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2937
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:785-E | codeforces | 785-E | Anton and Permutation | https://codeforces.com/problemset/problem/785/E | [
"brute force",
"data structures"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2329
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:785-D | codeforces | 785-D | Anton and School - 2 | https://codeforces.com/problemset/problem/785/D | [
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 4119
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:785-C | codeforces | 785-C | Anton and Fairy Tale | https://codeforces.com/problemset/problem/785/C | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7972
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:785-B | codeforces | 785-B | Anton and Classes | https://codeforces.com/problemset/problem/785/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10757
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:785-A | codeforces | 785-A | Anton and Polyhedrons | https://codeforces.com/problemset/problem/785/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 117034
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:784-G | codeforces | 784-G | BF Calculator | https://codeforces.com/problemset/problem/784/G | [
"*special"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 793
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:784-F | codeforces | 784-F | Crunching Numbers Just for You | https://codeforces.com/problemset/problem/784/F | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1150
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:784-E | codeforces | 784-E | Twisted Circuit | https://codeforces.com/problemset/problem/784/E | [
"*special",
"brute force",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2065
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:784-D | codeforces | 784-D | Touchy-Feely Palindromes | https://codeforces.com/problemset/problem/784/D | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 519
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:784-C | codeforces | 784-C | INTERCALC | https://codeforces.com/problemset/problem/784/C | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 782
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:784-B | codeforces | 784-B | Kids' Riddle | https://codeforces.com/problemset/problem/784/B | [
"*special"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 942
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:784-A | codeforces | 784-A | Numbers Joke | https://codeforces.com/problemset/problem/784/A | [
"*special"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3385
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:780-H | codeforces | 780-H | Intranet of Buses | https://codeforces.com/problemset/problem/780/H | [
"binary search",
"geometry",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 211
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:780-G | codeforces | 780-G | Andryusha and Nervous Barriers | https://codeforces.com/problemset/problem/780/G | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 805
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:780-F | codeforces | 780-F | Axel and Marston in Bitland | https://codeforces.com/problemset/problem/780/F | [
"bitmasks",
"dp",
"graphs",
"matrices"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1320
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:780-E | codeforces | 780-E | Underground Lab | https://codeforces.com/problemset/problem/780/E | [
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3156
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:780-D | codeforces | 780-D | Innokenty and a Football League | https://codeforces.com/problemset/problem/780/D | [
"2-sat",
"graphs",
"greedy",
"implementation",
"shortest paths",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3071
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:780-C | codeforces | 780-C | Andryusha and Colored Balloons | https://codeforces.com/problemset/problem/780/C | [
"dfs and similar",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10370
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:780-B | codeforces | 780-B | The Meeting Place Cannot Be Changed | https://codeforces.com/problemset/problem/780/B | [
"binary search"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13988
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:780-A | codeforces | 780-A | Andryusha and Socks | https://codeforces.com/problemset/problem/780/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23603
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:779-C | codeforces | 779-C | Dishonest Sellers | https://codeforces.com/problemset/problem/779/C | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 13049
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:779-B | codeforces | 779-B | Weird Rounding | https://codeforces.com/problemset/problem/779/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10807
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:779-A | codeforces | 779-A | Pupils Redistribution | https://codeforces.com/problemset/problem/779/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 9805
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:778-E | codeforces | 778-E | Selling Numbers | https://codeforces.com/problemset/problem/778/E | [
"dp",
"sortings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 452
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:778-D | codeforces | 778-D | Parquet Re-laying | https://codeforces.com/problemset/problem/778/D | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 621
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:778-C | codeforces | 778-C | Peterson Polyglot | https://codeforces.com/problemset/problem/778/C | [
"brute force",
"dfs and similar",
"dsu",
"hashing",
"strings",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1059
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:778-B | codeforces | 778-B | Bitwise Formula | https://codeforces.com/problemset/problem/778/B | [
"bitmasks",
"brute force",
"dfs and similar",
"expression parsing",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2582
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:778-A | codeforces | 778-A | String Game | https://codeforces.com/problemset/problem/778/A | [
"binary search",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 13309
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:777-E | codeforces | 777-E | Hanoi Factory | https://codeforces.com/problemset/problem/777/E | [
"brute force",
"data structures",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5014
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:777-D | codeforces | 777-D | Cloud of Hashtags | https://codeforces.com/problemset/problem/777/D | [
"binary search",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5307
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:777-C | codeforces | 777-C | Alyona and Spreadsheet | https://codeforces.com/problemset/problem/777/C | [
"binary search",
"data structures",
"dp",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6958
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:777-B | codeforces | 777-B | Game of Credit Cards | https://codeforces.com/problemset/problem/777/B | [
"data structures",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 10075
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:777-A | codeforces | 777-A | Shell Game | https://codeforces.com/problemset/problem/777/A | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 11193
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:776-G | codeforces | 776-G | Sherlock and the Encrypted Data | https://codeforces.com/problemset/problem/776/G | [
"bitmasks",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 438
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:776-F | codeforces | 776-F | Sherlock's bet to Moriarty | https://codeforces.com/problemset/problem/776/F | [
"constructive algorithms",
"data structures",
"divide and conquer",
"geometry",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 574
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:776-E | codeforces | 776-E | The Holmes Children | https://codeforces.com/problemset/problem/776/E | [
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2570
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:776-D | codeforces | 776-D | The Door Problem | https://codeforces.com/problemset/problem/776/D | [
"2-sat",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6675
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:776-C | codeforces | 776-C | Molly's Chemicals | https://codeforces.com/problemset/problem/776/C | [
"binary search",
"brute force",
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6349
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:776-B | codeforces | 776-B | Sherlock and his girlfriend | https://codeforces.com/problemset/problem/776/B | [
"constructive algorithms",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 27472
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:776-A | codeforces | 776-A | A Serial Killer | https://codeforces.com/problemset/problem/776/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 13014
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:775-A | codeforces | 775-A | University Schedule | https://codeforces.com/problemset/problem/775/A | [
"*special"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 0
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:774-L | codeforces | 774-L | Bars | https://codeforces.com/problemset/problem/774/L | [
"*special",
"binary search"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 415
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:774-K | codeforces | 774-K | Stepan and Vowels | https://codeforces.com/problemset/problem/774/K | [
"*special",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 1403
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:774-J | codeforces | 774-J | Stepan's Series | https://codeforces.com/problemset/problem/774/J | [
"*special",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 459
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:774-I | codeforces | 774-I | Composing Of String | https://codeforces.com/problemset/problem/774/I | [
"*special",
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 171
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:774-H | codeforces | 774-H | Repairing Of String | https://codeforces.com/problemset/problem/774/H | [
"*special",
"constructive algorithms"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 292
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:774-G | codeforces | 774-G | Perfectionist Arkadiy | https://codeforces.com/problemset/problem/774/G | [
"*special",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 249
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:774-F | codeforces | 774-F | Pens And Days Of Week | https://codeforces.com/problemset/problem/774/F | [
"*special",
"binary search",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 203
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:774-E | codeforces | 774-E | Big Number and Remainder | https://codeforces.com/problemset/problem/774/E | [
"*special",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 283
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:774-D | codeforces | 774-D | Lie or Truth | https://codeforces.com/problemset/problem/774/D | [
"*special",
"constructive algorithms",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 2138
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:774-C | codeforces | 774-C | Maximum Number | https://codeforces.com/problemset/problem/774/C | [
"*special",
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 4428
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:774-B | codeforces | 774-B | Significant Cups | https://codeforces.com/problemset/problem/774/B | [
"*special",
"binary search",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 332
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:774-A | codeforces | 774-A | Amusement Park | https://codeforces.com/problemset/problem/774/A | [
"*special",
"ternary search"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 401
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:773-F | codeforces | 773-F | Test Data Generation | https://codeforces.com/problemset/problem/773/F | [
"combinatorics",
"divide and conquer",
"dp",
"fft",
"math",
"number theory"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 397
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:773-E | codeforces | 773-E | Blog Post Rating | https://codeforces.com/problemset/problem/773/E | [
"data structures",
"sortings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 613
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:773-D | codeforces | 773-D | Perishable Roads | https://codeforces.com/problemset/problem/773/D | [
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 828
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:773-C | codeforces | 773-C | Prairie Partition | https://codeforces.com/problemset/problem/773/C | [
"binary search",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1029
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:773-B | codeforces | 773-B | Dynamic Problem Scoring | https://codeforces.com/problemset/problem/773/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1304
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:773-A | codeforces | 773-A | Success Rate | https://codeforces.com/problemset/problem/773/A | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4836
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:772-E | codeforces | 772-E | Verifying Kingdom | https://codeforces.com/problemset/problem/772/E | [
"binary search",
"divide and conquer",
"interactive",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 230
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:772-D | codeforces | 772-D | Varying Kibibits | https://codeforces.com/problemset/problem/772/D | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 877
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:772-C | codeforces | 772-C | Vulnerable Kerbals | https://codeforces.com/problemset/problem/772/C | [
"constructive algorithms",
"dp",
"graphs",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1505
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:772-B | codeforces | 772-B | Volatile Kite | https://codeforces.com/problemset/problem/772/B | [
"geometry"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3560
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:772-A | codeforces | 772-A | Voltage Keepsake | https://codeforces.com/problemset/problem/772/A | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5089
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:771-F | codeforces | 771-F | Bear and Isomorphic Points | https://codeforces.com/problemset/problem/771/F | [
"geometry",
"two pointers"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 93
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:771-E | codeforces | 771-E | Bear and Rectangle Strips | https://codeforces.com/problemset/problem/771/E | [
"dp",
"greedy"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 714
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:771-D | codeforces | 771-D | Bear and Company | https://codeforces.com/problemset/problem/771/D | [
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1697
} | 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.