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:1669-F | codeforces | 1669-F | Eating Candies | https://codeforces.com/problemset/problem/1669/F | [
"binary search",
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 40237
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1669-E | codeforces | 1669-E | 2-Letter Strings | https://codeforces.com/problemset/problem/1669/E | [
"data structures",
"math",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 21387
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1669-D | codeforces | 1669-D | Colorful Stamp | https://codeforces.com/problemset/problem/1669/D | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 25510
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1669-C | codeforces | 1669-C | Odd/Even Increments | https://codeforces.com/problemset/problem/1669/C | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 41650
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1669-B | codeforces | 1669-B | Triple | https://codeforces.com/problemset/problem/1669/B | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 55910
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1669-A | codeforces | 1669-A | Division? | https://codeforces.com/problemset/problem/1669/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 89419
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1668-B | codeforces | 1668-B | Social Distance | https://codeforces.com/problemset/problem/1668/B | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 17943
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1668-A | codeforces | 1668-A | Direction Change | https://codeforces.com/problemset/problem/1668/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16821
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1667-F | codeforces | 1667-F | Yin Yang | https://codeforces.com/problemset/problem/1667/F | [
"implementation"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 119
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1667-E | codeforces | 1667-E | Centroid Probabilities | https://codeforces.com/problemset/problem/1667/E | [
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 816
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1667-D | codeforces | 1667-D | Edge Elimination | https://codeforces.com/problemset/problem/1667/D | [
"constructive algorithms",
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 812
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1667-C | codeforces | 1667-C | Half Queen Cover | https://codeforces.com/problemset/problem/1667/C | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1978
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1667-B | codeforces | 1667-B | Optimal Partition | https://codeforces.com/problemset/problem/1667/B | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4331
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1667-A | codeforces | 1667-A | Make it Increasing | https://codeforces.com/problemset/problem/1667/A | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15726
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1666-L | codeforces | 1666-L | Labyrinth | https://codeforces.com/problemset/problem/1666/L | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3713
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1666-K | codeforces | 1666-K | Kingdom Partition | https://codeforces.com/problemset/problem/1666/K | [
"flows"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 359
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1666-J | codeforces | 1666-J | Job Lookup | https://codeforces.com/problemset/problem/1666/J | [
"constructive algorithms",
"dp",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1585
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1666-I | codeforces | 1666-I | Interactive Treasure Hunt | https://codeforces.com/problemset/problem/1666/I | [
"brute force",
"constructive algorithms",
"geometry",
"interactive",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1777
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1666-H | codeforces | 1666-H | Heroes of Might | https://codeforces.com/problemset/problem/1666/H | [
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 87
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1666-G | codeforces | 1666-G | Global Warming | https://codeforces.com/problemset/problem/1666/G | [
"geometry",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 153
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1666-F | codeforces | 1666-F | Fancy Stack | https://codeforces.com/problemset/problem/1666/F | [
"combinatorics",
"dp",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1538
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1666-E | codeforces | 1666-E | Even Split | https://codeforces.com/problemset/problem/1666/E | [
"binary search",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 884
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1666-D | codeforces | 1666-D | Deletive Editing | https://codeforces.com/problemset/problem/1666/D | [
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 20717
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1666-C | codeforces | 1666-C | Connect the Points | https://codeforces.com/problemset/problem/1666/C | [
"brute force",
"constructive algorithms",
"geometry"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3711
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1666-B | codeforces | 1666-B | Budget Distribution | https://codeforces.com/problemset/problem/1666/B | [] | null | null | stdin_stdout | 3,300 | {
"solved_count": 66
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1666-A | codeforces | 1666-A | Admissible Map | https://codeforces.com/problemset/problem/1666/A | [] | null | null | stdin_stdout | 3,300 | {
"solved_count": 136
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1665-E | codeforces | 1665-E | MinimizOR | https://codeforces.com/problemset/problem/1665/E | [
"bitmasks",
"brute force",
"data structures",
"divide and conquer",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1805
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1665-D | codeforces | 1665-D | GCD Guess | https://codeforces.com/problemset/problem/1665/D | [
"bitmasks",
"chinese remainder theorem",
"constructive algorithms",
"games",
"interactive",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4688
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1665-C | codeforces | 1665-C | Tree Infection | https://codeforces.com/problemset/problem/1665/C | [
"binary search",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9907
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1665-B | codeforces | 1665-B | Array Cloning Technique | https://codeforces.com/problemset/problem/1665/B | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 33558
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1665-A | codeforces | 1665-A | GCD vs LCM | https://codeforces.com/problemset/problem/1665/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26283
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1663-H | codeforces | 1663-H | Cross-Language Program | https://codeforces.com/problemset/problem/1663/H | [
"*special",
"constructive algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": 1354
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1663-G | codeforces | 1663-G | Six Characters | https://codeforces.com/problemset/problem/1663/G | [
"*special",
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | null | {
"solved_count": 225
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1663-F | codeforces | 1663-F | In Every Generation... | https://codeforces.com/problemset/problem/1663/F | [
"*special",
"strings"
] | null | null | stdin_stdout | null | {
"solved_count": 379
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1663-E | codeforces | 1663-E | Are You Safe? | https://codeforces.com/problemset/problem/1663/E | [
"*special",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 589
} | 2026-06-01T05:00:40.145500+00:00 |
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": 1485
} | 2026-06-01T05:00:40.145500+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": 5878
} | 2026-06-01T05:00:40.145500+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": 3573
} | 2026-06-01T05:00:40.145500+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": 10897
} | 2026-06-01T05:00:40.145500+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": 1596
} | 2026-06-01T05:00:40.145500+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": 937
} | 2026-06-01T05:00:40.145500+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": 3879
} | 2026-06-01T05:00:40.145500+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": 1334
} | 2026-06-01T05:00:40.145500+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": 390
} | 2026-06-01T05:00:40.145500+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": 298
} | 2026-06-01T05:00:40.145500+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": 2470
} | 2026-06-01T05:00:40.145500+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": 3370
} | 2026-06-01T05:00:40.145500+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": 562
} | 2026-06-01T05:00:40.145500+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": 1248
} | 2026-06-01T05:00:40.145500+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": 180
} | 2026-06-01T05:00:40.145500+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": 2158
} | 2026-06-01T05:00:40.145500+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": 383
} | 2026-06-01T05:00:40.145500+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": 152
} | 2026-06-01T05:00:40.145500+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": 4844
} | 2026-06-01T05:00:40.145500+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": 838
} | 2026-06-01T05:00:40.145500+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": 1124
} | 2026-06-01T05:00:40.145500+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": 5406
} | 2026-06-01T05:00:40.145500+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": 10563
} | 2026-06-01T05:00:40.145500+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": 20822
} | 2026-06-01T05:00:40.145500+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": 19384
} | 2026-06-01T05:00:40.145500+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": 3157
} | 2026-06-01T05:00:40.145500+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": 7975
} | 2026-06-01T05:00:40.145500+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": 8101
} | 2026-06-01T05:00:40.145500+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": 11646
} | 2026-06-01T05:00:40.145500+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": 22082
} | 2026-06-01T05:00:40.145500+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": 29800
} | 2026-06-01T05:00:40.145500+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": 39304
} | 2026-06-01T05:00:40.145500+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": 251
} | 2026-06-01T05:00:40.145500+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": 1978
} | 2026-06-01T05:00:40.145500+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": 4455
} | 2026-06-01T05:00:40.145500+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": 15298
} | 2026-06-01T05:00:40.145500+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": 12044
} | 2026-06-01T05:00:40.145500+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": 31590
} | 2026-06-01T05:00:40.145500+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": 946
} | 2026-06-01T05:00:40.145500+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": 1178
} | 2026-06-01T05:00:40.145500+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": 3183
} | 2026-06-01T05:00:40.145500+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": 10019
} | 2026-06-01T05:00:40.145500+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": 9965
} | 2026-06-01T05:00:40.145500+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": 19555
} | 2026-06-01T05:00:40.145500+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": 20920
} | 2026-06-01T05:00:40.145500+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": 766
} | 2026-06-01T05:00:40.145500+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": 2506
} | 2026-06-01T05:00:40.145500+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": 5325
} | 2026-06-01T05:00:40.145500+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": 17720
} | 2026-06-01T05:00:40.145500+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": 23632
} | 2026-06-01T05:00:40.145500+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": 24938
} | 2026-06-01T05:00:40.145500+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": 154
} | 2026-06-01T05:00:40.145500+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": 797
} | 2026-06-01T05:00:40.145500+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": 467
} | 2026-06-01T05:00:40.145500+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": 1233
} | 2026-06-01T05:00:40.145500+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": 3880
} | 2026-06-01T05:00:40.145500+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": 7584
} | 2026-06-01T05:00:40.145500+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": 21079
} | 2026-06-01T05:00:40.145500+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": 27223
} | 2026-06-01T05:00:40.145500+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": 20468
} | 2026-06-01T05:00:40.145500+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": 101
} | 2026-06-01T05:00:40.145500+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": 461
} | 2026-06-01T05:00:40.145500+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": 1489
} | 2026-06-01T05:00:40.145500+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": 2366
} | 2026-06-01T05:00:40.145500+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": 3070
} | 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.