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:988-C | codeforces | 988-C | Equal Sums | https://codeforces.com/problemset/problem/988/C | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11166
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:988-B | codeforces | 988-B | Substrings Sort | https://codeforces.com/problemset/problem/988/B | [
"sortings",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20361
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:988-A | codeforces | 988-A | Diverse Team | https://codeforces.com/problemset/problem/988/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28601
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:987-C | codeforces | 987-C | Three displays | https://codeforces.com/problemset/problem/987/C | [
"brute force",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15102
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:987-B | codeforces | 987-B | High School: Become Human | https://codeforces.com/problemset/problem/987/B | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12241
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:987-A | codeforces | 987-A | Infinity Gauntlet | https://codeforces.com/problemset/problem/987/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17528
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:986-F | codeforces | 986-F | Oppa Funcan Style Remastered | https://codeforces.com/problemset/problem/986/F | [
"graphs",
"math",
"number theory",
"shortest paths"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 750
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:986-E | codeforces | 986-E | Prince's Problem | https://codeforces.com/problemset/problem/986/E | [
"brute force",
"data structures",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 909
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:986-D | codeforces | 986-D | Perfect Encoding | https://codeforces.com/problemset/problem/986/D | [
"fft",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 356
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:986-C | codeforces | 986-C | AND Graph | https://codeforces.com/problemset/problem/986/C | [
"bitmasks",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2723
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:986-B | codeforces | 986-B | Petr and Permutations | https://codeforces.com/problemset/problem/986/B | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5060
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:986-A | codeforces | 986-A | Fair | https://codeforces.com/problemset/problem/986/A | [
"graphs",
"greedy",
"number theory",
"shortest paths"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8380
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:985-G | codeforces | 985-G | Team Players | https://codeforces.com/problemset/problem/985/G | [
"combinatorics"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 726
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:985-F | codeforces | 985-F | Isomorphic Strings | https://codeforces.com/problemset/problem/985/F | [
"hashing",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2179
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:985-E | codeforces | 985-E | Pencils and Boxes | https://codeforces.com/problemset/problem/985/E | [
"binary search",
"data structures",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4169
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:985-D | codeforces | 985-D | Sand Fortress | https://codeforces.com/problemset/problem/985/D | [
"binary search",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2754
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:985-C | codeforces | 985-C | Liebig's Barrels | https://codeforces.com/problemset/problem/985/C | [
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5979
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:985-B | codeforces | 985-B | Switches and Lamps | https://codeforces.com/problemset/problem/985/B | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 7887
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:985-A | codeforces | 985-A | Chess Placing | https://codeforces.com/problemset/problem/985/A | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 8432
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:984-B | codeforces | 984-B | Minesweeper | https://codeforces.com/problemset/problem/984/B | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 7987
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:984-A | codeforces | 984-A | Game | https://codeforces.com/problemset/problem/984/A | [
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20789
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:983-E | codeforces | 983-E | NN country | https://codeforces.com/problemset/problem/983/E | [
"binary search",
"data structures",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1203
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:983-D | codeforces | 983-D | Arkady and Rectangles | https://codeforces.com/problemset/problem/983/D | [
"data structures"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 535
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:983-C | codeforces | 983-C | Elevator | https://codeforces.com/problemset/problem/983/C | [
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 942
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:983-B | codeforces | 983-B | XOR-pyramid | https://codeforces.com/problemset/problem/983/B | [
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6344
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:983-A | codeforces | 983-A | Finite or not? | https://codeforces.com/problemset/problem/983/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4796
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:982-F | codeforces | 982-F | The Meeting Place Cannot Be Changed | https://codeforces.com/problemset/problem/982/F | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 223
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:982-E | codeforces | 982-E | Billiard | https://codeforces.com/problemset/problem/982/E | [
"geometry",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 829
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:982-D | codeforces | 982-D | Shark | https://codeforces.com/problemset/problem/982/D | [
"brute force",
"data structures",
"dsu",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2524
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:982-C | codeforces | 982-C | Cut 'em all! | https://codeforces.com/problemset/problem/982/C | [
"dfs and similar",
"dp",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 16115
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:982-B | codeforces | 982-B | Bus of Characters | https://codeforces.com/problemset/problem/982/B | [
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 8976
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:982-A | codeforces | 982-A | Row | https://codeforces.com/problemset/problem/982/A | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9737
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:981-H | codeforces | 981-H | K Paths | https://codeforces.com/problemset/problem/981/H | [
"combinatorics",
"data structures",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 289
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:981-G | codeforces | 981-G | Magic multisets | https://codeforces.com/problemset/problem/981/G | [
"data structures"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 766
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:981-F | codeforces | 981-F | Round Marriage | https://codeforces.com/problemset/problem/981/F | [
"binary search",
"graph matchings",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 910
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:981-E | codeforces | 981-E | Addition on Segments | https://codeforces.com/problemset/problem/981/E | [
"bitmasks",
"data structures",
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2552
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:981-D | codeforces | 981-D | Bookshelves | https://codeforces.com/problemset/problem/981/D | [
"bitmasks",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3566
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:981-C | codeforces | 981-C | Useful Decomposition | https://codeforces.com/problemset/problem/981/C | [
"implementation",
"trees"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 6886
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:981-B | codeforces | 981-B | Businessmen Problems | https://codeforces.com/problemset/problem/981/B | [
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 8068
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:981-A | codeforces | 981-A | Antipalindrome | https://codeforces.com/problemset/problem/981/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 10364
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:980-F | codeforces | 980-F | Cactus to Tree | https://codeforces.com/problemset/problem/980/F | [
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 216
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:980-E | codeforces | 980-E | The Number Games | https://codeforces.com/problemset/problem/980/E | [
"data structures",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2123
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:980-D | codeforces | 980-D | Perfect Groups | https://codeforces.com/problemset/problem/980/D | [
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3015
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:980-C | codeforces | 980-C | Posterized | https://codeforces.com/problemset/problem/980/C | [
"games",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3946
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:980-B | codeforces | 980-B | Marlin | https://codeforces.com/problemset/problem/980/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4930
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:980-A | codeforces | 980-A | Links and Pearls | https://codeforces.com/problemset/problem/980/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 10973
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:979-E | codeforces | 979-E | Kuro and Topological Parity | https://codeforces.com/problemset/problem/979/E | [
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 915
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:979-D | codeforces | 979-D | Kuro and GCD and XOR and SUM | https://codeforces.com/problemset/problem/979/D | [
"binary search",
"bitmasks",
"brute force",
"data structures",
"dp",
"dsu",
"greedy",
"math",
"number theory",
"strings",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2193
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:979-C | codeforces | 979-C | Kuro and Walking Route | https://codeforces.com/problemset/problem/979/C | [
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7372
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:979-B | codeforces | 979-B | Treasure Hunt | https://codeforces.com/problemset/problem/979/B | [
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4791
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:979-A | codeforces | 979-A | Pizza, Pizza, Pizza!!! | https://codeforces.com/problemset/problem/979/A | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 14597
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:978-G | codeforces | 978-G | Petya's Exams | https://codeforces.com/problemset/problem/978/G | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4896
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:978-F | codeforces | 978-F | Mentors | https://codeforces.com/problemset/problem/978/F | [
"binary search",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9240
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:978-E | codeforces | 978-E | Bus Video System | https://codeforces.com/problemset/problem/978/E | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10612
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:978-D | codeforces | 978-D | Almost Arithmetic Progression | https://codeforces.com/problemset/problem/978/D | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9991
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:978-C | codeforces | 978-C | Letters | https://codeforces.com/problemset/problem/978/C | [
"binary search",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 30064
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:978-B | codeforces | 978-B | File Name | https://codeforces.com/problemset/problem/978/B | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 41070
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:978-A | codeforces | 978-A | Remove Duplicates | https://codeforces.com/problemset/problem/978/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30921
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:977-F | codeforces | 977-F | Consecutive Subsequence | https://codeforces.com/problemset/problem/977/F | [
"dp"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 25348
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:977-E | codeforces | 977-E | Cyclic Components | https://codeforces.com/problemset/problem/977/E | [
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 25858
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:977-D | codeforces | 977-D | Divide by three, multiply by two | https://codeforces.com/problemset/problem/977/D | [
"dfs and similar",
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 20630
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:977-C | codeforces | 977-C | Less or Equal | https://codeforces.com/problemset/problem/977/C | [
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 43722
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:977-B | codeforces | 977-B | Two-gram | https://codeforces.com/problemset/problem/977/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 50180
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:977-A | codeforces | 977-A | Wrong Subtraction | https://codeforces.com/problemset/problem/977/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 219403
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:976-F | codeforces | 976-F | Minimal k-covering | https://codeforces.com/problemset/problem/976/F | [
"flows",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 673
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:976-E | codeforces | 976-E | Well played! | https://codeforces.com/problemset/problem/976/E | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2568
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:976-D | codeforces | 976-D | Degree Set | https://codeforces.com/problemset/problem/976/D | [
"constructive algorithms",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 765
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:976-C | codeforces | 976-C | Nested Segments | https://codeforces.com/problemset/problem/976/C | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10852
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:976-B | codeforces | 976-B | Lara Croft and the New Game | https://codeforces.com/problemset/problem/976/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6055
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:976-A | codeforces | 976-A | Minimum Binary Number | https://codeforces.com/problemset/problem/976/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 10993
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:975-E | codeforces | 975-E | Hag's Khashba | https://codeforces.com/problemset/problem/975/E | [
"geometry"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 337
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:975-D | codeforces | 975-D | Ghosts | https://codeforces.com/problemset/problem/975/D | [
"geometry",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2392
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:975-C | codeforces | 975-C | Valhalla Siege | https://codeforces.com/problemset/problem/975/C | [
"binary search"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11328
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:975-B | codeforces | 975-B | Mancala | https://codeforces.com/problemset/problem/975/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 7118
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:975-A | codeforces | 975-A | Aramic script | https://codeforces.com/problemset/problem/975/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 10296
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:967-B | codeforces | 967-B | Watering System | https://codeforces.com/problemset/problem/967/B | [
"math",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 7909
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:967-A | codeforces | 967-A | Mind the Gap | https://codeforces.com/problemset/problem/967/A | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 4644
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:965-E | codeforces | 965-E | Short Code | https://codeforces.com/problemset/problem/965/E | [
"data structures",
"dp",
"greedy",
"strings",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1905
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:965-D | codeforces | 965-D | Single-use Stones | https://codeforces.com/problemset/problem/965/D | [
"binary search",
"flows",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3357
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:965-C | codeforces | 965-C | Greedy Arkady | https://codeforces.com/problemset/problem/965/C | [
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2217
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:965-B | codeforces | 965-B | Battleship | https://codeforces.com/problemset/problem/965/B | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4772
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:965-A | codeforces | 965-A | Paper Airplanes | https://codeforces.com/problemset/problem/965/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 10392
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:964-B | codeforces | 964-B | Messages | https://codeforces.com/problemset/problem/964/B | [
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4592
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:964-A | codeforces | 964-A | Splits | https://codeforces.com/problemset/problem/964/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 10330
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:963-E | codeforces | 963-E | Circles of Waiting | https://codeforces.com/problemset/problem/963/E | [
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 651
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:963-D | codeforces | 963-D | Frequency of String | https://codeforces.com/problemset/problem/963/D | [
"hashing",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2761
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:963-C | codeforces | 963-C | Cutting Rectangle | https://codeforces.com/problemset/problem/963/C | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 672
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:963-B | codeforces | 963-B | Destruction of a Tree | https://codeforces.com/problemset/problem/963/B | [
"constructive algorithms",
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3007
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:963-A | codeforces | 963-A | Alternating Sum | https://codeforces.com/problemset/problem/963/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3648
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:962-G | codeforces | 962-G | Visible Black Areas | https://codeforces.com/problemset/problem/962/G | [
"data structures",
"dsu",
"geometry",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 207
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:962-F | codeforces | 962-F | Simple Cycles Edges | https://codeforces.com/problemset/problem/962/F | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1596
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:962-E | codeforces | 962-E | Byteland, Berland and Disputed Cities | https://codeforces.com/problemset/problem/962/E | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1143
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:962-D | codeforces | 962-D | Merge Equals | https://codeforces.com/problemset/problem/962/D | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7376
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:962-C | codeforces | 962-C | Make a Square | https://codeforces.com/problemset/problem/962/C | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8362
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:962-B | codeforces | 962-B | Students in Railway Carriage | https://codeforces.com/problemset/problem/962/B | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 8037
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:962-A | codeforces | 962-A | Equator | https://codeforces.com/problemset/problem/962/A | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13444
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:961-G | codeforces | 961-G | Partitions | https://codeforces.com/problemset/problem/961/G | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1633
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:961-F | codeforces | 961-F | k-substrings | https://codeforces.com/problemset/problem/961/F | [
"binary search",
"hashing",
"string suffix structures"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 946
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:961-E | codeforces | 961-E | Tufurama | https://codeforces.com/problemset/problem/961/E | [
"data structures"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4249
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:961-D | codeforces | 961-D | Pair Of Lines | https://codeforces.com/problemset/problem/961/D | [
"geometry"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4901
} | 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.