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:1373-G | codeforces | 1373-G | Pawns | https://codeforces.com/problemset/problem/1373/G | [
"data structures",
"divide and conquer",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 986
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1373-F | codeforces | 1373-F | Network Coverage | https://codeforces.com/problemset/problem/1373/F | [
"binary search",
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1945
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1373-E | codeforces | 1373-E | Sum of Digits | https://codeforces.com/problemset/problem/1373/E | [
"brute force",
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3012
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1373-D | codeforces | 1373-D | Maximum Sum on Even Positions | https://codeforces.com/problemset/problem/1373/D | [
"divide and conquer",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 18354
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1373-C | codeforces | 1373-C | Pluses and Minuses | https://codeforces.com/problemset/problem/1373/C | [
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 19617
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1373-B | codeforces | 1373-B | 01 Game | https://codeforces.com/problemset/problem/1373/B | [
"games"
] | null | null | stdin_stdout | 900 | {
"solved_count": 58372
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1373-A | codeforces | 1373-A | Donut Shops | https://codeforces.com/problemset/problem/1373/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 30172
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1372-F | codeforces | 1372-F | Omkar and Modes | https://codeforces.com/problemset/problem/1372/F | [
"binary search",
"divide and conquer",
"interactive"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 525
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1372-E | codeforces | 1372-E | Omkar and Last Floor | https://codeforces.com/problemset/problem/1372/E | [
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1497
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1372-D | codeforces | 1372-D | Omkar and Circle | https://codeforces.com/problemset/problem/1372/D | [
"brute force",
"dp",
"games",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5989
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1372-C | codeforces | 1372-C | Omkar and Baseball | https://codeforces.com/problemset/problem/1372/C | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 19401
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1372-B | codeforces | 1372-B | Omkar and Last Class of Math | https://codeforces.com/problemset/problem/1372/B | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 39360
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1372-A | codeforces | 1372-A | Omkar and Completion | https://codeforces.com/problemset/problem/1372/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33714
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1371-F | codeforces | 1371-F | Raging Thunder | https://codeforces.com/problemset/problem/1371/F | [
"data structures",
"divide and conquer",
"implementation"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 763
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1371-E2 | codeforces | 1371-E2 | Asterism (Hard Version) | https://codeforces.com/problemset/problem/1371/E2 | [
"binary search",
"combinatorics",
"dp",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2569
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1371-E1 | codeforces | 1371-E1 | Asterism (Easy Version) | https://codeforces.com/problemset/problem/1371/E1 | [
"binary search",
"brute force",
"combinatorics",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5582
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1371-D | codeforces | 1371-D | Grid-00100 | https://codeforces.com/problemset/problem/1371/D | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13823
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1371-C | codeforces | 1371-C | A Cookie for You | https://codeforces.com/problemset/problem/1371/C | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 21584
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1371-B | codeforces | 1371-B | Magical Calendar | https://codeforces.com/problemset/problem/1371/B | [
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19805
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1371-A | codeforces | 1371-A | Magical Sticks | https://codeforces.com/problemset/problem/1371/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 52374
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1370-F2 | codeforces | 1370-F2 | The Hidden Pair (Hard Version) | https://codeforces.com/problemset/problem/1370/F2 | [
"binary search",
"dfs and similar",
"graphs",
"interactive",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1766
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1370-F1 | codeforces | 1370-F1 | The Hidden Pair (Easy Version) | https://codeforces.com/problemset/problem/1370/F1 | [
"binary search",
"dfs and similar",
"graphs",
"interactive",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1873
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1370-E | codeforces | 1370-E | Binary Subsequence Rotation | https://codeforces.com/problemset/problem/1370/E | [
"binary search",
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5330
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1370-D | codeforces | 1370-D | Odd-Even Subsequence | https://codeforces.com/problemset/problem/1370/D | [
"binary search",
"dp",
"dsu",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 11528
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1370-C | codeforces | 1370-C | Number Game | https://codeforces.com/problemset/problem/1370/C | [
"games",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 28021
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1370-B | codeforces | 1370-B | GCD Compression | https://codeforces.com/problemset/problem/1370/B | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 25528
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1370-A | codeforces | 1370-A | Maximum GCD | https://codeforces.com/problemset/problem/1370/A | [
"greedy",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 69081
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1369-F | codeforces | 1369-F | BareLee | https://codeforces.com/problemset/problem/1369/F | [
"dfs and similar",
"dp",
"games"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 779
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1369-E | codeforces | 1369-E | DeadLee | https://codeforces.com/problemset/problem/1369/E | [
"data structures",
"dfs and similar",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2534
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1369-D | codeforces | 1369-D | TediousLee | https://codeforces.com/problemset/problem/1369/D | [
"dp",
"graphs",
"greedy",
"math",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 9367
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1369-C | codeforces | 1369-C | RationalLee | https://codeforces.com/problemset/problem/1369/C | [
"greedy",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 21282
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1369-B | codeforces | 1369-B | AccurateLee | https://codeforces.com/problemset/problem/1369/B | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 25874
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1369-A | codeforces | 1369-A | FashionabLee | https://codeforces.com/problemset/problem/1369/A | [
"geometry",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 39603
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1368-H2 | codeforces | 1368-H2 | Breadboard Capacity (hard version) | https://codeforces.com/problemset/problem/1368/H2 | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 291
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1368-H1 | codeforces | 1368-H1 | Breadboard Capacity (easy version) | https://codeforces.com/problemset/problem/1368/H1 | [
"dp",
"flows",
"greedy"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 486
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1368-G | codeforces | 1368-G | Shifting Dominoes | https://codeforces.com/problemset/problem/1368/G | [
"data structures",
"geometry",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 810
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1368-F | codeforces | 1368-F | Lamps on a Circle | https://codeforces.com/problemset/problem/1368/F | [
"games",
"implementation",
"interactive",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1139
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1368-E | codeforces | 1368-E | Ski Accidents | https://codeforces.com/problemset/problem/1368/E | [
"constructive algorithms",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2491
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1368-D | codeforces | 1368-D | AND, OR and square sum | https://codeforces.com/problemset/problem/1368/D | [
"bitmasks",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 14618
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1368-C | codeforces | 1368-C | Even Picture | https://codeforces.com/problemset/problem/1368/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14181
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1368-B | codeforces | 1368-B | Codeforces Subsequences | https://codeforces.com/problemset/problem/1368/B | [
"brute force",
"constructive algorithms",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 22109
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1368-A | codeforces | 1368-A | C+= | https://codeforces.com/problemset/problem/1368/A | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 47773
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1367-F2 | codeforces | 1367-F2 | Flying Sort (Hard Version) | https://codeforces.com/problemset/problem/1367/F2 | [
"binary search",
"data structures",
"dp",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2041
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1367-F1 | codeforces | 1367-F1 | Flying Sort (Easy Version) | https://codeforces.com/problemset/problem/1367/F1 | [
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3748
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1367-E | codeforces | 1367-E | Necklace Assembly | https://codeforces.com/problemset/problem/1367/E | [
"brute force",
"dfs and similar",
"dp",
"graphs",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5982
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1367-D | codeforces | 1367-D | Task On The Board | https://codeforces.com/problemset/problem/1367/D | [
"constructive algorithms",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9020
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1367-C | codeforces | 1367-C | Social Distance | https://codeforces.com/problemset/problem/1367/C | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 25868
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1367-B | codeforces | 1367-B | Even Array | https://codeforces.com/problemset/problem/1367/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 67013
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1367-A | codeforces | 1367-A | Short Substrings | https://codeforces.com/problemset/problem/1367/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 70238
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1366-G | codeforces | 1366-G | Construct the String | https://codeforces.com/problemset/problem/1366/G | [
"data structures",
"dp",
"strings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 656
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1366-F | codeforces | 1366-F | Jog Around The Graph | https://codeforces.com/problemset/problem/1366/F | [
"binary search",
"dp",
"geometry",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 955
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1366-E | codeforces | 1366-E | Two Arrays | https://codeforces.com/problemset/problem/1366/E | [
"binary search",
"brute force",
"combinatorics",
"constructive algorithms",
"dp",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4718
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1366-D | codeforces | 1366-D | Two Divisors | https://codeforces.com/problemset/problem/1366/D | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 13014
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1366-C | codeforces | 1366-C | Palindromic Paths | https://codeforces.com/problemset/problem/1366/C | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14416
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1366-B | codeforces | 1366-B | Shuffle | https://codeforces.com/problemset/problem/1366/B | [
"math",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 30434
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1366-A | codeforces | 1366-A | Shovels and Swords | https://codeforces.com/problemset/problem/1366/A | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 33719
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1365-G | codeforces | 1365-G | Secure Password | https://codeforces.com/problemset/problem/1365/G | [
"bitmasks",
"combinatorics",
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1576
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1365-F | codeforces | 1365-F | Swaps Again | https://codeforces.com/problemset/problem/1365/F | [
"constructive algorithms",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4932
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1365-E | codeforces | 1365-E | Maximum Subsequence Value | https://codeforces.com/problemset/problem/1365/E | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8537
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1365-D | codeforces | 1365-D | Solve The Maze | https://codeforces.com/problemset/problem/1365/D | [
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 21962
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1365-C | codeforces | 1365-C | Rotation Matching | https://codeforces.com/problemset/problem/1365/C | [
"constructive algorithms",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 25525
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1365-B | codeforces | 1365-B | Trouble Sort | https://codeforces.com/problemset/problem/1365/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 29361
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1365-A | codeforces | 1365-A | Matrix Game | https://codeforces.com/problemset/problem/1365/A | [
"games",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 25345
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1364-E | codeforces | 1364-E | X-OR | https://codeforces.com/problemset/problem/1364/E | [
"bitmasks",
"constructive algorithms",
"divide and conquer",
"interactive",
"probabilities"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1803
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1364-D | codeforces | 1364-D | Ehab's Last Corollary | https://codeforces.com/problemset/problem/1364/D | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5272
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1364-C | codeforces | 1364-C | Ehab and Prefix MEXs | https://codeforces.com/problemset/problem/1364/C | [
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14686
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1364-B | codeforces | 1364-B | Most socially-distanced subsequence | https://codeforces.com/problemset/problem/1364/B | [
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 28431
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1364-A | codeforces | 1364-A | XXXXX | https://codeforces.com/problemset/problem/1364/A | [
"brute force",
"data structures",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 32317
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1363-F | codeforces | 1363-F | Rotating Substrings | https://codeforces.com/problemset/problem/1363/F | [
"dp",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1868
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1363-E | codeforces | 1363-E | Tree Shuffling | https://codeforces.com/problemset/problem/1363/E | [
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 7714
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1363-D | codeforces | 1363-D | Guess The Maximums | https://codeforces.com/problemset/problem/1363/D | [
"binary search",
"implementation",
"interactive",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4516
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1363-C | codeforces | 1363-C | Game On Leaves | https://codeforces.com/problemset/problem/1363/C | [
"games",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 21867
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1363-B | codeforces | 1363-B | Subsequence Hate | https://codeforces.com/problemset/problem/1363/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 27343
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1363-A | codeforces | 1363-A | Odd Selection | https://codeforces.com/problemset/problem/1363/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 41883
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1362-C | codeforces | 1362-C | Johnny and Another Rating Drop | https://codeforces.com/problemset/problem/1362/C | [
"bitmasks",
"greedy",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 25644
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1362-B | codeforces | 1362-B | Johnny and His Hobbies | https://codeforces.com/problemset/problem/1362/B | [
"bitmasks",
"brute force"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 21538
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1362-A | codeforces | 1362-A | Johnny and Ancient Computer | https://codeforces.com/problemset/problem/1362/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 37852
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1361-F | codeforces | 1361-F | Johnny and New Toy | https://codeforces.com/problemset/problem/1361/F | [
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 264
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1361-E | codeforces | 1361-E | James and the Chase | https://codeforces.com/problemset/problem/1361/E | [
"dfs and similar",
"graphs",
"probabilities",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1103
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1361-D | codeforces | 1361-D | Johnny and James | https://codeforces.com/problemset/problem/1361/D | [
"greedy",
"implementation",
"math",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 456
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1361-C | codeforces | 1361-C | Johnny and Megan's Necklace | https://codeforces.com/problemset/problem/1361/C | [
"binary search",
"bitmasks",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2181
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1361-B | codeforces | 1361-B | Johnny and Grandmaster | https://codeforces.com/problemset/problem/1361/B | [
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3925
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1361-A | codeforces | 1361-A | Johnny and Contribution | https://codeforces.com/problemset/problem/1361/A | [
"constructive algorithms",
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8928
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1360-H | codeforces | 1360-H | Binary Median | https://codeforces.com/problemset/problem/1360/H | [
"binary search",
"bitmasks",
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4952
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1360-G | codeforces | 1360-G | A/B Matrix | https://codeforces.com/problemset/problem/1360/G | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8458
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1360-F | codeforces | 1360-F | Spy-string | https://codeforces.com/problemset/problem/1360/F | [
"bitmasks",
"brute force",
"constructive algorithms",
"dp",
"hashing",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 13879
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1360-E | codeforces | 1360-E | Polygon | https://codeforces.com/problemset/problem/1360/E | [
"dp",
"graphs",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 28813
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1360-D | codeforces | 1360-D | Buying Shovels | https://codeforces.com/problemset/problem/1360/D | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 46576
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1360-C | codeforces | 1360-C | Similar Pairs | https://codeforces.com/problemset/problem/1360/C | [
"constructive algorithms",
"graph matchings",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 37911
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1360-B | codeforces | 1360-B | Honest Coach | https://codeforces.com/problemset/problem/1360/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 55460
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1360-A | codeforces | 1360-A | Minimal Square | https://codeforces.com/problemset/problem/1360/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 58669
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1359-F | codeforces | 1359-F | RC Kaboom Show | https://codeforces.com/problemset/problem/1359/F | [
"binary search",
"brute force",
"data structures",
"geometry",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 640
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1359-E | codeforces | 1359-E | Modular Stability | https://codeforces.com/problemset/problem/1359/E | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6972
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1359-D | codeforces | 1359-D | Yet Another Yet Another Task | https://codeforces.com/problemset/problem/1359/D | [
"data structures",
"dp",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 11110
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1359-C | codeforces | 1359-C | Mixing Water | https://codeforces.com/problemset/problem/1359/C | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 15723
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1359-B | codeforces | 1359-B | New Theatre Square | https://codeforces.com/problemset/problem/1359/B | [
"brute force",
"dp",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 29719
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1359-A | codeforces | 1359-A | Berland Poker | https://codeforces.com/problemset/problem/1359/A | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 32169
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1358-F | codeforces | 1358-F | Tasty Cookie | https://codeforces.com/problemset/problem/1358/F | [
"binary search",
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 570
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1358-E | codeforces | 1358-E | Are You Fired? | https://codeforces.com/problemset/problem/1358/E | [
"constructive algorithms",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2501
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1358-D | codeforces | 1358-D | The Best Vacation | https://codeforces.com/problemset/problem/1358/D | [
"binary search",
"brute force",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8891
} | 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.