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:1812-D | codeforces | 1812-D | Trivial Conjecture | https://codeforces.com/problemset/problem/1812/D | [
"*special",
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | null | {
"solved_count": 4969
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1812-C | codeforces | 1812-C | Digits | https://codeforces.com/problemset/problem/1812/C | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 1381
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1812-B | codeforces | 1812-B | Was it Rated? | https://codeforces.com/problemset/problem/1812/B | [
"*special",
"brute force",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 6103
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1812-A | codeforces | 1812-A | Are You a Robot? | https://codeforces.com/problemset/problem/1812/A | [
"*special",
"expression parsing",
"strings"
] | null | null | stdin_stdout | null | {
"solved_count": 14415
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1811-G2 | codeforces | 1811-G2 | Vlad and the Nice Paths (hard version) | https://codeforces.com/problemset/problem/1811/G2 | [
"binary search",
"combinatorics",
"data structures",
"dp",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2253
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1811-G1 | codeforces | 1811-G1 | Vlad and the Nice Paths (easy version) | https://codeforces.com/problemset/problem/1811/G1 | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2656
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1811-F | codeforces | 1811-F | Is It Flower? | https://codeforces.com/problemset/problem/1811/F | [
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2362
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1811-E | codeforces | 1811-E | Living Sequence | https://codeforces.com/problemset/problem/1811/E | [
"binary search",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14939
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1811-D | codeforces | 1811-D | Umka and a Long Flight | https://codeforces.com/problemset/problem/1811/D | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8874
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1811-C | codeforces | 1811-C | Restore the Array | https://codeforces.com/problemset/problem/1811/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22687
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1811-B | codeforces | 1811-B | Conveyor Belts | https://codeforces.com/problemset/problem/1811/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22707
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1811-A | codeforces | 1811-A | Insert Digit | https://codeforces.com/problemset/problem/1811/A | [
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 35287
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1810-H | codeforces | 1810-H | Last Number | https://codeforces.com/problemset/problem/1810/H | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 177
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1810-G | codeforces | 1810-G | The Maximum Prefix | https://codeforces.com/problemset/problem/1810/G | [
"dp"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 1408
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1810-F | codeforces | 1810-F | M-tree | https://codeforces.com/problemset/problem/1810/F | [
"data structures",
"math",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 715
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1810-E | codeforces | 1810-E | Monsters | https://codeforces.com/problemset/problem/1810/E | [
"brute force",
"data structures",
"dfs and similar",
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4105
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1810-D | codeforces | 1810-D | Climbing the Tree | https://codeforces.com/problemset/problem/1810/D | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8718
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1810-C | codeforces | 1810-C | Make It Permutation | https://codeforces.com/problemset/problem/1810/C | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16881
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1810-B | codeforces | 1810-B | Candies | https://codeforces.com/problemset/problem/1810/B | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19097
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1810-A | codeforces | 1810-A | Beautiful Sequence | https://codeforces.com/problemset/problem/1810/A | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22139
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1809-G | codeforces | 1809-G | Prediction | https://codeforces.com/problemset/problem/1809/G | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 692
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1809-F | codeforces | 1809-F | Traveling in Berland | https://codeforces.com/problemset/problem/1809/F | [
"binary search",
"data structures",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1002
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1809-E | codeforces | 1809-E | Two Tanks | https://codeforces.com/problemset/problem/1809/E | [
"binary search",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1147
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1809-D | codeforces | 1809-D | Binary String Sorting | https://codeforces.com/problemset/problem/1809/D | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7504
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1809-C | codeforces | 1809-C | Sum on Subarrays | https://codeforces.com/problemset/problem/1809/C | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15690
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1809-B | codeforces | 1809-B | Points on Plane | https://codeforces.com/problemset/problem/1809/B | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22902
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1809-A | codeforces | 1809-A | Garland | https://codeforces.com/problemset/problem/1809/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25421
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1808-E3 | codeforces | 1808-E3 | Minibuses on Venus (hard version) | https://codeforces.com/problemset/problem/1808/E3 | [
"brute force",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 667
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1808-E2 | codeforces | 1808-E2 | Minibuses on Venus (medium version) | https://codeforces.com/problemset/problem/1808/E2 | [
"combinatorics",
"divide and conquer",
"dp",
"matrices"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 910
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1808-E1 | codeforces | 1808-E1 | Minibuses on Venus (easy version) | https://codeforces.com/problemset/problem/1808/E1 | [
"combinatorics",
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1686
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1808-D | codeforces | 1808-D | Petya, Petya, Petr, and Palindromes | https://codeforces.com/problemset/problem/1808/D | [
"binary search",
"brute force",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2854
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1808-C | codeforces | 1808-C | Unlucky Numbers | https://codeforces.com/problemset/problem/1808/C | [
"brute force",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4453
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1808-B | codeforces | 1808-B | Playing in a Casino | https://codeforces.com/problemset/problem/1808/B | [
"math",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 33858
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1808-A | codeforces | 1808-A | Lucky Numbers | https://codeforces.com/problemset/problem/1808/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 21216
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1807-G2 | codeforces | 1807-G2 | Subsequence Addition (Hard Version) | https://codeforces.com/problemset/problem/1807/G2 | [
"bitmasks",
"dp",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 30674
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1807-G1 | codeforces | 1807-G1 | Subsequence Addition (Easy Version) | https://codeforces.com/problemset/problem/1807/G1 | [
"brute force",
"data structures",
"dp",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 23004
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1807-F | codeforces | 1807-F | Bouncy Ball | https://codeforces.com/problemset/problem/1807/F | [
"brute force",
"dfs and similar",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7535
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1807-E | codeforces | 1807-E | Interview | https://codeforces.com/problemset/problem/1807/E | [
"binary search",
"implementation",
"interactive"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17579
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1807-D | codeforces | 1807-D | Odd Queries | https://codeforces.com/problemset/problem/1807/D | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 65330
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1807-C | codeforces | 1807-C | Find and Replace | https://codeforces.com/problemset/problem/1807/C | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 35142
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1807-B | codeforces | 1807-B | Grab the Candies | https://codeforces.com/problemset/problem/1807/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 51008
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1807-A | codeforces | 1807-A | Plus or Minus | https://codeforces.com/problemset/problem/1807/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 90891
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1806-F2 | codeforces | 1806-F2 | GCD Master (hard version) | https://codeforces.com/problemset/problem/1806/F2 | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 494
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1806-F1 | codeforces | 1806-F1 | GCD Master (easy version) | https://codeforces.com/problemset/problem/1806/F1 | [
"greedy",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 488
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1806-E | codeforces | 1806-E | Tree Master | https://codeforces.com/problemset/problem/1806/E | [
"brute force",
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3603
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1806-D | codeforces | 1806-D | DSU Master | https://codeforces.com/problemset/problem/1806/D | [
"combinatorics",
"dp",
"dsu",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1315
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1806-C | codeforces | 1806-C | Sequence Master | https://codeforces.com/problemset/problem/1806/C | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8869
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1806-B | codeforces | 1806-B | Mex Master | https://codeforces.com/problemset/problem/1806/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 20107
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1806-A | codeforces | 1806-A | Walking Master | https://codeforces.com/problemset/problem/1806/A | [
"geometry",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 50096
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1805-F2 | codeforces | 1805-F2 | Survival of the Weakest (hard version) | https://codeforces.com/problemset/problem/1805/F2 | [
"greedy",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 542
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1805-F1 | codeforces | 1805-F1 | Survival of the Weakest (easy version) | https://codeforces.com/problemset/problem/1805/F1 | [
"binary search",
"brute force",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1489
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1805-E | codeforces | 1805-E | There Should Be a Lot of Maximums | https://codeforces.com/problemset/problem/1805/E | [
"brute force",
"data structures",
"dfs and similar",
"dp",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2003
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1805-D | codeforces | 1805-D | A Wide, Wide Graph | https://codeforces.com/problemset/problem/1805/D | [
"dfs and similar",
"dp",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 10098
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1805-C | codeforces | 1805-C | Place for a Selfie | https://codeforces.com/problemset/problem/1805/C | [
"binary search",
"data structures",
"geometry",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14516
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1805-B | codeforces | 1805-B | The String Has a Target | https://codeforces.com/problemset/problem/1805/B | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20670
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1805-A | codeforces | 1805-A | We Need the Zero | https://codeforces.com/problemset/problem/1805/A | [
"bitmasks",
"brute force"
] | null | null | stdin_stdout | 800 | {
"solved_count": 49399
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1804-H | codeforces | 1804-H | Code Lock | https://codeforces.com/problemset/problem/1804/H | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 283
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1804-G | codeforces | 1804-G | Flow Control | https://codeforces.com/problemset/problem/1804/G | [
"data structures",
"dsu",
"implementation"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 337
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1804-F | codeforces | 1804-F | Approximate Diameter | https://codeforces.com/problemset/problem/1804/F | [
"binary search",
"divide and conquer",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1230
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1804-E | codeforces | 1804-E | Routing | https://codeforces.com/problemset/problem/1804/E | [
"bitmasks",
"brute force",
"dfs and similar",
"dp",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1770
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1804-D | codeforces | 1804-D | Accommodation | https://codeforces.com/problemset/problem/1804/D | [
"brute force",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5407
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1804-C | codeforces | 1804-C | Pull Your Luck | https://codeforces.com/problemset/problem/1804/C | [
"brute force",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14148
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1804-B | codeforces | 1804-B | Vaccination | https://codeforces.com/problemset/problem/1804/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 15954
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1804-A | codeforces | 1804-A | Lame King | https://codeforces.com/problemset/problem/1804/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18830
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1802-B | codeforces | 1802-B | Settlement of Guinea Pigs | https://codeforces.com/problemset/problem/1802/B | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 14943
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1802-A | codeforces | 1802-A | Likes | https://codeforces.com/problemset/problem/1802/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16834
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1801-G | codeforces | 1801-G | A task for substrings | https://codeforces.com/problemset/problem/1801/G | [
"data structures",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 801
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1801-F | codeforces | 1801-F | Another n-dimensional chocolate bar | https://codeforces.com/problemset/problem/1801/F | [
"dp",
"math",
"meet-in-the-middle",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 779
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1801-E | codeforces | 1801-E | Gasoline prices | https://codeforces.com/problemset/problem/1801/E | [
"data structures",
"divide and conquer",
"dsu",
"hashing",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 805
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1801-D | codeforces | 1801-D | The way home | https://codeforces.com/problemset/problem/1801/D | [
"binary search",
"data structures",
"dp",
"graphs",
"greedy",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3056
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1801-C | codeforces | 1801-C | Music Festival | https://codeforces.com/problemset/problem/1801/C | [
"binary search",
"data structures",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4248
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1801-B | codeforces | 1801-B | Buying gifts | https://codeforces.com/problemset/problem/1801/B | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7868
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1801-A | codeforces | 1801-A | The Very Beautiful Blanket | https://codeforces.com/problemset/problem/1801/A | [
"bitmasks",
"constructive algorithms"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9958
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1800-G | codeforces | 1800-G | Symmetree | https://codeforces.com/problemset/problem/1800/G | [
"dfs and similar",
"hashing",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2686
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1800-F | codeforces | 1800-F | Dasha and Nightmares | https://codeforces.com/problemset/problem/1800/F | [
"bitmasks",
"hashing",
"meet-in-the-middle",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4949
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1800-E2 | codeforces | 1800-E2 | Unforgivable Curse (hard version) | https://codeforces.com/problemset/problem/1800/E2 | [
"brute force",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15842
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1800-E1 | codeforces | 1800-E1 | Unforgivable Curse (easy version) | https://codeforces.com/problemset/problem/1800/E1 | [
"brute force",
"constructive algorithms",
"dsu",
"graphs",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16146
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1800-D | codeforces | 1800-D | Remove Two Letters | https://codeforces.com/problemset/problem/1800/D | [
"data structures",
"greedy",
"hashing",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 30812
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1800-C2 | codeforces | 1800-C2 | Powering the Hero (hard version) | https://codeforces.com/problemset/problem/1800/C2 | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 28375
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1800-C1 | codeforces | 1800-C1 | Powering the Hero (easy version) | https://codeforces.com/problemset/problem/1800/C1 | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 27922
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1800-B | codeforces | 1800-B | Count the Number of Pairs | https://codeforces.com/problemset/problem/1800/B | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 29297
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1800-A | codeforces | 1800-A | Is It a Cat? | https://codeforces.com/problemset/problem/1800/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 38009
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1799-H | codeforces | 1799-H | Tree Cutting | https://codeforces.com/problemset/problem/1799/H | [
"bitmasks",
"dfs and similar",
"dp"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 552
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1799-G | codeforces | 1799-G | Count Voting | https://codeforces.com/problemset/problem/1799/G | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1147
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1799-F | codeforces | 1799-F | Halve or Subtract | https://codeforces.com/problemset/problem/1799/F | [
"binary search",
"brute force",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1145
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1799-E | codeforces | 1799-E | City Union | https://codeforces.com/problemset/problem/1799/E | [
"constructive algorithms",
"dfs and similar",
"dsu",
"geometry",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1452
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1799-D2 | codeforces | 1799-D2 | Hot Start Up (hard version) | https://codeforces.com/problemset/problem/1799/D2 | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3255
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1799-D1 | codeforces | 1799-D1 | Hot Start Up (easy version) | https://codeforces.com/problemset/problem/1799/D1 | [
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6274
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1799-C | codeforces | 1799-C | Double Lexicographically Minimum | https://codeforces.com/problemset/problem/1799/C | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7111
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1799-B | codeforces | 1799-B | Equalize by Divide | https://codeforces.com/problemset/problem/1799/B | [
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 13040
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1799-A | codeforces | 1799-A | Recent Actions | https://codeforces.com/problemset/problem/1799/A | [
"data structures",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12535
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1798-F | codeforces | 1798-F | Gifts from Grandfather Ahmed | https://codeforces.com/problemset/problem/1798/F | [
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 701
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1798-E | codeforces | 1798-E | Multitest Generator | https://codeforces.com/problemset/problem/1798/E | [
"brute force",
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2150
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1798-D | codeforces | 1798-D | Shocking Arrangement | https://codeforces.com/problemset/problem/1798/D | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15419
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1798-C | codeforces | 1798-C | Candy Store | https://codeforces.com/problemset/problem/1798/C | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9659
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1798-B | codeforces | 1798-B | Three Sevens | https://codeforces.com/problemset/problem/1798/B | [
"brute force",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19200
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1798-A | codeforces | 1798-A | Showstopper | https://codeforces.com/problemset/problem/1798/A | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21230
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1797-F | codeforces | 1797-F | Li Hua and Path | https://codeforces.com/problemset/problem/1797/F | [
"data structures",
"dfs and similar",
"divide and conquer",
"dsu",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 738
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1797-E | codeforces | 1797-E | Li Hua and Array | https://codeforces.com/problemset/problem/1797/E | [
"brute force",
"data structures",
"dsu",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1739
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1797-D | codeforces | 1797-D | Li Hua and Tree | https://codeforces.com/problemset/problem/1797/D | [
"brute force",
"data structures",
"dfs and similar",
"dp",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4775
} | 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.