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:399-A | codeforces | 399-A | Pages | https://codeforces.com/problemset/problem/399/A | [
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 4244
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:398-E | codeforces | 398-E | Sorting Permutations | https://codeforces.com/problemset/problem/398/E | [] | null | null | stdin_stdout | null | {
"solved_count": 124
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:398-D | codeforces | 398-D | Instant Messanger | https://codeforces.com/problemset/problem/398/D | [
"data structures"
] | null | null | stdin_stdout | null | {
"solved_count": 1351
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:398-C | codeforces | 398-C | Tree and Array | https://codeforces.com/problemset/problem/398/C | [
"constructive algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": 222
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:398-B | codeforces | 398-B | Painting The Wall | https://codeforces.com/problemset/problem/398/B | [
"dp",
"probabilities"
] | null | null | stdin_stdout | null | {
"solved_count": 1217
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:398-A | codeforces | 398-A | Cards | https://codeforces.com/problemset/problem/398/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 967
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:397-B | codeforces | 397-B | On Corruption and Numbers | https://codeforces.com/problemset/problem/397/B | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 836
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:397-A | codeforces | 397-A | On Segment's Own Points | https://codeforces.com/problemset/problem/397/A | [
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 2735
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:396-E | codeforces | 396-E | On Iteration of One Well-Known Function | https://codeforces.com/problemset/problem/396/E | [
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 167
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:396-D | codeforces | 396-D | On Sum of Number of Inversions in Permutations | https://codeforces.com/problemset/problem/396/D | [
"combinatorics",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 465
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:396-C | codeforces | 396-C | On Changing Tree | https://codeforces.com/problemset/problem/396/C | [
"data structures",
"graphs",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 1873
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:396-B | codeforces | 396-B | On Sum of Fractions | https://codeforces.com/problemset/problem/396/B | [
"math",
"number theory"
] | null | null | stdin_stdout | null | {
"solved_count": 1201
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:396-A | codeforces | 396-A | On Number of Decompositions into Multipliers | https://codeforces.com/problemset/problem/396/A | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | null | {
"solved_count": 1652
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:394-E | codeforces | 394-E | Lightbulb for Minister | https://codeforces.com/problemset/problem/394/E | [
"geometry"
] | null | null | stdin_stdout | null | {
"solved_count": 134
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:394-D | codeforces | 394-D | Physical Education and Buns | https://codeforces.com/problemset/problem/394/D | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 300
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:394-C | codeforces | 394-C | Dominoes | https://codeforces.com/problemset/problem/394/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 561
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:394-B | codeforces | 394-B | Very Beautiful Number | https://codeforces.com/problemset/problem/394/B | [
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 628
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:394-A | codeforces | 394-A | Counting Sticks | https://codeforces.com/problemset/problem/394/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 2742
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:393-B | codeforces | 393-B | Three matrices | https://codeforces.com/problemset/problem/393/B | [] | null | null | stdin_stdout | null | {
"solved_count": 2082
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:393-A | codeforces | 393-A | Nineteen | https://codeforces.com/problemset/problem/393/A | [] | null | null | stdin_stdout | null | {
"solved_count": 7012
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:392-E | codeforces | 392-E | Deleting Substrings | https://codeforces.com/problemset/problem/392/E | [] | null | null | stdin_stdout | null | {
"solved_count": 188
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:392-D | codeforces | 392-D | Three Arrays | https://codeforces.com/problemset/problem/392/D | [
"data structures"
] | null | null | stdin_stdout | null | {
"solved_count": 242
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:392-C | codeforces | 392-C | Yet Another Number Sequence | https://codeforces.com/problemset/problem/392/C | [
"combinatorics",
"math",
"matrices"
] | null | null | stdin_stdout | null | {
"solved_count": 689
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:392-B | codeforces | 392-B | Tower of Hanoi | https://codeforces.com/problemset/problem/392/B | [
"dp"
] | null | null | stdin_stdout | null | {
"solved_count": 1067
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:392-A | codeforces | 392-A | Blocked Points | https://codeforces.com/problemset/problem/392/A | [
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 1012
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:391-F3 | codeforces | 391-F3 | Stock Trading | https://codeforces.com/problemset/problem/391/F3 | [] | null | null | stdin_stdout | null | {
"solved_count": 120
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:391-F2 | codeforces | 391-F2 | Stock Trading | https://codeforces.com/problemset/problem/391/F2 | [
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 123
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:391-F1 | codeforces | 391-F1 | Stock Trading | https://codeforces.com/problemset/problem/391/F1 | [
"dp"
] | null | null | stdin_stdout | null | {
"solved_count": 228
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:391-E2 | codeforces | 391-E2 | Three Trees | https://codeforces.com/problemset/problem/391/E2 | [] | null | null | stdin_stdout | null | {
"solved_count": 191
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:391-E1 | codeforces | 391-E1 | Three Trees | https://codeforces.com/problemset/problem/391/E1 | [] | null | null | stdin_stdout | null | {
"solved_count": 137
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:391-D2 | codeforces | 391-D2 | Supercollider | https://codeforces.com/problemset/problem/391/D2 | [
"data structures"
] | null | null | stdin_stdout | null | {
"solved_count": 218
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:391-D1 | codeforces | 391-D1 | Supercollider | https://codeforces.com/problemset/problem/391/D1 | [
"brute force"
] | null | null | stdin_stdout | null | {
"solved_count": 295
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:391-C3 | codeforces | 391-C3 | The Tournament | https://codeforces.com/problemset/problem/391/C3 | [] | null | null | stdin_stdout | null | {
"solved_count": 180
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:391-C2 | codeforces | 391-C2 | The Tournament | https://codeforces.com/problemset/problem/391/C2 | [
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 156
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:391-C1 | codeforces | 391-C1 | The Tournament | https://codeforces.com/problemset/problem/391/C1 | [
"brute force"
] | null | null | stdin_stdout | null | {
"solved_count": 214
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:391-B | codeforces | 391-B | Word Folding | https://codeforces.com/problemset/problem/391/B | [
"brute force"
] | null | null | stdin_stdout | null | {
"solved_count": 444
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:391-A | codeforces | 391-A | Genetic Engineering | https://codeforces.com/problemset/problem/391/A | [
"implementation",
"two pointers"
] | null | null | stdin_stdout | null | {
"solved_count": 1815
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:390-E | codeforces | 390-E | Inna and Large Sweet Matrix | https://codeforces.com/problemset/problem/390/E | [] | null | null | stdin_stdout | null | {
"solved_count": 279
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:390-D | codeforces | 390-D | Inna and Sweet Matrix | https://codeforces.com/problemset/problem/390/D | [
"constructive algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": 539
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:390-C | codeforces | 390-C | Inna and Candy Boxes | https://codeforces.com/problemset/problem/390/C | [
"data structures"
] | null | null | stdin_stdout | null | {
"solved_count": 700
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:390-B | codeforces | 390-B | Inna, Dima and Song | https://codeforces.com/problemset/problem/390/B | [
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 1313
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:390-A | codeforces | 390-A | Inna and Alarm Clock | https://codeforces.com/problemset/problem/390/A | [
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 3770
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:389-B | codeforces | 389-B | Fox and Cross | https://codeforces.com/problemset/problem/389/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 7381
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:389-A | codeforces | 389-A | Fox and Number Game | https://codeforces.com/problemset/problem/389/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 15070
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:388-E | codeforces | 388-E | Fox and Meteor Shower | https://codeforces.com/problemset/problem/388/E | [
"geometry"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 262
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:388-D | codeforces | 388-D | Fox and Perfect Sets | https://codeforces.com/problemset/problem/388/D | [
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 526
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:388-C | codeforces | 388-C | Fox and Card Game | https://codeforces.com/problemset/problem/388/C | [
"games",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3948
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:388-B | codeforces | 388-B | Fox and Minimal path | https://codeforces.com/problemset/problem/388/B | [
"bitmasks",
"constructive algorithms",
"graphs",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2611
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:388-A | codeforces | 388-A | Fox and Box Accumulation | https://codeforces.com/problemset/problem/388/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11999
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:387-E | codeforces | 387-E | George and Cards | https://codeforces.com/problemset/problem/387/E | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1021
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:387-D | codeforces | 387-D | George and Interesting Graph | https://codeforces.com/problemset/problem/387/D | [
"graph matchings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1217
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:387-C | codeforces | 387-C | George and Number | https://codeforces.com/problemset/problem/387/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2301
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:387-B | codeforces | 387-B | George and Round | https://codeforces.com/problemset/problem/387/B | [
"brute force",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 13056
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:387-A | codeforces | 387-A | George and Sleep | https://codeforces.com/problemset/problem/387/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 10644
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:386-D | codeforces | 386-D | Game with Points | https://codeforces.com/problemset/problem/386/D | [
"dp",
"graphs",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 586
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:386-C | codeforces | 386-C | Diverse Substrings | https://codeforces.com/problemset/problem/386/C | [
"dp",
"strings",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 975
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:386-B | codeforces | 386-B | Fly, freebies, fly! | https://codeforces.com/problemset/problem/386/B | [
"binary search",
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 2551
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:386-A | codeforces | 386-A | Second-Price Auction | https://codeforces.com/problemset/problem/386/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 7838
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:385-E | codeforces | 385-E | Bear in the Field | https://codeforces.com/problemset/problem/385/E | [
"math",
"matrices"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 690
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:385-D | codeforces | 385-D | Bear and Floodlight | https://codeforces.com/problemset/problem/385/D | [
"bitmasks",
"dp",
"geometry"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 972
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:385-C | codeforces | 385-C | Bear and Prime Numbers | https://codeforces.com/problemset/problem/385/C | [
"binary search",
"brute force",
"data structures",
"dp",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10799
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:385-B | codeforces | 385-B | Bear and Strings | https://codeforces.com/problemset/problem/385/B | [
"brute force",
"greedy",
"implementation",
"math",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10954
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:385-A | codeforces | 385-A | Bear and Raspberry | https://codeforces.com/problemset/problem/385/A | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17441
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:384-B | codeforces | 384-B | Multitasking | https://codeforces.com/problemset/problem/384/B | [
"greedy",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3830
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:384-A | codeforces | 384-A | Coder | https://codeforces.com/problemset/problem/384/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17408
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:383-E | codeforces | 383-E | Vowels | https://codeforces.com/problemset/problem/383/E | [
"combinatorics",
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 4675
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:383-D | codeforces | 383-D | Antimatter | https://codeforces.com/problemset/problem/383/D | [
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3414
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:383-C | codeforces | 383-C | Propagating tree | https://codeforces.com/problemset/problem/383/C | [
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 7885
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:383-B | codeforces | 383-B | Volcanoes | https://codeforces.com/problemset/problem/383/B | [
"binary search",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 814
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:383-A | codeforces | 383-A | Milking cows | https://codeforces.com/problemset/problem/383/A | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5621
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:382-E | codeforces | 382-E | Ksenia and Combinatorics | https://codeforces.com/problemset/problem/382/E | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 469
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:382-D | codeforces | 382-D | Ksenia and Pawns | https://codeforces.com/problemset/problem/382/D | [
"dfs and similar",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 754
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:382-C | codeforces | 382-C | Arithmetic Progression | https://codeforces.com/problemset/problem/382/C | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8796
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:382-B | codeforces | 382-B | Number Busters | https://codeforces.com/problemset/problem/382/B | [
"binary search",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1529
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:382-A | codeforces | 382-A | Ksenia and Pan Scales | https://codeforces.com/problemset/problem/382/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 13833
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:381-B | codeforces | 381-B | Sereja and Stairs | https://codeforces.com/problemset/problem/381/B | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 7411
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:381-A | codeforces | 381-A | Sereja and Dima | https://codeforces.com/problemset/problem/381/A | [
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 93725
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:380-E | codeforces | 380-E | Sereja and Dividing | https://codeforces.com/problemset/problem/380/E | [
"data structures"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 374
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:380-D | codeforces | 380-D | Sereja and Cinema | https://codeforces.com/problemset/problem/380/D | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 555
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:380-C | codeforces | 380-C | Sereja and Brackets | https://codeforces.com/problemset/problem/380/C | [
"data structures",
"schedules"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 21039
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:380-B | codeforces | 380-B | Sereja and Tree | https://codeforces.com/problemset/problem/380/B | [
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 585
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:380-A | codeforces | 380-A | Sereja and Prefixes | https://codeforces.com/problemset/problem/380/A | [
"binary search",
"brute force"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2953
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:379-G | codeforces | 379-G | New Year Cactus | https://codeforces.com/problemset/problem/379/G | [
"dp"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 345
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:379-F | codeforces | 379-F | New Year Tree | https://codeforces.com/problemset/problem/379/F | [
"data structures",
"divide and conquer",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2822
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:379-E | codeforces | 379-E | New Year Tree Decorations | https://codeforces.com/problemset/problem/379/E | [
"geometry",
"schedules",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 403
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:379-D | codeforces | 379-D | New Year Letter | https://codeforces.com/problemset/problem/379/D | [
"bitmasks",
"brute force",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1685
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:379-C | codeforces | 379-C | New Year Ratings Change | https://codeforces.com/problemset/problem/379/C | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7083
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:379-B | codeforces | 379-B | New Year Present | https://codeforces.com/problemset/problem/379/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 7636
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:379-A | codeforces | 379-A | New Year Candles | https://codeforces.com/problemset/problem/379/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 54246
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:378-B | codeforces | 378-B | Semifinals | https://codeforces.com/problemset/problem/378/B | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6251
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:378-A | codeforces | 378-A | Playing with Dice | https://codeforces.com/problemset/problem/378/A | [
"brute force"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26147
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:377-E | codeforces | 377-E | Cookie Clicker | https://codeforces.com/problemset/problem/377/E | [
"dp",
"geometry"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 598
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:377-D | codeforces | 377-D | Developing Game | https://codeforces.com/problemset/problem/377/D | [
"data structures"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1509
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:377-C | codeforces | 377-C | Captains Mode | https://codeforces.com/problemset/problem/377/C | [
"bitmasks",
"dp",
"games"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1441
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:377-B | codeforces | 377-B | Preparing for the Contest | https://codeforces.com/problemset/problem/377/B | [
"binary search",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2584
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:377-A | codeforces | 377-A | Maze | https://codeforces.com/problemset/problem/377/A | [
"dfs and similar"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 28347
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:376-B | codeforces | 376-B | I.O.U. | https://codeforces.com/problemset/problem/376/B | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6998
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:376-A | codeforces | 376-A | Lever | https://codeforces.com/problemset/problem/376/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 9971
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:375-E | codeforces | 375-E | Red and Black Tree | https://codeforces.com/problemset/problem/375/E | [
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 670
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:375-D | codeforces | 375-D | Tree and Queries | https://codeforces.com/problemset/problem/375/D | [
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 9365
} | 2026-08-10T02:20:32.917453+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.