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:976-C | codeforces | 976-C | Nested Segments | https://codeforces.com/problemset/problem/976/C | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11447
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:976-B | codeforces | 976-B | Lara Croft and the New Game | https://codeforces.com/problemset/problem/976/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6092
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:976-A | codeforces | 976-A | Minimum Binary Number | https://codeforces.com/problemset/problem/976/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 11033
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:975-E | codeforces | 975-E | Hag's Khashba | https://codeforces.com/problemset/problem/975/E | [
"geometry"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 378
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:975-D | codeforces | 975-D | Ghosts | https://codeforces.com/problemset/problem/975/D | [
"geometry",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2431
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:975-C | codeforces | 975-C | Valhalla Siege | https://codeforces.com/problemset/problem/975/C | [
"binary search"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11456
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:975-B | codeforces | 975-B | Mancala | https://codeforces.com/problemset/problem/975/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 7232
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:975-A | codeforces | 975-A | Aramic script | https://codeforces.com/problemset/problem/975/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 10428
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:967-B | codeforces | 967-B | Watering System | https://codeforces.com/problemset/problem/967/B | [
"math",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 7996
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:967-A | codeforces | 967-A | Mind the Gap | https://codeforces.com/problemset/problem/967/A | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 4668
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:965-E | codeforces | 965-E | Short Code | https://codeforces.com/problemset/problem/965/E | [
"data structures",
"dp",
"greedy",
"strings",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2023
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:965-D | codeforces | 965-D | Single-use Stones | https://codeforces.com/problemset/problem/965/D | [
"binary search",
"flows",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3378
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:965-C | codeforces | 965-C | Greedy Arkady | https://codeforces.com/problemset/problem/965/C | [
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2243
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:965-B | codeforces | 965-B | Battleship | https://codeforces.com/problemset/problem/965/B | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4803
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:965-A | codeforces | 965-A | Paper Airplanes | https://codeforces.com/problemset/problem/965/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 10447
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:964-B | codeforces | 964-B | Messages | https://codeforces.com/problemset/problem/964/B | [
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4610
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:964-A | codeforces | 964-A | Splits | https://codeforces.com/problemset/problem/964/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 10394
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:963-E | codeforces | 963-E | Circles of Waiting | https://codeforces.com/problemset/problem/963/E | [
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 872
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:963-D | codeforces | 963-D | Frequency of String | https://codeforces.com/problemset/problem/963/D | [
"hashing",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2937
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:963-C | codeforces | 963-C | Cutting Rectangle | https://codeforces.com/problemset/problem/963/C | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 707
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:963-B | codeforces | 963-B | Destruction of a Tree | https://codeforces.com/problemset/problem/963/B | [
"constructive algorithms",
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3051
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:963-A | codeforces | 963-A | Alternating Sum | https://codeforces.com/problemset/problem/963/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3673
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:962-G | codeforces | 962-G | Visible Black Areas | https://codeforces.com/problemset/problem/962/G | [
"data structures",
"dsu",
"geometry",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 284
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:962-F | codeforces | 962-F | Simple Cycles Edges | https://codeforces.com/problemset/problem/962/F | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1678
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:962-E | codeforces | 962-E | Byteland, Berland and Disputed Cities | https://codeforces.com/problemset/problem/962/E | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1170
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:962-D | codeforces | 962-D | Merge Equals | https://codeforces.com/problemset/problem/962/D | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7442
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:962-C | codeforces | 962-C | Make a Square | https://codeforces.com/problemset/problem/962/C | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8513
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:962-B | codeforces | 962-B | Students in Railway Carriage | https://codeforces.com/problemset/problem/962/B | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 8184
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:962-A | codeforces | 962-A | Equator | https://codeforces.com/problemset/problem/962/A | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13493
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:961-G | codeforces | 961-G | Partitions | https://codeforces.com/problemset/problem/961/G | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1825
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:961-F | codeforces | 961-F | k-substrings | https://codeforces.com/problemset/problem/961/F | [
"binary search",
"hashing",
"string suffix structures"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 973
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:961-E | codeforces | 961-E | Tufurama | https://codeforces.com/problemset/problem/961/E | [
"data structures"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4338
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:961-D | codeforces | 961-D | Pair Of Lines | https://codeforces.com/problemset/problem/961/D | [
"geometry"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5008
} | 2026-08-17T01:43:56.191071+00:00 |
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": 5662
} | 2026-08-17T01:43:56.191071+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": 27214
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:961-A | codeforces | 961-A | Tetris | https://codeforces.com/problemset/problem/961/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 10939
} | 2026-08-17T01:43:56.191071+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": 526
} | 2026-08-17T01:43:56.191071+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": 1292
} | 2026-08-17T01:43:56.191071+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": 3502
} | 2026-08-17T01:43:56.191071+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": 2365
} | 2026-08-17T01:43:56.191071+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": 1980
} | 2026-08-17T01:43:56.191071+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": 4195
} | 2026-08-17T01:43:56.191071+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": 13277
} | 2026-08-17T01:43:56.191071+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": 8897
} | 2026-08-17T01:43:56.191071+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": 2973
} | 2026-08-17T01:43:56.191071+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": 3831
} | 2026-08-17T01:43:56.191071+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": 3296
} | 2026-08-17T01:43:56.191071+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": 6333
} | 2026-08-17T01:43:56.191071+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": 10703
} | 2026-08-17T01:43:56.191071+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": 56750
} | 2026-08-17T01:43:56.191071+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": 993
} | 2026-08-17T01:43:56.191071+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": 1459
} | 2026-08-17T01:43:56.191071+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": 1836
} | 2026-08-17T01:43:56.191071+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": 247
} | 2026-08-17T01:43:56.191071+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": 1214
} | 2026-08-17T01:43:56.191071+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": 1793
} | 2026-08-17T01:43:56.191071+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": 142
} | 2026-08-17T01:43:56.191071+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": 2245
} | 2026-08-17T01:43:56.191071+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": 786
} | 2026-08-17T01:43:56.191071+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": 1422
} | 2026-08-17T01:43:56.191071+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": 3217
} | 2026-08-17T01:43:56.191071+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": 767
} | 2026-08-17T01:43:56.191071+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": 3974
} | 2026-08-17T01:43:56.191071+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": 150
} | 2026-08-17T01:43:56.191071+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": 1097
} | 2026-08-17T01:43:56.191071+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": 1865
} | 2026-08-17T01:43:56.191071+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": 6037
} | 2026-08-17T01:43:56.191071+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": 2002
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:955-E | codeforces | 955-E | Icicles | https://codeforces.com/problemset/problem/955/E | [] | null | null | stdin_stdout | 2,900 | {
"solved_count": 174
} | 2026-08-17T01:43:56.191071+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": 617
} | 2026-08-17T01:43:56.191071+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": 2936
} | 2026-08-17T01:43:56.191071+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": 5211
} | 2026-08-17T01:43:56.191071+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": 7061
} | 2026-08-17T01:43:56.191071+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": 1425
} | 2026-08-17T01:43:56.191071+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": 830
} | 2026-08-17T01:43:56.191071+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": 2455
} | 2026-08-17T01:43:56.191071+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": 1441
} | 2026-08-17T01:43:56.191071+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": 2152
} | 2026-08-17T01:43:56.191071+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": 8132
} | 2026-08-17T01:43:56.191071+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": 3979
} | 2026-08-17T01:43:56.191071+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": 7880
} | 2026-08-17T01:43:56.191071+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": 11133
} | 2026-08-17T01:43:56.191071+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": 263
} | 2026-08-17T01:43:56.191071+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": 436
} | 2026-08-17T01:43:56.191071+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": 703
} | 2026-08-17T01:43:56.191071+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": 2584
} | 2026-08-17T01:43:56.191071+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": 3077
} | 2026-08-17T01:43:56.191071+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": 2134
} | 2026-08-17T01:43:56.191071+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": 12076
} | 2026-08-17T01:43:56.191071+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": 8042
} | 2026-08-17T01:43:56.191071+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": 16507
} | 2026-08-17T01:43:56.191071+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": 64
} | 2026-08-17T01:43:56.191071+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": 797
} | 2026-08-17T01:43:56.191071+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": 921
} | 2026-08-17T01:43:56.191071+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": 2342
} | 2026-08-17T01:43:56.191071+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": 3845
} | 2026-08-17T01:43:56.191071+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": 5721
} | 2026-08-17T01:43:56.191071+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": 15607
} | 2026-08-17T01:43:56.191071+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": 840
} | 2026-08-17T01:43:56.191071+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": 674
} | 2026-08-17T01:43:56.191071+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.