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:802-G1 | codeforces | 802-G1 | Fake News (easy) | https://codeforces.com/problemset/problem/802/G1 | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 8193
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:802-D3 | codeforces | 802-D3 | Marmots (hard) | https://codeforces.com/problemset/problem/802/D3 | [
"math",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 154
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:802-D2 | codeforces | 802-D2 | Marmots (medium) | https://codeforces.com/problemset/problem/802/D2 | [
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 332
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:802-D1 | codeforces | 802-D1 | Marmots (easy) | https://codeforces.com/problemset/problem/802/D1 | [
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 554
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:802-A3 | codeforces | 802-A3 | Heidi and Library (hard) | https://codeforces.com/problemset/problem/802/A3 | [
"flows",
"graphs"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 700
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:802-A2 | codeforces | 802-A2 | Heidi and Library (medium) | https://codeforces.com/problemset/problem/802/A2 | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1345
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:802-A1 | codeforces | 802-A1 | Heidi and Library (easy) | https://codeforces.com/problemset/problem/802/A1 | [
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1603
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:801-B | codeforces | 801-B | Valued Keys | https://codeforces.com/problemset/problem/801/B | [
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 11243
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:801-A | codeforces | 801-A | Vicious Keyboard | https://codeforces.com/problemset/problem/801/A | [
"brute force"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 7680
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:799-G | codeforces | 799-G | Cut the pie | https://codeforces.com/problemset/problem/799/G | [
"binary search",
"data structures",
"geometry"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 123
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:799-F | codeforces | 799-F | Beautiful fountains rows | https://codeforces.com/problemset/problem/799/F | [
"data structures"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 516
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:799-E | codeforces | 799-E | Aquarium decoration | https://codeforces.com/problemset/problem/799/E | [
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1055
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:799-D | codeforces | 799-D | Field expansion | https://codeforces.com/problemset/problem/799/D | [
"brute force",
"dp",
"meet-in-the-middle"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2185
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:799-C | codeforces | 799-C | Fountains | https://codeforces.com/problemset/problem/799/C | [
"binary search",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4061
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:799-B | codeforces | 799-B | T-shirt buying | https://codeforces.com/problemset/problem/799/B | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10195
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:799-A | codeforces | 799-A | Carrot Cakes | https://codeforces.com/problemset/problem/799/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21515
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:798-E | codeforces | 798-E | Mike and code of a permutation | https://codeforces.com/problemset/problem/798/E | [
"constructive algorithms",
"data structures",
"graphs",
"sortings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 551
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:798-D | codeforces | 798-D | Mike and distribution | https://codeforces.com/problemset/problem/798/D | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2169
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:798-C | codeforces | 798-C | Mike and gcd problem | https://codeforces.com/problemset/problem/798/C | [
"dp",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6385
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:798-B | codeforces | 798-B | Mike and strings | https://codeforces.com/problemset/problem/798/B | [
"brute force",
"dp",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9254
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:798-A | codeforces | 798-A | Mike and palindrome | https://codeforces.com/problemset/problem/798/A | [
"brute force",
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 23916
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:797-F | codeforces | 797-F | Mice and Holes | https://codeforces.com/problemset/problem/797/F | [
"data structures",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1473
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:797-E | codeforces | 797-E | Array Queries | https://codeforces.com/problemset/problem/797/E | [
"brute force",
"data structures",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5649
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:797-D | codeforces | 797-D | Broken BST | https://codeforces.com/problemset/problem/797/D | [
"data structures",
"dfs and similar"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2205
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:797-C | codeforces | 797-C | Minimal string | https://codeforces.com/problemset/problem/797/C | [
"data structures",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9886
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:797-B | codeforces | 797-B | Odd sum | https://codeforces.com/problemset/problem/797/B | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11554
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:797-A | codeforces | 797-A | k-Factorization | https://codeforces.com/problemset/problem/797/A | [
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20115
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:796-F | codeforces | 796-F | Sequence Recovery | https://codeforces.com/problemset/problem/796/F | [
"bitmasks",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 204
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:796-E | codeforces | 796-E | Exam Cheating | https://codeforces.com/problemset/problem/796/E | [
"binary search",
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 733
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:796-D | codeforces | 796-D | Police Stations | https://codeforces.com/problemset/problem/796/D | [
"constructive algorithms",
"dfs and similar",
"dp",
"graphs",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 7271
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:796-C | codeforces | 796-C | Bank Hacking | https://codeforces.com/problemset/problem/796/C | [
"constructive algorithms",
"data structures",
"dp",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3236
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:796-B | codeforces | 796-B | Find The Bone | https://codeforces.com/problemset/problem/796/B | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9743
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:796-A | codeforces | 796-A | Buying A House | https://codeforces.com/problemset/problem/796/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 13848
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:794-G | codeforces | 794-G | Replace All | https://codeforces.com/problemset/problem/794/G | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 404
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:794-F | codeforces | 794-F | Leha and security system | https://codeforces.com/problemset/problem/794/F | [
"data structures"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1005
} | 2026-06-01T05:00:40.145500+00:00 |
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": 1028
} | 2026-06-01T05:00:40.145500+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": 920
} | 2026-06-01T05:00:40.145500+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": 3331
} | 2026-06-01T05:00:40.145500+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": 7285
} | 2026-06-01T05:00:40.145500+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": 7799
} | 2026-06-01T05:00:40.145500+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": 453
} | 2026-06-01T05:00:40.145500+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": 804
} | 2026-06-01T05:00:40.145500+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": 305
} | 2026-06-01T05:00:40.145500+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": 1711
} | 2026-06-01T05:00:40.145500+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": 1364
} | 2026-06-01T05:00:40.145500+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": 4851
} | 2026-06-01T05:00:40.145500+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": 8046
} | 2026-06-01T05:00:40.145500+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": 235
} | 2026-06-01T05:00:40.145500+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": 1266
} | 2026-06-01T05:00:40.145500+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": 3410
} | 2026-06-01T05:00:40.145500+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": 5021
} | 2026-06-01T05:00:40.145500+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": 6560
} | 2026-06-01T05:00:40.145500+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": 9724
} | 2026-06-01T05:00:40.145500+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": 259412
} | 2026-06-01T05:00:40.145500+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": 4958
} | 2026-06-01T05:00:40.145500+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": 9832
} | 2026-06-01T05:00:40.145500+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": 392
} | 2026-06-01T05:00:40.145500+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": 411
} | 2026-06-01T05:00:40.145500+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": 2624
} | 2026-06-01T05:00:40.145500+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": 2900
} | 2026-06-01T05:00:40.145500+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": 10224
} | 2026-06-01T05:00:40.145500+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": 5772
} | 2026-06-01T05:00:40.145500+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": 12210
} | 2026-06-01T05:00:40.145500+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": 753
} | 2026-06-01T05:00:40.145500+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": 168
} | 2026-06-01T05:00:40.145500+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": 3743
} | 2026-06-01T05:00:40.145500+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": 8121
} | 2026-06-01T05:00:40.145500+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": 2847
} | 2026-06-01T05:00:40.145500+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": 2217
} | 2026-06-01T05:00:40.145500+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": 3729
} | 2026-06-01T05:00:40.145500+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": 7839
} | 2026-06-01T05:00:40.145500+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": 10647
} | 2026-06-01T05:00:40.145500+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": 111804
} | 2026-06-01T05:00:40.145500+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": 773
} | 2026-06-01T05:00:40.145500+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": 1145
} | 2026-06-01T05:00:40.145500+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": 2039
} | 2026-06-01T05:00:40.145500+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": 513
} | 2026-06-01T05:00:40.145500+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": 773
} | 2026-06-01T05:00:40.145500+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": 925
} | 2026-06-01T05:00:40.145500+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": 3349
} | 2026-06-01T05:00:40.145500+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": 133
} | 2026-06-01T05:00:40.145500+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": 707
} | 2026-06-01T05:00:40.145500+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": 1273
} | 2026-06-01T05:00:40.145500+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": 2995
} | 2026-06-01T05:00:40.145500+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": 3048
} | 2026-06-01T05:00:40.145500+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": 10045
} | 2026-06-01T05:00:40.145500+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": 12866
} | 2026-06-01T05:00:40.145500+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": 22892
} | 2026-06-01T05:00:40.145500+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": 12792
} | 2026-06-01T05:00:40.145500+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": 10718
} | 2026-06-01T05:00:40.145500+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": 9713
} | 2026-06-01T05:00:40.145500+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": 354
} | 2026-06-01T05:00:40.145500+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": 591
} | 2026-06-01T05:00:40.145500+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": 986
} | 2026-06-01T05:00:40.145500+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": 2540
} | 2026-06-01T05:00:40.145500+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": 12897
} | 2026-06-01T05:00:40.145500+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": 4780
} | 2026-06-01T05:00:40.145500+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": 5259
} | 2026-06-01T05:00:40.145500+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": 6834
} | 2026-06-01T05:00:40.145500+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": 9985
} | 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.