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:1663-D | codeforces | 1663-D | Is it rated - 3 | https://codeforces.com/problemset/problem/1663/D | [
"*special",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 1499
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1663-C | codeforces | 1663-C | Pōja Verdon | https://codeforces.com/problemset/problem/1663/C | [
"*special",
"implementation",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 5901
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1663-B | codeforces | 1663-B | Mike's Sequence | https://codeforces.com/problemset/problem/1663/B | [
"*special",
"divide and conquer",
"implementation",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 3598
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1663-A | codeforces | 1663-A | Who Tested? | https://codeforces.com/problemset/problem/1663/A | [
"*special",
"expression parsing",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 10939
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1662-O | codeforces | 1662-O | Circular Maze | https://codeforces.com/problemset/problem/1662/O | [
"brute force",
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 1682
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1662-N | codeforces | 1662-N | Drone Photo | https://codeforces.com/problemset/problem/1662/N | [
"combinatorics",
"math",
"sortings"
] | null | null | stdin_stdout | null | {
"solved_count": 1006
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1662-M | codeforces | 1662-M | Bottle Arrangements | https://codeforces.com/problemset/problem/1662/M | [
"constructive algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": 4021
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1662-L | codeforces | 1662-L | Il Derby della Madonnina | https://codeforces.com/problemset/problem/1662/L | [
"data structures",
"dp",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 1421
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1662-K | codeforces | 1662-K | Pandemic Restrictions | https://codeforces.com/problemset/problem/1662/K | [
"geometry",
"ternary search"
] | null | null | stdin_stdout | null | {
"solved_count": 396
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1662-J | codeforces | 1662-J | Training Camp | https://codeforces.com/problemset/problem/1662/J | [
"flows",
"graphs"
] | null | null | stdin_stdout | null | {
"solved_count": 308
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1662-I | codeforces | 1662-I | Ice Cream Shop | https://codeforces.com/problemset/problem/1662/I | [
"brute force",
"implementation",
"sortings"
] | null | null | stdin_stdout | null | {
"solved_count": 2590
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1662-H | codeforces | 1662-H | Boundary | https://codeforces.com/problemset/problem/1662/H | [
"brute force",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 3520
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1662-G | codeforces | 1662-G | Gastronomic Event | https://codeforces.com/problemset/problem/1662/G | [
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 592
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1662-F | codeforces | 1662-F | Antennas | https://codeforces.com/problemset/problem/1662/F | [
"data structures",
"dfs and similar",
"graphs",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | null | {
"solved_count": 1337
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1662-E | codeforces | 1662-E | Round Table | https://codeforces.com/problemset/problem/1662/E | [
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 191
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1662-D | codeforces | 1662-D | Evolution of Weasels | https://codeforces.com/problemset/problem/1662/D | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | null | {
"solved_count": 2269
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1662-C | codeforces | 1662-C | European Trip | https://codeforces.com/problemset/problem/1662/C | [
"dp",
"graphs",
"math",
"matrices"
] | null | null | stdin_stdout | null | {
"solved_count": 402
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1662-B | codeforces | 1662-B | Toys | https://codeforces.com/problemset/problem/1662/B | [
"greedy",
"strings"
] | null | null | stdin_stdout | null | {
"solved_count": 154
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1662-A | codeforces | 1662-A | Organizing SWERC | https://codeforces.com/problemset/problem/1662/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 4976
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1661-F | codeforces | 1661-F | Teleporters | https://codeforces.com/problemset/problem/1661/F | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 956
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1661-E | codeforces | 1661-E | Narrow Components | https://codeforces.com/problemset/problem/1661/E | [
"brute force",
"data structures",
"dp",
"dsu",
"math",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1189
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1661-D | codeforces | 1661-D | Progressions Covering | https://codeforces.com/problemset/problem/1661/D | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5571
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1661-C | codeforces | 1661-C | Water the Trees | https://codeforces.com/problemset/problem/1661/C | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10955
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1661-B | codeforces | 1661-B | Getting Zero | https://codeforces.com/problemset/problem/1661/B | [
"bitmasks",
"brute force",
"dfs and similar",
"dp",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 21490
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1661-A | codeforces | 1661-A | Array Balancing | https://codeforces.com/problemset/problem/1661/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19557
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1660-F2 | codeforces | 1660-F2 | Promising String (hard version) | https://codeforces.com/problemset/problem/1660/F2 | [
"data structures",
"implementation",
"math",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3264
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1660-F1 | codeforces | 1660-F1 | Promising String (easy version) | https://codeforces.com/problemset/problem/1660/F1 | [
"brute force",
"implementation",
"math",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8082
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1660-E | codeforces | 1660-E | Matrix and Shifts | https://codeforces.com/problemset/problem/1660/E | [
"brute force",
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8439
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1660-D | codeforces | 1660-D | Maximum Product Strikes Back | https://codeforces.com/problemset/problem/1660/D | [
"brute force",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12597
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1660-C | codeforces | 1660-C | Get an Even String | https://codeforces.com/problemset/problem/1660/C | [
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 22523
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1660-B | codeforces | 1660-B | Vlad and Candies | https://codeforces.com/problemset/problem/1660/B | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30155
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1660-A | codeforces | 1660-A | Vasya and Coins | https://codeforces.com/problemset/problem/1660/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 40009
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1659-F | codeforces | 1659-F | Tree and Permutation Game | https://codeforces.com/problemset/problem/1659/F | [
"dfs and similar",
"games",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 273
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1659-E | codeforces | 1659-E | AND-MEX Walk | https://codeforces.com/problemset/problem/1659/E | [
"bitmasks",
"brute force",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2068
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1659-D | codeforces | 1659-D | Reverse Sort Sum | https://codeforces.com/problemset/problem/1659/D | [
"constructive algorithms",
"data structures",
"greedy",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4530
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1659-C | codeforces | 1659-C | Line Empire | https://codeforces.com/problemset/problem/1659/C | [
"binary search",
"brute force",
"dp",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 16674
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1659-B | codeforces | 1659-B | Bit Flipping | https://codeforces.com/problemset/problem/1659/B | [
"bitmasks",
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12287
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1659-A | codeforces | 1659-A | Red Versus Blue | https://codeforces.com/problemset/problem/1659/A | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 35236
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1658-F | codeforces | 1658-F | Juju and Binary String | https://codeforces.com/problemset/problem/1658/F | [
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1027
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1658-E | codeforces | 1658-E | Gojou and Matrix Game | https://codeforces.com/problemset/problem/1658/E | [
"data structures",
"dp",
"games",
"hashing",
"implementation",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1266
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1658-D2 | codeforces | 1658-D2 | 388535 (Hard Version) | https://codeforces.com/problemset/problem/1658/D2 | [
"bitmasks",
"brute force",
"data structures",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3258
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1658-D1 | codeforces | 1658-D1 | 388535 (Easy Version) | https://codeforces.com/problemset/problem/1658/D1 | [
"bitmasks",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10154
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1658-C | codeforces | 1658-C | Shinju and the Lost Permutation | https://codeforces.com/problemset/problem/1658/C | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10052
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1658-B | codeforces | 1658-B | Marin and Anti-coprime Permutation | https://codeforces.com/problemset/problem/1658/B | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19771
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1658-A | codeforces | 1658-A | Marin and Photoshoot | https://codeforces.com/problemset/problem/1658/A | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20980
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1657-F | codeforces | 1657-F | Words on Tree | https://codeforces.com/problemset/problem/1657/F | [
"2-sat",
"dfs and similar",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 886
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1657-E | codeforces | 1657-E | Star MST | https://codeforces.com/problemset/problem/1657/E | [
"combinatorics",
"dp",
"graph matchings",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2630
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1657-D | codeforces | 1657-D | For Gamers. By Gamers. | https://codeforces.com/problemset/problem/1657/D | [
"binary search",
"brute force",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5418
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1657-C | codeforces | 1657-C | Bracket Sequence Deletion | https://codeforces.com/problemset/problem/1657/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17892
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1657-B | codeforces | 1657-B | XY Sequence | https://codeforces.com/problemset/problem/1657/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23773
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1657-A | codeforces | 1657-A | Integer Moves | https://codeforces.com/problemset/problem/1657/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25100
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1656-I | codeforces | 1656-I | Neighbour Ordering | https://codeforces.com/problemset/problem/1656/I | [
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 174
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1656-H | codeforces | 1656-H | Equal LCM Subsets | https://codeforces.com/problemset/problem/1656/H | [
"data structures",
"math",
"number theory"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 854
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1656-G | codeforces | 1656-G | Cycle Palindrome | https://codeforces.com/problemset/problem/1656/G | [
"constructive algorithms",
"graphs",
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 562
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1656-F | codeforces | 1656-F | Parametric MST | https://codeforces.com/problemset/problem/1656/F | [
"binary search",
"constructive algorithms",
"graphs",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1307
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1656-E | codeforces | 1656-E | Equal Tree Sums | https://codeforces.com/problemset/problem/1656/E | [
"constructive algorithms",
"dfs and similar",
"math",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4062
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1656-D | codeforces | 1656-D | K-good | https://codeforces.com/problemset/problem/1656/D | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7703
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1656-C | codeforces | 1656-C | Make Equal With Mod | https://codeforces.com/problemset/problem/1656/C | [
"constructive algorithms",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 21341
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1656-B | codeforces | 1656-B | Subtract Operation | https://codeforces.com/problemset/problem/1656/B | [
"data structures",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 29639
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1656-A | codeforces | 1656-A | Good Pairs | https://codeforces.com/problemset/problem/1656/A | [
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20563
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1654-H | codeforces | 1654-H | Three Minimums | https://codeforces.com/problemset/problem/1654/H | [
"combinatorics",
"constructive algorithms",
"divide and conquer",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 115
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1654-G | codeforces | 1654-G | Snowy Mountain | https://codeforces.com/problemset/problem/1654/G | [
"data structures",
"dfs and similar",
"graphs",
"greedy",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 486
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1654-F | codeforces | 1654-F | Minimal String Xoration | https://codeforces.com/problemset/problem/1654/F | [
"bitmasks",
"data structures",
"divide and conquer",
"greedy",
"hashing",
"sortings",
"strings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1572
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1654-E | codeforces | 1654-E | Arithmetic Operations | https://codeforces.com/problemset/problem/1654/E | [
"brute force",
"data structures",
"graphs",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2480
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1654-D | codeforces | 1654-D | Potion Brewing Class | https://codeforces.com/problemset/problem/1654/D | [
"dfs and similar",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3121
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1654-C | codeforces | 1654-C | Alice and the Cake | https://codeforces.com/problemset/problem/1654/C | [
"data structures",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14718
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1654-B | codeforces | 1654-B | Prefix Removals | https://codeforces.com/problemset/problem/1654/B | [
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16970
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1654-A | codeforces | 1654-A | Maximum Cake Tastiness | https://codeforces.com/problemset/problem/1654/A | [
"brute force",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19512
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1651-F | codeforces | 1651-F | Tower Defense | https://codeforces.com/problemset/problem/1651/F | [
"binary search",
"brute force",
"data structures"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 548
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1651-E | codeforces | 1651-E | Sum of Matchings | https://codeforces.com/problemset/problem/1651/E | [
"brute force",
"combinatorics",
"constructive algorithms",
"dfs and similar",
"graph matchings",
"greedy",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 690
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1651-D | codeforces | 1651-D | Nearest Excluded Points | https://codeforces.com/problemset/problem/1651/D | [
"binary search",
"data structures",
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6930
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1651-C | codeforces | 1651-C | Fault-tolerant Network | https://codeforces.com/problemset/problem/1651/C | [
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11729
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1651-B | codeforces | 1651-B | Prove Him Wrong | https://codeforces.com/problemset/problem/1651/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20574
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1651-A | codeforces | 1651-A | Playoff | https://codeforces.com/problemset/problem/1651/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26833
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1650-G | codeforces | 1650-G | Counting Shortcuts | https://codeforces.com/problemset/problem/1650/G | [
"data structures",
"dfs and similar",
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3195
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1650-F | codeforces | 1650-F | Vitaly and Advanced Useless Algorithms | https://codeforces.com/problemset/problem/1650/F | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1782
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1650-E | codeforces | 1650-E | Rescheduling the Exam | https://codeforces.com/problemset/problem/1650/E | [
"binary search",
"data structures",
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4527
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1650-D | codeforces | 1650-D | Twist the Permutation | https://codeforces.com/problemset/problem/1650/D | [
"brute force",
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15560
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1650-C | codeforces | 1650-C | Weight of the System of Nested Segments | https://codeforces.com/problemset/problem/1650/C | [
"greedy",
"hashing",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18905
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1650-B | codeforces | 1650-B | DIV + MOD | https://codeforces.com/problemset/problem/1650/B | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 30446
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1650-A | codeforces | 1650-A | Deletions of Two Adjacent Letters | https://codeforces.com/problemset/problem/1650/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 37756
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1649-B | codeforces | 1649-B | Game of Ball Passing | https://codeforces.com/problemset/problem/1649/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14102
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1649-A | codeforces | 1649-A | Game | https://codeforces.com/problemset/problem/1649/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16171
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1648-F | codeforces | 1648-F | Two Avenues | https://codeforces.com/problemset/problem/1648/F | [
"data structures",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 201
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1648-E | codeforces | 1648-E | Air Reform | https://codeforces.com/problemset/problem/1648/E | [
"data structures",
"dfs and similar",
"divide and conquer",
"dsu",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 643
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1648-D | codeforces | 1648-D | Serious Business | https://codeforces.com/problemset/problem/1648/D | [
"data structures",
"divide and conquer",
"dp",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1109
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1648-C | codeforces | 1648-C | Tyler and Strings | https://codeforces.com/problemset/problem/1648/C | [
"combinatorics",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3424
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1648-B | codeforces | 1648-B | Integral Array | https://codeforces.com/problemset/problem/1648/B | [
"brute force",
"constructive algorithms",
"data structures",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7481
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1648-A | codeforces | 1648-A | Weird Sum | https://codeforces.com/problemset/problem/1648/A | [
"combinatorics",
"data structures",
"geometry",
"math",
"matrices",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 20739
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1647-F | codeforces | 1647-F | Madoka and Laziness | https://codeforces.com/problemset/problem/1647/F | [
"dp",
"greedy"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 564
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1647-E | codeforces | 1647-E | Madoka and the Sixth-graders | https://codeforces.com/problemset/problem/1647/E | [
"data structures",
"dfs and similar",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1153
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1647-D | codeforces | 1647-D | Madoka and the Best School in Russia | https://codeforces.com/problemset/problem/1647/D | [
"constructive algorithms",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5773
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1647-C | codeforces | 1647-C | Madoka and Childish Pranks | https://codeforces.com/problemset/problem/1647/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13476
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1647-B | codeforces | 1647-B | Madoka and the Elegant Gift | https://codeforces.com/problemset/problem/1647/B | [
"brute force",
"constructive algorithms",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17367
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1647-A | codeforces | 1647-A | Madoka and Math Dad | https://codeforces.com/problemset/problem/1647/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23596
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1646-F | codeforces | 1646-F | Playing Around the Table | https://codeforces.com/problemset/problem/1646/F | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 724
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1646-E | codeforces | 1646-E | Power Board | https://codeforces.com/problemset/problem/1646/E | [
"brute force",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2852
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1646-D | codeforces | 1646-D | Weight the Tree | https://codeforces.com/problemset/problem/1646/D | [
"constructive algorithms",
"dfs and similar",
"dp",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4565
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1646-C | codeforces | 1646-C | Factorials and Powers of Two | https://codeforces.com/problemset/problem/1646/C | [
"bitmasks",
"brute force",
"constructive algorithms",
"dp",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 21437
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1646-B | codeforces | 1646-B | Quality vs Quantity | https://codeforces.com/problemset/problem/1646/B | [
"brute force",
"constructive algorithms",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23037
} | 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.