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:815-E | codeforces | 815-E | Karen and Neighborhood | https://codeforces.com/problemset/problem/815/E | [
"binary search",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 372
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:815-D | codeforces | 815-D | Karen and Cards | https://codeforces.com/problemset/problem/815/D | [
"binary search",
"combinatorics",
"data structures",
"geometry"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 955
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:815-C | codeforces | 815-C | Karen and Supermarket | https://codeforces.com/problemset/problem/815/C | [
"brute force",
"dp",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 3602
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:815-B | codeforces | 815-B | Karen and Test | https://codeforces.com/problemset/problem/815/B | [
"brute force",
"combinatorics",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1680
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:815-A | codeforces | 815-A | Karen and Game | https://codeforces.com/problemset/problem/815/A | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5944
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:814-E | codeforces | 814-E | An unavoidable detour for home | https://codeforces.com/problemset/problem/814/E | [
"combinatorics",
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 865
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:814-D | codeforces | 814-D | An overnight dance in discotheque | https://codeforces.com/problemset/problem/814/D | [
"dfs and similar",
"dp",
"geometry",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2655
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:814-C | codeforces | 814-C | An impassioned circulation of affection | https://codeforces.com/problemset/problem/814/C | [
"brute force",
"dp",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8211
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:814-B | codeforces | 814-B | An express train to reveries | https://codeforces.com/problemset/problem/814/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 5922
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:814-A | codeforces | 814-A | An abandoned sentiment from past | https://codeforces.com/problemset/problem/814/A | [
"constructive algorithms",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 11157
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:813-F | codeforces | 813-F | Bipartite Checking | https://codeforces.com/problemset/problem/813/F | [
"data structures",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1925
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:813-E | codeforces | 813-E | Army Creation | https://codeforces.com/problemset/problem/813/E | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3423
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:813-D | codeforces | 813-D | Two Melodies | https://codeforces.com/problemset/problem/813/D | [
"dp",
"flows"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1305
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:813-C | codeforces | 813-C | The Tag Game | https://codeforces.com/problemset/problem/813/C | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8842
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:813-B | codeforces | 813-B | The Golden Age | https://codeforces.com/problemset/problem/813/B | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4571
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:813-A | codeforces | 813-A | The Contest | https://codeforces.com/problemset/problem/813/A | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 5523
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:812-E | codeforces | 812-E | Sagheer and Apple Tree | https://codeforces.com/problemset/problem/812/E | [
"games",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1434
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:812-D | codeforces | 812-D | Sagheer and Kindergarten | https://codeforces.com/problemset/problem/812/D | [
"dfs and similar",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 387
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:812-C | codeforces | 812-C | Sagheer and Nubian Market | https://codeforces.com/problemset/problem/812/C | [
"binary search",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 18933
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:812-B | codeforces | 812-B | Sagheer, the Hausmeister | https://codeforces.com/problemset/problem/812/B | [
"bitmasks",
"brute force",
"dp"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5611
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:812-A | codeforces | 812-A | Sagheer and Crossroads | https://codeforces.com/problemset/problem/812/A | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 6493
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:811-E | codeforces | 811-E | Vladik and Entertaining Flags | https://codeforces.com/problemset/problem/811/E | [
"data structures",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1125
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:811-D | codeforces | 811-D | Vladik and Favorite Game | https://codeforces.com/problemset/problem/811/D | [
"constructive algorithms",
"dfs and similar",
"graphs",
"interactive"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1979
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:811-C | codeforces | 811-C | Vladik and Memorable Trip | https://codeforces.com/problemset/problem/811/C | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3540
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:811-B | codeforces | 811-B | Vladik and Complicated Book | https://codeforces.com/problemset/problem/811/B | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 6842
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:811-A | codeforces | 811-A | Vladik and Courtesy | https://codeforces.com/problemset/problem/811/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12505
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:810-B | codeforces | 810-B | Summer sell-off | https://codeforces.com/problemset/problem/810/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12854
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:810-A | codeforces | 810-A | Straight <<A>> | https://codeforces.com/problemset/problem/810/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 9444
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:809-E | codeforces | 809-E | Surprise me! | https://codeforces.com/problemset/problem/809/E | [
"divide and conquer",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 1073
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:809-D | codeforces | 809-D | Hitchhiking in the Baltic States | https://codeforces.com/problemset/problem/809/D | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1245
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:809-C | codeforces | 809-C | Find a car | https://codeforces.com/problemset/problem/809/C | [
"combinatorics",
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 956
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:809-B | codeforces | 809-B | Glad to see you! | https://codeforces.com/problemset/problem/809/B | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1840
} | 2026-11-02T05:37:07.883505+00:00 |
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": 4934
} | 2026-11-02T05:37:07.883505+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": 4248
} | 2026-11-02T05:37:07.883505+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": 1721
} | 2026-11-02T05:37:07.883505+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": 2307
} | 2026-11-02T05:37:07.883505+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": 8536
} | 2026-11-02T05:37:07.883505+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": 7211
} | 2026-11-02T05:37:07.883505+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": 17404
} | 2026-11-02T05:37:07.883505+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": 11512
} | 2026-11-02T05:37:07.883505+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": 3709
} | 2026-11-02T05:37:07.883505+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": 23952
} | 2026-11-02T05:37:07.883505+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": 19184
} | 2026-11-02T05:37:07.883505+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": 19590
} | 2026-11-02T05:37:07.883505+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": 224
} | 2026-11-02T05:37:07.883505+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": 846
} | 2026-11-02T05:37:07.883505+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": 1669
} | 2026-11-02T05:37:07.883505+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": 1996
} | 2026-11-02T05:37:07.883505+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": 10350
} | 2026-11-02T05:37:07.883505+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": 16693
} | 2026-11-02T05:37:07.883505+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": 1999
} | 2026-11-02T05:37:07.883505+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": 5264
} | 2026-11-02T05:37:07.883505+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": 2780
} | 2026-11-02T05:37:07.883505+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": 4212
} | 2026-11-02T05:37:07.883505+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": 6007
} | 2026-11-02T05:37:07.883505+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": 7762
} | 2026-11-02T05:37:07.883505+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": 5436
} | 2026-11-02T05:37:07.883505+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": 1343
} | 2026-11-02T05:37:07.883505+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": 1526
} | 2026-11-02T05:37:07.883505+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": 3753
} | 2026-11-02T05:37:07.883505+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": 417
} | 2026-11-02T05:37:07.883505+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": 752
} | 2026-11-02T05:37:07.883505+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": 6792
} | 2026-11-02T05:37:07.883505+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": 1893
} | 2026-11-02T05:37:07.883505+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": 574
} | 2026-11-02T05:37:07.883505+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": 8366
} | 2026-11-02T05:37:07.883505+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": 159
} | 2026-11-02T05:37:07.883505+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": 339
} | 2026-11-02T05:37:07.883505+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": 566
} | 2026-11-02T05:37:07.883505+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": 706
} | 2026-11-02T05:37:07.883505+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": 1361
} | 2026-11-02T05:37:07.883505+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": 1619
} | 2026-11-02T05:37:07.883505+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": 11371
} | 2026-11-02T05:37:07.883505+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": 7837
} | 2026-11-02T05:37:07.883505+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": 172
} | 2026-11-02T05:37:07.883505+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": 679
} | 2026-11-02T05:37:07.883505+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": 1135
} | 2026-11-02T05:37:07.883505+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": 2296
} | 2026-11-02T05:37:07.883505+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": 4094
} | 2026-11-02T05:37:07.883505+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": 10348
} | 2026-11-02T05:37:07.883505+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": 21865
} | 2026-11-02T05:37:07.883505+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": 578
} | 2026-11-02T05:37:07.883505+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": 2270
} | 2026-11-02T05:37:07.883505+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": 6518
} | 2026-11-02T05:37:07.883505+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": 9433
} | 2026-11-02T05:37:07.883505+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": 24505
} | 2026-11-02T05:37:07.883505+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": 1573
} | 2026-11-02T05:37:07.883505+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": 6185
} | 2026-11-02T05:37:07.883505+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": 2333
} | 2026-11-02T05:37:07.883505+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": 10430
} | 2026-11-02T05:37:07.883505+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": 11826
} | 2026-11-02T05:37:07.883505+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": 21063
} | 2026-11-02T05:37:07.883505+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": 478
} | 2026-11-02T05:37:07.883505+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": 780
} | 2026-11-02T05:37:07.883505+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": 8106
} | 2026-11-02T05:37:07.883505+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": 3272
} | 2026-11-02T05:37:07.883505+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": 9802
} | 2026-11-02T05:37:07.883505+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": 13961
} | 2026-11-02T05:37:07.883505+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": 588
} | 2026-11-02T05:37:07.883505+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": 1120
} | 2026-11-02T05:37:07.883505+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.