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:1532-E | codeforces | 1532-E | Good Array | https://codeforces.com/problemset/problem/1532/E | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 396
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1532-D | codeforces | 1532-D | Teams Forming | https://codeforces.com/problemset/problem/1532/D | [
"*special",
"sortings"
] | null | null | stdin_stdout | null | {
"solved_count": 591
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1532-C | codeforces | 1532-C | Uniform String | https://codeforces.com/problemset/problem/1532/C | [
"*special",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 642
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1532-B | codeforces | 1532-B | Frog Jumping | https://codeforces.com/problemset/problem/1532/B | [
"*special",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 830
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1532-A | codeforces | 1532-A | A+B (Trial Problem) | https://codeforces.com/problemset/problem/1532/A | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 1151
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1531-E3 | codeforces | 1531-E3 | Сортировка слиянием | https://codeforces.com/problemset/problem/1531/E3 | [
"*special",
"binary search"
] | null | null | stdin_stdout | null | {
"solved_count": 272
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1531-E2 | codeforces | 1531-E2 | Сортировка слиянием | https://codeforces.com/problemset/problem/1531/E2 | [
"*special",
"brute force"
] | null | null | stdin_stdout | null | {
"solved_count": 342
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1531-E1 | codeforces | 1531-E1 | Сортировка слиянием | https://codeforces.com/problemset/problem/1531/E1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 363
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1531-D | codeforces | 1531-D | Редактируем Зингер | color | https://codeforces.com/problemset/problem/1531/D | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 371
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1531-C | codeforces | 1531-C | Симметричный амфитеатр | https://codeforces.com/problemset/problem/1531/C | [
"*special",
"constructive algorithms",
"dp"
] | null | null | stdin_stdout | null | {
"solved_count": 663
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1531-B2 | codeforces | 1531-B2 | Мониторинг | https://codeforces.com/problemset/problem/1531/B2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 797
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1531-B1 | codeforces | 1531-B1 | Мониторинг | https://codeforces.com/problemset/problem/1531/B1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 1158
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1531-A | codeforces | 1531-A | Зингер | color | https://codeforces.com/problemset/problem/1531/A | [
"*special",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 1489
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1530-H | codeforces | 1530-H | Turing's Award | https://codeforces.com/problemset/problem/1530/H | [
"data structures",
"dp"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 212
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1530-G | codeforces | 1530-G | What a Reversal | https://codeforces.com/problemset/problem/1530/G | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 190
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1530-F | codeforces | 1530-F | Bingo | https://codeforces.com/problemset/problem/1530/F | [
"bitmasks",
"combinatorics",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1223
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1530-E | codeforces | 1530-E | Minimax | https://codeforces.com/problemset/problem/1530/E | [
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3425
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1530-D | codeforces | 1530-D | Secret Santa | https://codeforces.com/problemset/problem/1530/D | [
"constructive algorithms",
"flows",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10352
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1530-C | codeforces | 1530-C | Pursuit | https://codeforces.com/problemset/problem/1530/C | [
"binary search",
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 15872
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1530-B | codeforces | 1530-B | Putting Plates | https://codeforces.com/problemset/problem/1530/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16368
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1530-A | codeforces | 1530-A | Binary Decimal | https://codeforces.com/problemset/problem/1530/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22099
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1529-B | codeforces | 1529-B | Sifid and Strange Subsequences | https://codeforces.com/problemset/problem/1529/B | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21379
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1529-A | codeforces | 1529-A | Eshag Loves Big Arrays | https://codeforces.com/problemset/problem/1529/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31297
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1528-F | codeforces | 1528-F | AmShZ Farm | https://codeforces.com/problemset/problem/1528/F | [
"combinatorics",
"fft",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 560
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1528-E | codeforces | 1528-E | Mashtali and Hagh Trees | https://codeforces.com/problemset/problem/1528/E | [
"combinatorics",
"dp",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 661
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1528-D | codeforces | 1528-D | It's a bird! No, it's a plane! No, it's AaParsa! | https://codeforces.com/problemset/problem/1528/D | [
"constructive algorithms",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1822
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1528-C | codeforces | 1528-C | Trees of Tranquillity | https://codeforces.com/problemset/problem/1528/C | [
"data structures",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3160
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1528-B | codeforces | 1528-B | Kavi on Pairing Duty | https://codeforces.com/problemset/problem/1528/B | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11201
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1528-A | codeforces | 1528-A | Parsa's Humongous Tree | https://codeforces.com/problemset/problem/1528/A | [
"dfs and similar",
"divide and conquer",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 20697
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1527-E | codeforces | 1527-E | Partition Game | https://codeforces.com/problemset/problem/1527/E | [
"binary search",
"data structures",
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 3254
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1527-D | codeforces | 1527-D | MEX Tree | https://codeforces.com/problemset/problem/1527/D | [
"combinatorics",
"dfs and similar",
"implementation",
"math",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2408
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1527-C | codeforces | 1527-C | Sequence Pair Weight | https://codeforces.com/problemset/problem/1527/C | [
"hashing",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15461
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1527-B2 | codeforces | 1527-B2 | Palindrome Game (hard version) | https://codeforces.com/problemset/problem/1527/B2 | [
"constructive algorithms",
"games"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8954
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1527-B1 | codeforces | 1527-B1 | Palindrome Game (easy version) | https://codeforces.com/problemset/problem/1527/B1 | [
"constructive algorithms",
"games"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 37385
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1527-A | codeforces | 1527-A | And Then There Were K | https://codeforces.com/problemset/problem/1527/A | [
"bitmasks"
] | null | null | stdin_stdout | 800 | {
"solved_count": 43558
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1526-F | codeforces | 1526-F | Median Queries | https://codeforces.com/problemset/problem/1526/F | [
"constructive algorithms",
"interactive",
"probabilities"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 419
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1526-E | codeforces | 1526-E | Oolimry and Suffix Array | https://codeforces.com/problemset/problem/1526/E | [
"combinatorics",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1614
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1526-D | codeforces | 1526-D | Kill Anton | https://codeforces.com/problemset/problem/1526/D | [
"brute force",
"constructive algorithms",
"data structures",
"math",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2889
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1526-C2 | codeforces | 1526-C2 | Potions (Hard Version) | https://codeforces.com/problemset/problem/1526/C2 | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 33483
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1526-C1 | codeforces | 1526-C1 | Potions (Easy Version) | https://codeforces.com/problemset/problem/1526/C1 | [
"brute force",
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 28868
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1526-B | codeforces | 1526-B | I Hate 1111 | https://codeforces.com/problemset/problem/1526/B | [
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 38527
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1526-A | codeforces | 1526-A | Mean Inequality | https://codeforces.com/problemset/problem/1526/A | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25188
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1525-F | codeforces | 1525-F | Goblins And Gnomes | https://codeforces.com/problemset/problem/1525/F | [
"brute force",
"dp",
"flows",
"graph matchings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 519
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1525-E | codeforces | 1525-E | Assimilation IV | https://codeforces.com/problemset/problem/1525/E | [
"combinatorics",
"dp",
"math",
"probabilities",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2607
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1525-D | codeforces | 1525-D | Armchairs | https://codeforces.com/problemset/problem/1525/D | [
"dp",
"flows",
"graph matchings",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 11232
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1525-C | codeforces | 1525-C | Robot Collisions | https://codeforces.com/problemset/problem/1525/C | [
"data structures",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5171
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1525-B | codeforces | 1525-B | Permutation Sort | https://codeforces.com/problemset/problem/1525/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 26951
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1525-A | codeforces | 1525-A | Potion-making | https://codeforces.com/problemset/problem/1525/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27299
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1523-H | codeforces | 1523-H | Hopping Around the Array | https://codeforces.com/problemset/problem/1523/H | [
"data structures",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 469
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1523-G | codeforces | 1523-G | Try Booking | https://codeforces.com/problemset/problem/1523/G | [
"data structures",
"divide and conquer"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 605
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1523-F | codeforces | 1523-F | Favorite Game | https://codeforces.com/problemset/problem/1523/F | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 557
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1523-E | codeforces | 1523-E | Crypto Lights | https://codeforces.com/problemset/problem/1523/E | [
"combinatorics",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 2064
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1523-D | codeforces | 1523-D | Love-Hate | https://codeforces.com/problemset/problem/1523/D | [
"bitmasks",
"brute force",
"dp",
"probabilities"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2590
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1523-C | codeforces | 1523-C | Compression and Expansion | https://codeforces.com/problemset/problem/1523/C | [
"brute force",
"data structures",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9251
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1523-B | codeforces | 1523-B | Lord of the Values | https://codeforces.com/problemset/problem/1523/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12593
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1523-A | codeforces | 1523-A | Game of Life | https://codeforces.com/problemset/problem/1523/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14118
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1521-E | codeforces | 1521-E | Nastia and a Beautiful Matrix | https://codeforces.com/problemset/problem/1521/E | [
"binary search",
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 774
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1521-D | codeforces | 1521-D | Nastia Plays with a Tree | https://codeforces.com/problemset/problem/1521/D | [
"constructive algorithms",
"data structures",
"dfs and similar",
"dp",
"dsu",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2492
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1521-C | codeforces | 1521-C | Nastia and a Hidden Permutation | https://codeforces.com/problemset/problem/1521/C | [
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4708
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1521-B | codeforces | 1521-B | Nastia and a Good Array | https://codeforces.com/problemset/problem/1521/B | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 23365
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1521-A | codeforces | 1521-A | Nastia and Nearly Good Numbers | https://codeforces.com/problemset/problem/1521/A | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 43060
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1520-G | codeforces | 1520-G | To Go Or Not To Go? | https://codeforces.com/problemset/problem/1520/G | [
"brute force",
"dfs and similar",
"graphs",
"greedy",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4469
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1520-F2 | codeforces | 1520-F2 | Guess the K-th Zero (Hard version) | https://codeforces.com/problemset/problem/1520/F2 | [
"binary search",
"constructive algorithms",
"data structures",
"interactive"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3480
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1520-F1 | codeforces | 1520-F1 | Guess the K-th Zero (Easy version) | https://codeforces.com/problemset/problem/1520/F1 | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15352
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1520-E | codeforces | 1520-E | Arranging The Sheep | https://codeforces.com/problemset/problem/1520/E | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 31194
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1520-D | codeforces | 1520-D | Same Differences | https://codeforces.com/problemset/problem/1520/D | [
"data structures",
"hashing",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 71657
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1520-C | codeforces | 1520-C | Not Adjacent Matrix | https://codeforces.com/problemset/problem/1520/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 35301
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1520-B | codeforces | 1520-B | Ordinary Numbers | https://codeforces.com/problemset/problem/1520/B | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 51071
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1520-A | codeforces | 1520-A | Do Not Be Distracted! | https://codeforces.com/problemset/problem/1520/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 60182
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1519-F | codeforces | 1519-F | Chests and Keys | https://codeforces.com/problemset/problem/1519/F | [
"bitmasks",
"brute force",
"dfs and similar",
"dp",
"flows"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 896
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1519-E | codeforces | 1519-E | Off by One | https://codeforces.com/problemset/problem/1519/E | [
"constructive algorithms",
"dfs and similar",
"geometry",
"graphs",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1010
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1519-D | codeforces | 1519-D | Maximum Sum of Products | https://codeforces.com/problemset/problem/1519/D | [
"brute force",
"dp",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 18220
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1519-C | codeforces | 1519-C | Berland Regional | https://codeforces.com/problemset/problem/1519/C | [
"brute force",
"data structures",
"greedy",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 24328
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1519-B | codeforces | 1519-B | The Cake Is a Lie | https://codeforces.com/problemset/problem/1519/B | [
"dp",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33880
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1519-A | codeforces | 1519-A | Red and Blue Beans | https://codeforces.com/problemset/problem/1519/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30958
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1517-H | codeforces | 1517-H | Fly Around the World | https://codeforces.com/problemset/problem/1517/H | [
"dp",
"geometry"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 103
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1517-G | codeforces | 1517-G | Starry Night Camping | https://codeforces.com/problemset/problem/1517/G | [
"constructive algorithms",
"flows",
"graphs"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 778
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1517-F | codeforces | 1517-F | Reunion | https://codeforces.com/problemset/problem/1517/F | [
"combinatorics",
"dp",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 739
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1517-E | codeforces | 1517-E | Group Photo | https://codeforces.com/problemset/problem/1517/E | [
"binary search",
"data structures",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1074
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1517-D | codeforces | 1517-D | Explorer Space | https://codeforces.com/problemset/problem/1517/D | [
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9685
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1517-C | codeforces | 1517-C | Fillomino 2 | https://codeforces.com/problemset/problem/1517/C | [
"constructive algorithms",
"dfs and similar",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14333
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1517-B | codeforces | 1517-B | Morning Jogging | https://codeforces.com/problemset/problem/1517/B | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 13939
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1517-A | codeforces | 1517-A | Sum of 2050 | https://codeforces.com/problemset/problem/1517/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27139
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1516-E | codeforces | 1516-E | Baby Ehab Plays with Permutations | https://codeforces.com/problemset/problem/1516/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1121
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1516-D | codeforces | 1516-D | Cut | https://codeforces.com/problemset/problem/1516/D | [
"binary search",
"data structures",
"dp",
"graphs",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5532
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1516-C | codeforces | 1516-C | Baby Ehab Partitions Again | https://codeforces.com/problemset/problem/1516/C | [
"bitmasks",
"constructive algorithms",
"dp",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 14807
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1516-B | codeforces | 1516-B | AGAGA XOOORRR | https://codeforces.com/problemset/problem/1516/B | [
"bitmasks",
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 27685
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1516-A | codeforces | 1516-A | Tit for Tat | https://codeforces.com/problemset/problem/1516/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24941
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1515-I | codeforces | 1515-I | Phoenix and Diamonds | https://codeforces.com/problemset/problem/1515/I | [
"binary search",
"data structures",
"sortings"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 451
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1515-H | codeforces | 1515-H | Phoenix and Bits | https://codeforces.com/problemset/problem/1515/H | [
"bitmasks",
"brute force",
"data structures",
"sortings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 375
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1515-G | codeforces | 1515-G | Phoenix and Odometers | https://codeforces.com/problemset/problem/1515/G | [
"dfs and similar",
"graphs",
"math",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1452
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1515-F | codeforces | 1515-F | Phoenix and Earthquake | https://codeforces.com/problemset/problem/1515/F | [
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 2292
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1515-E | codeforces | 1515-E | Phoenix and Computers | https://codeforces.com/problemset/problem/1515/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4885
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1515-D | codeforces | 1515-D | Phoenix and Socks | https://codeforces.com/problemset/problem/1515/D | [
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13059
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1515-C | codeforces | 1515-C | Phoenix and Towers | https://codeforces.com/problemset/problem/1515/C | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 19246
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1515-B | codeforces | 1515-B | Phoenix and Puzzle | https://codeforces.com/problemset/problem/1515/B | [
"brute force",
"geometry",
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 27450
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1515-A | codeforces | 1515-A | Phoenix and Gold | https://codeforces.com/problemset/problem/1515/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21623
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1514-E | codeforces | 1514-E | Baby Ehab's Hyper Apartment | https://codeforces.com/problemset/problem/1514/E | [
"binary search",
"graphs",
"interactive",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 728
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1514-D | codeforces | 1514-D | Cut and Stick | https://codeforces.com/problemset/problem/1514/D | [
"binary search",
"data structures",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5147
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1514-C | codeforces | 1514-C | Product 1 Modulo N | https://codeforces.com/problemset/problem/1514/C | [
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 19389
} | 2026-11-02T05:37:07.883505+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.