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:1456-E | codeforces | 1456-E | XOR-ranges | https://codeforces.com/problemset/problem/1456/E | [
"dp",
"greedy"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 398
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1455-G | codeforces | 1455-G | Forbidden Value | https://codeforces.com/problemset/problem/1455/G | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 558
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1455-F | codeforces | 1455-F | String and Operations | https://codeforces.com/problemset/problem/1455/F | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 539
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1455-E | codeforces | 1455-E | Four Points | https://codeforces.com/problemset/problem/1455/E | [
"brute force",
"constructive algorithms",
"flows",
"geometry",
"greedy",
"implementation",
"math",
"ternary search"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1711
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1455-D | codeforces | 1455-D | Sequence and Swaps | https://codeforces.com/problemset/problem/1455/D | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13445
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1455-C | codeforces | 1455-C | Ping-pong | https://codeforces.com/problemset/problem/1455/C | [
"constructive algorithms",
"games",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20672
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1455-B | codeforces | 1455-B | Jumps | https://codeforces.com/problemset/problem/1455/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 23688
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1455-A | codeforces | 1455-A | Strange Functions | https://codeforces.com/problemset/problem/1455/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27638
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1454-F | codeforces | 1454-F | Array Partition | https://codeforces.com/problemset/problem/1454/F | [
"binary search",
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5059
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1454-E | codeforces | 1454-E | Number of Simple Paths | https://codeforces.com/problemset/problem/1454/E | [
"combinatorics",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 7166
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1454-D | codeforces | 1454-D | Number into Sequence | https://codeforces.com/problemset/problem/1454/D | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 22814
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1454-C | codeforces | 1454-C | Sequence Transformation | https://codeforces.com/problemset/problem/1454/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 22800
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1454-B | codeforces | 1454-B | Unique Bid Auction | https://codeforces.com/problemset/problem/1454/B | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30391
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1454-A | codeforces | 1454-A | Special Permutation | https://codeforces.com/problemset/problem/1454/A | [
"constructive algorithms",
"probabilities"
] | null | null | stdin_stdout | 800 | {
"solved_count": 45129
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1453-F | codeforces | 1453-F | Even Harder | https://codeforces.com/problemset/problem/1453/F | [
"dp"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1098
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1453-E | codeforces | 1453-E | Dog Snacks | https://codeforces.com/problemset/problem/1453/E | [
"binary search",
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2303
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1453-D | codeforces | 1453-D | Checkpoints | https://codeforces.com/problemset/problem/1453/D | [
"brute force",
"constructive algorithms",
"greedy",
"math",
"probabilities"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4503
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1453-C | codeforces | 1453-C | Triangles | https://codeforces.com/problemset/problem/1453/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6304
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1453-B | codeforces | 1453-B | Suffix Operations | https://codeforces.com/problemset/problem/1453/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14269
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1453-A | codeforces | 1453-A | Cancel the Trains | https://codeforces.com/problemset/problem/1453/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25479
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1452-G | codeforces | 1452-G | Game On Tree | https://codeforces.com/problemset/problem/1452/G | [
"data structures",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 587
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1452-F | codeforces | 1452-F | Divide Powers | https://codeforces.com/problemset/problem/1452/F | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 416
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1452-E | codeforces | 1452-E | Two Editorials | https://codeforces.com/problemset/problem/1452/E | [
"brute force",
"dp",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1784
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1452-D | codeforces | 1452-D | Radio Towers | https://codeforces.com/problemset/problem/1452/D | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8875
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1452-C | codeforces | 1452-C | Two Brackets | https://codeforces.com/problemset/problem/1452/C | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21526
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1452-B | codeforces | 1452-B | Toy Blocks | https://codeforces.com/problemset/problem/1452/B | [
"binary search",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15710
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1452-A | codeforces | 1452-A | Robot Program | https://codeforces.com/problemset/problem/1452/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23218
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1451-F | codeforces | 1451-F | Nullify The Matrix | https://codeforces.com/problemset/problem/1451/F | [
"constructive algorithms",
"games"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1321
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1451-E2 | codeforces | 1451-E2 | Bitwise Queries (Hard Version) | https://codeforces.com/problemset/problem/1451/E2 | [
"bitmasks",
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 4051
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1451-E1 | codeforces | 1451-E1 | Bitwise Queries (Easy Version) | https://codeforces.com/problemset/problem/1451/E1 | [
"bitmasks",
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5687
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1451-D | codeforces | 1451-D | Circle Game | https://codeforces.com/problemset/problem/1451/D | [
"games",
"geometry",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10421
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1451-C | codeforces | 1451-C | String Equality | https://codeforces.com/problemset/problem/1451/C | [
"dp",
"greedy",
"hashing",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17592
} | 2026-11-02T05:37:07.883505+00:00 |
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": 20606
} | 2026-11-02T05:37:07.883505+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": 25585
} | 2026-11-02T05:37:07.883505+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": 388
} | 2026-11-02T05:37:07.883505+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": 670
} | 2026-11-02T05:37:07.883505+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": 454
} | 2026-11-02T05:37:07.883505+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": 1506
} | 2026-11-02T05:37:07.883505+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": 1642
} | 2026-11-02T05:37:07.883505+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": 5909
} | 2026-11-02T05:37:07.883505+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": 4546
} | 2026-11-02T05:37:07.883505+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": 6080
} | 2026-11-02T05:37:07.883505+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": 16182
} | 2026-11-02T05:37:07.883505+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": 18607
} | 2026-11-02T05:37:07.883505+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": 29950
} | 2026-11-02T05:37:07.883505+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": 14525
} | 2026-11-02T05:37:07.883505+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": 489
} | 2026-11-02T05:37:07.883505+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": 132
} | 2026-11-02T05:37:07.883505+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": 2099
} | 2026-11-02T05:37:07.883505+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": 2238
} | 2026-11-02T05:37:07.883505+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": 4273
} | 2026-11-02T05:37:07.883505+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": 9537
} | 2026-11-02T05:37:07.883505+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": 18342
} | 2026-11-02T05:37:07.883505+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": 16073
} | 2026-11-02T05:37:07.883505+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": 20544
} | 2026-11-02T05:37:07.883505+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-11-02T05:37:07.883505+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": 710
} | 2026-11-02T05:37:07.883505+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": 2015
} | 2026-11-02T05:37:07.883505+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": 6899
} | 2026-11-02T05:37:07.883505+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": 14764
} | 2026-11-02T05:37:07.883505+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": 1604
} | 2026-11-02T05:37:07.883505+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": 17295
} | 2026-11-02T05:37:07.883505+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": 16853
} | 2026-11-02T05:37:07.883505+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": 16775
} | 2026-11-02T05:37:07.883505+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": 175
} | 2026-11-02T05:37:07.883505+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": 842
} | 2026-11-02T05:37:07.883505+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": 3258
} | 2026-11-02T05:37:07.883505+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": 2109
} | 2026-11-02T05:37:07.883505+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": 5597
} | 2026-11-02T05:37:07.883505+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": 9946
} | 2026-11-02T05:37:07.883505+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": 34427
} | 2026-11-02T05:37:07.883505+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": 20496
} | 2026-11-02T05:37:07.883505+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": 317
} | 2026-11-02T05:37:07.883505+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": 622
} | 2026-11-02T05:37:07.883505+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": 2409
} | 2026-11-02T05:37:07.883505+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": 1709
} | 2026-11-02T05:37:07.883505+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": 5461
} | 2026-11-02T05:37:07.883505+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": 9863
} | 2026-11-02T05:37:07.883505+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": 832
} | 2026-11-02T05:37:07.883505+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": 1525
} | 2026-11-02T05:37:07.883505+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": 4722
} | 2026-11-02T05:37:07.883505+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": 12030
} | 2026-11-02T05:37:07.883505+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": 32389
} | 2026-11-02T05:37:07.883505+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": 19851
} | 2026-11-02T05:37:07.883505+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": 1426
} | 2026-11-02T05:37:07.883505+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": 1774
} | 2026-11-02T05:37:07.883505+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": 4127
} | 2026-11-02T05:37:07.883505+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": 14787
} | 2026-11-02T05:37:07.883505+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": 12802
} | 2026-11-02T05:37:07.883505+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": 21254
} | 2026-11-02T05:37:07.883505+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": 18548
} | 2026-11-02T05:37:07.883505+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": 736
} | 2026-11-02T05:37:07.883505+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": 3033
} | 2026-11-02T05:37:07.883505+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": 6607
} | 2026-11-02T05:37:07.883505+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": 11942
} | 2026-11-02T05:37:07.883505+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": 21920
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1436-A | codeforces | 1436-A | Reorder | https://codeforces.com/problemset/problem/1436/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23753
} | 2026-11-02T05:37:07.883505+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": 340
} | 2026-11-02T05:37:07.883505+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": 5519
} | 2026-11-02T05:37:07.883505+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": 6981
} | 2026-11-02T05:37:07.883505+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.