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:1690-A | codeforces | 1690-A | Print a Pedestal (Codeforces logo?) | https://codeforces.com/problemset/problem/1690/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 35582
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1689-E | codeforces | 1689-E | ANDfinity | https://codeforces.com/problemset/problem/1689/E | [
"bitmasks",
"brute force",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1355
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1689-D | codeforces | 1689-D | Lena and Matrix | https://codeforces.com/problemset/problem/1689/D | [
"data structures",
"dp",
"geometry",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4729
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1689-C | codeforces | 1689-C | Infected Tree | https://codeforces.com/problemset/problem/1689/C | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13392
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1689-B | codeforces | 1689-B | Mystic Permutation | https://codeforces.com/problemset/problem/1689/B | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 19047
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1689-A | codeforces | 1689-A | Lex String | https://codeforces.com/problemset/problem/1689/A | [
"brute force",
"greedy",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17713
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1688-C | codeforces | 1688-C | Manipulating History | https://codeforces.com/problemset/problem/1688/C | [
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8731
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1688-B | codeforces | 1688-B | Patchouli's Magical Talisman | https://codeforces.com/problemset/problem/1688/B | [
"bitmasks",
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18994
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1688-A | codeforces | 1688-A | Cirno's Perfect Bitmasks Classroom | https://codeforces.com/problemset/problem/1688/A | [
"bitmasks",
"brute force"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23424
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1687-F | codeforces | 1687-F | Koishi's Unconscious Permutation | https://codeforces.com/problemset/problem/1687/F | [
"fft",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 109
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1687-E | codeforces | 1687-E | Become Big For Me | https://codeforces.com/problemset/problem/1687/E | [
"combinatorics",
"constructive algorithms",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 309
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1687-D | codeforces | 1687-D | Cute number | https://codeforces.com/problemset/problem/1687/D | [
"binary search",
"brute force",
"data structures",
"dsu",
"implementation",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 731
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1687-C | codeforces | 1687-C | Sanae and Giant Robot | https://codeforces.com/problemset/problem/1687/C | [
"binary search",
"brute force",
"data structures",
"dsu",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1674
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1687-B | codeforces | 1687-B | Railway System | https://codeforces.com/problemset/problem/1687/B | [
"constructive algorithms",
"graphs",
"greedy",
"interactive",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4126
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1687-A | codeforces | 1687-A | The Enchanted Forest | https://codeforces.com/problemset/problem/1687/A | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11379
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1686-B | codeforces | 1686-B | Odd Subarrays | https://codeforces.com/problemset/problem/1686/B | [
"dp",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19323
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1686-A | codeforces | 1686-A | Everything Everywhere All But One | https://codeforces.com/problemset/problem/1686/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21230
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1685-E | codeforces | 1685-E | The Ultimate LIS Problem | https://codeforces.com/problemset/problem/1685/E | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 196
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1685-D2 | codeforces | 1685-D2 | Permutation Weight (Hard Version) | https://codeforces.com/problemset/problem/1685/D2 | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 132
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1685-D1 | codeforces | 1685-D1 | Permutation Weight (Easy Version) | https://codeforces.com/problemset/problem/1685/D1 | [
"constructive algorithms",
"dfs and similar",
"dsu"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 504
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1685-C | codeforces | 1685-C | Bring Balance | https://codeforces.com/problemset/problem/1685/C | [
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1327
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1685-B | codeforces | 1685-B | Linguistics | https://codeforces.com/problemset/problem/1685/B | [
"greedy",
"implementation",
"sortings",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3660
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1685-A | codeforces | 1685-A | Circular Local MiniMax | https://codeforces.com/problemset/problem/1685/A | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 18561
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1684-H | codeforces | 1684-H | Hard Cut | https://codeforces.com/problemset/problem/1684/H | [
"constructive algorithms",
"dfs and similar",
"divide and conquer",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 275
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1684-G | codeforces | 1684-G | Euclid Guess | https://codeforces.com/problemset/problem/1684/G | [
"constructive algorithms",
"flows",
"graph matchings",
"math",
"number theory"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 774
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1684-F | codeforces | 1684-F | Diverse Segments | https://codeforces.com/problemset/problem/1684/F | [
"data structures",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1116
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1684-E | codeforces | 1684-E | MEX vs DIFF | https://codeforces.com/problemset/problem/1684/E | [
"binary search",
"brute force",
"constructive algorithms",
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3617
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1684-D | codeforces | 1684-D | Traps | https://codeforces.com/problemset/problem/1684/D | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10736
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1684-C | codeforces | 1684-C | Column Swapping | https://codeforces.com/problemset/problem/1684/C | [
"brute force",
"constructive algorithms",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 13252
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1684-B | codeforces | 1684-B | Z mod X = C | https://codeforces.com/problemset/problem/1684/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21822
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1684-A | codeforces | 1684-A | Digit Minimization | https://codeforces.com/problemset/problem/1684/A | [
"constructive algorithms",
"games",
"math",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24914
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1682-F | codeforces | 1682-F | MCMF? | https://codeforces.com/problemset/problem/1682/F | [
"data structures",
"flows",
"graphs",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 389
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1682-E | codeforces | 1682-E | Unordered Swaps | https://codeforces.com/problemset/problem/1682/E | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy",
"math",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 744
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1682-D | codeforces | 1682-D | Circular Spanning Tree | https://codeforces.com/problemset/problem/1682/D | [
"constructive algorithms",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3713
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1682-C | codeforces | 1682-C | LIS or Reverse LIS? | https://codeforces.com/problemset/problem/1682/C | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16427
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1682-B | codeforces | 1682-B | AND Sorting | https://codeforces.com/problemset/problem/1682/B | [
"bitmasks",
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 26120
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1682-A | codeforces | 1682-A | Palindromic Indices | https://codeforces.com/problemset/problem/1682/A | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19949
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1681-F | codeforces | 1681-F | Unique Occurrences | https://codeforces.com/problemset/problem/1681/F | [
"data structures",
"dfs and similar",
"divide and conquer",
"dp",
"dsu",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2287
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1681-E | codeforces | 1681-E | Labyrinth Adventures | https://codeforces.com/problemset/problem/1681/E | [
"data structures",
"dp",
"matrices",
"shortest paths"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 928
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1681-D | codeforces | 1681-D | Required Length | https://codeforces.com/problemset/problem/1681/D | [
"brute force",
"dfs and similar",
"dp",
"hashing",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10731
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1681-C | codeforces | 1681-C | Double Sort | https://codeforces.com/problemset/problem/1681/C | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18693
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1681-B | codeforces | 1681-B | Card Trick | https://codeforces.com/problemset/problem/1681/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21010
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1681-A | codeforces | 1681-A | Game with Cards | https://codeforces.com/problemset/problem/1681/A | [
"games",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21670
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1680-F | codeforces | 1680-F | Lenient Vertex Cover | https://codeforces.com/problemset/problem/1680/F | [
"dfs and similar",
"divide and conquer",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 893
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1680-E | codeforces | 1680-E | Moving Chips | https://codeforces.com/problemset/problem/1680/E | [
"bitmasks",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4312
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1680-D | codeforces | 1680-D | Dog Walking | https://codeforces.com/problemset/problem/1680/D | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1337
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1680-C | codeforces | 1680-C | Binary String | https://codeforces.com/problemset/problem/1680/C | [
"binary search",
"greedy",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11076
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1680-B | codeforces | 1680-B | Robots | https://codeforces.com/problemset/problem/1680/B | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19066
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1680-A | codeforces | 1680-A | Minimums and Maximums | https://codeforces.com/problemset/problem/1680/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22332
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1679-F | codeforces | 1679-F | Formalism for Formalism | https://codeforces.com/problemset/problem/1679/F | [
"bitmasks",
"dp",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 769
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1679-E | codeforces | 1679-E | Typical Party in Dorm | https://codeforces.com/problemset/problem/1679/E | [
"bitmasks",
"combinatorics",
"dp",
"strings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1410
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1679-D | codeforces | 1679-D | Toss a Coin to Your Graph... | https://codeforces.com/problemset/problem/1679/D | [
"binary search",
"dfs and similar",
"dp",
"graphs"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5801
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1679-C | codeforces | 1679-C | Rooks Defenders | https://codeforces.com/problemset/problem/1679/C | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11700
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1679-B | codeforces | 1679-B | Stone Age Problem | https://codeforces.com/problemset/problem/1679/B | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 27143
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1679-A | codeforces | 1679-A | AvtoBus | https://codeforces.com/problemset/problem/1679/A | [
"brute force",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 39641
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1678-B2 | codeforces | 1678-B2 | Tokitsukaze and Good 01-String (hard version) | https://codeforces.com/problemset/problem/1678/B2 | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7343
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1678-B1 | codeforces | 1678-B1 | Tokitsukaze and Good 01-String (easy version) | https://codeforces.com/problemset/problem/1678/B1 | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16600
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1678-A | codeforces | 1678-A | Tokitsukaze and All Zero Sequence | https://codeforces.com/problemset/problem/1678/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19160
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1677-F | codeforces | 1677-F | Tokitsukaze and Gems | https://codeforces.com/problemset/problem/1677/F | [
"dp",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 110
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1677-E | codeforces | 1677-E | Tokitsukaze and Beautiful Subsegments | https://codeforces.com/problemset/problem/1677/E | [
"data structures"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 659
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1677-D | codeforces | 1677-D | Tokitsukaze and Permutations | https://codeforces.com/problemset/problem/1677/D | [
"dp",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1450
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1677-C | codeforces | 1677-C | Tokitsukaze and Two Colorful Tapes | https://codeforces.com/problemset/problem/1677/C | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4067
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1677-B | codeforces | 1677-B | Tokitsukaze and Meeting | https://codeforces.com/problemset/problem/1677/B | [
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4536
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1677-A | codeforces | 1677-A | Tokitsukaze and Strange Inequality | https://codeforces.com/problemset/problem/1677/A | [
"brute force",
"data structures",
"dp"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9334
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1676-H2 | codeforces | 1676-H2 | Maximum Crossings (Hard Version) | https://codeforces.com/problemset/problem/1676/H2 | [
"data structures",
"divide and conquer",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13176
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1676-H1 | codeforces | 1676-H1 | Maximum Crossings (Easy Version) | https://codeforces.com/problemset/problem/1676/H1 | [
"brute force"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16257
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1676-G | codeforces | 1676-G | White-Black Balanced Subtrees | https://codeforces.com/problemset/problem/1676/G | [
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 23709
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1676-F | codeforces | 1676-F | Longest Strike | https://codeforces.com/problemset/problem/1676/F | [
"data structures",
"greedy",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 19958
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1676-E | codeforces | 1676-E | Eating Queries | https://codeforces.com/problemset/problem/1676/E | [
"binary search",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 32765
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1676-D | codeforces | 1676-D | X-Sum | https://codeforces.com/problemset/problem/1676/D | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 29182
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1676-C | codeforces | 1676-C | Most Similar Words | https://codeforces.com/problemset/problem/1676/C | [
"brute force",
"greedy",
"implementation",
"math",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34487
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1676-B | codeforces | 1676-B | Equal Candies | https://codeforces.com/problemset/problem/1676/B | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 60208
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1676-A | codeforces | 1676-A | Lucky? | https://codeforces.com/problemset/problem/1676/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 86774
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1675-G | codeforces | 1675-G | Sorting Pancakes | https://codeforces.com/problemset/problem/1675/G | [
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2115
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1675-F | codeforces | 1675-F | Vlad and Unfinished Business | https://codeforces.com/problemset/problem/1675/F | [
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6228
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1675-E | codeforces | 1675-E | Replace With the Previous, Minimize | https://codeforces.com/problemset/problem/1675/E | [
"dsu",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12046
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1675-D | codeforces | 1675-D | Vertical Paths | https://codeforces.com/problemset/problem/1675/D | [
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14728
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1675-C | codeforces | 1675-C | Detective Task | https://codeforces.com/problemset/problem/1675/C | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19269
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1675-B | codeforces | 1675-B | Make It Increasing | https://codeforces.com/problemset/problem/1675/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 42861
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1675-A | codeforces | 1675-A | Food for Animals | https://codeforces.com/problemset/problem/1675/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 36680
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1674-G | codeforces | 1674-G | Remove Directed Edges | https://codeforces.com/problemset/problem/1674/G | [
"dfs and similar",
"dp",
"graphs"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2888
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1674-F | codeforces | 1674-F | Desktop Rearrangement | https://codeforces.com/problemset/problem/1674/F | [
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5672
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1674-E | codeforces | 1674-E | Breaking the Wall | https://codeforces.com/problemset/problem/1674/E | [
"binary search",
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 7276
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1674-D | codeforces | 1674-D | A-B-C Sort | https://codeforces.com/problemset/problem/1674/D | [
"constructive algorithms",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17769
} | 2026-04-13T03:38:27.662191+00:00 |
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": 26289
} | 2026-04-13T03:38:27.662191+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": 29212
} | 2026-04-13T03:38:27.662191+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": 27930
} | 2026-04-13T03:38:27.662191+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": 954
} | 2026-04-13T03:38:27.662191+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": 798
} | 2026-04-13T03:38:27.662191+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": 3620
} | 2026-04-13T03:38:27.662191+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": 17859
} | 2026-04-13T03:38:27.662191+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": 21570
} | 2026-04-13T03:38:27.662191+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": 19128
} | 2026-04-13T03:38:27.662191+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": 252
} | 2026-04-13T03:38:27.662191+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": 1125
} | 2026-04-13T03:38:27.662191+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": 398
} | 2026-04-13T03:38:27.662191+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": 932
} | 2026-04-13T03:38:27.662191+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": 3522
} | 2026-04-13T03:38:27.662191+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": 2512
} | 2026-04-13T03:38:27.662191+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": 6932
} | 2026-04-13T03:38:27.662191+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.