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:1490-C | codeforces | 1490-C | Sum of Cubes | https://codeforces.com/problemset/problem/1490/C | [
"binary search",
"brute force",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 39633
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1490-B | codeforces | 1490-B | Balanced Remainders | https://codeforces.com/problemset/problem/1490/B | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 28096
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1490-A | codeforces | 1490-A | Dense Array | https://codeforces.com/problemset/problem/1490/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33257
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1488-J | codeforces | 1488-J | Flower Shop | https://codeforces.com/problemset/problem/1488/J | [
"*special",
"data structures",
"fft",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 43
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1488-I | codeforces | 1488-I | Demonic Invasion | https://codeforces.com/problemset/problem/1488/I | [
"*special",
"flows"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 50
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1488-H | codeforces | 1488-H | Build From Suffixes | https://codeforces.com/problemset/problem/1488/H | [
"*special",
"combinatorics",
"data structures"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 74
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1488-G | codeforces | 1488-G | Painting Numbers | https://codeforces.com/problemset/problem/1488/G | [
"*special",
"data structures",
"greedy",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 137
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1488-F | codeforces | 1488-F | Dogecoin | https://codeforces.com/problemset/problem/1488/F | [
"*special",
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 194
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1488-E | codeforces | 1488-E | Palindromic Doubles | https://codeforces.com/problemset/problem/1488/E | [
"*special",
"data structures",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 237
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1488-D | codeforces | 1488-D | Problemsolving Marathon | https://codeforces.com/problemset/problem/1488/D | [
"*special",
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 360
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1488-C | codeforces | 1488-C | Two Policemen | https://codeforces.com/problemset/problem/1488/C | [
"*special",
"binary search",
"brute force",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 491
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1488-B | codeforces | 1488-B | RBS Deletion | https://codeforces.com/problemset/problem/1488/B | [
"*special",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 603
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1488-A | codeforces | 1488-A | From Zero To Y | https://codeforces.com/problemset/problem/1488/A | [
"*special",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 1845
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1487-G | codeforces | 1487-G | String Counting | https://codeforces.com/problemset/problem/1487/G | [
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 748
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1487-F | codeforces | 1487-F | Ones | https://codeforces.com/problemset/problem/1487/F | [
"dp",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 533
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1487-E | codeforces | 1487-E | Cheap Dinner | https://codeforces.com/problemset/problem/1487/E | [
"brute force",
"data structures",
"graphs",
"greedy",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5196
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1487-D | codeforces | 1487-D | Pythagorean Triples | https://codeforces.com/problemset/problem/1487/D | [
"binary search",
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 20896
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1487-C | codeforces | 1487-C | Minimum Ties | https://codeforces.com/problemset/problem/1487/C | [
"brute force",
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15577
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1487-B | codeforces | 1487-B | Cat Cycle | https://codeforces.com/problemset/problem/1487/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 30387
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1487-A | codeforces | 1487-A | Arena | https://codeforces.com/problemset/problem/1487/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27699
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1486-F | codeforces | 1486-F | Pairs of Paths | https://codeforces.com/problemset/problem/1486/F | [
"combinatorics",
"data structures",
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 879
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1486-E | codeforces | 1486-E | Paired Payment | https://codeforces.com/problemset/problem/1486/E | [
"binary search",
"brute force",
"constructive algorithms",
"dp",
"flows",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3493
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1486-D | codeforces | 1486-D | Max Median | https://codeforces.com/problemset/problem/1486/D | [
"binary search",
"data structures",
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 10286
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1486-C2 | codeforces | 1486-C2 | Guessing the Greatest (hard version) | https://codeforces.com/problemset/problem/1486/C2 | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 10234
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1486-C1 | codeforces | 1486-C1 | Guessing the Greatest (easy version) | https://codeforces.com/problemset/problem/1486/C1 | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14488
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1486-B | codeforces | 1486-B | Eastern Exhibition | https://codeforces.com/problemset/problem/1486/B | [
"binary search",
"geometry",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 21352
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1486-A | codeforces | 1486-A | Shifting Stacks | https://codeforces.com/problemset/problem/1486/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 27283
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1485-F | codeforces | 1485-F | Copy or Prefix Sum | https://codeforces.com/problemset/problem/1485/F | [
"combinatorics",
"data structures",
"dp",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2383
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1485-E | codeforces | 1485-E | Move and Swap | https://codeforces.com/problemset/problem/1485/E | [
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1585
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1485-D | codeforces | 1485-D | Multiples and Power Differences | https://codeforces.com/problemset/problem/1485/D | [
"constructive algorithms",
"graphs",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 5727
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1485-C | codeforces | 1485-C | Floor and Mod | https://codeforces.com/problemset/problem/1485/C | [
"binary search",
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11209
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1485-B | codeforces | 1485-B | Replace and Keep Sorted | https://codeforces.com/problemset/problem/1485/B | [
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18023
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1485-A | codeforces | 1485-A | Add and Divide | https://codeforces.com/problemset/problem/1485/A | [
"brute force",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 35380
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1482-H | codeforces | 1482-H | Exam | https://codeforces.com/problemset/problem/1482/H | [
"data structures",
"string suffix structures",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 813
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1482-G | codeforces | 1482-G | Vabank | https://codeforces.com/problemset/problem/1482/G | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 362
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1482-F | codeforces | 1482-F | Useful Edges | https://codeforces.com/problemset/problem/1482/F | [
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1791
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1482-E | codeforces | 1482-E | Skyline Photo | https://codeforces.com/problemset/problem/1482/E | [
"data structures",
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3936
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1482-D | codeforces | 1482-D | Playlist | https://codeforces.com/problemset/problem/1482/D | [
"data structures",
"dsu",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4140
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1482-C | codeforces | 1482-C | Basic Diplomacy | https://codeforces.com/problemset/problem/1482/C | [
"brute force",
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10073
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1482-B | codeforces | 1482-B | Restore Modulo | https://codeforces.com/problemset/problem/1482/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9659
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1482-A | codeforces | 1482-A | Prison Break | https://codeforces.com/problemset/problem/1482/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21382
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1481-F | codeforces | 1481-F | AB Tree | https://codeforces.com/problemset/problem/1481/F | [
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 896
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1481-E | codeforces | 1481-E | Sorting Books | https://codeforces.com/problemset/problem/1481/E | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2496
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1481-D | codeforces | 1481-D | AB Graph | https://codeforces.com/problemset/problem/1481/D | [
"brute force",
"constructive algorithms",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4926
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1481-C | codeforces | 1481-C | Fence Painting | https://codeforces.com/problemset/problem/1481/C | [
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12500
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1481-B | codeforces | 1481-B | New Colony | https://codeforces.com/problemset/problem/1481/B | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20014
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1481-A | codeforces | 1481-A | Space Navigation | https://codeforces.com/problemset/problem/1481/A | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25837
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1480-B | codeforces | 1480-B | The Great Hero | https://codeforces.com/problemset/problem/1480/B | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18016
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1480-A | codeforces | 1480-A | Yet Another String Game | https://codeforces.com/problemset/problem/1480/A | [
"games",
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27290
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1479-E | codeforces | 1479-E | School Clubs | https://codeforces.com/problemset/problem/1479/E | [
"dp",
"fft",
"math",
"number theory",
"probabilities"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 471
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1479-D | codeforces | 1479-D | Odd Mineral Resource | https://codeforces.com/problemset/problem/1479/D | [
"binary search",
"bitmasks",
"brute force",
"data structures",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1419
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1479-C | codeforces | 1479-C | Continuous City | https://codeforces.com/problemset/problem/1479/C | [
"bitmasks",
"constructive algorithms"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1466
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1479-B2 | codeforces | 1479-B2 | Painting the Array II | https://codeforces.com/problemset/problem/1479/B2 | [
"constructive algorithms",
"data structures",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4555
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1479-B1 | codeforces | 1479-B1 | Painting the Array I | https://codeforces.com/problemset/problem/1479/B1 | [
"constructive algorithms",
"data structures",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7537
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1479-A | codeforces | 1479-A | Searching Local Minimum | https://codeforces.com/problemset/problem/1479/A | [
"binary search",
"interactive",
"ternary search"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 13373
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1478-C | codeforces | 1478-C | Nezzar and Symmetric Array | https://codeforces.com/problemset/problem/1478/C | [
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10727
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1478-B | codeforces | 1478-B | Nezzar and Lucky Number | https://codeforces.com/problemset/problem/1478/B | [
"brute force",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19084
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1478-A | codeforces | 1478-A | Nezzar and Colorful Balls | https://codeforces.com/problemset/problem/1478/A | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28199
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1477-F | codeforces | 1477-F | Nezzar and Chocolate Bars | https://codeforces.com/problemset/problem/1477/F | [
"combinatorics",
"fft",
"math",
"probabilities"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 384
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1477-E | codeforces | 1477-E | Nezzar and Tournaments | https://codeforces.com/problemset/problem/1477/E | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 306
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1477-D | codeforces | 1477-D | Nezzar and Hidden Permutations | https://codeforces.com/problemset/problem/1477/D | [
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 808
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1477-C | codeforces | 1477-C | Nezzar and Nice Beatmap | https://codeforces.com/problemset/problem/1477/C | [
"constructive algorithms",
"geometry",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2651
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1477-B | codeforces | 1477-B | Nezzar and Binary String | https://codeforces.com/problemset/problem/1477/B | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3695
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1477-A | codeforces | 1477-A | Nezzar and Board | https://codeforces.com/problemset/problem/1477/A | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6624
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1476-G | codeforces | 1476-G | Minimum Difference | https://codeforces.com/problemset/problem/1476/G | [
"data structures",
"hashing",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 1025
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1476-F | codeforces | 1476-F | Lanterns | https://codeforces.com/problemset/problem/1476/F | [
"binary search",
"data structures",
"dp"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1218
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1476-E | codeforces | 1476-E | Pattern Matching | https://codeforces.com/problemset/problem/1476/E | [
"bitmasks",
"data structures",
"dfs and similar",
"graphs",
"hashing",
"sortings",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2843
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1476-D | codeforces | 1476-D | Journey | https://codeforces.com/problemset/problem/1476/D | [
"dfs and similar",
"dp",
"dsu",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9301
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1476-C | codeforces | 1476-C | Longest Simple Cycle | https://codeforces.com/problemset/problem/1476/C | [
"dp",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12396
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1476-B | codeforces | 1476-B | Inflation | https://codeforces.com/problemset/problem/1476/B | [
"binary search",
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 21821
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1476-A | codeforces | 1476-A | K-divisible Sum | https://codeforces.com/problemset/problem/1476/A | [
"binary search",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 45788
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1475-G | codeforces | 1475-G | Strange Beauty | https://codeforces.com/problemset/problem/1475/G | [
"dp",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8040
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1475-F | codeforces | 1475-F | Unusual Matrix | https://codeforces.com/problemset/problem/1475/F | [
"2-sat",
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5984
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1475-E | codeforces | 1475-E | Advertising Agency | https://codeforces.com/problemset/problem/1475/E | [
"combinatorics",
"math",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 18532
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1475-D | codeforces | 1475-D | Cleaning the Phone | https://codeforces.com/problemset/problem/1475/D | [
"binary search",
"dp",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 11330
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1475-C | codeforces | 1475-C | Ball in Berland | https://codeforces.com/problemset/problem/1475/C | [
"combinatorics",
"graphs",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 28418
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1475-B | codeforces | 1475-B | New Year's Number | https://codeforces.com/problemset/problem/1475/B | [
"brute force",
"dp",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 58545
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1475-A | codeforces | 1475-A | Odd Divisor | https://codeforces.com/problemset/problem/1475/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 91462
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1474-F | codeforces | 1474-F | 1 2 3 4 ... | https://codeforces.com/problemset/problem/1474/F | [
"dp",
"math",
"matrices"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 396
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1474-E | codeforces | 1474-E | What Is It? | https://codeforces.com/problemset/problem/1474/E | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1532
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1474-D | codeforces | 1474-D | Cleaning | https://codeforces.com/problemset/problem/1474/D | [
"data structures",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4358
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1474-C | codeforces | 1474-C | Array Destruction | https://codeforces.com/problemset/problem/1474/C | [
"brute force",
"constructive algorithms",
"data structures",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 14366
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1474-B | codeforces | 1474-B | Different Divisors | https://codeforces.com/problemset/problem/1474/B | [
"binary search",
"constructive algorithms",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 42761
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1474-A | codeforces | 1474-A | Puzzle From the Future | https://codeforces.com/problemset/problem/1474/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23500
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1473-G | codeforces | 1473-G | Tiles | https://codeforces.com/problemset/problem/1473/G | [
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 509
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1473-F | codeforces | 1473-F | Strange Set | https://codeforces.com/problemset/problem/1473/F | [
"flows",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1221
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1473-E | codeforces | 1473-E | Minimum Path | https://codeforces.com/problemset/problem/1473/E | [
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 5019
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1473-D | codeforces | 1473-D | Program | https://codeforces.com/problemset/problem/1473/D | [
"data structures",
"dp",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11150
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1473-C | codeforces | 1473-C | No More Inversions | https://codeforces.com/problemset/problem/1473/C | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13507
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1473-B | codeforces | 1473-B | String LCM | https://codeforces.com/problemset/problem/1473/B | [
"brute force",
"math",
"number theory",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 35574
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1473-A | codeforces | 1473-A | Replacing Elements | https://codeforces.com/problemset/problem/1473/A | [
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 37780
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1472-G | codeforces | 1472-G | Moving to the Capital | https://codeforces.com/problemset/problem/1472/G | [
"dfs and similar",
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5882
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1472-F | codeforces | 1472-F | New Year's Puzzle | https://codeforces.com/problemset/problem/1472/F | [
"brute force",
"dp",
"graph matchings",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3330
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1472-E | codeforces | 1472-E | Correct Placement | https://codeforces.com/problemset/problem/1472/E | [
"binary search",
"data structures",
"dp",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9087
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1472-D | codeforces | 1472-D | Even-Odd Game | https://codeforces.com/problemset/problem/1472/D | [
"dp",
"games",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 31180
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1472-C | codeforces | 1472-C | Long Jumps | https://codeforces.com/problemset/problem/1472/C | [
"dp",
"graphs"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 35992
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1472-B | codeforces | 1472-B | Fair Division | https://codeforces.com/problemset/problem/1472/B | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 61064
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1472-A | codeforces | 1472-A | Cards for Friends | https://codeforces.com/problemset/problem/1472/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 46122
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1471-B | codeforces | 1471-B | Strange List | https://codeforces.com/problemset/problem/1471/B | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20022
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1471-A | codeforces | 1471-A | Strange Partition | https://codeforces.com/problemset/problem/1471/A | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 40712
} | 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.