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: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": 2908
} | 2026-08-17T01:43:56.191071+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": 2286
} | 2026-08-17T01:43:56.191071+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": 3957
} | 2026-08-17T01:43:56.191071+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": 7917
} | 2026-08-17T01:43:56.191071+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": 10709
} | 2026-08-17T01:43:56.191071+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": 114603
} | 2026-08-17T01:43:56.191071+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": 787
} | 2026-08-17T01:43:56.191071+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": 1149
} | 2026-08-17T01:43:56.191071+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": 2048
} | 2026-08-17T01:43:56.191071+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": 516
} | 2026-08-17T01:43:56.191071+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": 778
} | 2026-08-17T01:43:56.191071+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": 937
} | 2026-08-17T01:43:56.191071+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": 3368
} | 2026-08-17T01:43:56.191071+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": 209
} | 2026-08-17T01:43:56.191071+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": 799
} | 2026-08-17T01:43:56.191071+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": 1308
} | 2026-08-17T01:43:56.191071+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": 3089
} | 2026-08-17T01:43:56.191071+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": 3058
} | 2026-08-17T01:43:56.191071+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": 10288
} | 2026-08-17T01:43:56.191071+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": 13517
} | 2026-08-17T01:43:56.191071+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": 23324
} | 2026-08-17T01:43:56.191071+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": 12961
} | 2026-08-17T01:43:56.191071+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": 10780
} | 2026-08-17T01:43:56.191071+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": 9782
} | 2026-08-17T01:43:56.191071+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": 448
} | 2026-08-17T01:43:56.191071+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": 617
} | 2026-08-17T01:43:56.191071+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": 1029
} | 2026-08-17T01:43:56.191071+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": 2561
} | 2026-08-17T01:43:56.191071+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": 13124
} | 2026-08-17T01:43:56.191071+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": 4916
} | 2026-08-17T01:43:56.191071+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": 5277
} | 2026-08-17T01:43:56.191071+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": 6914
} | 2026-08-17T01:43:56.191071+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": 10031
} | 2026-08-17T01:43:56.191071+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": 10998
} | 2026-08-17T01:43:56.191071+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": 433
} | 2026-08-17T01:43:56.191071+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": 559
} | 2026-08-17T01:43:56.191071+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": 2536
} | 2026-08-17T01:43:56.191071+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": 6503
} | 2026-08-17T01:43:56.191071+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": 6316
} | 2026-08-17T01:43:56.191071+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": 26793
} | 2026-08-17T01:43:56.191071+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": 12965
} | 2026-08-17T01:43:56.191071+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-08-17T01:43:56.191071+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-08-17T01:43:56.191071+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": 1401
} | 2026-08-17T01:43:56.191071+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": 453
} | 2026-08-17T01:43:56.191071+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": 170
} | 2026-08-17T01:43:56.191071+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": 291
} | 2026-08-17T01:43:56.191071+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-08-17T01:43:56.191071+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-08-17T01:43:56.191071+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": 282
} | 2026-08-17T01:43:56.191071+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": 2128
} | 2026-08-17T01:43:56.191071+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": 4407
} | 2026-08-17T01:43:56.191071+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": 331
} | 2026-08-17T01:43:56.191071+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-08-17T01:43:56.191071+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": 396
} | 2026-08-17T01:43:56.191071+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": 607
} | 2026-08-17T01:43:56.191071+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": 814
} | 2026-08-17T01:43:56.191071+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": 1020
} | 2026-08-17T01:43:56.191071+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": 1298
} | 2026-08-17T01:43:56.191071+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": 4810
} | 2026-08-17T01:43:56.191071+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": 227
} | 2026-08-17T01:43:56.191071+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": 864
} | 2026-08-17T01:43:56.191071+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": 1496
} | 2026-08-17T01:43:56.191071+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": 3502
} | 2026-08-17T01:43:56.191071+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": 5034
} | 2026-08-17T01:43:56.191071+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": 92
} | 2026-08-17T01:43:56.191071+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": 684
} | 2026-08-17T01:43:56.191071+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": 1690
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:771-C | codeforces | 771-C | Bear and Tree Jumps | https://codeforces.com/problemset/problem/771/C | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3642
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:771-B | codeforces | 771-B | Bear and Different Names | https://codeforces.com/problemset/problem/771/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7261
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:771-A | codeforces | 771-A | Bear and Friendship Condition | https://codeforces.com/problemset/problem/771/A | [
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 18140
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:770-D | codeforces | 770-D | Draw Brackets! | https://codeforces.com/problemset/problem/770/D | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 1637
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:770-C | codeforces | 770-C | Online Courses In BSU | https://codeforces.com/problemset/problem/770/C | [
"*special",
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3001
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:770-B | codeforces | 770-B | Maximize Sum of Digits | https://codeforces.com/problemset/problem/770/B | [
"*special",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 3086
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:770-A | codeforces | 770-A | New Password | https://codeforces.com/problemset/problem/770/A | [
"*special",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21991
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:769-D | codeforces | 769-D | k-Interesting Pairs Of Integers | https://codeforces.com/problemset/problem/769/D | [
"*special",
"bitmasks",
"brute force",
"meet-in-the-middle"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2582
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:769-C | codeforces | 769-C | Cycle In Maze | https://codeforces.com/problemset/problem/769/C | [
"*special",
"dfs and similar",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3183
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:769-B | codeforces | 769-B | News About Credit | https://codeforces.com/problemset/problem/769/B | [
"*special",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 3464
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:769-A | codeforces | 769-A | Year of University Entrance | https://codeforces.com/problemset/problem/769/A | [
"*special",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 6503
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:768-G | codeforces | 768-G | The Winds of Winter | https://codeforces.com/problemset/problem/768/G | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 572
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:768-F | codeforces | 768-F | Barrels and boxes | https://codeforces.com/problemset/problem/768/F | [
"brute force",
"combinatorics",
"math",
"number theory",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1157
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:768-E | codeforces | 768-E | Game of Stones | https://codeforces.com/problemset/problem/768/E | [
"bitmasks",
"dp",
"games"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3699
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:768-D | codeforces | 768-D | Jon and Orbs | https://codeforces.com/problemset/problem/768/D | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3566
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:768-C | codeforces | 768-C | Jon Snow and his Favourite Number | https://codeforces.com/problemset/problem/768/C | [
"brute force",
"dp",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4231
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:768-B | codeforces | 768-B | Code For 1 | https://codeforces.com/problemset/problem/768/B | [
"constructive algorithms",
"dfs and similar",
"divide and conquer"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7149
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:768-A | codeforces | 768-A | Oath of the Night's Watch | https://codeforces.com/problemset/problem/768/A | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 31264
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:767-E | codeforces | 767-E | Change-free | https://codeforces.com/problemset/problem/767/E | [
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1153
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:767-D | codeforces | 767-D | Cartons of milk | https://codeforces.com/problemset/problem/767/D | [
"binary search",
"data structures",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2449
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:767-C | codeforces | 767-C | Garland | https://codeforces.com/problemset/problem/767/C | [
"dfs and similar",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4715
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:767-B | codeforces | 767-B | The Queue | https://codeforces.com/problemset/problem/767/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2276
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:767-A | codeforces | 767-A | Snacktower | https://codeforces.com/problemset/problem/767/A | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 23017
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:766-E | codeforces | 766-E | Mahmoud and a xor trip | https://codeforces.com/problemset/problem/766/E | [
"bitmasks",
"constructive algorithms",
"data structures",
"dfs and similar",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3620
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:766-D | codeforces | 766-D | Mahmoud and a Dictionary | https://codeforces.com/problemset/problem/766/D | [
"data structures",
"dfs and similar",
"dp",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4032
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:766-C | codeforces | 766-C | Mahmoud and a Message | https://codeforces.com/problemset/problem/766/C | [
"brute force",
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4969
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:766-B | codeforces | 766-B | Mahmoud and a Triangle | https://codeforces.com/problemset/problem/766/B | [
"constructive algorithms",
"geometry",
"greedy",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 39020
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:766-A | codeforces | 766-A | Mahmoud and Longest Uncommon Subsequence | https://codeforces.com/problemset/problem/766/A | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 35208
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:765-G | codeforces | 765-G | Math, math everywhere | https://codeforces.com/problemset/problem/765/G | [
"brute force",
"dp",
"math",
"meet-in-the-middle",
"number theory"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 119
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:765-F | codeforces | 765-F | Souvenirs | https://codeforces.com/problemset/problem/765/F | [
"data structures"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 2785
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:765-E | codeforces | 765-E | Tree Folding | https://codeforces.com/problemset/problem/765/E | [
"dfs and similar",
"dp",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1361
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:765-D | codeforces | 765-D | Artsem and Saunders | https://codeforces.com/problemset/problem/765/D | [
"constructive algorithms",
"dsu",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2605
} | 2026-08-17T01:43:56.191071+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.