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:1615-E | codeforces | 1615-E | Purple Crayon | https://codeforces.com/problemset/problem/1615/E | [
"data structures",
"dfs and similar",
"games",
"graphs",
"greedy",
"math",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1704
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1615-D | codeforces | 1615-D | X(or)-mas Tree | https://codeforces.com/problemset/problem/1615/D | [
"bitmasks",
"dfs and similar",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2139
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1615-C | codeforces | 1615-C | Menorah | https://codeforces.com/problemset/problem/1615/C | [
"brute force",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9221
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1615-B | codeforces | 1615-B | And It's Non-Zero | https://codeforces.com/problemset/problem/1615/B | [
"bitmasks",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17970
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1615-A | codeforces | 1615-A | Closing The Gap | https://codeforces.com/problemset/problem/1615/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21592
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1614-E | codeforces | 1614-E | Divan and a Cottage | https://codeforces.com/problemset/problem/1614/E | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 953
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1614-D2 | codeforces | 1614-D2 | Divan and Kostomuksha (hard version) | https://codeforces.com/problemset/problem/1614/D2 | [
"dp",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2762
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1614-D1 | codeforces | 1614-D1 | Divan and Kostomuksha (easy version) | https://codeforces.com/problemset/problem/1614/D1 | [
"dp",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4504
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1614-C | codeforces | 1614-C | Divan and bitwise operations | https://codeforces.com/problemset/problem/1614/C | [
"bitmasks",
"combinatorics",
"constructive algorithms",
"dp",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11339
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1614-B | codeforces | 1614-B | Divan and a New Project | https://codeforces.com/problemset/problem/1614/B | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 29556
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1614-A | codeforces | 1614-A | Divan and a Store | https://codeforces.com/problemset/problem/1614/A | [
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24626
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1613-F | codeforces | 1613-F | Tree Coloring | https://codeforces.com/problemset/problem/1613/F | [
"combinatorics",
"divide and conquer",
"fft"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 835
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1613-E | codeforces | 1613-E | Crazy Robot | https://codeforces.com/problemset/problem/1613/E | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5911
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1613-D | codeforces | 1613-D | MEX Sequences | https://codeforces.com/problemset/problem/1613/D | [
"dp",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5328
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1613-C | codeforces | 1613-C | Poisoned Dagger | https://codeforces.com/problemset/problem/1613/C | [
"binary search"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 29945
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1613-B | codeforces | 1613-B | Absent Remainder | https://codeforces.com/problemset/problem/1613/B | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 23379
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1613-A | codeforces | 1613-A | Long Comparison | https://codeforces.com/problemset/problem/1613/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 26680
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1612-G | codeforces | 1612-G | Max Sum Array | https://codeforces.com/problemset/problem/1612/G | [
"combinatorics",
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1001
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1612-F | codeforces | 1612-F | Armor and Weapons | https://codeforces.com/problemset/problem/1612/F | [
"brute force",
"dp",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 695
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1612-E | codeforces | 1612-E | Messages | https://codeforces.com/problemset/problem/1612/E | [
"brute force",
"dp",
"greedy",
"probabilities",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2834
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1612-D | codeforces | 1612-D | X-Magic Pair | https://codeforces.com/problemset/problem/1612/D | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10286
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1612-C | codeforces | 1612-C | Chat Ban | https://codeforces.com/problemset/problem/1612/C | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 26197
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1612-B | codeforces | 1612-B | Special Permutation | https://codeforces.com/problemset/problem/1612/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18466
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1612-A | codeforces | 1612-A | Distance | https://codeforces.com/problemset/problem/1612/A | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18220
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1611-G | codeforces | 1611-G | Robot and Candies | https://codeforces.com/problemset/problem/1611/G | [
"data structures",
"graph matchings",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 741
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1611-F | codeforces | 1611-F | ATM and Students | https://codeforces.com/problemset/problem/1611/F | [
"binary search",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7418
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1611-E2 | codeforces | 1611-E2 | Escape The Maze (hard version) | https://codeforces.com/problemset/problem/1611/E2 | [
"dfs and similar",
"dp",
"greedy",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4321
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1611-E1 | codeforces | 1611-E1 | Escape The Maze (easy version) | https://codeforces.com/problemset/problem/1611/E1 | [
"dfs and similar",
"greedy",
"shortest paths",
"trees",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8400
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1611-D | codeforces | 1611-D | Weights Assignment For Tree Edges | https://codeforces.com/problemset/problem/1611/D | [
"constructive algorithms",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11631
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1611-C | codeforces | 1611-C | Polycarp Recovers the Permutation | https://codeforces.com/problemset/problem/1611/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19398
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1611-B | codeforces | 1611-B | Team Composition: Programmers and Mathematicians | https://codeforces.com/problemset/problem/1611/B | [
"binary search",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31978
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1611-A | codeforces | 1611-A | Make Even | https://codeforces.com/problemset/problem/1611/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33472
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1610-I | codeforces | 1610-I | Mashtali vs AtCoder | https://codeforces.com/problemset/problem/1610/I | [
"games",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 340
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1610-H | codeforces | 1610-H | Squid Game | https://codeforces.com/problemset/problem/1610/H | [
"data structures",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 629
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1610-G | codeforces | 1610-G | AmShZ Wins a Bet | https://codeforces.com/problemset/problem/1610/G | [
"data structures",
"greedy",
"hashing"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 655
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1610-F | codeforces | 1610-F | Mashtali: a Space Oddysey | https://codeforces.com/problemset/problem/1610/F | [
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 710
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1610-E | codeforces | 1610-E | AmShZ and G.O.A.T. | https://codeforces.com/problemset/problem/1610/E | [
"binary search",
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1940
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1610-D | codeforces | 1610-D | Not Quite Lee | https://codeforces.com/problemset/problem/1610/D | [
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3043
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1610-C | codeforces | 1610-C | Keshi Is Throwing a Party | https://codeforces.com/problemset/problem/1610/C | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15822
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1610-B | codeforces | 1610-B | Kalindrome Array | https://codeforces.com/problemset/problem/1610/B | [
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 23785
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1610-A | codeforces | 1610-A | Anti Light's Cell Guessing | https://codeforces.com/problemset/problem/1610/A | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 17114
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1609-H | codeforces | 1609-H | Pushing Robots | https://codeforces.com/problemset/problem/1609/H | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 105
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1609-G | codeforces | 1609-G | A Stroll Around the Matrix | https://codeforces.com/problemset/problem/1609/G | [
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 485
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1609-F | codeforces | 1609-F | Interesting Sections | https://codeforces.com/problemset/problem/1609/F | [
"data structures",
"divide and conquer",
"meet-in-the-middle",
"two pointers"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 962
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1609-E | codeforces | 1609-E | William The Oblivious | https://codeforces.com/problemset/problem/1609/E | [
"bitmasks",
"data structures",
"dp",
"matrices"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2470
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1609-D | codeforces | 1609-D | Social Network | https://codeforces.com/problemset/problem/1609/D | [
"dsu",
"graphs",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8434
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1609-C | codeforces | 1609-C | Complex Market Analysis | https://codeforces.com/problemset/problem/1609/C | [
"binary search",
"dp",
"implementation",
"number theory",
"schedules",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10484
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1609-B | codeforces | 1609-B | William the Vigilant | https://codeforces.com/problemset/problem/1609/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12153
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1609-A | codeforces | 1609-A | Divide and Multiply | https://codeforces.com/problemset/problem/1609/A | [
"greedy",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18979
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1608-G | codeforces | 1608-G | Alphabetic Tree | https://codeforces.com/problemset/problem/1608/G | [
"binary search",
"data structures",
"dfs and similar",
"hashing",
"string suffix structures",
"strings",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 247
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1608-F | codeforces | 1608-F | MEX counting | https://codeforces.com/problemset/problem/1608/F | [
"combinatorics",
"dp",
"implementation"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 850
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1608-E | codeforces | 1608-E | The Cells on the Paper | https://codeforces.com/problemset/problem/1608/E | [
"binary search",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 491
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1608-D | codeforces | 1608-D | Dominoes | https://codeforces.com/problemset/problem/1608/D | [
"combinatorics",
"fft",
"graphs",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1563
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1608-C | codeforces | 1608-C | Game Master | https://codeforces.com/problemset/problem/1608/C | [
"data structures",
"dfs and similar",
"dp",
"graphs",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7396
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1608-B | codeforces | 1608-B | Build the Permutation | https://codeforces.com/problemset/problem/1608/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12519
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1608-A | codeforces | 1608-A | Find Array | https://codeforces.com/problemset/problem/1608/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20293
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1607-H | codeforces | 1607-H | Banquet Preparations 2 | https://codeforces.com/problemset/problem/1607/H | [
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1435
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1607-G | codeforces | 1607-G | Banquet Preparations 1 | https://codeforces.com/problemset/problem/1607/G | [
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1748
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1607-F | codeforces | 1607-F | Robot on the Board 2 | https://codeforces.com/problemset/problem/1607/F | [
"brute force",
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2137
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1607-E | codeforces | 1607-E | Robot on the Board 1 | https://codeforces.com/problemset/problem/1607/E | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10045
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1607-D | codeforces | 1607-D | Blue-Red Permutation | https://codeforces.com/problemset/problem/1607/D | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18169
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1607-C | codeforces | 1607-C | Minimum Extraction | https://codeforces.com/problemset/problem/1607/C | [
"brute force",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 26878
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1607-B | codeforces | 1607-B | Odd Grasshopper | https://codeforces.com/problemset/problem/1607/B | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 40156
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1607-A | codeforces | 1607-A | Linear Keyboard | https://codeforces.com/problemset/problem/1607/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 40815
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1606-F | codeforces | 1606-F | Tree Queries | https://codeforces.com/problemset/problem/1606/F | [
"brute force",
"dp",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 668
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1606-E | codeforces | 1606-E | Arena | https://codeforces.com/problemset/problem/1606/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4200
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1606-D | codeforces | 1606-D | Red-Blue Matrix | https://codeforces.com/problemset/problem/1606/D | [
"brute force",
"constructive algorithms",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1579
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1606-C | codeforces | 1606-C | Banknotes | https://codeforces.com/problemset/problem/1606/C | [
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15234
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1606-B | codeforces | 1606-B | Update Files | https://codeforces.com/problemset/problem/1606/B | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19577
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1606-A | codeforces | 1606-A | AB Balance | https://codeforces.com/problemset/problem/1606/A | [
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 38143
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1605-F | codeforces | 1605-F | PalindORme | https://codeforces.com/problemset/problem/1605/F | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 431
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1605-E | codeforces | 1605-E | Array Equalizer | https://codeforces.com/problemset/problem/1605/E | [
"binary search",
"greedy",
"implementation",
"math",
"number theory",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1186
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1605-D | codeforces | 1605-D | Treelabeling | https://codeforces.com/problemset/problem/1605/D | [
"bitmasks",
"constructive algorithms",
"dfs and similar",
"games",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3261
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1605-C | codeforces | 1605-C | Dominant Character | https://codeforces.com/problemset/problem/1605/C | [
"brute force",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 18943
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1605-B | codeforces | 1605-B | Reverse Sort | https://codeforces.com/problemset/problem/1605/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19367
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1605-A | codeforces | 1605-A | A.M. Deviation | https://codeforces.com/problemset/problem/1605/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21658
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1604-B | codeforces | 1604-B | XOR Specia-LIS-t | https://codeforces.com/problemset/problem/1604/B | [] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16352
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1604-A | codeforces | 1604-A | Era | https://codeforces.com/problemset/problem/1604/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22664
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1603-F | codeforces | 1603-F | October 18, 2017 | https://codeforces.com/problemset/problem/1603/F | [
"combinatorics",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 352
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1603-E | codeforces | 1603-E | A Perfect Problem | https://codeforces.com/problemset/problem/1603/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 641
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1603-D | codeforces | 1603-D | Artistic Partition | https://codeforces.com/problemset/problem/1603/D | [
"divide and conquer",
"dp",
"number theory"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 886
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1603-C | codeforces | 1603-C | Extreme Extension | https://codeforces.com/problemset/problem/1603/C | [
"dp",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2272
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1603-B | codeforces | 1603-B | Moderate Modular Mode | https://codeforces.com/problemset/problem/1603/B | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15119
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1603-A | codeforces | 1603-A | Di-visible Confusion | https://codeforces.com/problemset/problem/1603/A | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17863
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1602-B | codeforces | 1602-B | Divine Array | https://codeforces.com/problemset/problem/1602/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 14766
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1602-A | codeforces | 1602-A | Two Subsequences | https://codeforces.com/problemset/problem/1602/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19768
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1601-F | codeforces | 1601-F | Two Sorts | https://codeforces.com/problemset/problem/1601/F | [
"binary search",
"dfs and similar",
"math",
"meet-in-the-middle"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 275
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1601-E | codeforces | 1601-E | Phys Ed Online | https://codeforces.com/problemset/problem/1601/E | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 598
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1601-D | codeforces | 1601-D | Difficult Mountain | https://codeforces.com/problemset/problem/1601/D | [
"data structures",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1946
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1601-C | codeforces | 1601-C | Optimal Insertion | https://codeforces.com/problemset/problem/1601/C | [
"data structures",
"divide and conquer",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2350
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1601-B | codeforces | 1601-B | Frog Traveler | https://codeforces.com/problemset/problem/1601/B | [
"data structures",
"dfs and similar",
"dp",
"graphs",
"shortest paths",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5516
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1601-A | codeforces | 1601-A | Array Elimination | https://codeforces.com/problemset/problem/1601/A | [
"bitmasks",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 21390
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1600-J | codeforces | 1600-J | Robot Factory | https://codeforces.com/problemset/problem/1600/J | [
"bitmasks",
"dfs and similar"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 4434
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1600-F | codeforces | 1600-F | Party Organization | https://codeforces.com/problemset/problem/1600/F | [
"brute force",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 618
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1600-E | codeforces | 1600-E | Array Game | https://codeforces.com/problemset/problem/1600/E | [
"games",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2396
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1599-J | codeforces | 1599-J | Bob's Beautiful Array | https://codeforces.com/problemset/problem/1599/J | [
"bitmasks",
"brute force",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 330
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1599-I | codeforces | 1599-I | Desert | https://codeforces.com/problemset/problem/1599/I | [
"data structures",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 132
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1599-H | codeforces | 1599-H | Hidden Fortress | https://codeforces.com/problemset/problem/1599/H | [
"interactive",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1280
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1599-G | codeforces | 1599-G | Shortest path | https://codeforces.com/problemset/problem/1599/G | [
"brute force",
"geometry",
"math",
"shortest paths"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 409
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1599-F | codeforces | 1599-F | Mars | https://codeforces.com/problemset/problem/1599/F | [
"hashing"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 414
} | 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.