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:1870-A | codeforces | 1870-A | MEXanized Array | https://codeforces.com/problemset/problem/1870/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20259
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1869-B | codeforces | 1869-B | 2D Traveling | https://codeforces.com/problemset/problem/1869/B | [
"geometry",
"math",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 26238
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1869-A | codeforces | 1869-A | Make It Zero | https://codeforces.com/problemset/problem/1869/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 900 | {
"solved_count": 40990
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1868-F | codeforces | 1868-F | LIS? | https://codeforces.com/problemset/problem/1868/F | [
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 98
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1868-E | codeforces | 1868-E | Min-Sum-Max | https://codeforces.com/problemset/problem/1868/E | [
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 113
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1868-D | codeforces | 1868-D | Flower-like Pseudotree | https://codeforces.com/problemset/problem/1868/D | [
"constructive algorithms",
"graphs",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 383
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1868-C | codeforces | 1868-C | Travel Plan | https://codeforces.com/problemset/problem/1868/C | [
"combinatorics",
"dp",
"implementation",
"math",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1377
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1868-B2 | codeforces | 1868-B2 | Candy Party (Hard Version) | https://codeforces.com/problemset/problem/1868/B2 | [
"bitmasks",
"constructive algorithms",
"dp",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2767
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1868-B1 | codeforces | 1868-B1 | Candy Party (Easy Version) | https://codeforces.com/problemset/problem/1868/B1 | [
"bitmasks",
"constructive algorithms",
"graphs",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8352
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1868-A | codeforces | 1868-A | Fill in the Matrix | https://codeforces.com/problemset/problem/1868/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13636
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1867-F | codeforces | 1867-F | Most Different Tree | https://codeforces.com/problemset/problem/1867/F | [
"brute force",
"constructive algorithms",
"dfs and similar",
"greedy",
"hashing"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 511
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1867-E2 | codeforces | 1867-E2 | Salyg1n and Array (hard version) | https://codeforces.com/problemset/problem/1867/E2 | [
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3769
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1867-E1 | codeforces | 1867-E1 | Salyg1n and Array (simple version) | https://codeforces.com/problemset/problem/1867/E1 | [
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4352
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1867-D | codeforces | 1867-D | Cyclic Operations | https://codeforces.com/problemset/problem/1867/D | [
"brute force",
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6896
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1867-C | codeforces | 1867-C | Salyg1n and the MEX Game | https://codeforces.com/problemset/problem/1867/C | [
"constructive algorithms",
"data structures",
"games",
"greedy",
"interactive"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12695
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1867-B | codeforces | 1867-B | XOR Palindromes | https://codeforces.com/problemset/problem/1867/B | [
"bitmasks",
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 18686
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1867-A | codeforces | 1867-A | green_gold_dog, array and permutation | https://codeforces.com/problemset/problem/1867/A | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21157
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1866-M | codeforces | 1866-M | Mighty Rock Tower | https://codeforces.com/problemset/problem/1866/M | [
"brute force",
"combinatorics",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 978
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1866-L | codeforces | 1866-L | Lihmuf Balling | https://codeforces.com/problemset/problem/1866/L | [
"binary search",
"brute force",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 881
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1866-K | codeforces | 1866-K | Keen Tree Calculation | https://codeforces.com/problemset/problem/1866/K | [
"binary search",
"data structures",
"dp",
"geometry",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 560
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1866-J | codeforces | 1866-J | Jackets and Packets | https://codeforces.com/problemset/problem/1866/J | [
"dp"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 441
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1866-I | codeforces | 1866-I | Imagination Castle | https://codeforces.com/problemset/problem/1866/I | [
"dp",
"games",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 938
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1866-H | codeforces | 1866-H | Happy Sets | https://codeforces.com/problemset/problem/1866/H | [
"combinatorics"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1921
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1866-G | codeforces | 1866-G | Grouped Carriages | https://codeforces.com/problemset/problem/1866/G | [
"binary search",
"data structures",
"dp",
"flows",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2194
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1866-F | codeforces | 1866-F | Freak Joker Process | https://codeforces.com/problemset/problem/1866/F | [
"binary search",
"data structures",
"sortings"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 156
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1866-E | codeforces | 1866-E | Elevators of Tamem | https://codeforces.com/problemset/problem/1866/E | [
"dp"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 535
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1866-D | codeforces | 1866-D | Digital Wallet | https://codeforces.com/problemset/problem/1866/D | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1577
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1866-C | codeforces | 1866-C | Completely Searching for Inversions | https://codeforces.com/problemset/problem/1866/C | [
"dfs and similar",
"dp",
"graphs"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3433
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1866-B | codeforces | 1866-B | Battling with Numbers | https://codeforces.com/problemset/problem/1866/B | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9225
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1866-A | codeforces | 1866-A | Ambitious Kid | https://codeforces.com/problemset/problem/1866/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 52863
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1864-I | codeforces | 1864-I | Future Dominators | https://codeforces.com/problemset/problem/1864/I | [
"graphs",
"greedy"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 107
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1864-H | codeforces | 1864-H | Asterism Stream | https://codeforces.com/problemset/problem/1864/H | [
"dp",
"math",
"matrices"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 495
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1864-G | codeforces | 1864-G | Magic Square | https://codeforces.com/problemset/problem/1864/G | [
"combinatorics",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 315
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1864-F | codeforces | 1864-F | Exotic Queries | https://codeforces.com/problemset/problem/1864/F | [
"data structures",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1645
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1864-E | codeforces | 1864-E | Guess Game | https://codeforces.com/problemset/problem/1864/E | [
"bitmasks",
"data structures",
"games",
"math",
"probabilities",
"sortings",
"strings",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3067
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1864-D | codeforces | 1864-D | Matrix Cascade | https://codeforces.com/problemset/problem/1864/D | [
"brute force",
"constructive algorithms",
"data structures",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7665
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1864-C | codeforces | 1864-C | Divisor Chain | https://codeforces.com/problemset/problem/1864/C | [
"bitmasks",
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15323
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1864-B | codeforces | 1864-B | Swap and Reverse | https://codeforces.com/problemset/problem/1864/B | [
"constructive algorithms",
"greedy",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16688
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1864-A | codeforces | 1864-A | Increasing and Decreasing | https://codeforces.com/problemset/problem/1864/A | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21453
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1863-I | codeforces | 1863-I | Redundant Routes | https://codeforces.com/problemset/problem/1863/I | [
"constructive algorithms",
"dp",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 128
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1863-H | codeforces | 1863-H | Goldberg Machine 3 | https://codeforces.com/problemset/problem/1863/H | [
"dp",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 112
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1863-G | codeforces | 1863-G | Swaps | https://codeforces.com/problemset/problem/1863/G | [
"combinatorics",
"dp",
"graphs",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 833
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1863-F | codeforces | 1863-F | Divide, XOR, and Conquer | https://codeforces.com/problemset/problem/1863/F | [
"bitmasks",
"dp",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1357
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1863-E | codeforces | 1863-E | Speedrun | https://codeforces.com/problemset/problem/1863/E | [
"brute force",
"dfs and similar",
"dp",
"graphs",
"greedy",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3207
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1863-D | codeforces | 1863-D | Two-Colored Dominoes | https://codeforces.com/problemset/problem/1863/D | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10804
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1863-C | codeforces | 1863-C | MEX Repetition | https://codeforces.com/problemset/problem/1863/C | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15568
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1863-B | codeforces | 1863-B | Split Sort | https://codeforces.com/problemset/problem/1863/B | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16839
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1863-A | codeforces | 1863-A | Channel | https://codeforces.com/problemset/problem/1863/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18891
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1862-G | codeforces | 1862-G | The Great Equalizer | https://codeforces.com/problemset/problem/1862/G | [
"binary search",
"data structures",
"math",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3468
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1862-F | codeforces | 1862-F | Magic Will Save the World | https://codeforces.com/problemset/problem/1862/F | [
"binary search",
"bitmasks",
"brute force",
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7657
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1862-E | codeforces | 1862-E | Kolya and Movie Theatre | https://codeforces.com/problemset/problem/1862/E | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12850
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1862-D | codeforces | 1862-D | Ice Cream Balls | https://codeforces.com/problemset/problem/1862/D | [
"binary search",
"combinatorics",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 19931
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1862-C | codeforces | 1862-C | Flower City Fence | https://codeforces.com/problemset/problem/1862/C | [
"binary search",
"data structures",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 23137
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1862-B | codeforces | 1862-B | Sequence Game | https://codeforces.com/problemset/problem/1862/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 56568
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1862-A | codeforces | 1862-A | Gift Carpet | https://codeforces.com/problemset/problem/1862/A | [
"dp",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 36409
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1861-F | codeforces | 1861-F | Four Suits | https://codeforces.com/problemset/problem/1861/F | [
"binary search",
"bitmasks",
"flows",
"greedy"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 299
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1861-E | codeforces | 1861-E | Non-Intersecting Subpermutations | https://codeforces.com/problemset/problem/1861/E | [
"combinatorics",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2052
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1861-D | codeforces | 1861-D | Sorting By Multiplication | https://codeforces.com/problemset/problem/1861/D | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7995
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1861-C | codeforces | 1861-C | Queries for the Array | https://codeforces.com/problemset/problem/1861/C | [
"data structures",
"dfs and similar",
"implementation",
"strings",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12358
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1861-B | codeforces | 1861-B | Two Binary Strings | https://codeforces.com/problemset/problem/1861/B | [
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 24114
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1861-A | codeforces | 1861-A | Prime Deletion | https://codeforces.com/problemset/problem/1861/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25986
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1860-F | codeforces | 1860-F | Evaluate RBS | https://codeforces.com/problemset/problem/1860/F | [
"data structures",
"geometry",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 323
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1860-E | codeforces | 1860-E | Fast Travel Text Editor | https://codeforces.com/problemset/problem/1860/E | [
"data structures",
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1825
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1860-D | codeforces | 1860-D | Balanced String | https://codeforces.com/problemset/problem/1860/D | [
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3628
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1860-C | codeforces | 1860-C | Game on Permutation | https://codeforces.com/problemset/problem/1860/C | [
"data structures",
"dp",
"games",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15656
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1860-B | codeforces | 1860-B | Fancy Coins | https://codeforces.com/problemset/problem/1860/B | [
"binary search",
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18992
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1860-A | codeforces | 1860-A | Not a Substring | https://codeforces.com/problemset/problem/1860/A | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 23644
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1859-F | codeforces | 1859-F | Teleportation in Byteland | https://codeforces.com/problemset/problem/1859/F | [
"data structures",
"dfs and similar",
"divide and conquer",
"graphs",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 526
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1859-E | codeforces | 1859-E | Maximum Monogonosity | https://codeforces.com/problemset/problem/1859/E | [
"brute force",
"dp",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2124
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1859-D | codeforces | 1859-D | Andrey and Escape from Capygrad | https://codeforces.com/problemset/problem/1859/D | [
"binary search",
"data structures",
"dp",
"dsu",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8027
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1859-C | codeforces | 1859-C | Another Permutation Problem | https://codeforces.com/problemset/problem/1859/C | [
"brute force",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18717
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1859-B | codeforces | 1859-B | Olya and Game with Arrays | https://codeforces.com/problemset/problem/1859/B | [
"constructive algorithms",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 44712
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1859-A | codeforces | 1859-A | United We Stand | https://codeforces.com/problemset/problem/1859/A | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 55973
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1858-E2 | codeforces | 1858-E2 | Rollbacks (Hard Version) | https://codeforces.com/problemset/problem/1858/E2 | [
"data structures",
"interactive",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1270
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1858-E1 | codeforces | 1858-E1 | Rollbacks (Easy Version) | https://codeforces.com/problemset/problem/1858/E1 | [
"brute force",
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1565
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1858-D | codeforces | 1858-D | Trees and Segments | https://codeforces.com/problemset/problem/1858/D | [
"brute force",
"data structures",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3206
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1858-C | codeforces | 1858-C | Yet Another Permutation Problem | https://codeforces.com/problemset/problem/1858/C | [
"constructive algorithms",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 25583
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1858-B | codeforces | 1858-B | The Walkway | https://codeforces.com/problemset/problem/1858/B | [
"brute force",
"dp",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13077
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1858-A | codeforces | 1858-A | Buttons | https://codeforces.com/problemset/problem/1858/A | [
"games",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 67876
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1857-G | codeforces | 1857-G | Counting Graphs | https://codeforces.com/problemset/problem/1857/G | [
"combinatorics",
"divide and conquer",
"dsu",
"graphs",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5522
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1857-F | codeforces | 1857-F | Sum and Product | https://codeforces.com/problemset/problem/1857/F | [
"binary search",
"data structures",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14410
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1857-E | codeforces | 1857-E | Power of Points | https://codeforces.com/problemset/problem/1857/E | [
"math",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14910
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1857-D | codeforces | 1857-D | Strong Vertices | https://codeforces.com/problemset/problem/1857/D | [
"math",
"sortings",
"trees"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 29754
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1857-C | codeforces | 1857-C | Assembly via Minimums | https://codeforces.com/problemset/problem/1857/C | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 42465
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1857-B | codeforces | 1857-B | Maximum Rounding | https://codeforces.com/problemset/problem/1857/B | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 24758
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1857-A | codeforces | 1857-A | Array Coloring | https://codeforces.com/problemset/problem/1857/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 80483
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1856-E2 | codeforces | 1856-E2 | PermuTree (hard version) | https://codeforces.com/problemset/problem/1856/E2 | [
"bitmasks",
"dfs and similar",
"dp",
"fft",
"greedy",
"implementation",
"math",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1761
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1856-E1 | codeforces | 1856-E1 | PermuTree (easy version) | https://codeforces.com/problemset/problem/1856/E1 | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6472
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1856-D | codeforces | 1856-D | More Wrong | https://codeforces.com/problemset/problem/1856/D | [
"divide and conquer",
"interactive"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3813
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1856-C | codeforces | 1856-C | To Become Max | https://codeforces.com/problemset/problem/1856/C | [
"binary search",
"brute force",
"data structures",
"dp"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 18622
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1856-B | codeforces | 1856-B | Good Arrays | https://codeforces.com/problemset/problem/1856/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 27571
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1856-A | codeforces | 1856-A | Tales of a Sort | https://codeforces.com/problemset/problem/1856/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28201
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1855-B | codeforces | 1855-B | Longest Divisors Interval | https://codeforces.com/problemset/problem/1855/B | [
"brute force",
"combinatorics",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 45888
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1855-A | codeforces | 1855-A | Dalton the Teacher | https://codeforces.com/problemset/problem/1855/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29981
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1854-F | codeforces | 1854-F | Mark and Spaceship | https://codeforces.com/problemset/problem/1854/F | [
"brute force",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 140
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1854-E | codeforces | 1854-E | Game Bundles | https://codeforces.com/problemset/problem/1854/E | [
"brute force",
"constructive algorithms",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 529
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1854-D | codeforces | 1854-D | Michael and Hotel | https://codeforces.com/problemset/problem/1854/D | [
"binary search",
"interactive",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 657
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1854-C | codeforces | 1854-C | Expected Destruction | https://codeforces.com/problemset/problem/1854/C | [
"combinatorics",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1799
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1854-B | codeforces | 1854-B | Earn or Unlock | https://codeforces.com/problemset/problem/1854/B | [
"bitmasks",
"brute force",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4251
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1854-A2 | codeforces | 1854-A2 | Dual (Hard Version) | https://codeforces.com/problemset/problem/1854/A2 | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7900
} | 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.