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:1423-D | codeforces | 1423-D | Does anyone else hate the wind? | https://codeforces.com/problemset/problem/1423/D | [] | null | null | stdin_stdout | 3,100 | {
"solved_count": 50
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1423-C | codeforces | 1423-C | Dušan's Railway | https://codeforces.com/problemset/problem/1423/C | [
"divide and conquer",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 214
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1423-B | codeforces | 1423-B | Valuable Paper | https://codeforces.com/problemset/problem/1423/B | [
"binary search",
"flows",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2123
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1423-A | codeforces | 1423-A | Wakanda Forever | https://codeforces.com/problemset/problem/1423/A | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 125
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1422-F | codeforces | 1422-F | Boring Queries | https://codeforces.com/problemset/problem/1422/F | [
"data structures",
"math",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1290
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1422-E | codeforces | 1422-E | Minlexes | https://codeforces.com/problemset/problem/1422/E | [
"dp",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 856
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1422-D | codeforces | 1422-D | Returning Home | https://codeforces.com/problemset/problem/1422/D | [
"graphs",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3207
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1422-C | codeforces | 1422-C | Bargain | https://codeforces.com/problemset/problem/1422/C | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8854
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1422-B | codeforces | 1422-B | Nice Matrix | https://codeforces.com/problemset/problem/1422/B | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15096
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1422-A | codeforces | 1422-A | Fence | https://codeforces.com/problemset/problem/1422/A | [
"geometry",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21888
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1421-E | codeforces | 1421-E | Swedish Heroes | https://codeforces.com/problemset/problem/1421/E | [
"brute force",
"dp",
"implementation"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 974
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1421-D | codeforces | 1421-D | Hexagons | https://codeforces.com/problemset/problem/1421/D | [
"brute force",
"constructive algorithms",
"greedy",
"implementation",
"math",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4387
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1421-C | codeforces | 1421-C | Palindromifier | https://codeforces.com/problemset/problem/1421/C | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 13564
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1421-B | codeforces | 1421-B | Putting Bricks in the Wall | https://codeforces.com/problemset/problem/1421/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 13488
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1421-A | codeforces | 1421-A | XORwice | https://codeforces.com/problemset/problem/1421/A | [
"bitmasks",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 35811
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1420-E | codeforces | 1420-E | Battle Lemmings | https://codeforces.com/problemset/problem/1420/E | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1047
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1420-D | codeforces | 1420-D | Rescue Nibel! | https://codeforces.com/problemset/problem/1420/D | [
"combinatorics",
"data structures",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8358
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1420-C2 | codeforces | 1420-C2 | Pokémon Army (hard version) | https://codeforces.com/problemset/problem/1420/C2 | [
"data structures",
"divide and conquer",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5200
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1420-C1 | codeforces | 1420-C1 | Pokémon Army (easy version) | https://codeforces.com/problemset/problem/1420/C1 | [
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 19048
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1420-B | codeforces | 1420-B | Rock and Lever | https://codeforces.com/problemset/problem/1420/B | [
"bitmasks",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 36395
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1420-A | codeforces | 1420-A | Cubes Sorting | https://codeforces.com/problemset/problem/1420/A | [
"math",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 25253
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1419-F | codeforces | 1419-F | Rain of Fire | https://codeforces.com/problemset/problem/1419/F | [
"binary search",
"data structures",
"dfs and similar",
"dsu",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 565
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1419-E | codeforces | 1419-E | Decryption | https://codeforces.com/problemset/problem/1419/E | [
"constructive algorithms",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3522
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1419-D2 | codeforces | 1419-D2 | Sage's Birthday (hard version) | https://codeforces.com/problemset/problem/1419/D2 | [
"binary search",
"brute force",
"constructive algorithms",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 17481
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1419-D1 | codeforces | 1419-D1 | Sage's Birthday (easy version) | https://codeforces.com/problemset/problem/1419/D1 | [
"binary search",
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 26460
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1419-C | codeforces | 1419-C | Killjoy | https://codeforces.com/problemset/problem/1419/C | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 16325
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1419-B | codeforces | 1419-B | Stairs | https://codeforces.com/problemset/problem/1419/B | [
"brute force",
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17014
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1419-A | codeforces | 1419-A | Digit Game | https://codeforces.com/problemset/problem/1419/A | [
"games",
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 20583
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1418-G | codeforces | 1418-G | Three Occurrences | https://codeforces.com/problemset/problem/1418/G | [
"data structures",
"divide and conquer",
"hashing",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2770
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1418-F | codeforces | 1418-F | Equal Product | https://codeforces.com/problemset/problem/1418/F | [
"data structures",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 435
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1418-E | codeforces | 1418-E | Expected Damage | https://codeforces.com/problemset/problem/1418/E | [
"binary search",
"combinatorics",
"probabilities"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2207
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1418-D | codeforces | 1418-D | Trash Problem | https://codeforces.com/problemset/problem/1418/D | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4751
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1418-C | codeforces | 1418-C | Mortal Kombat Tower | https://codeforces.com/problemset/problem/1418/C | [
"dp",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 28687
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1418-B | codeforces | 1418-B | Negative Prefixes | https://codeforces.com/problemset/problem/1418/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17644
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1418-A | codeforces | 1418-A | Buying Torches | https://codeforces.com/problemset/problem/1418/A | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 34425
} | 2026-06-01T05:00:40.145500+00:00 |
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": 15086
} | 2026-06-01T05:00:40.145500+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": 18754
} | 2026-06-01T05:00:40.145500+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": 604
} | 2026-06-01T05:00:40.145500+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": 434
} | 2026-06-01T05:00:40.145500+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": 2731
} | 2026-06-01T05:00:40.145500+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": 5079
} | 2026-06-01T05:00:40.145500+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": 6710
} | 2026-06-01T05:00:40.145500+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": 16930
} | 2026-06-01T05:00:40.145500+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": 565
} | 2026-06-01T05:00:40.145500+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": 3007
} | 2026-06-01T05:00:40.145500+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": 6180
} | 2026-06-01T05:00:40.145500+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": 11746
} | 2026-06-01T05:00:40.145500+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": 12551
} | 2026-06-01T05:00:40.145500+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": 15888
} | 2026-06-01T05:00:40.145500+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": 966
} | 2026-06-01T05:00:40.145500+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": 2187
} | 2026-06-01T05:00:40.145500+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": 6929
} | 2026-06-01T05:00:40.145500+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": 6274
} | 2026-06-01T05:00:40.145500+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": 12021
} | 2026-06-01T05:00:40.145500+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": 15302
} | 2026-06-01T05:00:40.145500+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": 893
} | 2026-06-01T05:00:40.145500+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": 436
} | 2026-06-01T05:00:40.145500+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": 1834
} | 2026-06-01T05:00:40.145500+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": 2723
} | 2026-06-01T05:00:40.145500+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": 8611
} | 2026-06-01T05:00:40.145500+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": 30977
} | 2026-06-01T05:00:40.145500+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": 21774
} | 2026-06-01T05:00:40.145500+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": 5182
} | 2026-06-01T05:00:40.145500+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": 8481
} | 2026-06-01T05:00:40.145500+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": 21463
} | 2026-06-01T05:00:40.145500+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": 24698
} | 2026-06-01T05:00:40.145500+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": 31003
} | 2026-06-01T05:00:40.145500+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": 80889
} | 2026-06-01T05:00:40.145500+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": 201
} | 2026-06-01T05:00:40.145500+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": 556
} | 2026-06-01T05:00:40.145500+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": 1342
} | 2026-06-01T05:00:40.145500+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": 2684
} | 2026-06-01T05:00:40.145500+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": 2194
} | 2026-06-01T05:00:40.145500+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": 4685
} | 2026-06-01T05:00:40.145500+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": 9290
} | 2026-06-01T05:00:40.145500+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": 10466
} | 2026-06-01T05:00:40.145500+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": 12797
} | 2026-06-01T05:00:40.145500+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": 1911
} | 2026-06-01T05:00:40.145500+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": 5802
} | 2026-06-01T05:00:40.145500+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": 14946
} | 2026-06-01T05:00:40.145500+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": 18099
} | 2026-06-01T05:00:40.145500+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": 21451
} | 2026-06-01T05:00:40.145500+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": 1888
} | 2026-06-01T05:00:40.145500+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": 3821
} | 2026-06-01T05:00:40.145500+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": 11817
} | 2026-06-01T05:00:40.145500+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": 24521
} | 2026-06-01T05:00:40.145500+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": 23072
} | 2026-06-01T05:00:40.145500+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": 23107
} | 2026-06-01T05:00:40.145500+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": 21919
} | 2026-06-01T05:00:40.145500+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": 1594
} | 2026-06-01T05:00:40.145500+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": 1275
} | 2026-06-01T05:00:40.145500+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": 3058
} | 2026-06-01T05:00:40.145500+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": 8226
} | 2026-06-01T05:00:40.145500+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": 19580
} | 2026-06-01T05:00:40.145500+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": 75
} | 2026-06-01T05:00:40.145500+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": 395
} | 2026-06-01T05:00:40.145500+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": 313
} | 2026-06-01T05:00:40.145500+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": 236
} | 2026-06-01T05:00:40.145500+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": 131
} | 2026-06-01T05:00:40.145500+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": 1358
} | 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.