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:961-C | codeforces | 961-C | Chessboard | https://codeforces.com/problemset/problem/961/C | [
"bitmasks",
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 5643
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:961-B | codeforces | 961-B | Lecture Sleep | https://codeforces.com/problemset/problem/961/B | [
"data structures",
"dp",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 26494
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:961-A | codeforces | 961-A | Tetris | https://codeforces.com/problemset/problem/961/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 10870
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:960-H | codeforces | 960-H | Santa's Gift | https://codeforces.com/problemset/problem/960/H | [
"data structures",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 349
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:960-G | codeforces | 960-G | Bandit Blues | https://codeforces.com/problemset/problem/960/G | [
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1204
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:960-F | codeforces | 960-F | Pathwalks | https://codeforces.com/problemset/problem/960/F | [
"data structures",
"dp",
"graphs"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3404
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:960-E | codeforces | 960-E | Alternating Tree | https://codeforces.com/problemset/problem/960/E | [
"combinatorics",
"dfs and similar",
"divide and conquer",
"dp",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2290
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:960-D | codeforces | 960-D | Full Binary Tree Queries | https://codeforces.com/problemset/problem/960/D | [
"brute force",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1948
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:960-C | codeforces | 960-C | Subsequence Counting | https://codeforces.com/problemset/problem/960/C | [
"bitmasks",
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4109
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:960-B | codeforces | 960-B | Minimize the error | https://codeforces.com/problemset/problem/960/B | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12599
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:960-A | codeforces | 960-A | Check the string | https://codeforces.com/problemset/problem/960/A | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8807
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:959-F | codeforces | 959-F | Mahmoud and Ehab and yet another xor task | https://codeforces.com/problemset/problem/959/F | [
"bitmasks",
"dp",
"math",
"matrices"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2875
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:959-E | codeforces | 959-E | Mahmoud and Ehab and the xor-MST | https://codeforces.com/problemset/problem/959/E | [
"bitmasks",
"dp",
"graphs",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3774
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:959-D | codeforces | 959-D | Mahmoud and Ehab and another array construction task | https://codeforces.com/problemset/problem/959/D | [
"constructive algorithms",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3275
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:959-C | codeforces | 959-C | Mahmoud and Ehab and the wrong algorithm | https://codeforces.com/problemset/problem/959/C | [
"constructive algorithms",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6214
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:959-B | codeforces | 959-B | Mahmoud and Ehab and the message | https://codeforces.com/problemset/problem/959/B | [
"dsu",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10596
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:959-A | codeforces | 959-A | Mahmoud and Ehab and the even-odd game | https://codeforces.com/problemset/problem/959/A | [
"games",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 55950
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:958-F3 | codeforces | 958-F3 | Lightsabers (hard) | https://codeforces.com/problemset/problem/958/F3 | [
"fft"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 931
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:958-F2 | codeforces | 958-F2 | Lightsabers (medium) | https://codeforces.com/problemset/problem/958/F2 | [
"binary search",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1451
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:958-F1 | codeforces | 958-F1 | Lightsabers (easy) | https://codeforces.com/problemset/problem/958/F1 | [
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 1821
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:958-E3 | codeforces | 958-E3 | Guard Duty (hard) | https://codeforces.com/problemset/problem/958/E3 | [
"geometry"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 215
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:958-E2 | codeforces | 958-E2 | Guard Duty (medium) | https://codeforces.com/problemset/problem/958/E2 | [
"binary search",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1172
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:958-E1 | codeforces | 958-E1 | Guard Duty (easy) | https://codeforces.com/problemset/problem/958/E1 | [
"brute force",
"geometry",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 1787
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:958-D2 | codeforces | 958-D2 | Hyperspace Jump (hard) | https://codeforces.com/problemset/problem/958/D2 | [] | null | null | stdin_stdout | 2,700 | {
"solved_count": 120
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:958-D1 | codeforces | 958-D1 | Hyperspace Jump (easy) | https://codeforces.com/problemset/problem/958/D1 | [
"expression parsing",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 2234
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:958-C3 | codeforces | 958-C3 | Encryption (hard) | https://codeforces.com/problemset/problem/958/C3 | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 717
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:958-C2 | codeforces | 958-C2 | Encryption (medium) | https://codeforces.com/problemset/problem/958/C2 | [
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1379
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:958-C1 | codeforces | 958-C1 | Encryption (easy) | https://codeforces.com/problemset/problem/958/C1 | [
"brute force"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 3186
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:958-B2 | codeforces | 958-B2 | Maximum Control (medium) | https://codeforces.com/problemset/problem/958/B2 | [
"data structures",
"dfs and similar",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 748
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:958-B1 | codeforces | 958-B1 | Maximum Control (easy) | https://codeforces.com/problemset/problem/958/B1 | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 3939
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:958-A3 | codeforces | 958-A3 | Death Stars (hard) | https://codeforces.com/problemset/problem/958/A3 | [] | null | null | stdin_stdout | 3,100 | {
"solved_count": 54
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:958-A2 | codeforces | 958-A2 | Death Stars (medium) | https://codeforces.com/problemset/problem/958/A2 | [
"hashing",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1059
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:958-A1 | codeforces | 958-A1 | Death Stars (easy) | https://codeforces.com/problemset/problem/958/A1 | [
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 1856
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:957-A | codeforces | 957-A | Tritonic Iridescence | https://codeforces.com/problemset/problem/957/A | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6004
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:955-F | codeforces | 955-F | Heaps | https://codeforces.com/problemset/problem/955/F | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1966
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:955-E | codeforces | 955-E | Icicles | https://codeforces.com/problemset/problem/955/E | [] | null | null | stdin_stdout | 2,900 | {
"solved_count": 104
} | 2026-06-01T05:00:40.145500+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": 578
} | 2026-06-01T05:00:40.145500+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": 2897
} | 2026-06-01T05:00:40.145500+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": 5175
} | 2026-06-01T05:00:40.145500+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": 7033
} | 2026-06-01T05:00:40.145500+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": 1321
} | 2026-06-01T05:00:40.145500+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": 771
} | 2026-06-01T05:00:40.145500+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": 2408
} | 2026-06-01T05:00:40.145500+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": 1394
} | 2026-06-01T05:00:40.145500+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": 2102
} | 2026-06-01T05:00:40.145500+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": 7936
} | 2026-06-01T05:00:40.145500+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": 3964
} | 2026-06-01T05:00:40.145500+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": 7819
} | 2026-06-01T05:00:40.145500+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": 11078
} | 2026-06-01T05:00:40.145500+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": 253
} | 2026-06-01T05:00:40.145500+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": 424
} | 2026-06-01T05:00:40.145500+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": 680
} | 2026-06-01T05:00:40.145500+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": 2569
} | 2026-06-01T05:00:40.145500+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": 3066
} | 2026-06-01T05:00:40.145500+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": 2126
} | 2026-06-01T05:00:40.145500+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": 11986
} | 2026-06-01T05:00:40.145500+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": 8006
} | 2026-06-01T05:00:40.145500+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": 16417
} | 2026-06-01T05:00:40.145500+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": 63
} | 2026-06-01T05:00:40.145500+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": 769
} | 2026-06-01T05:00:40.145500+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": 886
} | 2026-06-01T05:00:40.145500+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": 2268
} | 2026-06-01T05:00:40.145500+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": 3838
} | 2026-06-01T05:00:40.145500+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": 5667
} | 2026-06-01T05:00:40.145500+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": 15403
} | 2026-06-01T05:00:40.145500+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": 795
} | 2026-06-01T05:00:40.145500+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": 649
} | 2026-06-01T05:00:40.145500+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": 1247
} | 2026-06-01T05:00:40.145500+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": 4902
} | 2026-06-01T05:00:40.145500+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": 9404
} | 2026-06-01T05:00:40.145500+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": 11483
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:946-A | codeforces | 946-A | Partition | https://codeforces.com/problemset/problem/946/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18191
} | 2026-06-01T05:00:40.145500+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": 3412
} | 2026-06-01T05:00:40.145500+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": 4414
} | 2026-06-01T05:00:40.145500+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": 3761
} | 2026-06-01T05:00:40.145500+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": 6689
} | 2026-06-01T05:00:40.145500+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": 9529
} | 2026-06-01T05:00:40.145500+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": 8825
} | 2026-06-01T05:00:40.145500+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": 1205
} | 2026-06-01T05:00:40.145500+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": 3545
} | 2026-06-01T05:00:40.145500+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": 8200
} | 2026-06-01T05:00:40.145500+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": 4929
} | 2026-06-01T05:00:40.145500+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": 11292
} | 2026-06-01T05:00:40.145500+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": 29882
} | 2026-06-01T05:00:40.145500+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": 1096
} | 2026-06-01T05:00:40.145500+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": 614
} | 2026-06-01T05:00:40.145500+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": 1562
} | 2026-06-01T05:00:40.145500+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": 7047
} | 2026-06-01T05:00:40.145500+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": 3479
} | 2026-06-01T05:00:40.145500+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": 9317
} | 2026-06-01T05:00:40.145500+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": 12055
} | 2026-06-01T05:00:40.145500+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": 7267
} | 2026-06-01T05:00:40.145500+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": 16585
} | 2026-06-01T05:00:40.145500+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": 254
} | 2026-06-01T05:00:40.145500+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": 397
} | 2026-06-01T05:00:40.145500+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": 1263
} | 2026-06-01T05:00:40.145500+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": 3415
} | 2026-06-01T05:00:40.145500+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": 4640
} | 2026-06-01T05:00:40.145500+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": 440
} | 2026-06-01T05:00:40.145500+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": 981
} | 2026-06-01T05:00:40.145500+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.