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:1417-B | codeforces | 1417-B | Two Arrays | https://codeforces.com/problemset/problem/1417/B | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15174
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1417-A | codeforces | 1417-A | Copy-paste | https://codeforces.com/problemset/problem/1417/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18827
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1416-F | codeforces | 1416-F | Showing Off | https://codeforces.com/problemset/problem/1416/F | [
"flows",
"graph matchings",
"greedy",
"implementation"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 740
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1416-E | codeforces | 1416-E | Split | https://codeforces.com/problemset/problem/1416/E | [
"binary search",
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 563
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1416-D | codeforces | 1416-D | Graph and Queries | https://codeforces.com/problemset/problem/1416/D | [
"data structures",
"dsu",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 3087
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1416-C | codeforces | 1416-C | XOR Inverse | https://codeforces.com/problemset/problem/1416/C | [
"bitmasks",
"data structures",
"divide and conquer",
"dp",
"greedy",
"math",
"sortings",
"strings",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5370
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1416-B | codeforces | 1416-B | Make Them Equal | https://codeforces.com/problemset/problem/1416/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6836
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1416-A | codeforces | 1416-A | k-Amazing Numbers | https://codeforces.com/problemset/problem/1416/A | [
"binary search",
"data structures",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 18148
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1415-F | codeforces | 1415-F | Cakes for Clones | https://codeforces.com/problemset/problem/1415/F | [
"dp"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 630
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1415-E | codeforces | 1415-E | New Game Plus! | https://codeforces.com/problemset/problem/1415/E | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3080
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1415-D | codeforces | 1415-D | XOR-gun | https://codeforces.com/problemset/problem/1415/D | [
"bitmasks",
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6329
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1415-C | codeforces | 1415-C | Bouncing Ball | https://codeforces.com/problemset/problem/1415/C | [
"brute force",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11893
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1415-B | codeforces | 1415-B | Repainting Street | https://codeforces.com/problemset/problem/1415/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12620
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1415-A | codeforces | 1415-A | Prison Break | https://codeforces.com/problemset/problem/1415/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15969
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1413-F | codeforces | 1413-F | Roads and Ramen | https://codeforces.com/problemset/problem/1413/F | [
"data structures",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1034
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1413-E | codeforces | 1413-E | Solo mid Oracle | https://codeforces.com/problemset/problem/1413/E | [
"greedy",
"math",
"ternary search"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2342
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1413-D | codeforces | 1413-D | Shurikens | https://codeforces.com/problemset/problem/1413/D | [
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7003
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1413-C | codeforces | 1413-C | Perform Easily | https://codeforces.com/problemset/problem/1413/C | [
"binary search",
"brute force",
"dp",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6328
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1413-B | codeforces | 1413-B | A New Technique | https://codeforces.com/problemset/problem/1413/B | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12127
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1413-A | codeforces | 1413-A | Finding Sasuke | https://codeforces.com/problemset/problem/1413/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15351
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1411-G | codeforces | 1411-G | No Game No Life | https://codeforces.com/problemset/problem/1411/G | [
"bitmasks",
"games",
"math",
"matrices"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 966
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1411-F | codeforces | 1411-F | The Thorny Path | https://codeforces.com/problemset/problem/1411/F | [
"greedy",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 540
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1411-E | codeforces | 1411-E | Poman Numbers | https://codeforces.com/problemset/problem/1411/E | [
"bitmasks",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1882
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1411-D | codeforces | 1411-D | Grime Zoo | https://codeforces.com/problemset/problem/1411/D | [
"brute force",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2787
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1411-C | codeforces | 1411-C | Peaceful Rooks | https://codeforces.com/problemset/problem/1411/C | [
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8717
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1411-B | codeforces | 1411-B | Fair Numbers | https://codeforces.com/problemset/problem/1411/B | [
"brute force",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 34123
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1411-A | codeforces | 1411-A | In-game Chat | https://codeforces.com/problemset/problem/1411/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21915
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1409-F | codeforces | 1409-F | Subsequences of Length Two | https://codeforces.com/problemset/problem/1409/F | [
"dp",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5315
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1409-E | codeforces | 1409-E | Two Platforms | https://codeforces.com/problemset/problem/1409/E | [
"binary search",
"dp",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8626
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1409-D | codeforces | 1409-D | Decrease the Sum of Digits | https://codeforces.com/problemset/problem/1409/D | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 21900
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1409-C | codeforces | 1409-C | Yet Another Array Restoration | https://codeforces.com/problemset/problem/1409/C | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 25003
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1409-B | codeforces | 1409-B | Minimum Product | https://codeforces.com/problemset/problem/1409/B | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 31504
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1409-A | codeforces | 1409-A | Yet Another Two Integers Problem | https://codeforces.com/problemset/problem/1409/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 84254
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1408-I | codeforces | 1408-I | Bitwise Magic | https://codeforces.com/problemset/problem/1408/I | [
"dp",
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 404
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1408-H | codeforces | 1408-H | Rainbow Triples | https://codeforces.com/problemset/problem/1408/H | [
"binary search",
"data structures",
"flows",
"greedy"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 583
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1408-G | codeforces | 1408-G | Clusterization Counting | https://codeforces.com/problemset/problem/1408/G | [
"combinatorics",
"dp",
"dsu",
"fft",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1416
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1408-F | codeforces | 1408-F | Two Different | https://codeforces.com/problemset/problem/1408/F | [
"constructive algorithms",
"divide and conquer"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2811
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1408-E | codeforces | 1408-E | Avoid Rainbow Cycles | https://codeforces.com/problemset/problem/1408/E | [
"data structures",
"dsu",
"graphs",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2277
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1408-D | codeforces | 1408-D | Searchlights | https://codeforces.com/problemset/problem/1408/D | [
"binary search",
"brute force",
"data structures",
"dp",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4789
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1408-C | codeforces | 1408-C | Discrete Acceleration | https://codeforces.com/problemset/problem/1408/C | [
"binary search",
"dp",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9421
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1408-B | codeforces | 1408-B | Arrays Sum | https://codeforces.com/problemset/problem/1408/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10548
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1408-A | codeforces | 1408-A | Circle Coloring | https://codeforces.com/problemset/problem/1408/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12858
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1407-E | codeforces | 1407-E | Egor in the Republic of Dagestan | https://codeforces.com/problemset/problem/1407/E | [
"constructive algorithms",
"dfs and similar",
"dp",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2030
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1407-D | codeforces | 1407-D | Discrete Centrifugal Jumps | https://codeforces.com/problemset/problem/1407/D | [
"data structures",
"dp",
"graphs"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 6161
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1407-C | codeforces | 1407-C | Chocolate Bunny | https://codeforces.com/problemset/problem/1407/C | [
"constructive algorithms",
"interactive",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15692
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1407-B | codeforces | 1407-B | Big Vova | https://codeforces.com/problemset/problem/1407/B | [
"brute force",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18317
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1407-A | codeforces | 1407-A | Ahahahahahahahaha | https://codeforces.com/problemset/problem/1407/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21665
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1406-E | codeforces | 1406-E | Deleting Numbers | https://codeforces.com/problemset/problem/1406/E | [
"interactive",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 2023
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1406-D | codeforces | 1406-D | Three Sequences | https://codeforces.com/problemset/problem/1406/D | [
"constructive algorithms",
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3897
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1406-C | codeforces | 1406-C | Link Cut Centroids | https://codeforces.com/problemset/problem/1406/C | [
"constructive algorithms",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 12399
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1406-B | codeforces | 1406-B | Maximum Product | https://codeforces.com/problemset/problem/1406/B | [
"brute force",
"dp",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 25017
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1406-A | codeforces | 1406-A | Subset Mex | https://codeforces.com/problemset/problem/1406/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 23492
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1405-B | codeforces | 1405-B | Array Cancellation | https://codeforces.com/problemset/problem/1405/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 23551
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1405-A | codeforces | 1405-A | Permutation Forgery | https://codeforces.com/problemset/problem/1405/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22023
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1404-E | codeforces | 1404-E | Bricks | https://codeforces.com/problemset/problem/1404/E | [
"flows",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1866
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1404-D | codeforces | 1404-D | Game of Pairs | https://codeforces.com/problemset/problem/1404/D | [
"constructive algorithms",
"dfs and similar",
"interactive",
"math",
"number theory"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1325
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1404-C | codeforces | 1404-C | Fixed Point Removal | https://codeforces.com/problemset/problem/1404/C | [
"binary search",
"constructive algorithms",
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3171
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1404-B | codeforces | 1404-B | Tree Tag | https://codeforces.com/problemset/problem/1404/B | [
"dfs and similar",
"dp",
"games",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8690
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1404-A | codeforces | 1404-A | Balanced Bitstring | https://codeforces.com/problemset/problem/1404/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 20745
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1403-C | codeforces | 1403-C | Chess Rush | https://codeforces.com/problemset/problem/1403/C | [
"*special",
"combinatorics",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 95
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1403-B | codeforces | 1403-B | Spring cleaning | https://codeforces.com/problemset/problem/1403/B | [
"*special",
"data structures",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 443
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1403-A | codeforces | 1403-A | The Potion of Great Power | https://codeforces.com/problemset/problem/1403/A | [
"*special",
"2-sat",
"binary search",
"data structures",
"graphs",
"interactive",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 366
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1402-C | codeforces | 1402-C | Star Trek | https://codeforces.com/problemset/problem/1402/C | [
"*special",
"combinatorics",
"dfs and similar",
"dp",
"games",
"graphs",
"matrices",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 273
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1402-B | codeforces | 1402-B | Roads | https://codeforces.com/problemset/problem/1402/B | [
"*special",
"geometry",
"sortings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 144
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1402-A | codeforces | 1402-A | Fancy Fence | https://codeforces.com/problemset/problem/1402/A | [
"*special",
"data structures",
"dsu",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1398
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1401-F | codeforces | 1401-F | Reverse and Swap | https://codeforces.com/problemset/problem/1401/F | [
"binary search",
"bitmasks",
"data structures"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2039
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1401-E | codeforces | 1401-E | Divide Square | https://codeforces.com/problemset/problem/1401/E | [
"data structures",
"geometry",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2714
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1401-D | codeforces | 1401-D | Maximum Distributed Tree | https://codeforces.com/problemset/problem/1401/D | [
"dfs and similar",
"dp",
"greedy",
"implementation",
"math",
"number theory",
"sortings",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 11005
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1401-C | codeforces | 1401-C | Mere Array | https://codeforces.com/problemset/problem/1401/C | [
"constructive algorithms",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 27688
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1401-B | codeforces | 1401-B | Ternary Sequence | https://codeforces.com/problemset/problem/1401/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21957
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1401-A | codeforces | 1401-A | Distance and Axis | https://codeforces.com/problemset/problem/1401/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 28985
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1400-G | codeforces | 1400-G | Mercenaries | https://codeforces.com/problemset/problem/1400/G | [
"bitmasks",
"brute force",
"combinatorics",
"dp",
"dsu",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1251
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1400-F | codeforces | 1400-F | x-prime Substrings | https://codeforces.com/problemset/problem/1400/F | [
"brute force",
"dfs and similar",
"dp",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1324
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1400-E | codeforces | 1400-E | Clear the Multiset | https://codeforces.com/problemset/problem/1400/E | [
"data structures",
"divide and conquer",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 6818
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1400-D | codeforces | 1400-D | Zigzags | https://codeforces.com/problemset/problem/1400/D | [
"brute force",
"combinatorics",
"data structures",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 11668
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1400-C | codeforces | 1400-C | Binary String Reconstruction | https://codeforces.com/problemset/problem/1400/C | [
"2-sat",
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 18773
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1400-B | codeforces | 1400-B | RPG Protagonist | https://codeforces.com/problemset/problem/1400/B | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11827
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1400-A | codeforces | 1400-A | String Similarity | https://codeforces.com/problemset/problem/1400/A | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28168
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1399-F | codeforces | 1399-F | Yet Another Segments Subset | https://codeforces.com/problemset/problem/1399/F | [
"data structures",
"dp",
"graphs",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1970
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1399-E2 | codeforces | 1399-E2 | Weights Division (hard version) | https://codeforces.com/problemset/problem/1399/E2 | [
"binary search",
"dfs and similar",
"greedy",
"sortings",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2638
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1399-E1 | codeforces | 1399-E1 | Weights Division (easy version) | https://codeforces.com/problemset/problem/1399/E1 | [
"data structures",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6514
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1399-D | codeforces | 1399-D | Binary String To Subsequences | https://codeforces.com/problemset/problem/1399/D | [
"constructive algorithms",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 20277
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1399-C | codeforces | 1399-C | Boats Competition | https://codeforces.com/problemset/problem/1399/C | [
"brute force",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 34108
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1399-B | codeforces | 1399-B | Gifts Fixing | https://codeforces.com/problemset/problem/1399/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 47943
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1399-A | codeforces | 1399-A | Remove Smallest | https://codeforces.com/problemset/problem/1399/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 85456
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1398-G | codeforces | 1398-G | Running Competition | https://codeforces.com/problemset/problem/1398/G | [
"bitmasks",
"fft",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1360
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1398-F | codeforces | 1398-F | Controversial Rounds | https://codeforces.com/problemset/problem/1398/F | [
"binary search",
"data structures",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1510
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1398-E | codeforces | 1398-E | Two Types of Spells | https://codeforces.com/problemset/problem/1398/E | [
"binary search",
"data structures",
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2661
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1398-D | codeforces | 1398-D | Colored Rectangles | https://codeforces.com/problemset/problem/1398/D | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 12922
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1398-C | codeforces | 1398-C | Good Subarrays | https://codeforces.com/problemset/problem/1398/C | [
"data structures",
"dp",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 41057
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1398-B | codeforces | 1398-B | Substring Removal Game | https://codeforces.com/problemset/problem/1398/B | [
"games",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26320
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1398-A | codeforces | 1398-A | Bad Triangle | https://codeforces.com/problemset/problem/1398/A | [
"geometry",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29162
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1397-B | codeforces | 1397-B | Power Sequence | https://codeforces.com/problemset/problem/1397/B | [
"brute force",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15645
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1397-A | codeforces | 1397-A | Juggling Letters | https://codeforces.com/problemset/problem/1397/A | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30212
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1396-E | codeforces | 1396-E | Distance Matching | https://codeforces.com/problemset/problem/1396/E | [
"constructive algorithms",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 450
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1396-D | codeforces | 1396-D | Rainbow Rectangles | https://codeforces.com/problemset/problem/1396/D | [
"data structures",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 355
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1396-C | codeforces | 1396-C | Monster Invaders | https://codeforces.com/problemset/problem/1396/C | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2880
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1396-B | codeforces | 1396-B | Stoned Game | https://codeforces.com/problemset/problem/1396/B | [
"brute force",
"constructive algorithms",
"games",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 13532
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1396-A | codeforces | 1396-A | Multiples of Length | https://codeforces.com/problemset/problem/1396/A | [
"constructive algorithms",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 16987
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1395-C | codeforces | 1395-C | Boboniu and Bit Operations | https://codeforces.com/problemset/problem/1395/C | [
"bitmasks",
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15571
} | 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.