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:1427-G | codeforces | 1427-G | One Billion Shades of Grey | https://codeforces.com/problemset/problem/1427/G | [
"flows",
"graphs"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 515
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1427-F | codeforces | 1427-F | Boring Card Game | https://codeforces.com/problemset/problem/1427/F | [
"data structures",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 431
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1427-E | codeforces | 1427-E | Xum | https://codeforces.com/problemset/problem/1427/E | [
"bitmasks",
"constructive algorithms",
"math",
"matrices",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1722
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1427-D | codeforces | 1427-D | Unshuffling a Deck | https://codeforces.com/problemset/problem/1427/D | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3744
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1427-C | codeforces | 1427-C | The Hard Work of Paparazzi | https://codeforces.com/problemset/problem/1427/C | [
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6162
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1427-B | codeforces | 1427-B | Chess Cheater | https://codeforces.com/problemset/problem/1427/B | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11533
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1427-A | codeforces | 1427-A | Avoiding Zero | https://codeforces.com/problemset/problem/1427/A | [
"math",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18162
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1426-F | codeforces | 1426-F | Number of Subsequences | https://codeforces.com/problemset/problem/1426/F | [
"combinatorics",
"dp",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6384
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1426-E | codeforces | 1426-E | Rock, Paper, Scissors | https://codeforces.com/problemset/problem/1426/E | [
"brute force",
"constructive algorithms",
"flows",
"greedy",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8209
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1426-D | codeforces | 1426-D | Non-zero Segments | https://codeforces.com/problemset/problem/1426/D | [
"constructive algorithms",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 17795
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1426-C | codeforces | 1426-C | Increase and Copy | https://codeforces.com/problemset/problem/1426/C | [
"binary search",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20777
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1426-B | codeforces | 1426-B | Symmetric Matrix | https://codeforces.com/problemset/problem/1426/B | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 21997
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1426-A | codeforces | 1426-A | Floor Number | https://codeforces.com/problemset/problem/1426/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 55910
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1425-I | codeforces | 1425-I | Impressive Harvesting of The Orchard | https://codeforces.com/problemset/problem/1425/I | [
"data structures"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 280
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1425-H | codeforces | 1425-H | Huge Boxes of Animal Toys | https://codeforces.com/problemset/problem/1425/H | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4431
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1425-F | codeforces | 1425-F | Flamingoes of Mystery | https://codeforces.com/problemset/problem/1425/F | [
"interactive"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7326
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1425-E | codeforces | 1425-E | Excitation of Atoms | https://codeforces.com/problemset/problem/1425/E | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1027
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1425-D | codeforces | 1425-D | Danger of Mad Snakes | https://codeforces.com/problemset/problem/1425/D | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 925
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1425-C | codeforces | 1425-C | Captain of Knights | https://codeforces.com/problemset/problem/1425/C | [
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 123
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1425-B | codeforces | 1425-B | Blue and Red of Our Faculty! | https://codeforces.com/problemset/problem/1425/B | [
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 380
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1425-A | codeforces | 1425-A | Arena of Greed | https://codeforces.com/problemset/problem/1425/A | [
"games",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7280
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1424-M | codeforces | 1424-M | Ancient Language | https://codeforces.com/problemset/problem/1424/M | [
"graphs",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 637
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1424-G | codeforces | 1424-G | Years | https://codeforces.com/problemset/problem/1424/G | [
"data structures",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6805
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1423-N | codeforces | 1423-N | BubbleSquare Tokens | https://codeforces.com/problemset/problem/1423/N | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 175
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1423-M | codeforces | 1423-M | Milutin's Plums | https://codeforces.com/problemset/problem/1423/M | [
"interactive"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 365
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1423-L | codeforces | 1423-L | Light switches | https://codeforces.com/problemset/problem/1423/L | [
"meet-in-the-middle"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 662
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1423-K | codeforces | 1423-K | Lonely Numbers | https://codeforces.com/problemset/problem/1423/K | [
"binary search",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5498
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1423-J | codeforces | 1423-J | Bubble Cup hypothesis | https://codeforces.com/problemset/problem/1423/J | [
"bitmasks",
"constructive algorithms",
"dp",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 916
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1423-I | codeforces | 1423-I | Lookup Tables | https://codeforces.com/problemset/problem/1423/I | [
"bitmasks"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 294
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1423-H | codeforces | 1423-H | Virus | https://codeforces.com/problemset/problem/1423/H | [
"data structures",
"divide and conquer",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 669
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1423-G | codeforces | 1423-G | Growing flowers | https://codeforces.com/problemset/problem/1423/G | [
"data structures"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 357
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1423-F | codeforces | 1423-F | Coins | https://codeforces.com/problemset/problem/1423/F | [
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 540
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1423-E | codeforces | 1423-E | 5G Antenna Towers | https://codeforces.com/problemset/problem/1423/E | [
"geometry"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 141
} | 2026-08-10T02:20:32.917453+00:00 |
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": 81
} | 2026-08-10T02:20:32.917453+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": 240
} | 2026-08-10T02:20:32.917453+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": 2247
} | 2026-08-10T02:20:32.917453+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": 127
} | 2026-08-10T02:20:32.917453+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": 1409
} | 2026-08-10T02:20:32.917453+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": 912
} | 2026-08-10T02:20:32.917453+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": 3249
} | 2026-08-10T02:20:32.917453+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": 8887
} | 2026-08-10T02:20:32.917453+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": 15140
} | 2026-08-10T02:20:32.917453+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": 21935
} | 2026-08-10T02:20:32.917453+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": 1033
} | 2026-08-10T02:20:32.917453+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": 4397
} | 2026-08-10T02:20:32.917453+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": 13618
} | 2026-08-10T02:20:32.917453+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": 13509
} | 2026-08-10T02:20:32.917453+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": 36672
} | 2026-08-10T02:20:32.917453+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": 1108
} | 2026-08-10T02:20:32.917453+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": 8456
} | 2026-08-10T02:20:32.917453+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": 5277
} | 2026-08-10T02:20:32.917453+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": 19247
} | 2026-08-10T02:20:32.917453+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": 37886
} | 2026-08-10T02:20:32.917453+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": 25409
} | 2026-08-10T02:20:32.917453+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": 683
} | 2026-08-10T02:20:32.917453+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": 3550
} | 2026-08-10T02:20:32.917453+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": 17639
} | 2026-08-10T02:20:32.917453+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": 26665
} | 2026-08-10T02:20:32.917453+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": 16411
} | 2026-08-10T02:20:32.917453+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": 17103
} | 2026-08-10T02:20:32.917453+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": 20668
} | 2026-08-10T02:20:32.917453+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": 2920
} | 2026-08-10T02:20:32.917453+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": 550
} | 2026-08-10T02:20:32.917453+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": 2315
} | 2026-08-10T02:20:32.917453+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": 4825
} | 2026-08-10T02:20:32.917453+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": 29921
} | 2026-08-10T02:20:32.917453+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": 17807
} | 2026-08-10T02:20:32.917453+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": 36200
} | 2026-08-10T02:20:32.917453+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": 15147
} | 2026-08-10T02:20:32.917453+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": 18779
} | 2026-08-10T02:20:32.917453+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": 730
} | 2026-08-10T02:20:32.917453+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": 554
} | 2026-08-10T02:20:32.917453+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": 2882
} | 2026-08-10T02:20:32.917453+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": 5189
} | 2026-08-10T02:20:32.917453+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": 6763
} | 2026-08-10T02:20:32.917453+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": 17532
} | 2026-08-10T02:20:32.917453+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": 615
} | 2026-08-10T02:20:32.917453+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": 3057
} | 2026-08-10T02:20:32.917453+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": 6263
} | 2026-08-10T02:20:32.917453+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": 11838
} | 2026-08-10T02:20:32.917453+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": 12594
} | 2026-08-10T02:20:32.917453+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": 15933
} | 2026-08-10T02:20:32.917453+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": 983
} | 2026-08-10T02:20:32.917453+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": 2300
} | 2026-08-10T02:20:32.917453+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": 6962
} | 2026-08-10T02:20:32.917453+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": 6299
} | 2026-08-10T02:20:32.917453+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": 12103
} | 2026-08-10T02:20:32.917453+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": 15323
} | 2026-08-10T02:20:32.917453+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": 954
} | 2026-08-10T02:20:32.917453+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": 525
} | 2026-08-10T02:20:32.917453+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": 1865
} | 2026-08-10T02:20:32.917453+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": 2763
} | 2026-08-10T02:20:32.917453+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": 8665
} | 2026-08-10T02:20:32.917453+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": 32634
} | 2026-08-10T02:20:32.917453+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": 21863
} | 2026-08-10T02:20:32.917453+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": 5245
} | 2026-08-10T02:20:32.917453+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": 8536
} | 2026-08-10T02:20:32.917453+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": 21671
} | 2026-08-10T02:20:32.917453+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": 24849
} | 2026-08-10T02:20:32.917453+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": 31254
} | 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.