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:1451-B | codeforces | 1451-B | Non-Substring Subsequence | https://codeforces.com/problemset/problem/1451/B | [
"dp",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 20466
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1451-A | codeforces | 1451-A | Subtract or Divide | https://codeforces.com/problemset/problem/1451/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25396
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1450-H2 | codeforces | 1450-H2 | Multithreading (Hard Version) | https://codeforces.com/problemset/problem/1450/H2 | [
"combinatorics",
"implementation",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 386
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1450-H1 | codeforces | 1450-H1 | Multithreading (Easy Version) | https://codeforces.com/problemset/problem/1450/H1 | [
"combinatorics",
"fft",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 653
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1450-G | codeforces | 1450-G | Communism | https://codeforces.com/problemset/problem/1450/G | [
"bitmasks",
"dp",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 429
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1450-F | codeforces | 1450-F | The Struggling Contestant | https://codeforces.com/problemset/problem/1450/F | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1495
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1450-E | codeforces | 1450-E | Capitalism | https://codeforces.com/problemset/problem/1450/E | [
"constructive algorithms",
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1548
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1450-D | codeforces | 1450-D | Rating Compression | https://codeforces.com/problemset/problem/1450/D | [
"binary search",
"data structures",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5859
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1450-C2 | codeforces | 1450-C2 | Errich-Tac-Toe (Hard Version) | https://codeforces.com/problemset/problem/1450/C2 | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 4391
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1450-C1 | codeforces | 1450-C1 | Errich-Tac-Toe (Easy Version) | https://codeforces.com/problemset/problem/1450/C1 | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 6019
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1450-B | codeforces | 1450-B | Balls of Steel | https://codeforces.com/problemset/problem/1450/B | [
"brute force",
"geometry",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16118
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1450-A | codeforces | 1450-A | Avoid Trygub | https://codeforces.com/problemset/problem/1450/A | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18537
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1447-B | codeforces | 1447-B | Numbers Box | https://codeforces.com/problemset/problem/1447/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 28579
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1447-A | codeforces | 1447-A | Add Candies | https://codeforces.com/problemset/problem/1447/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14493
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1446-F | codeforces | 1446-F | Line Distance | https://codeforces.com/problemset/problem/1446/F | [
"binary search",
"data structures",
"geometry"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 485
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1446-E | codeforces | 1446-E | Long Recovery | https://codeforces.com/problemset/problem/1446/E | [
"constructive algorithms",
"dfs and similar"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 130
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1446-D2 | codeforces | 1446-D2 | Frequency Problem (Hard Version) | https://codeforces.com/problemset/problem/1446/D2 | [
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 2012
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1446-D1 | codeforces | 1446-D1 | Frequency Problem (Easy Version) | https://codeforces.com/problemset/problem/1446/D1 | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 2186
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1446-C | codeforces | 1446-C | Xor Tree | https://codeforces.com/problemset/problem/1446/C | [
"binary search",
"bitmasks",
"data structures",
"divide and conquer",
"dp",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4176
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1446-B | codeforces | 1446-B | Catching Cheaters | https://codeforces.com/problemset/problem/1446/B | [
"dp",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9323
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1446-A | codeforces | 1446-A | Knapsack | https://codeforces.com/problemset/problem/1446/A | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18109
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1445-B | codeforces | 1445-B | Elimination | https://codeforces.com/problemset/problem/1445/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 15999
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1445-A | codeforces | 1445-A | Array Rearrangment | https://codeforces.com/problemset/problem/1445/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20422
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1444-E | codeforces | 1444-E | Finding the Vertex | https://codeforces.com/problemset/problem/1444/E | [
"brute force",
"dfs and similar",
"dp",
"interactive",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 172
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1444-D | codeforces | 1444-D | Rectangular Polyline | https://codeforces.com/problemset/problem/1444/D | [
"constructive algorithms",
"dp",
"geometry"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 697
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1444-C | codeforces | 1444-C | Team-Building | https://codeforces.com/problemset/problem/1444/C | [
"data structures",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1949
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1444-B | codeforces | 1444-B | Divide and Sum | https://codeforces.com/problemset/problem/1444/B | [
"combinatorics",
"math",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6836
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1444-A | codeforces | 1444-A | Division | https://codeforces.com/problemset/problem/1444/A | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14655
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1443-E | codeforces | 1443-E | Long Permutation | https://codeforces.com/problemset/problem/1443/E | [
"brute force",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1586
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1443-C | codeforces | 1443-C | The Delivery Dilemma | https://codeforces.com/problemset/problem/1443/C | [
"binary search",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17062
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1443-B | codeforces | 1443-B | Saving the City | https://codeforces.com/problemset/problem/1443/B | [
"dp",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16754
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1443-A | codeforces | 1443-A | Kids Seating | https://codeforces.com/problemset/problem/1443/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16738
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1442-F | codeforces | 1442-F | Differentiating Games | https://codeforces.com/problemset/problem/1442/F | [
"games",
"interactive"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 173
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1442-E | codeforces | 1442-E | Black, White and Grey Tree | https://codeforces.com/problemset/problem/1442/E | [
"binary search",
"constructive algorithms",
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 805
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1442-D | codeforces | 1442-D | Sum | https://codeforces.com/problemset/problem/1442/D | [
"data structures",
"divide and conquer",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 3119
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1442-C | codeforces | 1442-C | Graph Transpositions | https://codeforces.com/problemset/problem/1442/C | [
"dfs and similar",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2032
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1442-B | codeforces | 1442-B | Identify the Operations | https://codeforces.com/problemset/problem/1442/B | [
"combinatorics",
"data structures",
"dsu",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5435
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1442-A | codeforces | 1442-A | Extreme Subtraction | https://codeforces.com/problemset/problem/1442/A | [
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9837
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1440-B | codeforces | 1440-B | Sum of Medians | https://codeforces.com/problemset/problem/1440/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 32661
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1440-A | codeforces | 1440-A | Buy the String | https://codeforces.com/problemset/problem/1440/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20445
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1439-E | codeforces | 1439-E | Cheat and Win | https://codeforces.com/problemset/problem/1439/E | [
"bitmasks",
"data structures",
"games",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 315
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1439-D | codeforces | 1439-D | INOI Final Contests | https://codeforces.com/problemset/problem/1439/D | [
"combinatorics",
"dp",
"fft"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 609
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1439-C | codeforces | 1439-C | Greedy Shopping | https://codeforces.com/problemset/problem/1439/C | [
"binary search",
"data structures",
"divide and conquer",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 2301
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1439-B | codeforces | 1439-B | Graph Subset Problem | https://codeforces.com/problemset/problem/1439/B | [
"constructive algorithms",
"data structures",
"graphs"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1691
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1439-A2 | codeforces | 1439-A2 | Binary Table (Hard Version) | https://codeforces.com/problemset/problem/1439/A2 | [
"constructive algorithms",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5418
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1439-A1 | codeforces | 1439-A1 | Binary Table (Easy Version) | https://codeforces.com/problemset/problem/1439/A1 | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9837
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1438-F | codeforces | 1438-F | Olha and Igor | https://codeforces.com/problemset/problem/1438/F | [
"interactive",
"probabilities",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 815
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1438-E | codeforces | 1438-E | Yurii Can Do Everything | https://codeforces.com/problemset/problem/1438/E | [
"binary search",
"bitmasks",
"brute force",
"constructive algorithms",
"divide and conquer",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1503
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1438-D | codeforces | 1438-D | Powerful Ksenia | https://codeforces.com/problemset/problem/1438/D | [
"bitmasks",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4655
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1438-C | codeforces | 1438-C | Engineer Artem | https://codeforces.com/problemset/problem/1438/C | [
"2-sat",
"chinese remainder theorem",
"constructive algorithms",
"fft",
"flows"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 11854
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1438-B | codeforces | 1438-B | Valerii Against Everyone | https://codeforces.com/problemset/problem/1438/B | [
"constructive algorithms",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 31060
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1438-A | codeforces | 1438-A | Specific Tastes of Andre | https://codeforces.com/problemset/problem/1438/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19804
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1437-G | codeforces | 1437-G | Death DBMS | https://codeforces.com/problemset/problem/1437/G | [
"data structures",
"string suffix structures",
"strings",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1364
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1437-F | codeforces | 1437-F | Emotional Fishermen | https://codeforces.com/problemset/problem/1437/F | [
"combinatorics",
"dp",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1687
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1437-E | codeforces | 1437-E | Make It Increasing | https://codeforces.com/problemset/problem/1437/E | [
"binary search",
"constructive algorithms",
"data structures",
"dp",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4028
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1437-D | codeforces | 1437-D | Minimal Height Tree | https://codeforces.com/problemset/problem/1437/D | [
"graphs",
"greedy",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14616
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1437-C | codeforces | 1437-C | Chef Monocarp | https://codeforces.com/problemset/problem/1437/C | [
"dp",
"flows",
"graph matchings",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 12547
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1437-B | codeforces | 1437-B | Reverse Binary Strings | https://codeforces.com/problemset/problem/1437/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 21090
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1437-A | codeforces | 1437-A | Marketing Scheme | https://codeforces.com/problemset/problem/1437/A | [
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18513
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1436-F | codeforces | 1436-F | Sum Over Subsets | https://codeforces.com/problemset/problem/1436/F | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 717
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1436-E | codeforces | 1436-E | Complicated Computations | https://codeforces.com/problemset/problem/1436/E | [
"binary search",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2970
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1436-D | codeforces | 1436-D | Bandit in a City | https://codeforces.com/problemset/problem/1436/D | [
"binary search",
"dfs and similar",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6567
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1436-C | codeforces | 1436-C | Binary Search | https://codeforces.com/problemset/problem/1436/C | [
"binary search",
"combinatorics"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11876
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1436-B | codeforces | 1436-B | Prime Square | https://codeforces.com/problemset/problem/1436/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 21825
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1436-A | codeforces | 1436-A | Reorder | https://codeforces.com/problemset/problem/1436/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23635
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1434-E | codeforces | 1434-E | A Convex Game | https://codeforces.com/problemset/problem/1434/E | [
"dsu",
"games"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 337
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1433-G | codeforces | 1433-G | Reducing Delivery Cost | https://codeforces.com/problemset/problem/1433/G | [
"brute force",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5353
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1433-F | codeforces | 1433-F | Zero Remainder Sum | https://codeforces.com/problemset/problem/1433/F | [
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 6881
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1433-E | codeforces | 1433-E | Two Round Dances | https://codeforces.com/problemset/problem/1433/E | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 20071
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1433-D | codeforces | 1433-D | Districts Connection | https://codeforces.com/problemset/problem/1433/D | [
"constructive algorithms",
"dfs and similar"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 32175
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1433-C | codeforces | 1433-C | Dominant Piranha | https://codeforces.com/problemset/problem/1433/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 28884
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1433-B | codeforces | 1433-B | Yet Another Bookshelf | https://codeforces.com/problemset/problem/1433/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30051
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1433-A | codeforces | 1433-A | Boring Apartments | https://codeforces.com/problemset/problem/1433/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 63785
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1431-J | codeforces | 1431-J | Zero-XOR Array | https://codeforces.com/problemset/problem/1431/J | [
"*special",
"dp"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 55
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1431-I | codeforces | 1431-I | Cyclic Shifts | https://codeforces.com/problemset/problem/1431/I | [
"*special",
"strings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 56
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1431-H | codeforces | 1431-H | Rogue-like Game | https://codeforces.com/problemset/problem/1431/H | [
"*special",
"brute force",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 82
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1431-G | codeforces | 1431-G | Number Deletion Game | https://codeforces.com/problemset/problem/1431/G | [
"*special",
"dp",
"games",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 215
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1431-F | codeforces | 1431-F | Neural Network Problem | https://codeforces.com/problemset/problem/1431/F | [
"*special",
"binary search",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 165
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1431-E | codeforces | 1431-E | Chess Match | https://codeforces.com/problemset/problem/1431/E | [
"*special"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 235
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1431-D | codeforces | 1431-D | Used Markers | https://codeforces.com/problemset/problem/1431/D | [
"*special",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 491
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1431-C | codeforces | 1431-C | Black Friday | https://codeforces.com/problemset/problem/1431/C | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 748
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1431-B | codeforces | 1431-B | Polycarp and the Language of Gods | https://codeforces.com/problemset/problem/1431/B | [
"*special",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 1057
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1431-A | codeforces | 1431-A | Selling Hamburgers | https://codeforces.com/problemset/problem/1431/A | [
"*special"
] | null | null | stdin_stdout | 800 | {
"solved_count": 2181
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1430-G | codeforces | 1430-G | Yet Another DAG Problem | https://codeforces.com/problemset/problem/1430/G | [
"bitmasks",
"dfs and similar",
"dp",
"flows",
"graphs",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 955
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1430-F | codeforces | 1430-F | Realistic Gameplay | https://codeforces.com/problemset/problem/1430/F | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1085
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1430-E | codeforces | 1430-E | String Reversal | https://codeforces.com/problemset/problem/1430/E | [
"data structures",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7430
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1430-D | codeforces | 1430-D | String Deletion | https://codeforces.com/problemset/problem/1430/D | [
"binary search",
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9426
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1430-C | codeforces | 1430-C | Numbers on Whiteboard | https://codeforces.com/problemset/problem/1430/C | [
"constructive algorithms",
"data structures",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 28859
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1430-B | codeforces | 1430-B | Barrels | https://codeforces.com/problemset/problem/1430/B | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20414
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1430-A | codeforces | 1430-A | Number of Apartments | https://codeforces.com/problemset/problem/1430/A | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 21961
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1428-H | codeforces | 1428-H | Rotary Laser Lock | https://codeforces.com/problemset/problem/1428/H | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 131
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1428-G2 | codeforces | 1428-G2 | Lucky Numbers (Hard Version) | https://codeforces.com/problemset/problem/1428/G2 | [
"dp",
"greedy"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 851
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1428-G1 | codeforces | 1428-G1 | Lucky Numbers (Easy Version) | https://codeforces.com/problemset/problem/1428/G1 | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 710
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1428-F | codeforces | 1428-F | Fruit Sequences | https://codeforces.com/problemset/problem/1428/F | [
"binary search",
"data structures",
"divide and conquer",
"dp",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2647
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1428-E | codeforces | 1428-E | Carrots for Rabbits | https://codeforces.com/problemset/problem/1428/E | [
"binary search",
"data structures",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4359
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1428-D | codeforces | 1428-D | Bouncing Boomerangs | https://codeforces.com/problemset/problem/1428/D | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4751
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1428-C | codeforces | 1428-C | ABBB | https://codeforces.com/problemset/problem/1428/C | [
"brute force",
"data structures",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22916
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1428-B | codeforces | 1428-B | Belted Rooms | https://codeforces.com/problemset/problem/1428/B | [
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 15292
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1428-A | codeforces | 1428-A | Box is Pull | https://codeforces.com/problemset/problem/1428/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17073
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1427-H | codeforces | 1427-H | Prison Break | https://codeforces.com/problemset/problem/1427/H | [
"binary search",
"games",
"geometry",
"ternary search"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 97
} | 2026-08-10T02:20:32.917453+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.