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:870-A | codeforces | 870-A | Search for Pretty Integers | https://codeforces.com/problemset/problem/870/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 10821
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:869-E | codeforces | 869-E | The Untended Antiquity | https://codeforces.com/problemset/problem/869/E | [
"data structures",
"hashing"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2073
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:869-D | codeforces | 869-D | The Overdosing Ubiquity | https://codeforces.com/problemset/problem/869/D | [
"brute force",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 279
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:869-C | codeforces | 869-C | The Intriguing Obsession | https://codeforces.com/problemset/problem/869/C | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5222
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:869-B | codeforces | 869-B | The Eternal Immortality | https://codeforces.com/problemset/problem/869/B | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15635
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:869-A | codeforces | 869-A | The Artful Expedient | https://codeforces.com/problemset/problem/869/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 9812
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:868-G | codeforces | 868-G | El Toll Caves | https://codeforces.com/problemset/problem/868/G | [
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 172
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:868-F | codeforces | 868-F | Yet Another Minimization Problem | https://codeforces.com/problemset/problem/868/F | [
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 5156
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:868-E | codeforces | 868-E | Policeman and a Tree | https://codeforces.com/problemset/problem/868/E | [
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 565
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:868-D | codeforces | 868-D | Huge Strings | https://codeforces.com/problemset/problem/868/D | [
"bitmasks",
"brute force",
"dp",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1005
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:868-C | codeforces | 868-C | Qualification Rounds | https://codeforces.com/problemset/problem/868/C | [
"bitmasks",
"brute force",
"constructive algorithms",
"dp"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5036
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:868-B | codeforces | 868-B | Race Against Time | https://codeforces.com/problemset/problem/868/B | [
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 3920
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:868-A | codeforces | 868-A | Bark to Unlock | https://codeforces.com/problemset/problem/868/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 9986
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:867-A | codeforces | 867-A | Between the Offices | https://codeforces.com/problemset/problem/867/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20697
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:865-G | codeforces | 865-G | Flowers and Chocolate | https://codeforces.com/problemset/problem/865/G | [
"combinatorics",
"math",
"matrices"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 165
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:865-F | codeforces | 865-F | Egg Roulette | https://codeforces.com/problemset/problem/865/F | [
"bitmasks",
"brute force",
"divide and conquer",
"math",
"meet-in-the-middle"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 81
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:865-E | codeforces | 865-E | Hex Dyslexia | https://codeforces.com/problemset/problem/865/E | [
"bitmasks",
"brute force",
"dp",
"graphs"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 157
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:865-D | codeforces | 865-D | Buy Low Sell High | https://codeforces.com/problemset/problem/865/D | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 8117
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:865-C | codeforces | 865-C | Gotta Go Fast | https://codeforces.com/problemset/problem/865/C | [
"binary search",
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 943
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:865-B | codeforces | 865-B | Ordering Pizza | https://codeforces.com/problemset/problem/865/B | [
"binary search",
"sortings",
"ternary search"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1941
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:865-A | codeforces | 865-A | Save the problem! | https://codeforces.com/problemset/problem/865/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 4431
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:864-F | codeforces | 864-F | Cities Excursions | https://codeforces.com/problemset/problem/864/F | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 675
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:864-E | codeforces | 864-E | Fire | https://codeforces.com/problemset/problem/864/E | [
"dp",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4711
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:864-D | codeforces | 864-D | Make a Permutation! | https://codeforces.com/problemset/problem/864/D | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6375
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:864-C | codeforces | 864-C | Bus | https://codeforces.com/problemset/problem/864/C | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6237
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:864-B | codeforces | 864-B | Polycarp and Letters | https://codeforces.com/problemset/problem/864/B | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 10010
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:864-A | codeforces | 864-A | Fair Game | https://codeforces.com/problemset/problem/864/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 12302
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:863-G | codeforces | 863-G | Graphic Settings | https://codeforces.com/problemset/problem/863/G | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 64
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:863-F | codeforces | 863-F | Almost Permutation | https://codeforces.com/problemset/problem/863/F | [
"flows"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1534
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:863-E | codeforces | 863-E | Turn Off The TV | https://codeforces.com/problemset/problem/863/E | [
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4101
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:863-D | codeforces | 863-D | Yet Another Array Queries Problem | https://codeforces.com/problemset/problem/863/D | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3827
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:863-C | codeforces | 863-C | 1-2-3 | https://codeforces.com/problemset/problem/863/C | [
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2718
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:863-B | codeforces | 863-B | Kayaking | https://codeforces.com/problemset/problem/863/B | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11093
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:863-A | codeforces | 863-A | Quasi-palindrome | https://codeforces.com/problemset/problem/863/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 10981
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:862-F | codeforces | 862-F | Mahmoud and Ehab and the final stage | https://codeforces.com/problemset/problem/862/F | [
"data structures",
"strings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 251
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:862-E | codeforces | 862-E | Mahmoud and Ehab and the function | https://codeforces.com/problemset/problem/862/E | [
"binary search",
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2203
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:862-D | codeforces | 862-D | Mahmoud and Ehab and the binary string | https://codeforces.com/problemset/problem/862/D | [
"binary search",
"divide and conquer",
"interactive"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2049
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:862-C | codeforces | 862-C | Mahmoud and Ehab and the xor | https://codeforces.com/problemset/problem/862/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4513
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:862-B | codeforces | 862-B | Mahmoud and Ehab and the bipartiteness | https://codeforces.com/problemset/problem/862/B | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 26074
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:862-A | codeforces | 862-A | Mahmoud and Ehab and the MEX | https://codeforces.com/problemset/problem/862/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 10738
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:860-E | codeforces | 860-E | Arkady and a Nobody-men | https://codeforces.com/problemset/problem/860/E | [
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 513
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:859-G | codeforces | 859-G | Circle of Numbers | https://codeforces.com/problemset/problem/859/G | [
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 191
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:859-F | codeforces | 859-F | Ordering T-Shirts | https://codeforces.com/problemset/problem/859/F | [
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 228
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:859-E | codeforces | 859-E | Desk Disorder | https://codeforces.com/problemset/problem/859/E | [
"combinatorics",
"dfs and similar",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2120
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:859-D | codeforces | 859-D | Third Month Insanity | https://codeforces.com/problemset/problem/859/D | [
"dp",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1132
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:859-C | codeforces | 859-C | Pie Rules | https://codeforces.com/problemset/problem/859/C | [
"dp",
"games"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6151
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:859-B | codeforces | 859-B | Lazy Security Guard | https://codeforces.com/problemset/problem/859/B | [
"brute force",
"geometry",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 7947
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:859-A | codeforces | 859-A | Declined Finalists | https://codeforces.com/problemset/problem/859/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 8658
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:858-F | codeforces | 858-F | Wizard's Tour | https://codeforces.com/problemset/problem/858/F | [
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2034
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:858-E | codeforces | 858-E | Tests Renumeration | https://codeforces.com/problemset/problem/858/E | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 536
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:858-D | codeforces | 858-D | Polycarp's phone book | https://codeforces.com/problemset/problem/858/D | [
"data structures",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4196
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:858-C | codeforces | 858-C | Did you mean... | https://codeforces.com/problemset/problem/858/C | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5899
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:858-B | codeforces | 858-B | Which floor? | https://codeforces.com/problemset/problem/858/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4112
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:858-A | codeforces | 858-A | k-rounding | https://codeforces.com/problemset/problem/858/A | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 9078
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:856-F | codeforces | 856-F | To Play or not to Play | https://codeforces.com/problemset/problem/856/F | [
"greedy"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 122
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:856-E | codeforces | 856-E | Satellites | https://codeforces.com/problemset/problem/856/E | [] | null | null | stdin_stdout | 3,100 | {
"solved_count": 82
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:856-D | codeforces | 856-D | Masha and Cactus | https://codeforces.com/problemset/problem/856/D | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 593
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:856-C | codeforces | 856-C | Eleventh Birthday | https://codeforces.com/problemset/problem/856/C | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 733
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:856-B | codeforces | 856-B | Similar Words | https://codeforces.com/problemset/problem/856/B | [
"dp",
"hashing",
"strings",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 621
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:856-A | codeforces | 856-A | Set Theory | https://codeforces.com/problemset/problem/856/A | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 1624
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:855-G | codeforces | 855-G | Harry Vs Voldemort | https://codeforces.com/problemset/problem/855/G | [
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 284
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:855-F | codeforces | 855-F | Nagini | https://codeforces.com/problemset/problem/855/F | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 582
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:855-E | codeforces | 855-E | Salazar Slytherin's Locket | https://codeforces.com/problemset/problem/855/E | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2154
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:855-D | codeforces | 855-D | Rowena Ravenclaw's Diadem | https://codeforces.com/problemset/problem/855/D | [
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 584
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:855-C | codeforces | 855-C | Helga Hufflepuff's Cup | https://codeforces.com/problemset/problem/855/C | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2418
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:855-B | codeforces | 855-B | Marvolo Gaunt's Ring | https://codeforces.com/problemset/problem/855/B | [
"brute force",
"data structures",
"dp"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9964
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:855-A | codeforces | 855-A | Tom Riddle's Diary | https://codeforces.com/problemset/problem/855/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27608
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:854-B | codeforces | 854-B | Maxim Buys an Apartment | https://codeforces.com/problemset/problem/854/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8591
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:854-A | codeforces | 854-A | Fraction | https://codeforces.com/problemset/problem/854/A | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14560
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:853-E | codeforces | 853-E | Lada Malina | https://codeforces.com/problemset/problem/853/E | [
"data structures",
"geometry"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 81
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:853-D | codeforces | 853-D | Michael and Charging Stations | https://codeforces.com/problemset/problem/853/D | [
"binary search",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 716
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:853-C | codeforces | 853-C | Boredom | https://codeforces.com/problemset/problem/853/C | [
"data structures"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1586
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:853-B | codeforces | 853-B | Jury Meeting | https://codeforces.com/problemset/problem/853/B | [
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2758
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:853-A | codeforces | 853-A | Planning | https://codeforces.com/problemset/problem/853/A | [
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6197
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:852-I | codeforces | 852-I | Dating | https://codeforces.com/problemset/problem/852/I | [
"brute force",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 749
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:852-H | codeforces | 852-H | Bob and stages | https://codeforces.com/problemset/problem/852/H | [
"dp",
"geometry"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 174
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:852-G | codeforces | 852-G | Bathroom terminal | https://codeforces.com/problemset/problem/852/G | [
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1462
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:852-F | codeforces | 852-F | Product transformation | https://codeforces.com/problemset/problem/852/F | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 658
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:852-E | codeforces | 852-E | Casinos and travel | https://codeforces.com/problemset/problem/852/E | [
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1213
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:852-D | codeforces | 852-D | Exploration plan | https://codeforces.com/problemset/problem/852/D | [
"binary search",
"flows",
"graph matchings",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1259
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:852-C | codeforces | 852-C | Property | https://codeforces.com/problemset/problem/852/C | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 663
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:852-B | codeforces | 852-B | Neural Network country | https://codeforces.com/problemset/problem/852/B | [
"dp",
"matrices"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1737
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:852-A | codeforces | 852-A | Digits | https://codeforces.com/problemset/problem/852/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 429
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:851-B | codeforces | 851-B | Arpa and an exam about geometry | https://codeforces.com/problemset/problem/851/B | [
"geometry",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 5898
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:851-A | codeforces | 851-A | Arpa and a research in Mexican wave | https://codeforces.com/problemset/problem/851/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 10323
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:850-F | codeforces | 850-F | Rainbow Balls | https://codeforces.com/problemset/problem/850/F | [
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 766
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:850-E | codeforces | 850-E | Random Elections | https://codeforces.com/problemset/problem/850/E | [
"bitmasks",
"brute force",
"divide and conquer",
"fft",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 535
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:850-D | codeforces | 850-D | Tournament Construction | https://codeforces.com/problemset/problem/850/D | [
"constructive algorithms",
"dp",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 469
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:850-C | codeforces | 850-C | Arpa and a game with Mojtaba | https://codeforces.com/problemset/problem/850/C | [
"bitmasks",
"dp",
"games"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1928
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:850-B | codeforces | 850-B | Arpa and a list of numbers | https://codeforces.com/problemset/problem/850/B | [
"implementation",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2136
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:850-A | codeforces | 850-A | Five Dimensional Points | https://codeforces.com/problemset/problem/850/A | [
"brute force",
"geometry",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3399
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:849-B | codeforces | 849-B | Tell Your World | https://codeforces.com/problemset/problem/849/B | [
"brute force",
"geometry"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4006
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:849-A | codeforces | 849-A | Odds and Ends | https://codeforces.com/problemset/problem/849/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 9775
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:848-E | codeforces | 848-E | Days of Floral Colours | https://codeforces.com/problemset/problem/848/E | [
"combinatorics",
"divide and conquer",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 242
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:848-D | codeforces | 848-D | Shake It! | https://codeforces.com/problemset/problem/848/D | [
"combinatorics",
"dp",
"flows",
"graphs"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 456
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:848-C | codeforces | 848-C | Goodbye Souvenir | https://codeforces.com/problemset/problem/848/C | [
"data structures",
"divide and conquer"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1583
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:848-B | codeforces | 848-B | Rooter's Song | https://codeforces.com/problemset/problem/848/B | [
"constructive algorithms",
"data structures",
"geometry",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2009
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:848-A | codeforces | 848-A | From Y to Y | https://codeforces.com/problemset/problem/848/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5350
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:847-M | codeforces | 847-M | Weather Tomorrow | https://codeforces.com/problemset/problem/847/M | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 6831
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:847-L | codeforces | 847-L | Berland SU Computer Network | https://codeforces.com/problemset/problem/847/L | [
"constructive algorithms",
"dfs and similar",
"graphs",
"hashing",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 349
} | 2026-06-01T05:00:40.145500+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.