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: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": 2716
} | 2026-11-02T05:37:07.883505+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": 3613
} | 2026-11-02T05:37:07.883505+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": 7043
} | 2026-11-02T05:37:07.883505+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": 8187
} | 2026-11-02T05:37:07.883505+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": 10502
} | 2026-11-02T05:37:07.883505+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": 245
} | 2026-11-02T05:37:07.883505+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": 2409
} | 2026-11-02T05:37:07.883505+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": 3120
} | 2026-11-02T05:37:07.883505+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": 3967
} | 2026-11-02T05:37:07.883505+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": 4985
} | 2026-11-02T05:37:07.883505+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": 11078
} | 2026-11-02T05:37:07.883505+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": 975
} | 2026-11-02T05:37:07.883505+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": 2320
} | 2026-11-02T05:37:07.883505+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": 7585
} | 2026-11-02T05:37:07.883505+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": 4843
} | 2026-11-02T05:37:07.883505+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": 14875
} | 2026-11-02T05:37:07.883505+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": 5032
} | 2026-11-02T05:37:07.883505+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": 9454
} | 2026-11-02T05:37:07.883505+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": 10816
} | 2026-11-02T05:37:07.883505+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": 10247
} | 2026-11-02T05:37:07.883505+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": 31409
} | 2026-11-02T05:37:07.883505+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": 42004
} | 2026-11-02T05:37:07.883505+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": 32370
} | 2026-11-02T05:37:07.883505+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": 26949
} | 2026-11-02T05:37:07.883505+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": 27798
} | 2026-11-02T05:37:07.883505+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": 21172
} | 2026-11-02T05:37:07.883505+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": 46319
} | 2026-11-02T05:37:07.883505+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": 52717
} | 2026-11-02T05:37:07.883505+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": 234476
} | 2026-11-02T05:37:07.883505+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": 716
} | 2026-11-02T05:37:07.883505+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": 2625
} | 2026-11-02T05:37:07.883505+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": 809
} | 2026-11-02T05:37:07.883505+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": 11909
} | 2026-11-02T05:37:07.883505+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": 6100
} | 2026-11-02T05:37:07.883505+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": 11073
} | 2026-11-02T05:37:07.883505+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": 382
} | 2026-11-02T05:37:07.883505+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": 2439
} | 2026-11-02T05:37:07.883505+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": 11557
} | 2026-11-02T05:37:07.883505+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": 7258
} | 2026-11-02T05:37:07.883505+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": 10521
} | 2026-11-02T05:37:07.883505+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": 8040
} | 2026-11-02T05:37:07.883505+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": 4688
} | 2026-11-02T05:37:07.883505+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": 2093
} | 2026-11-02T05:37:07.883505+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": 3402
} | 2026-11-02T05:37:07.883505+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": 2260
} | 2026-11-02T05:37:07.883505+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": 4836
} | 2026-11-02T05:37:07.883505+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": 10564
} | 2026-11-02T05:37:07.883505+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": 4618
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:964-A | codeforces | 964-A | Splits | https://codeforces.com/problemset/problem/964/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 10475
} | 2026-11-02T05:37:07.883505+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": 882
} | 2026-11-02T05:37:07.883505+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": 3039
} | 2026-11-02T05:37:07.883505+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": 708
} | 2026-11-02T05:37:07.883505+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": 3089
} | 2026-11-02T05:37:07.883505+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": 3701
} | 2026-11-02T05:37:07.883505+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": 287
} | 2026-11-02T05:37:07.883505+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": 1730
} | 2026-11-02T05:37:07.883505+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": 1175
} | 2026-11-02T05:37:07.883505+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": 7487
} | 2026-11-02T05:37:07.883505+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": 8558
} | 2026-11-02T05:37:07.883505+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": 8208
} | 2026-11-02T05:37:07.883505+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": 13532
} | 2026-11-02T05:37:07.883505+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": 1857
} | 2026-11-02T05:37:07.883505+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": 1028
} | 2026-11-02T05:37:07.883505+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": 4395
} | 2026-11-02T05:37:07.883505+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": 5153
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:961-C | codeforces | 961-C | Chessboard | https://codeforces.com/problemset/problem/961/C | [
"bitmasks",
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 5684
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:961-B | codeforces | 961-B | Lecture Sleep | https://codeforces.com/problemset/problem/961/B | [
"data structures",
"dp",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 27896
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:961-A | codeforces | 961-A | Tetris | https://codeforces.com/problemset/problem/961/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 11011
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:960-H | codeforces | 960-H | Santa's Gift | https://codeforces.com/problemset/problem/960/H | [
"data structures",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 530
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:960-G | codeforces | 960-G | Bandit Blues | https://codeforces.com/problemset/problem/960/G | [
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1309
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:960-F | codeforces | 960-F | Pathwalks | https://codeforces.com/problemset/problem/960/F | [
"data structures",
"dp",
"graphs"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3562
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:960-E | codeforces | 960-E | Alternating Tree | https://codeforces.com/problemset/problem/960/E | [
"combinatorics",
"dfs and similar",
"divide and conquer",
"dp",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2438
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:960-D | codeforces | 960-D | Full Binary Tree Queries | https://codeforces.com/problemset/problem/960/D | [
"brute force",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1984
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:960-C | codeforces | 960-C | Subsequence Counting | https://codeforces.com/problemset/problem/960/C | [
"bitmasks",
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4207
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:960-B | codeforces | 960-B | Minimize the error | https://codeforces.com/problemset/problem/960/B | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13839
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:960-A | codeforces | 960-A | Check the string | https://codeforces.com/problemset/problem/960/A | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8959
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:959-F | codeforces | 959-F | Mahmoud and Ehab and yet another xor task | https://codeforces.com/problemset/problem/959/F | [
"bitmasks",
"dp",
"math",
"matrices"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 3097
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:959-E | codeforces | 959-E | Mahmoud and Ehab and the xor-MST | https://codeforces.com/problemset/problem/959/E | [
"bitmasks",
"dp",
"graphs",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3883
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:959-D | codeforces | 959-D | Mahmoud and Ehab and another array construction task | https://codeforces.com/problemset/problem/959/D | [
"constructive algorithms",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3341
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:959-C | codeforces | 959-C | Mahmoud and Ehab and the wrong algorithm | https://codeforces.com/problemset/problem/959/C | [
"constructive algorithms",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6362
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:959-B | codeforces | 959-B | Mahmoud and Ehab and the message | https://codeforces.com/problemset/problem/959/B | [
"dsu",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10791
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:959-A | codeforces | 959-A | Mahmoud and Ehab and the even-odd game | https://codeforces.com/problemset/problem/959/A | [
"games",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 57458
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:958-F3 | codeforces | 958-F3 | Lightsabers (hard) | https://codeforces.com/problemset/problem/958/F3 | [
"fft"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1029
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:958-F2 | codeforces | 958-F2 | Lightsabers (medium) | https://codeforces.com/problemset/problem/958/F2 | [
"binary search",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1477
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:958-F1 | codeforces | 958-F1 | Lightsabers (easy) | https://codeforces.com/problemset/problem/958/F1 | [
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 1842
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:958-E3 | codeforces | 958-E3 | Guard Duty (hard) | https://codeforces.com/problemset/problem/958/E3 | [
"geometry"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 248
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:958-E2 | codeforces | 958-E2 | Guard Duty (medium) | https://codeforces.com/problemset/problem/958/E2 | [
"binary search",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1251
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:958-E1 | codeforces | 958-E1 | Guard Duty (easy) | https://codeforces.com/problemset/problem/958/E1 | [
"brute force",
"geometry",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 1809
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:958-D2 | codeforces | 958-D2 | Hyperspace Jump (hard) | https://codeforces.com/problemset/problem/958/D2 | [] | null | null | stdin_stdout | 2,700 | {
"solved_count": 142
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:958-D1 | codeforces | 958-D1 | Hyperspace Jump (easy) | https://codeforces.com/problemset/problem/958/D1 | [
"expression parsing",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 2268
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:958-C3 | codeforces | 958-C3 | Encryption (hard) | https://codeforces.com/problemset/problem/958/C3 | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 793
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:958-C2 | codeforces | 958-C2 | Encryption (medium) | https://codeforces.com/problemset/problem/958/C2 | [
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1433
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:958-C1 | codeforces | 958-C1 | Encryption (easy) | https://codeforces.com/problemset/problem/958/C1 | [
"brute force"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 3239
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:958-B2 | codeforces | 958-B2 | Maximum Control (medium) | https://codeforces.com/problemset/problem/958/B2 | [
"data structures",
"dfs and similar",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 774
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:958-B1 | codeforces | 958-B1 | Maximum Control (easy) | https://codeforces.com/problemset/problem/958/B1 | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 3995
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:958-A3 | codeforces | 958-A3 | Death Stars (hard) | https://codeforces.com/problemset/problem/958/A3 | [] | null | null | stdin_stdout | 3,100 | {
"solved_count": 150
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:958-A2 | codeforces | 958-A2 | Death Stars (medium) | https://codeforces.com/problemset/problem/958/A2 | [
"hashing",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1101
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:958-A1 | codeforces | 958-A1 | Death Stars (easy) | https://codeforces.com/problemset/problem/958/A1 | [
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 1876
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:957-A | codeforces | 957-A | Tritonic Iridescence | https://codeforces.com/problemset/problem/957/A | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6055
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:955-F | codeforces | 955-F | Heaps | https://codeforces.com/problemset/problem/955/F | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 2039
} | 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.