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: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": 690
} | 2026-06-01T05:00:40.145500+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": 347
} | 2026-06-01T05:00:40.145500+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": 1763
} | 2026-06-01T05:00:40.145500+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": 3783
} | 2026-06-01T05:00:40.145500+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": 4122
} | 2026-06-01T05:00:40.145500+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": 10044
} | 2026-06-01T05:00:40.145500+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": 9630
} | 2026-06-01T05:00:40.145500+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": 21323
} | 2026-06-01T05:00:40.145500+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": 739
} | 2026-06-01T05:00:40.145500+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": 2424
} | 2026-06-01T05:00:40.145500+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": 4886
} | 2026-06-01T05:00:40.145500+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": 12436
} | 2026-06-01T05:00:40.145500+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": 19927
} | 2026-06-01T05:00:40.145500+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": 25770
} | 2026-06-01T05:00:40.145500+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": 17949
} | 2026-06-01T05:00:40.145500+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": 27192
} | 2026-06-01T05:00:40.145500+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": 266
} | 2026-06-01T05:00:40.145500+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": 1348
} | 2026-06-01T05:00:40.145500+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": 1446
} | 2026-06-01T05:00:40.145500+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": 4439
} | 2026-06-01T05:00:40.145500+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": 7479
} | 2026-06-01T05:00:40.145500+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": 13149
} | 2026-06-01T05:00:40.145500+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": 10653
} | 2026-06-01T05:00:40.145500+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": 19026
} | 2026-06-01T05:00:40.145500+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": 28063
} | 2026-06-01T05:00:40.145500+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": 173
} | 2026-06-01T05:00:40.145500+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": 181
} | 2026-06-01T05:00:40.145500+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": 791
} | 2026-06-01T05:00:40.145500+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": 2595
} | 2026-06-01T05:00:40.145500+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": 3557
} | 2026-06-01T05:00:40.145500+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": 6549
} | 2026-06-01T05:00:40.145500+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": 743
} | 2026-06-01T05:00:40.145500+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": 1164
} | 2026-06-01T05:00:40.145500+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": 2763
} | 2026-06-01T05:00:40.145500+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": 9254
} | 2026-06-01T05:00:40.145500+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": 12325
} | 2026-06-01T05:00:40.145500+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": 21686
} | 2026-06-01T05:00:40.145500+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": 45173
} | 2026-06-01T05:00:40.145500+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": 7873
} | 2026-06-01T05:00:40.145500+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": 5923
} | 2026-06-01T05:00:40.145500+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": 17879
} | 2026-06-01T05:00:40.145500+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": 11222
} | 2026-06-01T05:00:40.145500+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": 27487
} | 2026-06-01T05:00:40.145500+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": 57564
} | 2026-06-01T05:00:40.145500+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": 88005
} | 2026-06-01T05:00:40.145500+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": 324
} | 2026-06-01T05:00:40.145500+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": 1465
} | 2026-06-01T05:00:40.145500+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": 4322
} | 2026-06-01T05:00:40.145500+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": 14217
} | 2026-06-01T05:00:40.145500+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": 40919
} | 2026-06-01T05:00:40.145500+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": 23396
} | 2026-06-01T05:00:40.145500+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": 455
} | 2026-06-01T05:00:40.145500+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": 1148
} | 2026-06-01T05:00:40.145500+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": 4785
} | 2026-06-01T05:00:40.145500+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": 11001
} | 2026-06-01T05:00:40.145500+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": 13449
} | 2026-06-01T05:00:40.145500+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": 35217
} | 2026-06-01T05:00:40.145500+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": 37551
} | 2026-06-01T05:00:40.145500+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": 5691
} | 2026-06-01T05:00:40.145500+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": 3299
} | 2026-06-01T05:00:40.145500+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": 8983
} | 2026-06-01T05:00:40.145500+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": 30711
} | 2026-06-01T05:00:40.145500+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": 35539
} | 2026-06-01T05:00:40.145500+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": 60205
} | 2026-06-01T05:00:40.145500+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": 45701
} | 2026-06-01T05:00:40.145500+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": 19950
} | 2026-06-01T05:00:40.145500+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": 38838
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1470-F | codeforces | 1470-F | Strange Covering | https://codeforces.com/problemset/problem/1470/F | [
"divide and conquer"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 163
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1470-E | codeforces | 1470-E | Strange Permutation | https://codeforces.com/problemset/problem/1470/E | [
"binary search",
"combinatorics",
"data structures",
"dp",
"graphs",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 375
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1470-D | codeforces | 1470-D | Strange Housing | https://codeforces.com/problemset/problem/1470/D | [
"constructive algorithms",
"dfs and similar",
"graph matchings",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4196
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1470-C | codeforces | 1470-C | Strange Shuffle | https://codeforces.com/problemset/problem/1470/C | [
"binary search",
"brute force",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1440
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1470-B | codeforces | 1470-B | Strange Definition | https://codeforces.com/problemset/problem/1470/B | [
"bitmasks",
"graphs",
"hashing",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6791
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1470-A | codeforces | 1470-A | Strange Birthday Party | https://codeforces.com/problemset/problem/1470/A | [
"binary search",
"dp",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 29715
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1469-F | codeforces | 1469-F | Power Sockets | https://codeforces.com/problemset/problem/1469/F | [
"binary search",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1088
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1469-E | codeforces | 1469-E | A Bit Similar | https://codeforces.com/problemset/problem/1469/E | [
"bitmasks",
"brute force",
"hashing",
"string suffix structures",
"strings",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2201
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1469-D | codeforces | 1469-D | Ceil Divisions | https://codeforces.com/problemset/problem/1469/D | [
"brute force",
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10226
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1469-C | codeforces | 1469-C | Building a Fence | https://codeforces.com/problemset/problem/1469/C | [
"dp",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11709
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1469-B | codeforces | 1469-B | Red and Blue | https://codeforces.com/problemset/problem/1469/B | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 31166
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1469-A | codeforces | 1469-A | Regular Bracket Sequence | https://codeforces.com/problemset/problem/1469/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 30089
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1468-N | codeforces | 1468-N | Waste Sorting | https://codeforces.com/problemset/problem/1468/N | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 9165
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1468-M | codeforces | 1468-M | Similar Sets | https://codeforces.com/problemset/problem/1468/M | [
"data structures",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1134
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1468-L | codeforces | 1468-L | Prime Divisors Selection | https://codeforces.com/problemset/problem/1468/L | [
"binary search",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 371
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1468-K | codeforces | 1468-K | The Robot | https://codeforces.com/problemset/problem/1468/K | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5609
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1468-J | codeforces | 1468-J | Road Reform | https://codeforces.com/problemset/problem/1468/J | [
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5981
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1468-I | codeforces | 1468-I | Plane Tiling | https://codeforces.com/problemset/problem/1468/I | [
"geometry",
"implementation",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 574
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1468-H | codeforces | 1468-H | K and Medians | https://codeforces.com/problemset/problem/1468/H | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2001
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1468-G | codeforces | 1468-G | Hobbits | https://codeforces.com/problemset/problem/1468/G | [
"binary search",
"geometry"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 889
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1468-F | codeforces | 1468-F | Full Turn | https://codeforces.com/problemset/problem/1468/F | [
"geometry",
"hashing",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4225
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1468-E | codeforces | 1468-E | Four Segments | https://codeforces.com/problemset/problem/1468/E | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 9825
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1468-D | codeforces | 1468-D | Firecrackers | https://codeforces.com/problemset/problem/1468/D | [
"binary search",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5309
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1468-C | codeforces | 1468-C | Berpizza | https://codeforces.com/problemset/problem/1468/C | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11377
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1468-B | codeforces | 1468-B | Bakery | https://codeforces.com/problemset/problem/1468/B | [
"data structures",
"dsu"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 243
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1468-A | codeforces | 1468-A | LaIS | https://codeforces.com/problemset/problem/1468/A | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1951
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1467-E | codeforces | 1467-E | Distinctive Roots in a Tree | https://codeforces.com/problemset/problem/1467/E | [
"data structures",
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1775
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1467-D | codeforces | 1467-D | Sum of Paths | https://codeforces.com/problemset/problem/1467/D | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4033
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1467-C | codeforces | 1467-C | Three Bags | https://codeforces.com/problemset/problem/1467/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6798
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1467-B | codeforces | 1467-B | Hills And Valleys | https://codeforces.com/problemset/problem/1467/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11565
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1467-A | codeforces | 1467-A | Wizard of Orz | https://codeforces.com/problemset/problem/1467/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 25334
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1466-I | codeforces | 1466-I | The Riddle of the Sphinx | https://codeforces.com/problemset/problem/1466/I | [
"binary search",
"data structures",
"interactive"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 247
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1466-H | codeforces | 1466-H | Finding satisfactory solutions | https://codeforces.com/problemset/problem/1466/H | [
"combinatorics",
"dp",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 490
} | 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.