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:1982-C | codeforces | 1982-C | Boring Day | https://codeforces.com/problemset/problem/1982/C | [
"binary search",
"data structures",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 22658
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1982-B | codeforces | 1982-B | Collatz Conjecture | https://codeforces.com/problemset/problem/1982/B | [
"brute force",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 20225
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1982-A | codeforces | 1982-A | Soccer | https://codeforces.com/problemset/problem/1982/A | [
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27781
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1981-F | codeforces | 1981-F | Turtle and Paths on a Tree | https://codeforces.com/problemset/problem/1981/F | [
"data structures",
"dp",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 382
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1981-E | codeforces | 1981-E | Turtle and Intersected Segments | https://codeforces.com/problemset/problem/1981/E | [
"data structures",
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1379
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1981-D | codeforces | 1981-D | Turtle and Multiplication | https://codeforces.com/problemset/problem/1981/D | [
"constructive algorithms",
"dfs and similar",
"graphs",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2280
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1981-C | codeforces | 1981-C | Turtle and an Incomplete Sequence | https://codeforces.com/problemset/problem/1981/C | [
"bitmasks",
"brute force",
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6530
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1981-B | codeforces | 1981-B | Turtle and an Infinite Sequence | https://codeforces.com/problemset/problem/1981/B | [
"bitmasks",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16977
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1981-A | codeforces | 1981-A | Turtle and Piggy Are Playing a Game | https://codeforces.com/problemset/problem/1981/A | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24461
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1980-G | codeforces | 1980-G | Yasya and the Mysterious Tree | https://codeforces.com/problemset/problem/1980/G | [
"bitmasks",
"data structures",
"dfs and similar",
"graphs",
"greedy",
"strings",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1842
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1980-F2 | codeforces | 1980-F2 | Field Division (hard version) | https://codeforces.com/problemset/problem/1980/F2 | [
"math",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1292
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1980-F1 | codeforces | 1980-F1 | Field Division (easy version) | https://codeforces.com/problemset/problem/1980/F1 | [
"data structures",
"math",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4543
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1980-E | codeforces | 1980-E | Permutation of Rows and Columns | https://codeforces.com/problemset/problem/1980/E | [
"constructive algorithms",
"data structures",
"greedy",
"hashing",
"implementation",
"math",
"matrices",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13521
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1980-D | codeforces | 1980-D | GCD-sequence | https://codeforces.com/problemset/problem/1980/D | [
"greedy",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17950
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1980-C | codeforces | 1980-C | Sofia and the Lost Operations | https://codeforces.com/problemset/problem/1980/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 22191
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1980-B | codeforces | 1980-B | Choosing Cubes | https://codeforces.com/problemset/problem/1980/B | [
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 39085
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1980-A | codeforces | 1980-A | Problem Generator | https://codeforces.com/problemset/problem/1980/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 48653
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1979-F | codeforces | 1979-F | Kostyanych's Theorem | https://codeforces.com/problemset/problem/1979/F | [
"brute force",
"constructive algorithms",
"graphs",
"interactive"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 456
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1979-E | codeforces | 1979-E | Manhattan Triangle | https://codeforces.com/problemset/problem/1979/E | [
"binary search",
"constructive algorithms",
"data structures",
"geometry",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1897
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1979-D | codeforces | 1979-D | Fixing a Binary String | https://codeforces.com/problemset/problem/1979/D | [
"bitmasks",
"brute force",
"constructive algorithms",
"dp",
"greedy",
"hashing",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8089
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1979-C | codeforces | 1979-C | Earning on Bets | https://codeforces.com/problemset/problem/1979/C | [
"binary search",
"combinatorics",
"constructive algorithms",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 22730
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1979-B | codeforces | 1979-B | XOR Sequences | https://codeforces.com/problemset/problem/1979/B | [
"bitmasks",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 27090
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1979-A | codeforces | 1979-A | Guess the Maximum | https://codeforces.com/problemset/problem/1979/A | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32227
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1978-F | codeforces | 1978-F | Large Graph | https://codeforces.com/problemset/problem/1978/F | [
"data structures",
"dfs and similar",
"dsu",
"graphs",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1664
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1978-E | codeforces | 1978-E | Computing Machine | https://codeforces.com/problemset/problem/1978/E | [
"brute force",
"data structures",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4751
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1978-D | codeforces | 1978-D | Elections | https://codeforces.com/problemset/problem/1978/D | [
"data structures",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14059
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1978-C | codeforces | 1978-C | Manhattan Permutations | https://codeforces.com/problemset/problem/1978/C | [
"constructive algorithms",
"data structures",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18257
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1978-B | codeforces | 1978-B | New Bakery | https://codeforces.com/problemset/problem/1978/B | [
"binary search",
"greedy",
"math",
"ternary search"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25838
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1978-A | codeforces | 1978-A | Alice and Books | https://codeforces.com/problemset/problem/1978/A | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29132
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1977-E | codeforces | 1977-E | Tensor | https://codeforces.com/problemset/problem/1977/E | [
"constructive algorithms",
"graphs",
"interactive"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 971
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1977-D | codeforces | 1977-D | XORificator | https://codeforces.com/problemset/problem/1977/D | [
"bitmasks",
"brute force",
"greedy",
"hashing"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2519
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1977-C | codeforces | 1977-C | Nikita and LCM | https://codeforces.com/problemset/problem/1977/C | [
"brute force",
"data structures",
"dp",
"greedy",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8313
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1977-B | codeforces | 1977-B | Binary Colouring | https://codeforces.com/problemset/problem/1977/B | [
"bitmasks",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20254
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1977-A | codeforces | 1977-A | Little Nikita | https://codeforces.com/problemset/problem/1977/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 40242
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1976-F | codeforces | 1976-F | Remove Bridges | https://codeforces.com/problemset/problem/1976/F | [
"data structures",
"dfs and similar",
"dp",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1050
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1976-E | codeforces | 1976-E | Splittable Permutations | https://codeforces.com/problemset/problem/1976/E | [
"combinatorics",
"data structures",
"dfs and similar",
"greedy",
"math",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1376
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1976-D | codeforces | 1976-D | Invertible Bracket Sequences | https://codeforces.com/problemset/problem/1976/D | [
"binary search",
"combinatorics",
"data structures",
"divide and conquer",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6046
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1976-C | codeforces | 1976-C | Job Interview | https://codeforces.com/problemset/problem/1976/C | [
"binary search",
"dp",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12841
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1976-B | codeforces | 1976-B | Increase/Decrease/Copy | https://codeforces.com/problemset/problem/1976/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 25527
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1976-A | codeforces | 1976-A | Verify Password | https://codeforces.com/problemset/problem/1976/A | [
"implementation",
"sortings",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33216
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1975-I | codeforces | 1975-I | Mind Bloom | https://codeforces.com/problemset/problem/1975/I | [
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 200
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1975-H | codeforces | 1975-H | 378QAQ and Core | https://codeforces.com/problemset/problem/1975/H | [
"greedy",
"strings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 223
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1975-G | codeforces | 1975-G | Zimpha Fan Club | https://codeforces.com/problemset/problem/1975/G | [
"fft",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 366
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1975-F | codeforces | 1975-F | Set | https://codeforces.com/problemset/problem/1975/F | [
"bitmasks",
"brute force",
"combinatorics",
"dfs and similar",
"divide and conquer",
"dp",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1096
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1975-E | codeforces | 1975-E | Chain Queries | https://codeforces.com/problemset/problem/1975/E | [
"binary search",
"data structures",
"dfs and similar",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3030
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1975-D | codeforces | 1975-D | Paint the Tree | https://codeforces.com/problemset/problem/1975/D | [
"brute force",
"dfs and similar",
"dp",
"greedy",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7800
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1975-C | codeforces | 1975-C | Chamo and Mocha's Array | https://codeforces.com/problemset/problem/1975/C | [
"binary search",
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17589
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1975-B | codeforces | 1975-B | 378QAQ and Mocha's Array | https://codeforces.com/problemset/problem/1975/B | [
"brute force",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 21465
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1975-A | codeforces | 1975-A | Bazoka and Mocha's Array | https://codeforces.com/problemset/problem/1975/A | [
"brute force",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21013
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1974-G | codeforces | 1974-G | Money Buys Less Happiness Now | https://codeforces.com/problemset/problem/1974/G | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6454
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1974-F | codeforces | 1974-F | Cutting Game | https://codeforces.com/problemset/problem/1974/F | [
"binary search",
"brute force",
"data structures",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4540
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1974-E | codeforces | 1974-E | Money Buys Happiness | https://codeforces.com/problemset/problem/1974/E | [
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 12378
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1974-D | codeforces | 1974-D | Ingenuity-2 | https://codeforces.com/problemset/problem/1974/D | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 18278
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1974-C | codeforces | 1974-C | Beautiful Triple Pairs | https://codeforces.com/problemset/problem/1974/C | [
"combinatorics",
"data structures"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 19726
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1974-B | codeforces | 1974-B | Symmetric Encoding | https://codeforces.com/problemset/problem/1974/B | [
"implementation",
"sortings",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 35263
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1974-A | codeforces | 1974-A | Phone Desktop | https://codeforces.com/problemset/problem/1974/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 38663
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1973-F | codeforces | 1973-F | Maximum GCD Sum Queries | https://codeforces.com/problemset/problem/1973/F | [
"bitmasks",
"brute force",
"dp",
"implementation",
"number theory"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 361
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1973-E | codeforces | 1973-E | Cat, Fox and Swaps | https://codeforces.com/problemset/problem/1973/E | [
"graphs",
"math",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1054
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1973-D | codeforces | 1973-D | Cat, Fox and Maximum Array Split | https://codeforces.com/problemset/problem/1973/D | [
"brute force",
"interactive",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2364
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1973-C | codeforces | 1973-C | Cat, Fox and Double Maximum | https://codeforces.com/problemset/problem/1973/C | [
"constructive algorithms",
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10083
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1973-B | codeforces | 1973-B | Cat, Fox and the Lonely Array | https://codeforces.com/problemset/problem/1973/B | [
"binary search",
"bitmasks",
"data structures",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17319
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1973-A | codeforces | 1973-A | Chess For Three | https://codeforces.com/problemset/problem/1973/A | [
"brute force",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 29271
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1972-B | codeforces | 1972-B | Coin Games | https://codeforces.com/problemset/problem/1972/B | [
"games"
] | null | null | stdin_stdout | 900 | {
"solved_count": 26038
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1972-A | codeforces | 1972-A | Contest Proposal | https://codeforces.com/problemset/problem/1972/A | [
"brute force",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26421
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1971-H | codeforces | 1971-H | ±1 | https://codeforces.com/problemset/problem/1971/H | [
"2-sat",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3067
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1971-G | codeforces | 1971-G | XOUR | https://codeforces.com/problemset/problem/1971/G | [
"data structures",
"dsu",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 12060
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1971-F | codeforces | 1971-F | Circle Perimeter | https://codeforces.com/problemset/problem/1971/F | [
"binary search",
"brute force",
"dfs and similar",
"geometry",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13033
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1971-E | codeforces | 1971-E | Find the Car | https://codeforces.com/problemset/problem/1971/E | [
"binary search",
"math",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 19021
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1971-D | codeforces | 1971-D | Binary Cut | https://codeforces.com/problemset/problem/1971/D | [
"dp",
"greedy",
"implementation",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 31441
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1971-C | codeforces | 1971-C | Clock and Strings | https://codeforces.com/problemset/problem/1971/C | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 43339
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1971-B | codeforces | 1971-B | Different String | https://codeforces.com/problemset/problem/1971/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 46322
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1971-A | codeforces | 1971-A | My First Sorting Problem | https://codeforces.com/problemset/problem/1971/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 62641
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1970-G3 | codeforces | 1970-G3 | Min-Fund Prison (Hard) | https://codeforces.com/problemset/problem/1970/G3 | [
"bitmasks",
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 604
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1970-G2 | codeforces | 1970-G2 | Min-Fund Prison (Medium) | https://codeforces.com/problemset/problem/1970/G2 | [
"brute force",
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 932
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1970-G1 | codeforces | 1970-G1 | Min-Fund Prison (Easy) | https://codeforces.com/problemset/problem/1970/G1 | [
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2007
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1970-F3 | codeforces | 1970-F3 | Playing Quidditch (Hard) | https://codeforces.com/problemset/problem/1970/F3 | [
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 576
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1970-F2 | codeforces | 1970-F2 | Playing Quidditch (Medium) | https://codeforces.com/problemset/problem/1970/F2 | [
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 547
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1970-F1 | codeforces | 1970-F1 | Playing Quidditch (Easy) | https://codeforces.com/problemset/problem/1970/F1 | [
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 669
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1970-E3 | codeforces | 1970-E3 | Trails (Hard) | https://codeforces.com/problemset/problem/1970/E3 | [
"dp",
"matrices"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1275
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1970-E2 | codeforces | 1970-E2 | Trails (Medium) | https://codeforces.com/problemset/problem/1970/E2 | [
"dp",
"matrices"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2231
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1970-E1 | codeforces | 1970-E1 | Trails (Easy) | https://codeforces.com/problemset/problem/1970/E1 | [
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3615
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1970-D3 | codeforces | 1970-D3 | Arithmancy (Hard) | https://codeforces.com/problemset/problem/1970/D3 | [
"interactive"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 175
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1970-D2 | codeforces | 1970-D2 | Arithmancy (Medium) | https://codeforces.com/problemset/problem/1970/D2 | [
"constructive algorithms",
"interactive",
"probabilities",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 349
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1970-D1 | codeforces | 1970-D1 | Arithmancy (Easy) | https://codeforces.com/problemset/problem/1970/D1 | [
"brute force",
"constructive algorithms",
"interactive",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 993
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1970-C3 | codeforces | 1970-C3 | Game on Tree (Hard) | https://codeforces.com/problemset/problem/1970/C3 | [
"dfs and similar",
"dp",
"games",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2694
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1970-C2 | codeforces | 1970-C2 | Game on Tree (Medium) | https://codeforces.com/problemset/problem/1970/C2 | [
"dfs and similar",
"dp",
"games",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4687
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1970-C1 | codeforces | 1970-C1 | Game on Tree (Easy) | https://codeforces.com/problemset/problem/1970/C1 | [
"games"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 5344
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1970-B3 | codeforces | 1970-B3 | Exact Neighbours (Hard) | https://codeforces.com/problemset/problem/1970/B3 | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 748
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1970-B2 | codeforces | 1970-B2 | Exact Neighbours (Medium) | https://codeforces.com/problemset/problem/1970/B2 | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1270
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1970-B1 | codeforces | 1970-B1 | Exact Neighbours (Easy) | https://codeforces.com/problemset/problem/1970/B1 | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1712
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1970-A3 | codeforces | 1970-A3 | Balanced Unshuffle (Hard) | https://codeforces.com/problemset/problem/1970/A3 | [
"constructive algorithms",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 698
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1970-A2 | codeforces | 1970-A2 | Balanced Unshuffle (Medium) | https://codeforces.com/problemset/problem/1970/A2 | [
"brute force",
"constructive algorithms",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 625
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1970-A1 | codeforces | 1970-A1 | Balanced Shuffle (Easy) | https://codeforces.com/problemset/problem/1970/A1 | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 7699
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1969-F | codeforces | 1969-F | Card Pairing | https://codeforces.com/problemset/problem/1969/F | [
"dp",
"greedy",
"hashing",
"implementation"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 435
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1969-E | codeforces | 1969-E | Unique Array | https://codeforces.com/problemset/problem/1969/E | [
"binary search",
"data structures",
"divide and conquer",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2015
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1969-D | codeforces | 1969-D | Shop Game | https://codeforces.com/problemset/problem/1969/D | [
"data structures",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5927
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1969-C | codeforces | 1969-C | Minimizing the Sum | https://codeforces.com/problemset/problem/1969/C | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 12237
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1969-B | codeforces | 1969-B | Shifts and Sorting | https://codeforces.com/problemset/problem/1969/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22824
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1969-A | codeforces | 1969-A | Two Friends | https://codeforces.com/problemset/problem/1969/A | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22455
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1968-G2 | codeforces | 1968-G2 | Division + LCP (hard version) | https://codeforces.com/problemset/problem/1968/G2 | [
"binary search",
"brute force",
"data structures",
"dp",
"hashing",
"math",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2769
} | 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.