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:1838-F | codeforces | 1838-F | Stuck Conveyor | https://codeforces.com/problemset/problem/1838/F | [
"binary search",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 384
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1838-E | codeforces | 1838-E | Count Supersequences | https://codeforces.com/problemset/problem/1838/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1867
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1838-D | codeforces | 1838-D | Bracket Walk | https://codeforces.com/problemset/problem/1838/D | [
"data structures",
"greedy",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3724
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1838-C | codeforces | 1838-C | No Prime Differences | https://codeforces.com/problemset/problem/1838/C | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17414
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1838-B | codeforces | 1838-B | Minimize Permutation Subarrays | https://codeforces.com/problemset/problem/1838/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17828
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1838-A | codeforces | 1838-A | Blackboard List | https://codeforces.com/problemset/problem/1838/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22704
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1837-F | codeforces | 1837-F | Editorial for Two | https://codeforces.com/problemset/problem/1837/F | [
"binary search",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2672
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1837-E | codeforces | 1837-E | Playoff Fixing | https://codeforces.com/problemset/problem/1837/E | [
"combinatorics",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2524
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1837-D | codeforces | 1837-D | Bracket Coloring | https://codeforces.com/problemset/problem/1837/D | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 22328
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1837-C | codeforces | 1837-C | Best Binary String | https://codeforces.com/problemset/problem/1837/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 24655
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1837-B | codeforces | 1837-B | Comparison String | https://codeforces.com/problemset/problem/1837/B | [
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 51130
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1837-A | codeforces | 1837-A | Grasshopper on a Line | https://codeforces.com/problemset/problem/1837/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 55998
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1836-B | codeforces | 1836-B | Astrophysicists | https://codeforces.com/problemset/problem/1836/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 13614
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1836-A | codeforces | 1836-A | Destroyer | https://codeforces.com/problemset/problem/1836/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21463
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1835-F | codeforces | 1835-F | Good Graph | https://codeforces.com/problemset/problem/1835/F | [
"bitmasks",
"dfs and similar",
"graph matchings",
"graphs",
"implementation"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 235
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1835-E | codeforces | 1835-E | Old Mobile | https://codeforces.com/problemset/problem/1835/E | [
"combinatorics",
"dp",
"probabilities"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 281
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1835-D | codeforces | 1835-D | Doctor's Brown Hypothesis | https://codeforces.com/problemset/problem/1835/D | [
"dfs and similar",
"graphs",
"math",
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 658
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1835-C | codeforces | 1835-C | Twin Clusters | https://codeforces.com/problemset/problem/1835/C | [
"bitmasks",
"brute force",
"constructive algorithms",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1174
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1835-B | codeforces | 1835-B | Lottery | https://codeforces.com/problemset/problem/1835/B | [
"binary search",
"brute force",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1090
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1835-A | codeforces | 1835-A | k-th equality | https://codeforces.com/problemset/problem/1835/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8762
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1834-F | codeforces | 1834-F | Typewriter | https://codeforces.com/problemset/problem/1834/F | [
"brute force",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 663
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1834-E | codeforces | 1834-E | MEX of LCM | https://codeforces.com/problemset/problem/1834/E | [
"binary search",
"data structures",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2784
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1834-D | codeforces | 1834-D | Survey in Class | https://codeforces.com/problemset/problem/1834/D | [
"brute force",
"data structures",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5574
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1834-C | codeforces | 1834-C | Game with Reversing | https://codeforces.com/problemset/problem/1834/C | [
"games",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 15102
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1834-B | codeforces | 1834-B | Maximum Strength | https://codeforces.com/problemset/problem/1834/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17074
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1834-A | codeforces | 1834-A | Unit Array | https://codeforces.com/problemset/problem/1834/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 46825
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1833-G | codeforces | 1833-G | Ksyusha and Chinchilla | https://codeforces.com/problemset/problem/1833/G | [
"constructive algorithms",
"dfs and similar",
"dp",
"dsu",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6415
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1833-F | codeforces | 1833-F | Ira and Flamenco | https://codeforces.com/problemset/problem/1833/F | [
"combinatorics",
"constructive algorithms",
"data structures",
"implementation",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10267
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1833-E | codeforces | 1833-E | Round Dance | https://codeforces.com/problemset/problem/1833/E | [
"dfs and similar",
"dsu",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 18767
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1833-D | codeforces | 1833-D | Flipper | https://codeforces.com/problemset/problem/1833/D | [
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15141
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1833-C | codeforces | 1833-C | Vlad Building Beautiful Array | https://codeforces.com/problemset/problem/1833/C | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27948
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1833-B | codeforces | 1833-B | Restore the Weather | https://codeforces.com/problemset/problem/1833/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 29697
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1833-A | codeforces | 1833-A | Musical Puzzle | https://codeforces.com/problemset/problem/1833/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 35179
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1832-F | codeforces | 1832-F | Zombies | https://codeforces.com/problemset/problem/1832/F | [
"binary search",
"dp"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 357
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1832-E | codeforces | 1832-E | Combinatorics Problem | https://codeforces.com/problemset/problem/1832/E | [
"brute force",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2559
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1832-D2 | codeforces | 1832-D2 | Red-Blue Operations (Hard Version) | https://codeforces.com/problemset/problem/1832/D2 | [
"binary search",
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2362
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1832-D1 | codeforces | 1832-D1 | Red-Blue Operations (Easy Version) | https://codeforces.com/problemset/problem/1832/D1 | [
"binary search",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3400
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1832-C | codeforces | 1832-C | Contrast Value | https://codeforces.com/problemset/problem/1832/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 35072
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1832-B | codeforces | 1832-B | Maximum Sum | https://codeforces.com/problemset/problem/1832/B | [
"brute force",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 36350
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1832-A | codeforces | 1832-A | New Palindrome | https://codeforces.com/problemset/problem/1832/A | [
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29190
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1831-B | codeforces | 1831-B | Array merging | https://codeforces.com/problemset/problem/1831/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 35789
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1831-A | codeforces | 1831-A | Twin Permutations | https://codeforces.com/problemset/problem/1831/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 47329
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1830-F | codeforces | 1830-F | The Third Grace | https://codeforces.com/problemset/problem/1830/F | [
"data structures",
"dp"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 392
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1830-E | codeforces | 1830-E | Bully Sort | https://codeforces.com/problemset/problem/1830/E | [
"data structures",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 327
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1830-D | codeforces | 1830-D | Mex Tree | https://codeforces.com/problemset/problem/1830/D | [
"brute force",
"dp",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 943
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1830-C | codeforces | 1830-C | Hyperregular Bracket Strings | https://codeforces.com/problemset/problem/1830/C | [
"combinatorics",
"greedy",
"hashing",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2211
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1830-B | codeforces | 1830-B | The BOSS Can Count Pairs | https://codeforces.com/problemset/problem/1830/B | [
"brute force",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5882
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1830-A | codeforces | 1830-A | Copil Copac Draws Trees | https://codeforces.com/problemset/problem/1830/A | [
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 20612
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1829-H | codeforces | 1829-H | Don't Blame Me | https://codeforces.com/problemset/problem/1829/H | [
"bitmasks",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10944
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1829-G | codeforces | 1829-G | Hits Different | https://codeforces.com/problemset/problem/1829/G | [
"data structures",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15379
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1829-F | codeforces | 1829-F | Forever Winter | https://codeforces.com/problemset/problem/1829/F | [
"dfs and similar",
"graphs",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 21977
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1829-E | codeforces | 1829-E | The Lakes | https://codeforces.com/problemset/problem/1829/E | [
"dfs and similar",
"dsu",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 26991
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1829-D | codeforces | 1829-D | Gold Rush | https://codeforces.com/problemset/problem/1829/D | [
"brute force",
"dfs and similar",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 34401
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1829-C | codeforces | 1829-C | Mr. Perfectly Fine | https://codeforces.com/problemset/problem/1829/C | [
"bitmasks",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32574
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1829-B | codeforces | 1829-B | Blank Space | https://codeforces.com/problemset/problem/1829/B | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 79532
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1829-A | codeforces | 1829-A | Love Story | https://codeforces.com/problemset/problem/1829/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 71324
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1828-B | codeforces | 1828-B | Permutation Swap | https://codeforces.com/problemset/problem/1828/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 40129
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1828-A | codeforces | 1828-A | Divisible Array | https://codeforces.com/problemset/problem/1828/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25400
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1827-F | codeforces | 1827-F | Copium Permutation | https://codeforces.com/problemset/problem/1827/F | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 135
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1827-E | codeforces | 1827-E | Bus Routes | https://codeforces.com/problemset/problem/1827/E | [
"binary search",
"constructive algorithms",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 560
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1827-D | codeforces | 1827-D | Two Centroids | https://codeforces.com/problemset/problem/1827/D | [
"data structures",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 989
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1827-C | codeforces | 1827-C | Palindrome Partition | https://codeforces.com/problemset/problem/1827/C | [
"binary search",
"brute force",
"data structures",
"dp",
"hashing",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1668
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1827-B2 | codeforces | 1827-B2 | Range Sorting (Hard Version) | https://codeforces.com/problemset/problem/1827/B2 | [
"binary search",
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2325
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1827-B1 | codeforces | 1827-B1 | Range Sorting (Easy Version) | https://codeforces.com/problemset/problem/1827/B1 | [
"binary search",
"dp",
"dsu",
"greedy",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4553
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1827-A | codeforces | 1827-A | Counting Orders | https://codeforces.com/problemset/problem/1827/A | [
"combinatorics",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 29294
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1826-F | codeforces | 1826-F | Fading into Fog | https://codeforces.com/problemset/problem/1826/F | [
"geometry",
"interactive",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 460
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1826-E | codeforces | 1826-E | Walk the Runway | https://codeforces.com/problemset/problem/1826/E | [
"bitmasks",
"brute force",
"data structures",
"dp",
"graphs",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1966
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1826-D | codeforces | 1826-D | Running Miles | https://codeforces.com/problemset/problem/1826/D | [
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 15182
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1826-C | codeforces | 1826-C | Dreaming of Freedom | https://codeforces.com/problemset/problem/1826/C | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15739
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1826-B | codeforces | 1826-B | Lunatic Never Content | https://codeforces.com/problemset/problem/1826/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 28666
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1826-A | codeforces | 1826-A | Trust Nobody | https://codeforces.com/problemset/problem/1826/A | [
"brute force",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17345
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1825-B | codeforces | 1825-B | LuoTianyi and the Table | https://codeforces.com/problemset/problem/1825/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16161
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1825-A | codeforces | 1825-A | LuoTianyi and the Palindrome String | https://codeforces.com/problemset/problem/1825/A | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20803
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1824-E | codeforces | 1824-E | LuoTianyi and Cartridge | https://codeforces.com/problemset/problem/1824/E | [
"data structures",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 188
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1824-D | codeforces | 1824-D | LuoTianyi and the Function | https://codeforces.com/problemset/problem/1824/D | [
"data structures"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 660
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1824-C | codeforces | 1824-C | LuoTianyi and XOR-Tree | https://codeforces.com/problemset/problem/1824/C | [
"data structures",
"dfs and similar",
"dp",
"dsu",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1692
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1824-B2 | codeforces | 1824-B2 | LuoTianyi and the Floating Islands (Hard Version) | https://codeforces.com/problemset/problem/1824/B2 | [
"combinatorics",
"dfs and similar",
"math",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3457
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1824-B1 | codeforces | 1824-B1 | LuoTianyi and the Floating Islands (Easy Version) | https://codeforces.com/problemset/problem/1824/B1 | [
"combinatorics",
"math",
"probabilities",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6089
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1824-A | codeforces | 1824-A | LuoTianyi and the Show | https://codeforces.com/problemset/problem/1824/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12565
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1823-F | codeforces | 1823-F | Random Walk | https://codeforces.com/problemset/problem/1823/F | [
"dp",
"graphs",
"math",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1300
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1823-E | codeforces | 1823-E | Removing Graph | https://codeforces.com/problemset/problem/1823/E | [
"brute force",
"dp",
"games",
"graphs",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1453
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1823-D | codeforces | 1823-D | Unique Palindromes | https://codeforces.com/problemset/problem/1823/D | [
"constructive algorithms",
"math",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4325
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1823-C | codeforces | 1823-C | Strongly Composite | https://codeforces.com/problemset/problem/1823/C | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13901
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1823-B | codeforces | 1823-B | Sort with Step | https://codeforces.com/problemset/problem/1823/B | [
"brute force",
"math",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18183
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1823-A | codeforces | 1823-A | A-characteristic | https://codeforces.com/problemset/problem/1823/A | [
"combinatorics",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17204
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1822-G2 | codeforces | 1822-G2 | Magic Triples (Hard Version) | https://codeforces.com/problemset/problem/1822/G2 | [
"brute force",
"data structures",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3067
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1822-G1 | codeforces | 1822-G1 | Magic Triples (Easy Version) | https://codeforces.com/problemset/problem/1822/G1 | [
"brute force",
"data structures",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9597
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1822-F | codeforces | 1822-F | Gardening Friends | https://codeforces.com/problemset/problem/1822/F | [
"brute force",
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7699
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1822-E | codeforces | 1822-E | Making Anti-Palindromes | https://codeforces.com/problemset/problem/1822/E | [
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12434
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1822-D | codeforces | 1822-D | Super-Permutation | https://codeforces.com/problemset/problem/1822/D | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19069
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1822-C | codeforces | 1822-C | Bun Lover | https://codeforces.com/problemset/problem/1822/C | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24828
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1822-B | codeforces | 1822-B | Karina and Array | https://codeforces.com/problemset/problem/1822/B | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26645
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1822-A | codeforces | 1822-A | TubeTube Feed | https://codeforces.com/problemset/problem/1822/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26067
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1821-F | codeforces | 1821-F | Timber | https://codeforces.com/problemset/problem/1821/F | [
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 957
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1821-E | codeforces | 1821-E | Rearrange Brackets | https://codeforces.com/problemset/problem/1821/E | [
"brute force",
"dp",
"greedy",
"sortings",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2719
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1821-D | codeforces | 1821-D | Black Cells | https://codeforces.com/problemset/problem/1821/D | [
"binary search",
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5549
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1821-C | codeforces | 1821-C | Tear It Apart | https://codeforces.com/problemset/problem/1821/C | [
"brute force",
"implementation",
"math",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16250
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1821-B | codeforces | 1821-B | Sort the Subarray | https://codeforces.com/problemset/problem/1821/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 28839
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1821-A | codeforces | 1821-A | Matching | https://codeforces.com/problemset/problem/1821/A | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21237
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1820-B | codeforces | 1820-B | JoJo's Incredible Adventures | https://codeforces.com/problemset/problem/1820/B | [
"math",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 23437
} | 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.