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:1599-E | codeforces | 1599-E | Two Arrays | https://codeforces.com/problemset/problem/1599/E | [
"data structures",
"matrices"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 91
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1599-D | codeforces | 1599-D | Bubble Popping | https://codeforces.com/problemset/problem/1599/D | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 34
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1599-C | codeforces | 1599-C | Bubble Strike | https://codeforces.com/problemset/problem/1599/C | [
"combinatorics",
"math",
"probabilities",
"ternary search"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1976
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1599-B | codeforces | 1599-B | Restaurant Game | https://codeforces.com/problemset/problem/1599/B | [] | null | null | stdin_stdout | 3,100 | {
"solved_count": 160
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1599-A | codeforces | 1599-A | Weights | https://codeforces.com/problemset/problem/1599/A | [
"constructive algorithms",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 882
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1598-G | codeforces | 1598-G | The Sum of Good Numbers | https://codeforces.com/problemset/problem/1598/G | [
"hashing",
"math",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 411
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1598-F | codeforces | 1598-F | RBS | https://codeforces.com/problemset/problem/1598/F | [
"binary search",
"bitmasks",
"brute force",
"data structures",
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1637
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1598-E | codeforces | 1598-E | Staircases | https://codeforces.com/problemset/problem/1598/E | [
"brute force",
"combinatorics",
"data structures",
"dfs and similar",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2506
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1598-D | codeforces | 1598-D | Training Session | https://codeforces.com/problemset/problem/1598/D | [
"combinatorics",
"data structures",
"geometry",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10549
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1598-C | codeforces | 1598-C | Delete Two Elements | https://codeforces.com/problemset/problem/1598/C | [
"data structures",
"dp",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 23735
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1598-B | codeforces | 1598-B | Groups | https://codeforces.com/problemset/problem/1598/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16976
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1598-A | codeforces | 1598-A | Computer Game | https://codeforces.com/problemset/problem/1598/A | [
"brute force",
"dfs and similar",
"dp",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25739
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1594-F | codeforces | 1594-F | Ideal Farm | https://codeforces.com/problemset/problem/1594/F | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1541
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1594-E2 | codeforces | 1594-E2 | Rubik's Cube Coloring (hard version) | https://codeforces.com/problemset/problem/1594/E2 | [
"brute force",
"dp",
"implementation",
"math",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1613
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1594-E1 | codeforces | 1594-E1 | Rubik's Cube Coloring (easy version) | https://codeforces.com/problemset/problem/1594/E1 | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12239
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1594-D | codeforces | 1594-D | The Number of Imposters | https://codeforces.com/problemset/problem/1594/D | [
"constructive algorithms",
"dfs and similar",
"dp",
"dsu",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9500
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1594-C | codeforces | 1594-C | Make Them Equal | https://codeforces.com/problemset/problem/1594/C | [
"brute force",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 28790
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1594-B | codeforces | 1594-B | Special Numbers | https://codeforces.com/problemset/problem/1594/B | [
"bitmasks",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22211
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1594-A | codeforces | 1594-A | Consecutive Sum Riddle | https://codeforces.com/problemset/problem/1594/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27206
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1593-G | codeforces | 1593-G | Changing Brackets | https://codeforces.com/problemset/problem/1593/G | [
"constructive algorithms",
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1904
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1593-F | codeforces | 1593-F | Red-Black Number | https://codeforces.com/problemset/problem/1593/F | [
"dfs and similar",
"dp",
"implementation",
"math",
"meet-in-the-middle"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2668
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1593-E | codeforces | 1593-E | Gardener and Tree | https://codeforces.com/problemset/problem/1593/E | [
"brute force",
"data structures",
"dfs and similar",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14845
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1593-D2 | codeforces | 1593-D2 | Half of Same | https://codeforces.com/problemset/problem/1593/D2 | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5581
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1593-D1 | codeforces | 1593-D1 | All are Same | https://codeforces.com/problemset/problem/1593/D1 | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22027
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1593-C | codeforces | 1593-C | Save More Mice | https://codeforces.com/problemset/problem/1593/C | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 28008
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1593-B | codeforces | 1593-B | Make it Divisible by 25 | https://codeforces.com/problemset/problem/1593/B | [
"dfs and similar",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 41368
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1593-A | codeforces | 1593-A | Elections | https://codeforces.com/problemset/problem/1593/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 41677
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1592-F2 | codeforces | 1592-F2 | Alice and Recoloring 2 | https://codeforces.com/problemset/problem/1592/F2 | [
"constructive algorithms",
"flows",
"graph matchings",
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 973
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1592-F1 | codeforces | 1592-F1 | Alice and Recoloring 1 | https://codeforces.com/problemset/problem/1592/F1 | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1082
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1592-E | codeforces | 1592-E | Bored Bakry | https://codeforces.com/problemset/problem/1592/E | [
"bitmasks",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1924
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1592-D | codeforces | 1592-D | Hemose in ICPC ? | https://codeforces.com/problemset/problem/1592/D | [
"binary search",
"dfs and similar",
"implementation",
"interactive",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2635
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1592-C | codeforces | 1592-C | Bakry and Partitioning | https://codeforces.com/problemset/problem/1592/C | [
"bitmasks",
"constructive algorithms",
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9179
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1592-B | codeforces | 1592-B | Hemose Shopping | https://codeforces.com/problemset/problem/1592/B | [
"constructive algorithms",
"dsu",
"math",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17238
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1592-A | codeforces | 1592-A | Gamer Hemose | https://codeforces.com/problemset/problem/1592/A | [
"binary search",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23828
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1588-F | codeforces | 1588-F | Jumping Through the Array | https://codeforces.com/problemset/problem/1588/F | [
"binary search",
"data structures",
"graphs",
"two pointers"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 355
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1586-I | codeforces | 1586-I | Omkar and Mosaic | https://codeforces.com/problemset/problem/1586/I | [
"combinatorics",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 299
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1585-G | codeforces | 1585-G | Poachers | https://codeforces.com/problemset/problem/1585/G | [
"dp",
"games",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 310
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1585-F | codeforces | 1585-F | Non-equal Neighbours | https://codeforces.com/problemset/problem/1585/F | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1688
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1585-E | codeforces | 1585-E | Frequency Queries | https://codeforces.com/problemset/problem/1585/E | [
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1211
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1585-D | codeforces | 1585-D | Yet Another Sorting Problem | https://codeforces.com/problemset/problem/1585/D | [
"data structures",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4395
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1585-C | codeforces | 1585-C | Minimize Distance | https://codeforces.com/problemset/problem/1585/C | [
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12853
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1585-B | codeforces | 1585-B | Array Eversion | https://codeforces.com/problemset/problem/1585/B | [
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16173
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1585-A | codeforces | 1585-A | Life of a Flower | https://codeforces.com/problemset/problem/1585/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18950
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1584-G | codeforces | 1584-G | Eligible Segments | https://codeforces.com/problemset/problem/1584/G | [
"geometry"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 246
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1584-F | codeforces | 1584-F | Strange LCS | https://codeforces.com/problemset/problem/1584/F | [
"bitmasks",
"dp",
"graphs",
"greedy",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1118
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1584-E | codeforces | 1584-E | Game with Stones | https://codeforces.com/problemset/problem/1584/E | [
"binary search",
"data structures",
"games",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1475
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1584-D | codeforces | 1584-D | Guess the Permutation | https://codeforces.com/problemset/problem/1584/D | [
"binary search",
"combinatorics",
"interactive",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3997
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1584-C | codeforces | 1584-C | Two Arrays | https://codeforces.com/problemset/problem/1584/C | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 17754
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1584-B | codeforces | 1584-B | Coloring Rectangles | https://codeforces.com/problemset/problem/1584/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 14373
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1584-A | codeforces | 1584-A | Mathematical Addition | https://codeforces.com/problemset/problem/1584/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15551
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1583-H | codeforces | 1583-H | Omkar and Tours | https://codeforces.com/problemset/problem/1583/H | [
"data structures",
"divide and conquer",
"sortings",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 407
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1583-G | codeforces | 1583-G | Omkar and Time Travel | https://codeforces.com/problemset/problem/1583/G | [
"data structures",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 498
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1583-F | codeforces | 1583-F | Defender of Childhood Dreams | https://codeforces.com/problemset/problem/1583/F | [
"bitmasks",
"constructive algorithms",
"divide and conquer"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1540
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1583-E | codeforces | 1583-E | Moment of Bloom | https://codeforces.com/problemset/problem/1583/E | [
"constructive algorithms",
"dfs and similar",
"graph matchings",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2493
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1583-D | codeforces | 1583-D | Omkar and the Meaning of Life | https://codeforces.com/problemset/problem/1583/D | [
"constructive algorithms",
"greedy",
"interactive"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5943
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1583-C | codeforces | 1583-C | Omkar and Determination | https://codeforces.com/problemset/problem/1583/C | [
"data structures",
"dp"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7447
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1583-B | codeforces | 1583-B | Omkar and Heavenly Tree | https://codeforces.com/problemset/problem/1583/B | [
"constructive algorithms",
"trees"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 13299
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1583-A | codeforces | 1583-A | Windblume Ode | https://codeforces.com/problemset/problem/1583/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14386
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1582-G | codeforces | 1582-G | Kuzya and Homework | https://codeforces.com/problemset/problem/1582/G | [
"data structures",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 704
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1582-F2 | codeforces | 1582-F2 | Korney Korneevich and XOR (hard version) | https://codeforces.com/problemset/problem/1582/F2 | [
"binary search",
"brute force",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2139
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1582-F1 | codeforces | 1582-F1 | Korney Korneevich and XOR (easy version) | https://codeforces.com/problemset/problem/1582/F1 | [
"bitmasks",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6617
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1582-E | codeforces | 1582-E | Pchelyonok and Segments | https://codeforces.com/problemset/problem/1582/E | [
"binary search",
"data structures",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4234
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1582-D | codeforces | 1582-D | Vupsen, Pupsen and 0 | https://codeforces.com/problemset/problem/1582/D | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11614
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1582-C | codeforces | 1582-C | Grandma Capa Knits a Scarf | https://codeforces.com/problemset/problem/1582/C | [
"brute force",
"data structures",
"greedy",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 24092
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1582-B | codeforces | 1582-B | Luntik and Subsequences | https://codeforces.com/problemset/problem/1582/B | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 34086
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1582-A | codeforces | 1582-A | Luntik and Concerts | https://codeforces.com/problemset/problem/1582/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19789
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1581-B | codeforces | 1581-B | Diameter of Graph | https://codeforces.com/problemset/problem/1581/B | [
"constructive algorithms",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12536
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1581-A | codeforces | 1581-A | CQXYM Count Permutations | https://codeforces.com/problemset/problem/1581/A | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14303
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1580-F | codeforces | 1580-F | Problems for Codeforces | https://codeforces.com/problemset/problem/1580/F | [
"combinatorics",
"fft",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 149
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1580-E | codeforces | 1580-E | Railway Construction | https://codeforces.com/problemset/problem/1580/E | [
"brute force",
"constructive algorithms",
"data structures",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 124
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1580-D | codeforces | 1580-D | Subsequence | https://codeforces.com/problemset/problem/1580/D | [
"brute force",
"divide and conquer",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1112
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1580-C | codeforces | 1580-C | Train Maintenance | https://codeforces.com/problemset/problem/1580/C | [
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2249
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1580-B | codeforces | 1580-B | Mathematics Curriculum | https://codeforces.com/problemset/problem/1580/B | [
"brute force",
"combinatorics",
"dp",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1289
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1580-A | codeforces | 1580-A | Portal | https://codeforces.com/problemset/problem/1580/A | [
"brute force",
"data structures",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3934
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1579-G | codeforces | 1579-G | Minimal Coverage | https://codeforces.com/problemset/problem/1579/G | [
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2758
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1579-F | codeforces | 1579-F | Array Stabilization (AND version) | https://codeforces.com/problemset/problem/1579/F | [
"brute force",
"graphs",
"math",
"number theory",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5381
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1579-E2 | codeforces | 1579-E2 | Array Optimization by Deque | https://codeforces.com/problemset/problem/1579/E2 | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7418
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1579-E1 | codeforces | 1579-E1 | Permutation Minimization by Deque | https://codeforces.com/problemset/problem/1579/E1 | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 25312
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1579-D | codeforces | 1579-D | Productive Meeting | https://codeforces.com/problemset/problem/1579/D | [
"constructive algorithms",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 18492
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1579-C | codeforces | 1579-C | Ticks | https://codeforces.com/problemset/problem/1579/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11687
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1579-B | codeforces | 1579-B | Shifting Sort | https://codeforces.com/problemset/problem/1579/B | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 18956
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1579-A | codeforces | 1579-A | Casimir's String Solitaire | https://codeforces.com/problemset/problem/1579/A | [
"math",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 42184
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1578-M | codeforces | 1578-M | The Mind | https://codeforces.com/problemset/problem/1578/M | [
"constructive algorithms",
"interactive",
"probabilities"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 521
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1578-L | codeforces | 1578-L | Labyrinth | https://codeforces.com/problemset/problem/1578/L | [
"binary search",
"dsu",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1438
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1578-K | codeforces | 1578-K | Kingdom of Islands | https://codeforces.com/problemset/problem/1578/K | [
"brute force",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 410
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1578-J | codeforces | 1578-J | Just Kingdom | https://codeforces.com/problemset/problem/1578/J | [
"brute force",
"data structures",
"dfs and similar"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 346
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1578-I | codeforces | 1578-I | Interactive Rays | https://codeforces.com/problemset/problem/1578/I | [
"geometry",
"interactive"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 73
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1578-H | codeforces | 1578-H | Higher Order Functions | https://codeforces.com/problemset/problem/1578/H | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2177
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1578-G | codeforces | 1578-G | Game of Chance | https://codeforces.com/problemset/problem/1578/G | [
"math",
"probabilities"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 60
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1578-F | codeforces | 1578-F | Framing Pictures | https://codeforces.com/problemset/problem/1578/F | [
"geometry"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 188
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1578-E | codeforces | 1578-E | Easy Scheduling | https://codeforces.com/problemset/problem/1578/E | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 4149
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1578-D | codeforces | 1578-D | Dragon Curve | https://codeforces.com/problemset/problem/1578/D | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 56
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1578-C | codeforces | 1578-C | Cactus Lady and her Cing | https://codeforces.com/problemset/problem/1578/C | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 16
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1578-B | codeforces | 1578-B | Building Forest Trails | https://codeforces.com/problemset/problem/1578/B | [
"data structures",
"dsu"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 476
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1578-A | codeforces | 1578-A | Anti-Tetris | https://codeforces.com/problemset/problem/1578/A | [
"constructive algorithms",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 425
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1576-A | codeforces | 1576-A | Communication Routing Challenge | https://codeforces.com/problemset/problem/1576/A | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 0
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1575-M | codeforces | 1575-M | Managing Telephone Poles | https://codeforces.com/problemset/problem/1575/M | [
"data structures",
"geometry"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 359
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1575-L | codeforces | 1575-L | Longest Array Deconstruction | https://codeforces.com/problemset/problem/1575/L | [
"data structures",
"divide and conquer",
"dp",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1719
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1575-K | codeforces | 1575-K | Knitting Batik | https://codeforces.com/problemset/problem/1575/K | [
"implementation",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 799
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1575-J | codeforces | 1575-J | Jeopardy of Dropped Balls | https://codeforces.com/problemset/problem/1575/J | [
"binary search",
"brute force",
"dsu",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4275
} | 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.