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: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": 12047
} | 2026-11-02T05:37:07.883505+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": 30421
} | 2026-11-02T05:37:07.883505+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": 45790
} | 2026-11-02T05:37:07.883505+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": 7433
} | 2026-11-02T05:37:07.883505+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": 16718
} | 2026-11-02T05:37:07.883505+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": 19262
} | 2026-11-02T05:37:07.883505+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": 182
} | 2026-11-02T05:37:07.883505+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": 774
} | 2026-11-02T05:37:07.883505+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": 1531
} | 2026-11-02T05:37:07.883505+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": 4180
} | 2026-11-02T05:37:07.883505+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": 4621
} | 2026-11-02T05:37:07.883505+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": 9531
} | 2026-11-02T05:37:07.883505+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": 13812
} | 2026-11-02T05:37:07.883505+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": 16827
} | 2026-11-02T05:37:07.883505+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": 27294
} | 2026-11-02T05:37:07.883505+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": 20982
} | 2026-11-02T05:37:07.883505+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": 35044
} | 2026-11-02T05:37:07.883505+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": 30312
} | 2026-11-02T05:37:07.883505+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": 36242
} | 2026-11-02T05:37:07.883505+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": 63733
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1676-A | codeforces | 1676-A | Lucky? | https://codeforces.com/problemset/problem/1676/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 93297
} | 2026-11-02T05:37:07.883505+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": 2220
} | 2026-11-02T05:37:07.883505+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": 6548
} | 2026-11-02T05:37:07.883505+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": 12342
} | 2026-11-02T05:37:07.883505+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": 15340
} | 2026-11-02T05:37:07.883505+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": 19590
} | 2026-11-02T05:37:07.883505+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": 49030
} | 2026-11-02T05:37:07.883505+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": 37578
} | 2026-11-02T05:37:07.883505+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": 3035
} | 2026-11-02T05:37:07.883505+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": 5776
} | 2026-11-02T05:37:07.883505+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": 7925
} | 2026-11-02T05:37:07.883505+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": 18043
} | 2026-11-02T05:37:07.883505+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": 26897
} | 2026-11-02T05:37:07.883505+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": 30385
} | 2026-11-02T05:37:07.883505+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": 28371
} | 2026-11-02T05:37:07.883505+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": 1009
} | 2026-11-02T05:37:07.883505+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": 860
} | 2026-11-02T05:37:07.883505+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": 3667
} | 2026-11-02T05:37:07.883505+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": 19840
} | 2026-11-02T05:37:07.883505+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": 24121
} | 2026-11-02T05:37:07.883505+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": 19243
} | 2026-11-02T05:37:07.883505+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": 281
} | 2026-11-02T05:37:07.883505+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": 1186
} | 2026-11-02T05:37:07.883505+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": 709
} | 2026-11-02T05:37:07.883505+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": 991
} | 2026-11-02T05:37:07.883505+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": 3659
} | 2026-11-02T05:37:07.883505+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": 2653
} | 2026-11-02T05:37:07.883505+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": 7056
} | 2026-11-02T05:37:07.883505+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": 14189
} | 2026-11-02T05:37:07.883505+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": 16608
} | 2026-11-02T05:37:07.883505+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": 16980
} | 2026-11-02T05:37:07.883505+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": 528
} | 2026-11-02T05:37:07.883505+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": 3421
} | 2026-11-02T05:37:07.883505+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": 8649
} | 2026-11-02T05:37:07.883505+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": 28359
} | 2026-11-02T05:37:07.883505+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": 19988
} | 2026-11-02T05:37:07.883505+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": 21552
} | 2026-11-02T05:37:07.883505+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": 1353
} | 2026-11-02T05:37:07.883505+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": 2038
} | 2026-11-02T05:37:07.883505+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": 5767
} | 2026-11-02T05:37:07.883505+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": 11316
} | 2026-11-02T05:37:07.883505+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": 13624
} | 2026-11-02T05:37:07.883505+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": 16105
} | 2026-11-02T05:37:07.883505+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": 32736
} | 2026-11-02T05:37:07.883505+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": 22466
} | 2026-11-02T05:37:07.883505+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": 44831
} | 2026-11-02T05:37:07.883505+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": 22305
} | 2026-11-02T05:37:07.883505+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": 26337
} | 2026-11-02T05:37:07.883505+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": 43207
} | 2026-11-02T05:37:07.883505+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": 58703
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1669-A | codeforces | 1669-A | Division? | https://codeforces.com/problemset/problem/1669/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 95946
} | 2026-11-02T05:37:07.883505+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": 18114
} | 2026-11-02T05:37:07.883505+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": 16894
} | 2026-11-02T05:37:07.883505+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": 125
} | 2026-11-02T05:37:07.883505+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": 978
} | 2026-11-02T05:37:07.883505+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": 898
} | 2026-11-02T05:37:07.883505+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": 2196
} | 2026-11-02T05:37:07.883505+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": 4547
} | 2026-11-02T05:37:07.883505+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": 15892
} | 2026-11-02T05:37:07.883505+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": 3825
} | 2026-11-02T05:37:07.883505+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": 370
} | 2026-11-02T05:37:07.883505+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": 1615
} | 2026-11-02T05:37:07.883505+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": 1820
} | 2026-11-02T05:37:07.883505+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": 95
} | 2026-11-02T05:37:07.883505+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-11-02T05:37:07.883505+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": 1616
} | 2026-11-02T05:37:07.883505+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": 922
} | 2026-11-02T05:37:07.883505+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": 24279
} | 2026-11-02T05:37:07.883505+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": 3866
} | 2026-11-02T05:37:07.883505+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": 70
} | 2026-11-02T05:37:07.883505+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": 142
} | 2026-11-02T05:37:07.883505+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": 1912
} | 2026-11-02T05:37:07.883505+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": 4861
} | 2026-11-02T05:37:07.883505+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": 10157
} | 2026-11-02T05:37:07.883505+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": 37420
} | 2026-11-02T05:37:07.883505+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": 27049
} | 2026-11-02T05:37:07.883505+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": 1370
} | 2026-11-02T05:37:07.883505+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": 233
} | 2026-11-02T05:37:07.883505+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": 390
} | 2026-11-02T05:37:07.883505+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": 601
} | 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.