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:955-E | codeforces | 955-E | Icicles | https://codeforces.com/problemset/problem/955/E | [] | null | null | stdin_stdout | 2,900 | {
"solved_count": 176
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:955-D | codeforces | 955-D | Scissors | https://codeforces.com/problemset/problem/955/D | [
"brute force",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 626
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:955-C | codeforces | 955-C | Sad powers | https://codeforces.com/problemset/problem/955/C | [
"binary search",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2956
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:955-B | codeforces | 955-B | Not simply beatiful strings | https://codeforces.com/problemset/problem/955/B | [
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 5229
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:955-A | codeforces | 955-A | Feed the cat | https://codeforces.com/problemset/problem/955/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 7086
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:954-I | codeforces | 954-I | Yet Another String Matching Problem | https://codeforces.com/problemset/problem/954/I | [
"fft",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1464
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:954-H | codeforces | 954-H | Path Counting | https://codeforces.com/problemset/problem/954/H | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 839
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:954-G | codeforces | 954-G | Castle Defense | https://codeforces.com/problemset/problem/954/G | [
"binary search",
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2484
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:954-F | codeforces | 954-F | Runner's Problem | https://codeforces.com/problemset/problem/954/F | [
"dp",
"matrices",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1455
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:954-E | codeforces | 954-E | Water Taps | https://codeforces.com/problemset/problem/954/E | [
"binary search",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2205
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:954-D | codeforces | 954-D | Fight Against Traffic | https://codeforces.com/problemset/problem/954/D | [
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8214
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:954-C | codeforces | 954-C | Matrix Walk | https://codeforces.com/problemset/problem/954/C | [
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3995
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:954-B | codeforces | 954-B | String Typing | https://codeforces.com/problemset/problem/954/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7919
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:954-A | codeforces | 954-A | Diagonal Walking | https://codeforces.com/problemset/problem/954/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 11211
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:952-G | codeforces | 952-G | Puzzling Language | https://codeforces.com/problemset/problem/952/G | [
"*special",
"constructive algorithms"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 265
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:952-F | codeforces | 952-F | 2 + 2 != 4 | https://codeforces.com/problemset/problem/952/F | [
"*special"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 441
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:952-E | codeforces | 952-E | Cheese Board | https://codeforces.com/problemset/problem/952/E | [
"*special"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 711
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:952-D | codeforces | 952-D | I'm Feeling Lucky! | https://codeforces.com/problemset/problem/952/D | [
"*special",
"probabilities"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2597
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:952-C | codeforces | 952-C | Ravioli Sort | https://codeforces.com/problemset/problem/952/C | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 3086
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:952-B | codeforces | 952-B | A Map of the Cat | https://codeforces.com/problemset/problem/952/B | [
"*special",
"brute force",
"interactive"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2145
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:952-A | codeforces | 952-A | Quirky Quantifiers | https://codeforces.com/problemset/problem/952/A | [
"*special",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12138
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:950-B | codeforces | 950-B | Intercepted Message | https://codeforces.com/problemset/problem/950/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 8088
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:950-A | codeforces | 950-A | Left-handers, Right-handers and Ambidexters | https://codeforces.com/problemset/problem/950/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16618
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:949-F | codeforces | 949-F | Astronomy | https://codeforces.com/problemset/problem/949/F | [
"geometry",
"probabilities"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 72
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:949-E | codeforces | 949-E | Binary Cards | https://codeforces.com/problemset/problem/949/E | [
"brute force"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 805
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:949-D | codeforces | 949-D | Curfew | https://codeforces.com/problemset/problem/949/D | [
"binary search",
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 924
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:949-C | codeforces | 949-C | Data Center Maintenance | https://codeforces.com/problemset/problem/949/C | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2374
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:949-B | codeforces | 949-B | A Leapfrog in the Array | https://codeforces.com/problemset/problem/949/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3865
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:949-A | codeforces | 949-A | Zebras | https://codeforces.com/problemset/problem/949/A | [
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5740
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:948-A | codeforces | 948-A | Protect Sheep | https://codeforces.com/problemset/problem/948/A | [
"brute force",
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 15830
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:946-G | codeforces | 946-G | Almost Increasing Array | https://codeforces.com/problemset/problem/946/G | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 859
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:946-F | codeforces | 946-F | Fibonacci String Subsequences | https://codeforces.com/problemset/problem/946/F | [
"combinatorics",
"dp",
"matrices"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 683
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:946-E | codeforces | 946-E | Largest Beautiful Number | https://codeforces.com/problemset/problem/946/E | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1280
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:946-D | codeforces | 946-D | Timetable | https://codeforces.com/problemset/problem/946/D | [
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5014
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:946-C | codeforces | 946-C | String Transformation | https://codeforces.com/problemset/problem/946/C | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9551
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:946-B | codeforces | 946-B | Weird Subtraction Process | https://codeforces.com/problemset/problem/946/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 11590
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:946-A | codeforces | 946-A | Partition | https://codeforces.com/problemset/problem/946/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18568
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:940-F | codeforces | 940-F | Machine Learning | https://codeforces.com/problemset/problem/940/F | [
"brute force",
"data structures"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 3756
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:940-E | codeforces | 940-E | Cashback | https://codeforces.com/problemset/problem/940/E | [
"data structures",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4604
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:940-D | codeforces | 940-D | Alena And The Heater | https://codeforces.com/problemset/problem/940/D | [
"binary search",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 3803
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:940-C | codeforces | 940-C | Phone Numbers | https://codeforces.com/problemset/problem/940/C | [
"constructive algorithms",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6814
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:940-B | codeforces | 940-B | Our Tanya is Crying Out Loud | https://codeforces.com/problemset/problem/940/B | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9651
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:940-A | codeforces | 940-A | Points on the line | https://codeforces.com/problemset/problem/940/A | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8925
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:939-F | codeforces | 939-F | Cutlet | https://codeforces.com/problemset/problem/939/F | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1296
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:939-E | codeforces | 939-E | Maximize! | https://codeforces.com/problemset/problem/939/E | [
"binary search",
"greedy",
"ternary search",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3596
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:939-D | codeforces | 939-D | Love Rescue | https://codeforces.com/problemset/problem/939/D | [
"dfs and similar",
"dsu",
"graphs",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8455
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:939-C | codeforces | 939-C | Convenient For Everybody | https://codeforces.com/problemset/problem/939/C | [
"binary search",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4980
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:939-B | codeforces | 939-B | Hamster Farm | https://codeforces.com/problemset/problem/939/B | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 11433
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:939-A | codeforces | 939-A | Love Triangle | https://codeforces.com/problemset/problem/939/A | [
"graphs"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31144
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:938-G | codeforces | 938-G | Shortest Path Queries | https://codeforces.com/problemset/problem/938/G | [
"bitmasks",
"data structures",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1285
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:938-F | codeforces | 938-F | Erasing Substrings | https://codeforces.com/problemset/problem/938/F | [
"bitmasks",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 686
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:938-E | codeforces | 938-E | Max History | https://codeforces.com/problemset/problem/938/E | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1653
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:938-D | codeforces | 938-D | Buy a Ticket | https://codeforces.com/problemset/problem/938/D | [
"data structures",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 7733
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:938-C | codeforces | 938-C | Constructing Tests | https://codeforces.com/problemset/problem/938/C | [
"binary search",
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3502
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:938-B | codeforces | 938-B | Run For Your Prize | https://codeforces.com/problemset/problem/938/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 9413
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:938-A | codeforces | 938-A | Word Correction | https://codeforces.com/problemset/problem/938/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12202
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:937-B | codeforces | 937-B | Vile Grasshoppers | https://codeforces.com/problemset/problem/937/B | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7344
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:937-A | codeforces | 937-A | Olympiad | https://codeforces.com/problemset/problem/937/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16840
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:936-E | codeforces | 936-E | Iqea | https://codeforces.com/problemset/problem/936/E | [
"data structures",
"dfs and similar",
"divide and conquer",
"dsu",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 265
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:936-D | codeforces | 936-D | World of Tank | https://codeforces.com/problemset/problem/936/D | [
"dp",
"greedy"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 407
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:936-C | codeforces | 936-C | Lock Puzzle | https://codeforces.com/problemset/problem/936/C | [
"constructive algorithms",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1296
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:936-B | codeforces | 936-B | Sleepy Game | https://codeforces.com/problemset/problem/936/B | [
"dfs and similar",
"dp",
"games",
"graphs"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3517
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:936-A | codeforces | 936-A | Save Energy! | https://codeforces.com/problemset/problem/936/A | [
"binary search",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4697
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:935-F | codeforces | 935-F | Fafa and Array | https://codeforces.com/problemset/problem/935/F | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 520
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:935-E | codeforces | 935-E | Fafa and Ancient Mathematics | https://codeforces.com/problemset/problem/935/E | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1026
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:935-D | codeforces | 935-D | Fafa and Ancient Alphabet | https://codeforces.com/problemset/problem/935/D | [
"math",
"probabilities"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2908
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:935-C | codeforces | 935-C | Fifa and Fafa | https://codeforces.com/problemset/problem/935/C | [
"geometry"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5068
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:935-B | codeforces | 935-B | Fafa and the Gates | https://codeforces.com/problemset/problem/935/B | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 12648
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:935-A | codeforces | 935-A | Fafa and his Company | https://codeforces.com/problemset/problem/935/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 48343
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:934-B | codeforces | 934-B | A Prosperous Lot | https://codeforces.com/problemset/problem/934/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9303
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:934-A | codeforces | 934-A | A Compatible Pair | https://codeforces.com/problemset/problem/934/A | [
"brute force",
"games"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7745
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:933-E | codeforces | 933-E | A Preponderant Reunion | https://codeforces.com/problemset/problem/933/E | [
"constructive algorithms",
"dp"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 338
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:933-D | codeforces | 933-D | A Creative Cutout | https://codeforces.com/problemset/problem/933/D | [
"brute force",
"combinatorics",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 404
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:933-C | codeforces | 933-C | A Colourful Prospect | https://codeforces.com/problemset/problem/933/C | [
"geometry",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 701
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:933-B | codeforces | 933-B | A Determined Cleanup | https://codeforces.com/problemset/problem/933/B | [
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2095
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:933-A | codeforces | 933-A | A Twisty Movement | https://codeforces.com/problemset/problem/933/A | [
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5536
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:932-G | codeforces | 932-G | Palindrome Partition | https://codeforces.com/problemset/problem/932/G | [
"dp",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1275
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:932-F | codeforces | 932-F | Escape Through Leaf | https://codeforces.com/problemset/problem/932/F | [
"data structures",
"dp",
"geometry"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 4507
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:932-E | codeforces | 932-E | Team Work | https://codeforces.com/problemset/problem/932/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 3720
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:932-D | codeforces | 932-D | Tree | https://codeforces.com/problemset/problem/932/D | [
"binary search",
"dp",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2110
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:932-C | codeforces | 932-C | Permutation Cycle | https://codeforces.com/problemset/problem/932/C | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4281
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:932-B | codeforces | 932-B | Recursive Queries | https://codeforces.com/problemset/problem/932/B | [
"binary search",
"data structures",
"dfs and similar"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9604
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:932-A | codeforces | 932-A | Palindromic Supersequence | https://codeforces.com/problemset/problem/932/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 11048
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:931-C | codeforces | 931-C | Laboratory Work | https://codeforces.com/problemset/problem/931/C | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3551
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:931-B | codeforces | 931-B | World Cup | https://codeforces.com/problemset/problem/931/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 7577
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:931-A | codeforces | 931-A | Friends Meeting | https://codeforces.com/problemset/problem/931/A | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 13259
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:930-E | codeforces | 930-E | Coins Exhibition | https://codeforces.com/problemset/problem/930/E | [
"data structures",
"dp",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 572
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:930-D | codeforces | 930-D | Game with Tokens | https://codeforces.com/problemset/problem/930/D | [
"data structures",
"games",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 469
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:930-C | codeforces | 930-C | Teodor is not a liar! | https://codeforces.com/problemset/problem/930/C | [
"data structures",
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2430
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:930-B | codeforces | 930-B | Game with String | https://codeforces.com/problemset/problem/930/B | [
"implementation",
"probabilities",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 3251
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:930-A | codeforces | 930-A | Peculiar apple-tree | https://codeforces.com/problemset/problem/930/A | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8714
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:929-D | codeforces | 929-D | Пограничные врата | https://codeforces.com/problemset/problem/929/D | [] | null | null | stdin_stdout | 2,400 | {
"solved_count": 172
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:929-C | codeforces | 929-C | Красивая команда | https://codeforces.com/problemset/problem/929/C | [
"*special",
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1207
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:929-B | codeforces | 929-B | Места в самолёте | https://codeforces.com/problemset/problem/929/B | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 2095
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:929-A | codeforces | 929-A | Прокат велосипедов | https://codeforces.com/problemset/problem/929/A | [
"*special",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 2575
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:928-D | codeforces | 928-D | Autocompletion | https://codeforces.com/problemset/problem/928/D | [
"*special",
"strings",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 840
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:928-C | codeforces | 928-C | Dependency management | https://codeforces.com/problemset/problem/928/C | [
"*special",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 911
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:928-B | codeforces | 928-B | Chat | https://codeforces.com/problemset/problem/928/B | [
"*special",
"dp"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 2664
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:928-A | codeforces | 928-A | Login Verification | https://codeforces.com/problemset/problem/928/A | [
"*special",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 3644
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:927-A | codeforces | 927-A | BuberPool Taxi Optimization | https://codeforces.com/problemset/problem/927/A | [
"*special",
"interactive"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1
} | 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.