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:1674-C | codeforces | 1674-C | Infinite Replacement | https://codeforces.com/problemset/problem/1674/C | [
"combinatorics",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 26665
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1674-B | codeforces | 1674-B | Dictionary | https://codeforces.com/problemset/problem/1674/B | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29874
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1674-A | codeforces | 1674-A | Number Transformation | https://codeforces.com/problemset/problem/1674/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28153
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1673-F | codeforces | 1673-F | Anti-Theft Road Planning | https://codeforces.com/problemset/problem/1673/F | [
"bitmasks",
"constructive algorithms",
"divide and conquer",
"greedy",
"interactive",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 982
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1673-E | codeforces | 1673-E | Power or XOR? | https://codeforces.com/problemset/problem/1673/E | [
"bitmasks",
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 852
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1673-D | codeforces | 1673-D | Lost Arithmetic Progression | https://codeforces.com/problemset/problem/1673/D | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3647
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1673-C | codeforces | 1673-C | Palindrome Basis | https://codeforces.com/problemset/problem/1673/C | [
"brute force",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 19056
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1673-B | codeforces | 1673-B | A Perfectly Balanced String? | https://codeforces.com/problemset/problem/1673/B | [
"brute force",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 23176
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1673-A | codeforces | 1673-A | Subtle Substring Subtraction | https://codeforces.com/problemset/problem/1673/A | [
"games",
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19197
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1672-I | codeforces | 1672-I | PermutationForces | https://codeforces.com/problemset/problem/1672/I | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 264
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1672-H | codeforces | 1672-H | Zigu Zagu | https://codeforces.com/problemset/problem/1672/H | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1168
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1672-G | codeforces | 1672-G | Cross Xor | https://codeforces.com/problemset/problem/1672/G | [
"constructive algorithms",
"graphs",
"math",
"matrices"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 694
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1672-F2 | codeforces | 1672-F2 | Checker for Array Shuffling | https://codeforces.com/problemset/problem/1672/F2 | [
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 963
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1672-F1 | codeforces | 1672-F1 | Array Shuffling | https://codeforces.com/problemset/problem/1672/F1 | [
"constructive algorithms",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3614
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1672-E | codeforces | 1672-E | notepad.exe | https://codeforces.com/problemset/problem/1672/E | [
"binary search",
"constructive algorithms",
"greedy",
"interactive"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2609
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1672-D | codeforces | 1672-D | Cyclic Rotation | https://codeforces.com/problemset/problem/1672/D | [
"constructive algorithms",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6988
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1672-C | codeforces | 1672-C | Unequal Array | https://codeforces.com/problemset/problem/1672/C | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 14088
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1672-B | codeforces | 1672-B | I love AAAB | https://codeforces.com/problemset/problem/1672/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16521
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1672-A | codeforces | 1672-A | Log Chopping | https://codeforces.com/problemset/problem/1672/A | [
"games",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16898
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1671-F | codeforces | 1671-F | Permutation Counting | https://codeforces.com/problemset/problem/1671/F | [
"brute force",
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 515
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1671-E | codeforces | 1671-E | Preorder | https://codeforces.com/problemset/problem/1671/E | [
"combinatorics",
"divide and conquer",
"dp",
"dsu",
"hashing",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3324
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1671-D | codeforces | 1671-D | Insert a Progression | https://codeforces.com/problemset/problem/1671/D | [
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8533
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1671-C | codeforces | 1671-C | Dolce Vita | https://codeforces.com/problemset/problem/1671/C | [
"binary search",
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 27176
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1671-B | codeforces | 1671-B | Consecutive Points Segment | https://codeforces.com/problemset/problem/1671/B | [
"brute force",
"math",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19839
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1671-A | codeforces | 1671-A | String Building | https://codeforces.com/problemset/problem/1671/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21475
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1670-F | codeforces | 1670-F | Jee, You See? | https://codeforces.com/problemset/problem/1670/F | [
"bitmasks",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1325
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1670-E | codeforces | 1670-E | Hemose on the Tree | https://codeforces.com/problemset/problem/1670/E | [
"bitmasks",
"constructive algorithms",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1995
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1670-D | codeforces | 1670-D | Very Suspicious | https://codeforces.com/problemset/problem/1670/D | [
"binary search",
"brute force",
"geometry",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5708
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1670-C | codeforces | 1670-C | Where is the Pizza? | https://codeforces.com/problemset/problem/1670/C | [
"data structures",
"dfs and similar",
"dsu",
"graphs",
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11163
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1670-B | codeforces | 1670-B | Dorms War | https://codeforces.com/problemset/problem/1670/B | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 13514
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1670-A | codeforces | 1670-A | Prof. Slim | https://codeforces.com/problemset/problem/1670/A | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16045
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1669-H | codeforces | 1669-H | Maximal AND | https://codeforces.com/problemset/problem/1669/H | [
"bitmasks",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 31324
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1669-G | codeforces | 1669-G | Fall Down | https://codeforces.com/problemset/problem/1669/G | [
"dfs and similar",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 22179
} | 2026-08-10T02:20:32.917453+00:00 |
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": 42564
} | 2026-08-10T02:20:32.917453+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": 21820
} | 2026-08-10T02:20:32.917453+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": 25954
} | 2026-08-10T02:20:32.917453+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": 42395
} | 2026-08-10T02:20:32.917453+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": 57288
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1669-A | codeforces | 1669-A | Division? | https://codeforces.com/problemset/problem/1669/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 91945
} | 2026-08-10T02:20:32.917453+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": 18016
} | 2026-08-10T02:20:32.917453+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": 16857
} | 2026-08-10T02:20:32.917453+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": 123
} | 2026-08-10T02:20:32.917453+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": 954
} | 2026-08-10T02:20:32.917453+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": 879
} | 2026-08-10T02:20:32.917453+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": 2158
} | 2026-08-10T02:20:32.917453+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": 4431
} | 2026-08-10T02:20:32.917453+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": 15791
} | 2026-08-10T02:20:32.917453+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": 3750
} | 2026-08-10T02:20:32.917453+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": 366
} | 2026-08-10T02:20:32.917453+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": 1593
} | 2026-08-10T02:20:32.917453+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": 1789
} | 2026-08-10T02:20:32.917453+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": 93
} | 2026-08-10T02:20:32.917453+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": 154
} | 2026-08-10T02:20:32.917453+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": 1579
} | 2026-08-10T02:20:32.917453+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": 893
} | 2026-08-10T02:20:32.917453+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": 22530
} | 2026-08-10T02:20:32.917453+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": 3825
} | 2026-08-10T02:20:32.917453+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": 68
} | 2026-08-10T02:20:32.917453+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": 140
} | 2026-08-10T02:20:32.917453+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": 1862
} | 2026-08-10T02:20:32.917453+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": 4771
} | 2026-08-10T02:20:32.917453+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": 10051
} | 2026-08-10T02:20:32.917453+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": 35491
} | 2026-08-10T02:20:32.917453+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": 26702
} | 2026-08-10T02:20:32.917453+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": 1361
} | 2026-08-10T02:20:32.917453+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": 231
} | 2026-08-10T02:20:32.917453+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": 387
} | 2026-08-10T02:20:32.917453+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": 597
} | 2026-08-10T02:20:32.917453+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": 1494
} | 2026-08-10T02:20:32.917453+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": 5893
} | 2026-08-10T02:20:32.917453+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": 3585
} | 2026-08-10T02:20:32.917453+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": 10917
} | 2026-08-10T02:20:32.917453+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": 1613
} | 2026-08-10T02:20:32.917453+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": 955
} | 2026-08-10T02:20:32.917453+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": 3909
} | 2026-08-10T02:20:32.917453+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": 1352
} | 2026-08-10T02:20:32.917453+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": 393
} | 2026-08-10T02:20:32.917453+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": 304
} | 2026-08-10T02:20:32.917453+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": 2500
} | 2026-08-10T02:20:32.917453+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": 3405
} | 2026-08-10T02:20:32.917453+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": 574
} | 2026-08-10T02:20:32.917453+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": 1273
} | 2026-08-10T02:20:32.917453+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": 186
} | 2026-08-10T02:20:32.917453+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": 2181
} | 2026-08-10T02:20:32.917453+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": 388
} | 2026-08-10T02:20:32.917453+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": 153
} | 2026-08-10T02:20:32.917453+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": 4877
} | 2026-08-10T02:20:32.917453+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": 919
} | 2026-08-10T02:20:32.917453+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": 1165
} | 2026-08-10T02:20:32.917453+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": 5476
} | 2026-08-10T02:20:32.917453+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": 10739
} | 2026-08-10T02:20:32.917453+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": 21129
} | 2026-08-10T02:20:32.917453+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": 19478
} | 2026-08-10T02:20:32.917453+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": 3214
} | 2026-08-10T02:20:32.917453+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": 8026
} | 2026-08-10T02:20:32.917453+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": 8170
} | 2026-08-10T02:20:32.917453+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": 12032
} | 2026-08-10T02:20:32.917453+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": 22279
} | 2026-08-10T02:20:32.917453+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": 29985
} | 2026-08-10T02:20:32.917453+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": 39546
} | 2026-08-10T02:20:32.917453+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.