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:391-D2 | codeforces | 391-D2 | Supercollider | https://codeforces.com/problemset/problem/391/D2 | [
"data structures"
] | null | null | stdin_stdout | null | {
"solved_count": 223
} | 2026-11-16T05:57:40.774385+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": 298
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:391-C3 | codeforces | 391-C3 | The Tournament | https://codeforces.com/problemset/problem/391/C3 | [] | null | null | stdin_stdout | null | {
"solved_count": 184
} | 2026-11-16T05:57:40.774385+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": 159
} | 2026-11-16T05:57:40.774385+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": 217
} | 2026-11-16T05:57:40.774385+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": 450
} | 2026-11-16T05:57:40.774385+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": 1822
} | 2026-11-16T05:57:40.774385+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": 280
} | 2026-11-16T05:57:40.774385+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": 540
} | 2026-11-16T05:57:40.774385+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": 704
} | 2026-11-16T05:57:40.774385+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": 1317
} | 2026-11-16T05:57:40.774385+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": 3787
} | 2026-11-16T05:57:40.774385+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": 7403
} | 2026-11-16T05:57:40.774385+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": 15148
} | 2026-11-16T05:57:40.774385+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": 264
} | 2026-11-16T05:57:40.774385+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": 530
} | 2026-11-16T05:57:40.774385+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": 4027
} | 2026-11-16T05:57:40.774385+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": 2628
} | 2026-11-16T05:57:40.774385+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": 12056
} | 2026-11-16T05:57:40.774385+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": 1030
} | 2026-11-16T05:57:40.774385+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": 1245
} | 2026-11-16T05:57:40.774385+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": 2316
} | 2026-11-16T05:57:40.774385+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": 13201
} | 2026-11-16T05:57:40.774385+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": 10713
} | 2026-11-16T05:57:40.774385+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": 595
} | 2026-11-16T05:57:40.774385+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": 994
} | 2026-11-16T05:57:40.774385+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": 2594
} | 2026-11-16T05:57:40.774385+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": 7997
} | 2026-11-16T05:57:40.774385+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": 695
} | 2026-11-16T05:57:40.774385+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": 979
} | 2026-11-16T05:57:40.774385+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": 10964
} | 2026-11-16T05:57:40.774385+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": 11034
} | 2026-11-16T05:57:40.774385+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": 17495
} | 2026-11-16T05:57:40.774385+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": 3861
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:384-A | codeforces | 384-A | Coder | https://codeforces.com/problemset/problem/384/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17558
} | 2026-11-16T05:57:40.774385+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": 4906
} | 2026-11-16T05:57:40.774385+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": 3486
} | 2026-11-16T05:57:40.774385+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": 8122
} | 2026-11-16T05:57:40.774385+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": 826
} | 2026-11-16T05:57:40.774385+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": 5658
} | 2026-11-16T05:57:40.774385+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": 475
} | 2026-11-16T05:57:40.774385+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": 769
} | 2026-11-16T05:57:40.774385+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": 8843
} | 2026-11-16T05:57:40.774385+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": 1537
} | 2026-11-16T05:57:40.774385+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": 13990
} | 2026-11-16T05:57:40.774385+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": 7478
} | 2026-11-16T05:57:40.774385+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": 98475
} | 2026-11-16T05:57:40.774385+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": 385
} | 2026-11-16T05:57:40.774385+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": 574
} | 2026-11-16T05:57:40.774385+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": 22210
} | 2026-11-16T05:57:40.774385+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": 589
} | 2026-11-16T05:57:40.774385+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": 2969
} | 2026-11-16T05:57:40.774385+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": 348
} | 2026-11-16T05:57:40.774385+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": 2897
} | 2026-11-16T05:57:40.774385+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": 409
} | 2026-11-16T05:57:40.774385+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": 1710
} | 2026-11-16T05:57:40.774385+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": 7123
} | 2026-11-16T05:57:40.774385+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": 7666
} | 2026-11-16T05:57:40.774385+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": 55255
} | 2026-11-16T05:57:40.774385+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": 6286
} | 2026-11-16T05:57:40.774385+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": 26482
} | 2026-11-16T05:57:40.774385+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": 610
} | 2026-11-16T05:57:40.774385+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": 1541
} | 2026-11-16T05:57:40.774385+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": 1449
} | 2026-11-16T05:57:40.774385+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": 2634
} | 2026-11-16T05:57:40.774385+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": 29294
} | 2026-11-16T05:57:40.774385+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": 7045
} | 2026-11-16T05:57:40.774385+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": 10068
} | 2026-11-16T05:57:40.774385+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": 677
} | 2026-11-16T05:57:40.774385+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": 9928
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:375-C | codeforces | 375-C | Circling Round Treasures | https://codeforces.com/problemset/problem/375/C | [
"bitmasks",
"shortest paths"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 689
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:375-B | codeforces | 375-B | Maximum Submatrix 2 | https://codeforces.com/problemset/problem/375/B | [
"data structures",
"dp",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5498
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:375-A | codeforces | 375-A | Divisible by Seven | https://codeforces.com/problemset/problem/375/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5451
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:374-E | codeforces | 374-E | Inna and Babies | https://codeforces.com/problemset/problem/374/E | [
"binary search",
"data structures",
"dsu",
"geometry",
"implementation"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 251
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:374-D | codeforces | 374-D | Inna and Sequence | https://codeforces.com/problemset/problem/374/D | [
"binary search",
"data structures",
"dp",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1049
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:374-C | codeforces | 374-C | Inna and Dima | https://codeforces.com/problemset/problem/374/C | [
"dfs and similar",
"dp",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3106
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:374-B | codeforces | 374-B | Inna and Nine | https://codeforces.com/problemset/problem/374/B | [
"combinatorics",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3544
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:374-A | codeforces | 374-A | Inna and Pink Pony | https://codeforces.com/problemset/problem/374/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3141
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:373-B | codeforces | 373-B | Making Sequences is Fun | https://codeforces.com/problemset/problem/373/B | [
"binary search",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2836
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:373-A | codeforces | 373-A | Collecting Beats is Fun | https://codeforces.com/problemset/problem/373/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 11632
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:372-E | codeforces | 372-E | Drawing Circles is Fun | https://codeforces.com/problemset/problem/372/E | [
"combinatorics",
"geometry"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 299
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:372-D | codeforces | 372-D | Choosing Subtree is Fun | https://codeforces.com/problemset/problem/372/D | [
"binary search",
"data structures",
"dfs and similar",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1226
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:372-C | codeforces | 372-C | Watching Fireworks is Fun | https://codeforces.com/problemset/problem/372/C | [
"data structures",
"dp",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5425
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:372-B | codeforces | 372-B | Counting Rectangles is Fun | https://codeforces.com/problemset/problem/372/B | [
"brute force",
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2907
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:372-A | codeforces | 372-A | Counting Kangaroos is Fun | https://codeforces.com/problemset/problem/372/A | [
"binary search",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 16279
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:371-E | codeforces | 371-E | Subway Innovation | https://codeforces.com/problemset/problem/371/E | [
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1488
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:371-D | codeforces | 371-D | Vessels | https://codeforces.com/problemset/problem/371/D | [
"data structures",
"dsu",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7000
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:371-C | codeforces | 371-C | Hamburgers | https://codeforces.com/problemset/problem/371/C | [
"binary search",
"brute force"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 38316
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:371-B | codeforces | 371-B | Fox Dividing Cheese | https://codeforces.com/problemset/problem/371/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12903
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:371-A | codeforces | 371-A | K-Periodic Array | https://codeforces.com/problemset/problem/371/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 6804
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:370-E | codeforces | 370-E | Summer Reading | https://codeforces.com/problemset/problem/370/E | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 355
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:370-D | codeforces | 370-D | Broken Monitor | https://codeforces.com/problemset/problem/370/D | [
"brute force",
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 732
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:370-C | codeforces | 370-C | Mittens | https://codeforces.com/problemset/problem/370/C | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1778
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:370-B | codeforces | 370-B | Berland Bingo | https://codeforces.com/problemset/problem/370/B | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 2761
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:370-A | codeforces | 370-A | Rook, Bishop and King | https://codeforces.com/problemset/problem/370/A | [
"graphs",
"math",
"shortest paths"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12451
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:369-E | codeforces | 369-E | Valera and Queries | https://codeforces.com/problemset/problem/369/E | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3105
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:369-D | codeforces | 369-D | Valera and Fools | https://codeforces.com/problemset/problem/369/D | [
"dfs and similar",
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1355
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:369-C | codeforces | 369-C | Valera and Elections | https://codeforces.com/problemset/problem/369/C | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12478
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:369-B | codeforces | 369-B | Valera and Contest | https://codeforces.com/problemset/problem/369/B | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 6957
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:369-A | codeforces | 369-A | Valera and Plates | https://codeforces.com/problemset/problem/369/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 12442
} | 2026-11-16T05:57:40.774385+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.