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:922-B | codeforces | 922-B | Magic Forest | https://codeforces.com/problemset/problem/922/B | [
"brute force"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9617
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:922-A | codeforces | 922-A | Cloning Toys | https://codeforces.com/problemset/problem/922/A | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12711
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:921-14 | codeforces | 921-14 | Labyrinth-14 | https://codeforces.com/problemset/problem/921/14 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:921-13 | codeforces | 921-13 | Labyrinth-13 | https://codeforces.com/problemset/problem/921/13 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:921-12 | codeforces | 921-12 | Labyrinth-12 | https://codeforces.com/problemset/problem/921/12 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:921-11 | codeforces | 921-11 | Labyrinth-11 | https://codeforces.com/problemset/problem/921/11 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:921-10 | codeforces | 921-10 | Labyrinth-10 | https://codeforces.com/problemset/problem/921/10 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:921-09 | codeforces | 921-09 | Labyrinth-9 | https://codeforces.com/problemset/problem/921/09 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:921-08 | codeforces | 921-08 | Labyrinth-8 | https://codeforces.com/problemset/problem/921/08 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:921-07 | codeforces | 921-07 | Labyrinth-7 | https://codeforces.com/problemset/problem/921/07 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:921-06 | codeforces | 921-06 | Labyrinth-6 | https://codeforces.com/problemset/problem/921/06 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:921-05 | codeforces | 921-05 | Labyrinth-5 | https://codeforces.com/problemset/problem/921/05 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:921-04 | codeforces | 921-04 | Labyrinth-4 | https://codeforces.com/problemset/problem/921/04 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:921-03 | codeforces | 921-03 | Labyrinth-3 | https://codeforces.com/problemset/problem/921/03 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:921-02 | codeforces | 921-02 | Labyrinth-2 | https://codeforces.com/problemset/problem/921/02 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:921-01 | codeforces | 921-01 | Labyrinth-1 | https://codeforces.com/problemset/problem/921/01 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:920-G | codeforces | 920-G | List Of Integers | https://codeforces.com/problemset/problem/920/G | [
"binary search",
"bitmasks",
"brute force",
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2064
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:920-F | codeforces | 920-F | SUM and REPLACE | https://codeforces.com/problemset/problem/920/F | [
"brute force",
"data structures",
"dsu",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 9094
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:920-E | codeforces | 920-E | Connected Components? | https://codeforces.com/problemset/problem/920/E | [
"data structures",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 8028
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:920-D | codeforces | 920-D | Tanks | https://codeforces.com/problemset/problem/920/D | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 837
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:920-C | codeforces | 920-C | Swap Adjacent Elements | https://codeforces.com/problemset/problem/920/C | [
"dfs and similar",
"greedy",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10097
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:920-B | codeforces | 920-B | Tea Queue | https://codeforces.com/problemset/problem/920/B | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8388
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:920-A | codeforces | 920-A | Water The Garden | https://codeforces.com/problemset/problem/920/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 8255
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:919-F | codeforces | 919-F | A Game With Numbers | https://codeforces.com/problemset/problem/919/F | [
"games",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 440
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:919-E | codeforces | 919-E | Congruence Equation | https://codeforces.com/problemset/problem/919/E | [
"chinese remainder theorem",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2552
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:919-D | codeforces | 919-D | Substring | https://codeforces.com/problemset/problem/919/D | [
"dfs and similar",
"dp",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 12996
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:919-C | codeforces | 919-C | Seat Arrangements | https://codeforces.com/problemset/problem/919/C | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9488
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:919-B | codeforces | 919-B | Perfect Number | https://codeforces.com/problemset/problem/919/B | [
"binary search",
"brute force",
"dp",
"implementation",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 32068
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:919-A | codeforces | 919-A | Supermarket | https://codeforces.com/problemset/problem/919/A | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17038
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:918-B | codeforces | 918-B | Radio Station | https://codeforces.com/problemset/problem/918/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 20475
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:918-A | codeforces | 918-A | Eleven | https://codeforces.com/problemset/problem/918/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18431
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:917-E | codeforces | 917-E | Upside Down | https://codeforces.com/problemset/problem/917/E | [
"data structures",
"string suffix structures",
"strings",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 197
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:917-D | codeforces | 917-D | Stranger Trees | https://codeforces.com/problemset/problem/917/D | [
"dp",
"math",
"matrices",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1532
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:917-C | codeforces | 917-C | Pollywog | https://codeforces.com/problemset/problem/917/C | [
"combinatorics",
"dp",
"matrices"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 487
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:917-B | codeforces | 917-B | MADMAX | https://codeforces.com/problemset/problem/917/B | [
"dfs and similar",
"dp",
"games",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4050
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:917-A | codeforces | 917-A | The Monster | https://codeforces.com/problemset/problem/917/A | [
"dp",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3691
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:916-E | codeforces | 916-E | Jamie and Tree | https://codeforces.com/problemset/problem/916/E | [
"data structures",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2206
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:916-D | codeforces | 916-D | Jamie and To-do List | https://codeforces.com/problemset/problem/916/D | [
"data structures",
"interactive",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 600
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:916-C | codeforces | 916-C | Jamie and Interesting Graph | https://codeforces.com/problemset/problem/916/C | [
"constructive algorithms",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5611
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:916-B | codeforces | 916-B | Jamie and Binary Sequence (changed after round) | https://codeforces.com/problemset/problem/916/B | [
"bitmasks",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2050
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:916-A | codeforces | 916-A | Jamie and Alarm Snooze | https://codeforces.com/problemset/problem/916/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 9692
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:915-G | codeforces | 915-G | Coprime Arrays | https://codeforces.com/problemset/problem/915/G | [
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1537
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:915-F | codeforces | 915-F | Imbalance Value of a Tree | https://codeforces.com/problemset/problem/915/F | [
"data structures",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 3277
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:915-E | codeforces | 915-E | Physical Education Lessons | https://codeforces.com/problemset/problem/915/E | [
"data structures",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 5886
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:915-D | codeforces | 915-D | Almost Acyclic Graph | https://codeforces.com/problemset/problem/915/D | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4168
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:915-C | codeforces | 915-C | Permute Digits | https://codeforces.com/problemset/problem/915/C | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7620
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:915-B | codeforces | 915-B | Browser | https://codeforces.com/problemset/problem/915/B | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 8428
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:915-A | codeforces | 915-A | Garden | https://codeforces.com/problemset/problem/915/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16185
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:914-H | codeforces | 914-H | Ember and Storm's Tree Game | https://codeforces.com/problemset/problem/914/H | [
"combinatorics",
"dp",
"games",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 351
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:914-G | codeforces | 914-G | Sum the Fibonacci | https://codeforces.com/problemset/problem/914/G | [
"bitmasks",
"divide and conquer",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1272
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:914-F | codeforces | 914-F | Substrings in a String | https://codeforces.com/problemset/problem/914/F | [
"bitmasks",
"brute force",
"data structures",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 2620
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:914-E | codeforces | 914-E | Palindromes in a Tree | https://codeforces.com/problemset/problem/914/E | [
"bitmasks",
"data structures",
"divide and conquer",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2027
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:914-D | codeforces | 914-D | Bash and a Tough Math Puzzle | https://codeforces.com/problemset/problem/914/D | [
"data structures",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6640
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:914-C | codeforces | 914-C | Travelling Salesman and Special Numbers | https://codeforces.com/problemset/problem/914/C | [
"brute force",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4409
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:914-B | codeforces | 914-B | Conan and Agasa play a Card Game | https://codeforces.com/problemset/problem/914/B | [
"games",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9122
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:914-A | codeforces | 914-A | Perfect Squares | https://codeforces.com/problemset/problem/914/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 15896
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:913-H | codeforces | 913-H | Don't Exceed | https://codeforces.com/problemset/problem/913/H | [
"math",
"probabilities"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 305
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:913-G | codeforces | 913-G | Power Substring | https://codeforces.com/problemset/problem/913/G | [
"math",
"number theory"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 299
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:913-F | codeforces | 913-F | Strongly Connected Tournament | https://codeforces.com/problemset/problem/913/F | [
"dp",
"graphs",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 845
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:913-E | codeforces | 913-E | Logical Expression | https://codeforces.com/problemset/problem/913/E | [
"bitmasks",
"dp",
"shortest paths"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 913
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:913-D | codeforces | 913-D | Too Easy Problems | https://codeforces.com/problemset/problem/913/D | [
"binary search",
"brute force",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5178
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:913-C | codeforces | 913-C | Party Lemonade | https://codeforces.com/problemset/problem/913/C | [
"bitmasks",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8549
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:913-B | codeforces | 913-B | Christmas Spruce | https://codeforces.com/problemset/problem/913/B | [
"implementation",
"trees"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19989
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:913-A | codeforces | 913-A | Modular Exponentiation | https://codeforces.com/problemset/problem/913/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 24573
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:912-E | codeforces | 912-E | Prime Gift | https://codeforces.com/problemset/problem/912/E | [
"binary search",
"dfs and similar",
"math",
"meet-in-the-middle",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2212
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:912-D | codeforces | 912-D | Fishes | https://codeforces.com/problemset/problem/912/D | [
"data structures",
"graphs",
"greedy",
"probabilities",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2195
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:912-C | codeforces | 912-C | Perun, Ult! | https://codeforces.com/problemset/problem/912/C | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 623
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:912-B | codeforces | 912-B | New Year's Eve | https://codeforces.com/problemset/problem/912/B | [
"bitmasks",
"constructive algorithms",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14246
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:912-A | codeforces | 912-A | Tricky Alchemy | https://codeforces.com/problemset/problem/912/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14522
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:911-G | codeforces | 911-G | Mass Change Queries | https://codeforces.com/problemset/problem/911/G | [
"data structures"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 4021
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:911-F | codeforces | 911-F | Tree Destruction | https://codeforces.com/problemset/problem/911/F | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2399
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:911-E | codeforces | 911-E | Stack Sorting | https://codeforces.com/problemset/problem/911/E | [
"constructive algorithms",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2993
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:911-D | codeforces | 911-D | Inversion Counting | https://codeforces.com/problemset/problem/911/D | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5178
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:911-C | codeforces | 911-C | Three Garlands | https://codeforces.com/problemset/problem/911/C | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7367
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:911-B | codeforces | 911-B | Two Cakes | https://codeforces.com/problemset/problem/911/B | [
"binary search",
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12910
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:911-A | codeforces | 911-A | Nearest Minimums | https://codeforces.com/problemset/problem/911/A | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12412
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:910-C | codeforces | 910-C | Minimum Sum | https://codeforces.com/problemset/problem/910/C | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2189
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:910-B | codeforces | 910-B | Door Frames | https://codeforces.com/problemset/problem/910/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 1894
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:910-A | codeforces | 910-A | The Way to Home | https://codeforces.com/problemset/problem/910/A | [
"dfs and similar",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14291
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:909-F | codeforces | 909-F | AND-permutations | https://codeforces.com/problemset/problem/909/F | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 687
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:909-E | codeforces | 909-E | Coprocessor | https://codeforces.com/problemset/problem/909/E | [
"dfs and similar",
"dp",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2571
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:909-D | codeforces | 909-D | Colorful Points | https://codeforces.com/problemset/problem/909/D | [
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2210
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:909-C | codeforces | 909-C | Python Indentation | https://codeforces.com/problemset/problem/909/C | [
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5551
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:909-B | codeforces | 909-B | Segments | https://codeforces.com/problemset/problem/909/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6821
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:909-A | codeforces | 909-A | Generate Login | https://codeforces.com/problemset/problem/909/A | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 10440
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:908-H | codeforces | 908-H | New Year and Boolean Bridges | https://codeforces.com/problemset/problem/908/H | [] | null | null | stdin_stdout | 3,100 | {
"solved_count": 669
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:908-G | codeforces | 908-G | New Year and Original Order | https://codeforces.com/problemset/problem/908/G | [
"dp",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1761
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:908-F | codeforces | 908-F | New Year and Rainbow Roads | https://codeforces.com/problemset/problem/908/F | [
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1653
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:908-E | codeforces | 908-E | New Year and Entity Enumeration | https://codeforces.com/problemset/problem/908/E | [
"bitmasks",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 874
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:908-D | codeforces | 908-D | New Year and Arbitrary Arrangement | https://codeforces.com/problemset/problem/908/D | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2762
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:908-C | codeforces | 908-C | New Year and Curling | https://codeforces.com/problemset/problem/908/C | [
"brute force",
"geometry",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7263
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:908-B | codeforces | 908-B | New Year and Buggy Bot | https://codeforces.com/problemset/problem/908/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8086
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:908-A | codeforces | 908-A | New Year and Counting Cards | https://codeforces.com/problemset/problem/908/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15973
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:907-B | codeforces | 907-B | Tic-Tac-Toe | https://codeforces.com/problemset/problem/907/B | [
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 4404
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:907-A | codeforces | 907-A | Masha and Bears | https://codeforces.com/problemset/problem/907/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6026
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:906-E | codeforces | 906-E | Reverses | https://codeforces.com/problemset/problem/906/E | [
"dp",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 594
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:906-D | codeforces | 906-D | Power Tower | https://codeforces.com/problemset/problem/906/D | [
"chinese remainder theorem",
"math",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 2825
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:906-C | codeforces | 906-C | Party | https://codeforces.com/problemset/problem/906/C | [
"bitmasks",
"brute force",
"dp",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1576
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:906-B | codeforces | 906-B | Seating of Students | https://codeforces.com/problemset/problem/906/B | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1358
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:906-A | codeforces | 906-A | Shockers | https://codeforces.com/problemset/problem/906/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4474
} | 2026-08-17T01:43:56.191071+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.