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:1654-C | codeforces | 1654-C | Alice and the Cake | https://codeforces.com/problemset/problem/1654/C | [
"data structures",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14573
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1654-B | codeforces | 1654-B | Prefix Removals | https://codeforces.com/problemset/problem/1654/B | [
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16788
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1654-A | codeforces | 1654-A | Maximum Cake Tastiness | https://codeforces.com/problemset/problem/1654/A | [
"brute force",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19407
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1651-F | codeforces | 1651-F | Tower Defense | https://codeforces.com/problemset/problem/1651/F | [
"binary search",
"brute force",
"data structures"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 482
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1651-E | codeforces | 1651-E | Sum of Matchings | https://codeforces.com/problemset/problem/1651/E | [
"brute force",
"combinatorics",
"constructive algorithms",
"dfs and similar",
"graph matchings",
"greedy",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 621
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1651-D | codeforces | 1651-D | Nearest Excluded Points | https://codeforces.com/problemset/problem/1651/D | [
"binary search",
"data structures",
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6557
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1651-C | codeforces | 1651-C | Fault-tolerant Network | https://codeforces.com/problemset/problem/1651/C | [
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11598
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1651-B | codeforces | 1651-B | Prove Him Wrong | https://codeforces.com/problemset/problem/1651/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20489
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1651-A | codeforces | 1651-A | Playoff | https://codeforces.com/problemset/problem/1651/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26692
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1650-G | codeforces | 1650-G | Counting Shortcuts | https://codeforces.com/problemset/problem/1650/G | [
"data structures",
"dfs and similar",
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2972
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1650-F | codeforces | 1650-F | Vitaly and Advanced Useless Algorithms | https://codeforces.com/problemset/problem/1650/F | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1675
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1650-E | codeforces | 1650-E | Rescheduling the Exam | https://codeforces.com/problemset/problem/1650/E | [
"binary search",
"data structures",
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4474
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1650-D | codeforces | 1650-D | Twist the Permutation | https://codeforces.com/problemset/problem/1650/D | [
"brute force",
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15272
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1650-C | codeforces | 1650-C | Weight of the System of Nested Segments | https://codeforces.com/problemset/problem/1650/C | [
"greedy",
"hashing",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18571
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1650-B | codeforces | 1650-B | DIV + MOD | https://codeforces.com/problemset/problem/1650/B | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 30069
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1650-A | codeforces | 1650-A | Deletions of Two Adjacent Letters | https://codeforces.com/problemset/problem/1650/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 37383
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1649-B | codeforces | 1649-B | Game of Ball Passing | https://codeforces.com/problemset/problem/1649/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13975
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1649-A | codeforces | 1649-A | Game | https://codeforces.com/problemset/problem/1649/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16062
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1648-F | codeforces | 1648-F | Two Avenues | https://codeforces.com/problemset/problem/1648/F | [
"data structures",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 186
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1648-E | codeforces | 1648-E | Air Reform | https://codeforces.com/problemset/problem/1648/E | [
"data structures",
"dfs and similar",
"divide and conquer",
"dsu",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 516
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1648-D | codeforces | 1648-D | Serious Business | https://codeforces.com/problemset/problem/1648/D | [
"data structures",
"divide and conquer",
"dp",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1052
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1648-C | codeforces | 1648-C | Tyler and Strings | https://codeforces.com/problemset/problem/1648/C | [
"combinatorics",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3348
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1648-B | codeforces | 1648-B | Integral Array | https://codeforces.com/problemset/problem/1648/B | [
"brute force",
"constructive algorithms",
"data structures",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7313
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1648-A | codeforces | 1648-A | Weird Sum | https://codeforces.com/problemset/problem/1648/A | [
"combinatorics",
"data structures",
"geometry",
"math",
"matrices",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 19066
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1647-F | codeforces | 1647-F | Madoka and Laziness | https://codeforces.com/problemset/problem/1647/F | [
"dp",
"greedy"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 544
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1647-E | codeforces | 1647-E | Madoka and the Sixth-graders | https://codeforces.com/problemset/problem/1647/E | [
"data structures",
"dfs and similar",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1098
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1647-D | codeforces | 1647-D | Madoka and the Best School in Russia | https://codeforces.com/problemset/problem/1647/D | [
"constructive algorithms",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5713
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1647-C | codeforces | 1647-C | Madoka and Childish Pranks | https://codeforces.com/problemset/problem/1647/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13356
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1647-B | codeforces | 1647-B | Madoka and the Elegant Gift | https://codeforces.com/problemset/problem/1647/B | [
"brute force",
"constructive algorithms",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17142
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1647-A | codeforces | 1647-A | Madoka and Math Dad | https://codeforces.com/problemset/problem/1647/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23507
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1646-F | codeforces | 1646-F | Playing Around the Table | https://codeforces.com/problemset/problem/1646/F | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 683
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1646-E | codeforces | 1646-E | Power Board | https://codeforces.com/problemset/problem/1646/E | [
"brute force",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2764
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1646-D | codeforces | 1646-D | Weight the Tree | https://codeforces.com/problemset/problem/1646/D | [
"constructive algorithms",
"dfs and similar",
"dp",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4459
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1646-C | codeforces | 1646-C | Factorials and Powers of Two | https://codeforces.com/problemset/problem/1646/C | [
"bitmasks",
"brute force",
"constructive algorithms",
"dp",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 19806
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1646-B | codeforces | 1646-B | Quality vs Quantity | https://codeforces.com/problemset/problem/1646/B | [
"brute force",
"constructive algorithms",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22713
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1646-A | codeforces | 1646-A | Square Counting | https://codeforces.com/problemset/problem/1646/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25426
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1644-F | codeforces | 1644-F | Basis | https://codeforces.com/problemset/problem/1644/F | [
"combinatorics",
"fft",
"math",
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 430
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1644-E | codeforces | 1644-E | Expand the Path | https://codeforces.com/problemset/problem/1644/E | [
"brute force",
"combinatorics",
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3491
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1644-D | codeforces | 1644-D | Cross Coloring | https://codeforces.com/problemset/problem/1644/D | [
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7889
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1644-C | codeforces | 1644-C | Increase Subarray Sums | https://codeforces.com/problemset/problem/1644/C | [
"brute force",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15031
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1644-B | codeforces | 1644-B | Anti-Fibonacci Permutation | https://codeforces.com/problemset/problem/1644/B | [
"brute force",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21331
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1644-A | codeforces | 1644-A | Doors and Keys | https://codeforces.com/problemset/problem/1644/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28675
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1642-B | codeforces | 1642-B | Power Walking | https://codeforces.com/problemset/problem/1642/B | [
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18283
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1642-A | codeforces | 1642-A | Hard Way | https://codeforces.com/problemset/problem/1642/A | [
"geometry"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16751
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1641-F | codeforces | 1641-F | Covering Circle | https://codeforces.com/problemset/problem/1641/F | [
"geometry"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 120
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1641-E | codeforces | 1641-E | Special Positions | https://codeforces.com/problemset/problem/1641/E | [
"combinatorics",
"divide and conquer",
"fft",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 290
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1641-D | codeforces | 1641-D | Two Arrays | https://codeforces.com/problemset/problem/1641/D | [
"bitmasks",
"brute force",
"combinatorics",
"greedy",
"hashing",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1520
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1641-C | codeforces | 1641-C | Anonymity Is Important | https://codeforces.com/problemset/problem/1641/C | [
"binary search",
"brute force",
"data structures",
"dsu",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2851
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1641-B | codeforces | 1641-B | Repetitions Decoding | https://codeforces.com/problemset/problem/1641/B | [
"constructive algorithms",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4077
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1641-A | codeforces | 1641-A | Great Sequence | https://codeforces.com/problemset/problem/1641/A | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19016
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1639-K | codeforces | 1639-K | Treasure Hunt | https://codeforces.com/problemset/problem/1639/K | [
"graphs",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 0
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1639-J | codeforces | 1639-J | Treasure Hunt | https://codeforces.com/problemset/problem/1639/J | [
"graphs",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 0
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1639-I | codeforces | 1639-I | Treasure Hunt | https://codeforces.com/problemset/problem/1639/I | [
"graphs",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 0
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1639-H | codeforces | 1639-H | Treasure Hunt | https://codeforces.com/problemset/problem/1639/H | [
"graphs",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 0
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1639-G | codeforces | 1639-G | Treasure Hunt | https://codeforces.com/problemset/problem/1639/G | [
"graphs",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 0
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1639-F | codeforces | 1639-F | Treasure Hunt | https://codeforces.com/problemset/problem/1639/F | [
"graphs",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 0
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1639-E | codeforces | 1639-E | Treasure Hunt | https://codeforces.com/problemset/problem/1639/E | [
"graphs",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 0
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1639-D | codeforces | 1639-D | Treasure Hunt | https://codeforces.com/problemset/problem/1639/D | [
"graphs",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 0
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1639-C | codeforces | 1639-C | Treasure Hunt | https://codeforces.com/problemset/problem/1639/C | [
"graphs",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 0
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1639-B | codeforces | 1639-B | Treasure Hunt | https://codeforces.com/problemset/problem/1639/B | [
"graphs",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 0
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1639-A | codeforces | 1639-A | Treasure Hunt | https://codeforces.com/problemset/problem/1639/A | [
"graphs",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 0
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1638-F | codeforces | 1638-F | Two Posters | https://codeforces.com/problemset/problem/1638/F | [
"brute force",
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 261
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1638-E | codeforces | 1638-E | Colorful Operations | https://codeforces.com/problemset/problem/1638/E | [
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2387
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1638-D | codeforces | 1638-D | Big Brush | https://codeforces.com/problemset/problem/1638/D | [
"constructive algorithms",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4756
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1638-C | codeforces | 1638-C | Inversion Graph | https://codeforces.com/problemset/problem/1638/C | [
"data structures",
"dsu",
"graphs",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15976
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1638-B | codeforces | 1638-B | Odd Swap Sort | https://codeforces.com/problemset/problem/1638/B | [
"data structures",
"math",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22598
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1638-A | codeforces | 1638-A | Reverse | https://codeforces.com/problemset/problem/1638/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22158
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1637-H | codeforces | 1637-H | Minimize Inversions Number | https://codeforces.com/problemset/problem/1637/H | [
"data structures",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 573
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1637-G | codeforces | 1637-G | Birthday | https://codeforces.com/problemset/problem/1637/G | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 621
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1637-F | codeforces | 1637-F | Towers | https://codeforces.com/problemset/problem/1637/F | [
"constructive algorithms",
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2172
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1637-E | codeforces | 1637-E | Best Pair | https://codeforces.com/problemset/problem/1637/E | [
"binary search",
"brute force",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3819
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1637-D | codeforces | 1637-D | Yet Another Minimization Problem | https://codeforces.com/problemset/problem/1637/D | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8952
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1637-C | codeforces | 1637-C | Andrew and Stones | https://codeforces.com/problemset/problem/1637/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18763
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1637-B | codeforces | 1637-B | MEX and Array | https://codeforces.com/problemset/problem/1637/B | [
"brute force",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15466
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1637-A | codeforces | 1637-A | Sorting Parts | https://codeforces.com/problemset/problem/1637/A | [
"brute force",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24155
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1635-F | codeforces | 1635-F | Closest Pair | https://codeforces.com/problemset/problem/1635/F | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1397
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1635-E | codeforces | 1635-E | Cars | https://codeforces.com/problemset/problem/1635/E | [
"2-sat",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2736
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1635-D | codeforces | 1635-D | Infinite Set | https://codeforces.com/problemset/problem/1635/D | [
"bitmasks",
"dp",
"math",
"matrices",
"number theory",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7068
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1635-C | codeforces | 1635-C | Differential Sorting | https://codeforces.com/problemset/problem/1635/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 25543
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1635-B | codeforces | 1635-B | Avoid Local Maximums | https://codeforces.com/problemset/problem/1635/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18489
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1635-A | codeforces | 1635-A | Min Or Sum | https://codeforces.com/problemset/problem/1635/A | [
"bitmasks",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26053
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1634-F | codeforces | 1634-F | Fibonacci Additions | https://codeforces.com/problemset/problem/1634/F | [
"brute force",
"data structures",
"hashing",
"implementation",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1911
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1634-E | codeforces | 1634-E | Fair Share | https://codeforces.com/problemset/problem/1634/E | [
"constructive algorithms",
"data structures",
"dfs and similar",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2213
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1634-D | codeforces | 1634-D | Finding Zero | https://codeforces.com/problemset/problem/1634/D | [
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4770
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1634-C | codeforces | 1634-C | OKEA | https://codeforces.com/problemset/problem/1634/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19104
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1634-B | codeforces | 1634-B | Fortune Telling | https://codeforces.com/problemset/problem/1634/B | [
"bitmasks",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 22599
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1634-A | codeforces | 1634-A | Reverse and Concatenate | https://codeforces.com/problemset/problem/1634/A | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24668
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1633-F | codeforces | 1633-F | Perfect Matching | https://codeforces.com/problemset/problem/1633/F | [
"data structures",
"divide and conquer",
"interactive",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 377
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1633-E | codeforces | 1633-E | Spanning Tree Queries | https://codeforces.com/problemset/problem/1633/E | [
"binary search",
"data structures",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"math",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1759
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1633-D | codeforces | 1633-D | Make Them Equal | https://codeforces.com/problemset/problem/1633/D | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 18977
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1633-C | codeforces | 1633-C | Kill the Monster | https://codeforces.com/problemset/problem/1633/C | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21280
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1633-B | codeforces | 1633-B | Minority | https://codeforces.com/problemset/problem/1633/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29440
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1633-A | codeforces | 1633-A | Div. 7 | https://codeforces.com/problemset/problem/1633/A | [
"brute force"
] | null | null | stdin_stdout | 800 | {
"solved_count": 36118
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1632-E2 | codeforces | 1632-E2 | Distance Tree (hard version) | https://codeforces.com/problemset/problem/1632/E2 | [
"binary search",
"dfs and similar",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1203
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1632-E1 | codeforces | 1632-E1 | Distance Tree (easy version) | https://codeforces.com/problemset/problem/1632/E1 | [
"binary search",
"data structures",
"dfs and similar",
"graphs",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1345
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1632-D | codeforces | 1632-D | New Year Concert | https://codeforces.com/problemset/problem/1632/D | [
"binary search",
"data structures",
"greedy",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5359
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1632-C | codeforces | 1632-C | Strange Test | https://codeforces.com/problemset/problem/1632/C | [
"binary search",
"bitmasks",
"brute force",
"dp",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14139
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1632-B | codeforces | 1632-B | Roof Construction | https://codeforces.com/problemset/problem/1632/B | [
"bitmasks",
"constructive algorithms"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 32017
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1632-A | codeforces | 1632-A | ABC | https://codeforces.com/problemset/problem/1632/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31106
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1631-B | codeforces | 1631-B | Fun with Even Subarrays | https://codeforces.com/problemset/problem/1631/B | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 27225
} | 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.