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:809-A | codeforces | 809-A | Do you want a date? | https://codeforces.com/problemset/problem/809/A | [
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4915
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:808-G | codeforces | 808-G | Anthem of Berland | https://codeforces.com/problemset/problem/808/G | [
"dp",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 4081
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:808-F | codeforces | 808-F | Card Game | https://codeforces.com/problemset/problem/808/F | [
"binary search",
"flows",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1662
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:808-E | codeforces | 808-E | Selling Souvenirs | https://codeforces.com/problemset/problem/808/E | [
"binary search",
"dp",
"greedy",
"ternary search"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2258
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:808-D | codeforces | 808-D | Array Division | https://codeforces.com/problemset/problem/808/D | [
"binary search",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8425
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:808-C | codeforces | 808-C | Tea Party | https://codeforces.com/problemset/problem/808/C | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7127
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:808-B | codeforces | 808-B | Average Sleep Time | https://codeforces.com/problemset/problem/808/B | [
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16501
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:808-A | codeforces | 808-A | Lucky Year | https://codeforces.com/problemset/problem/808/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 11251
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:807-B | codeforces | 807-B | T-Shirt Hunt | https://codeforces.com/problemset/problem/807/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 3682
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:807-A | codeforces | 807-A | Is it rated? | https://codeforces.com/problemset/problem/807/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 23646
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:805-B | codeforces | 805-B | 3-palindrome | https://codeforces.com/problemset/problem/805/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19026
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:805-A | codeforces | 805-A | Fake NP | https://codeforces.com/problemset/problem/805/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19449
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:804-F | codeforces | 804-F | Fake bullions | https://codeforces.com/problemset/problem/804/F | [
"combinatorics",
"dfs and similar",
"dp",
"graphs",
"number theory"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 221
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:804-E | codeforces | 804-E | The same permutation | https://codeforces.com/problemset/problem/804/E | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 759
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:804-D | codeforces | 804-D | Expected diameter of a tree | https://codeforces.com/problemset/problem/804/D | [
"binary search",
"brute force",
"dfs and similar",
"dp",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1645
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:804-C | codeforces | 804-C | Ice cream coloring | https://codeforces.com/problemset/problem/804/C | [
"constructive algorithms",
"dfs and similar",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1989
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:804-B | codeforces | 804-B | Minimum number of steps | https://codeforces.com/problemset/problem/804/B | [
"combinatorics",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10304
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:804-A | codeforces | 804-A | Find Amir | https://codeforces.com/problemset/problem/804/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16630
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:803-G | codeforces | 803-G | Periodic RMQ Problem | https://codeforces.com/problemset/problem/803/G | [
"data structures"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1950
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:803-F | codeforces | 803-F | Coprime Subsequences | https://codeforces.com/problemset/problem/803/F | [
"bitmasks",
"combinatorics",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5025
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:803-E | codeforces | 803-E | Roma and Poker | https://codeforces.com/problemset/problem/803/E | [
"dp",
"graphs"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2733
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:803-D | codeforces | 803-D | Magazine Ad | https://codeforces.com/problemset/problem/803/D | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4132
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:803-C | codeforces | 803-C | Maximal GCD | https://codeforces.com/problemset/problem/803/C | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5954
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:803-B | codeforces | 803-B | Distances to Zero | https://codeforces.com/problemset/problem/803/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 7705
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:803-A | codeforces | 803-A | Maximal Binary Matrix | https://codeforces.com/problemset/problem/803/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 5412
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:802-M3 | codeforces | 802-M3 | April Fools' Problem (hard) | https://codeforces.com/problemset/problem/802/M3 | [
"binary search",
"data structures",
"flows"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1319
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:802-M2 | codeforces | 802-M2 | April Fools' Problem (medium) | https://codeforces.com/problemset/problem/802/M2 | [
"binary search",
"flows",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1506
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:802-M1 | codeforces | 802-M1 | April Fools' Problem (easy) | https://codeforces.com/problemset/problem/802/M1 | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 3723
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:802-J3 | codeforces | 802-J3 | Send the Fool Further! (hard) | https://codeforces.com/problemset/problem/802/J3 | [
"dfs and similar",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 407
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:802-J2 | codeforces | 802-J2 | Send the Fool Further! (medium) | https://codeforces.com/problemset/problem/802/J2 | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 744
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:802-J1 | codeforces | 802-J1 | Send the Fool Further! (easy) | https://codeforces.com/problemset/problem/802/J1 | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 6702
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:802-G3 | codeforces | 802-G3 | Fake News (hard) | https://codeforces.com/problemset/problem/802/G3 | [
"string suffix structures"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1866
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:802-G2 | codeforces | 802-G2 | Fake News (medium) | https://codeforces.com/problemset/problem/802/G2 | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 559
} | 2026-08-17T01:43:56.191071+00:00 |
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": 8285
} | 2026-08-17T01:43:56.191071+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": 156
} | 2026-08-17T01:43:56.191071+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": 335
} | 2026-08-17T01:43:56.191071+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": 559
} | 2026-08-17T01:43:56.191071+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": 701
} | 2026-08-17T01:43:56.191071+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": 1350
} | 2026-08-17T01:43:56.191071+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": 1608
} | 2026-08-17T01:43:56.191071+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": 11305
} | 2026-08-17T01:43:56.191071+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": 7781
} | 2026-08-17T01:43:56.191071+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": 171
} | 2026-08-17T01:43:56.191071+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": 673
} | 2026-08-17T01:43:56.191071+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": 1124
} | 2026-08-17T01:43:56.191071+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": 2285
} | 2026-08-17T01:43:56.191071+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": 4078
} | 2026-08-17T01:43:56.191071+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": 10292
} | 2026-08-17T01:43:56.191071+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": 21712
} | 2026-08-17T01:43:56.191071+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": 571
} | 2026-08-17T01:43:56.191071+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": 2230
} | 2026-08-17T01:43:56.191071+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": 6442
} | 2026-08-17T01:43:56.191071+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": 9340
} | 2026-08-17T01:43:56.191071+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": 24182
} | 2026-08-17T01:43:56.191071+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": 1551
} | 2026-08-17T01:43:56.191071+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": 5960
} | 2026-08-17T01:43:56.191071+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": 2298
} | 2026-08-17T01:43:56.191071+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": 10242
} | 2026-08-17T01:43:56.191071+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": 11699
} | 2026-08-17T01:43:56.191071+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": 20680
} | 2026-08-17T01:43:56.191071+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": 472
} | 2026-08-17T01:43:56.191071+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": 773
} | 2026-08-17T01:43:56.191071+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": 7902
} | 2026-08-17T01:43:56.191071+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": 3253
} | 2026-08-17T01:43:56.191071+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": 9784
} | 2026-08-17T01:43:56.191071+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": 13914
} | 2026-08-17T01:43:56.191071+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": 584
} | 2026-08-17T01:43:56.191071+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": 1101
} | 2026-08-17T01:43:56.191071+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": 1227
} | 2026-08-17T01:43:56.191071+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": 947
} | 2026-08-17T01:43:56.191071+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": 3359
} | 2026-08-17T01:43:56.191071+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": 7499
} | 2026-08-17T01:43:56.191071+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": 8019
} | 2026-08-17T01:43:56.191071+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": 576
} | 2026-08-17T01:43:56.191071+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": 888
} | 2026-08-17T01:43:56.191071+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": 336
} | 2026-08-17T01:43:56.191071+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": 1747
} | 2026-08-17T01:43:56.191071+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": 1399
} | 2026-08-17T01:43:56.191071+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": 4907
} | 2026-08-17T01:43:56.191071+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": 8173
} | 2026-08-17T01:43:56.191071+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": 430
} | 2026-08-17T01:43:56.191071+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": 1303
} | 2026-08-17T01:43:56.191071+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": 3470
} | 2026-08-17T01:43:56.191071+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": 5114
} | 2026-08-17T01:43:56.191071+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": 6594
} | 2026-08-17T01:43:56.191071+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": 9892
} | 2026-08-17T01:43:56.191071+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": 267663
} | 2026-08-17T01:43:56.191071+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": 5060
} | 2026-08-17T01:43:56.191071+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": 9952
} | 2026-08-17T01:43:56.191071+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": 449
} | 2026-08-17T01:43:56.191071+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": 423
} | 2026-08-17T01:43:56.191071+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": 2689
} | 2026-08-17T01:43:56.191071+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": 2965
} | 2026-08-17T01:43:56.191071+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": 10317
} | 2026-08-17T01:43:56.191071+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": 5817
} | 2026-08-17T01:43:56.191071+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": 12271
} | 2026-08-17T01:43:56.191071+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": 912
} | 2026-08-17T01:43:56.191071+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": 197
} | 2026-08-17T01:43:56.191071+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": 3941
} | 2026-08-17T01:43:56.191071+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": 8452
} | 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.