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:1409-A | codeforces | 1409-A | Yet Another Two Integers Problem | https://codeforces.com/problemset/problem/1409/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 82551
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1408-I | codeforces | 1408-I | Bitwise Magic | https://codeforces.com/problemset/problem/1408/I | [
"dp",
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 402
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1408-H | codeforces | 1408-H | Rainbow Triples | https://codeforces.com/problemset/problem/1408/H | [
"binary search",
"data structures",
"flows",
"greedy"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 578
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1408-G | codeforces | 1408-G | Clusterization Counting | https://codeforces.com/problemset/problem/1408/G | [
"combinatorics",
"dp",
"dsu",
"fft",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1391
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1408-F | codeforces | 1408-F | Two Different | https://codeforces.com/problemset/problem/1408/F | [
"constructive algorithms",
"divide and conquer"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2787
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1408-E | codeforces | 1408-E | Avoid Rainbow Cycles | https://codeforces.com/problemset/problem/1408/E | [
"data structures",
"dsu",
"graphs",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2240
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1408-D | codeforces | 1408-D | Searchlights | https://codeforces.com/problemset/problem/1408/D | [
"binary search",
"brute force",
"data structures",
"dp",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4748
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1408-C | codeforces | 1408-C | Discrete Acceleration | https://codeforces.com/problemset/problem/1408/C | [
"binary search",
"dp",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9375
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1408-B | codeforces | 1408-B | Arrays Sum | https://codeforces.com/problemset/problem/1408/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10508
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1408-A | codeforces | 1408-A | Circle Coloring | https://codeforces.com/problemset/problem/1408/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12834
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1407-E | codeforces | 1407-E | Egor in the Republic of Dagestan | https://codeforces.com/problemset/problem/1407/E | [
"constructive algorithms",
"dfs and similar",
"dp",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2011
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1407-D | codeforces | 1407-D | Discrete Centrifugal Jumps | https://codeforces.com/problemset/problem/1407/D | [
"data structures",
"dp",
"graphs"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 5981
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1407-C | codeforces | 1407-C | Chocolate Bunny | https://codeforces.com/problemset/problem/1407/C | [
"constructive algorithms",
"interactive",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15352
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1407-B | codeforces | 1407-B | Big Vova | https://codeforces.com/problemset/problem/1407/B | [
"brute force",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18242
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1407-A | codeforces | 1407-A | Ahahahahahahahaha | https://codeforces.com/problemset/problem/1407/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21566
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1406-E | codeforces | 1406-E | Deleting Numbers | https://codeforces.com/problemset/problem/1406/E | [
"interactive",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1972
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1406-D | codeforces | 1406-D | Three Sequences | https://codeforces.com/problemset/problem/1406/D | [
"constructive algorithms",
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3873
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1406-C | codeforces | 1406-C | Link Cut Centroids | https://codeforces.com/problemset/problem/1406/C | [
"constructive algorithms",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 12156
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1406-B | codeforces | 1406-B | Maximum Product | https://codeforces.com/problemset/problem/1406/B | [
"brute force",
"dp",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 24822
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1406-A | codeforces | 1406-A | Subset Mex | https://codeforces.com/problemset/problem/1406/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 23297
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1405-B | codeforces | 1405-B | Array Cancellation | https://codeforces.com/problemset/problem/1405/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 23396
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1405-A | codeforces | 1405-A | Permutation Forgery | https://codeforces.com/problemset/problem/1405/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21970
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1404-E | codeforces | 1404-E | Bricks | https://codeforces.com/problemset/problem/1404/E | [
"flows",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1789
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1404-D | codeforces | 1404-D | Game of Pairs | https://codeforces.com/problemset/problem/1404/D | [
"constructive algorithms",
"dfs and similar",
"interactive",
"math",
"number theory"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1312
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1404-C | codeforces | 1404-C | Fixed Point Removal | https://codeforces.com/problemset/problem/1404/C | [
"binary search",
"constructive algorithms",
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3120
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1404-B | codeforces | 1404-B | Tree Tag | https://codeforces.com/problemset/problem/1404/B | [
"dfs and similar",
"dp",
"games",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8374
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1404-A | codeforces | 1404-A | Balanced Bitstring | https://codeforces.com/problemset/problem/1404/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 20212
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1403-C | codeforces | 1403-C | Chess Rush | https://codeforces.com/problemset/problem/1403/C | [
"*special",
"combinatorics",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 95
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1403-B | codeforces | 1403-B | Spring cleaning | https://codeforces.com/problemset/problem/1403/B | [
"*special",
"data structures",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 438
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1403-A | codeforces | 1403-A | The Potion of Great Power | https://codeforces.com/problemset/problem/1403/A | [
"*special",
"2-sat",
"binary search",
"data structures",
"graphs",
"interactive",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 362
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1402-C | codeforces | 1402-C | Star Trek | https://codeforces.com/problemset/problem/1402/C | [
"*special",
"combinatorics",
"dfs and similar",
"dp",
"games",
"graphs",
"matrices",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 271
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1402-B | codeforces | 1402-B | Roads | https://codeforces.com/problemset/problem/1402/B | [
"*special",
"geometry",
"sortings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 141
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1402-A | codeforces | 1402-A | Fancy Fence | https://codeforces.com/problemset/problem/1402/A | [
"*special",
"data structures",
"dsu",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1382
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1401-F | codeforces | 1401-F | Reverse and Swap | https://codeforces.com/problemset/problem/1401/F | [
"binary search",
"bitmasks",
"data structures"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2009
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1401-E | codeforces | 1401-E | Divide Square | https://codeforces.com/problemset/problem/1401/E | [
"data structures",
"geometry",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2687
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1401-D | codeforces | 1401-D | Maximum Distributed Tree | https://codeforces.com/problemset/problem/1401/D | [
"dfs and similar",
"dp",
"greedy",
"implementation",
"math",
"number theory",
"sortings",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 10792
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1401-C | codeforces | 1401-C | Mere Array | https://codeforces.com/problemset/problem/1401/C | [
"constructive algorithms",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 27442
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1401-B | codeforces | 1401-B | Ternary Sequence | https://codeforces.com/problemset/problem/1401/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21870
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1401-A | codeforces | 1401-A | Distance and Axis | https://codeforces.com/problemset/problem/1401/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 28824
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1400-G | codeforces | 1400-G | Mercenaries | https://codeforces.com/problemset/problem/1400/G | [
"bitmasks",
"brute force",
"combinatorics",
"dp",
"dsu",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1222
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1400-F | codeforces | 1400-F | x-prime Substrings | https://codeforces.com/problemset/problem/1400/F | [
"brute force",
"dfs and similar",
"dp",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1286
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1400-E | codeforces | 1400-E | Clear the Multiset | https://codeforces.com/problemset/problem/1400/E | [
"data structures",
"divide and conquer",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 6543
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1400-D | codeforces | 1400-D | Zigzags | https://codeforces.com/problemset/problem/1400/D | [
"brute force",
"combinatorics",
"data structures",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 11545
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1400-C | codeforces | 1400-C | Binary String Reconstruction | https://codeforces.com/problemset/problem/1400/C | [
"2-sat",
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 18658
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1400-B | codeforces | 1400-B | RPG Protagonist | https://codeforces.com/problemset/problem/1400/B | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11766
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1400-A | codeforces | 1400-A | String Similarity | https://codeforces.com/problemset/problem/1400/A | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28063
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1399-F | codeforces | 1399-F | Yet Another Segments Subset | https://codeforces.com/problemset/problem/1399/F | [
"data structures",
"dp",
"graphs",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1942
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1399-E2 | codeforces | 1399-E2 | Weights Division (hard version) | https://codeforces.com/problemset/problem/1399/E2 | [
"binary search",
"dfs and similar",
"greedy",
"sortings",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2594
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1399-E1 | codeforces | 1399-E1 | Weights Division (easy version) | https://codeforces.com/problemset/problem/1399/E1 | [
"data structures",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6432
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1399-D | codeforces | 1399-D | Binary String To Subsequences | https://codeforces.com/problemset/problem/1399/D | [
"constructive algorithms",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 20104
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1399-C | codeforces | 1399-C | Boats Competition | https://codeforces.com/problemset/problem/1399/C | [
"brute force",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 33383
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1399-B | codeforces | 1399-B | Gifts Fixing | https://codeforces.com/problemset/problem/1399/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 47477
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1399-A | codeforces | 1399-A | Remove Smallest | https://codeforces.com/problemset/problem/1399/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 83299
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1398-G | codeforces | 1398-G | Running Competition | https://codeforces.com/problemset/problem/1398/G | [
"bitmasks",
"fft",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1343
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1398-F | codeforces | 1398-F | Controversial Rounds | https://codeforces.com/problemset/problem/1398/F | [
"binary search",
"data structures",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1456
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1398-E | codeforces | 1398-E | Two Types of Spells | https://codeforces.com/problemset/problem/1398/E | [
"binary search",
"data structures",
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2642
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1398-D | codeforces | 1398-D | Colored Rectangles | https://codeforces.com/problemset/problem/1398/D | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 12778
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1398-C | codeforces | 1398-C | Good Subarrays | https://codeforces.com/problemset/problem/1398/C | [
"data structures",
"dp",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 39070
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1398-B | codeforces | 1398-B | Substring Removal Game | https://codeforces.com/problemset/problem/1398/B | [
"games",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26154
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1398-A | codeforces | 1398-A | Bad Triangle | https://codeforces.com/problemset/problem/1398/A | [
"geometry",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28999
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1397-B | codeforces | 1397-B | Power Sequence | https://codeforces.com/problemset/problem/1397/B | [
"brute force",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15569
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1397-A | codeforces | 1397-A | Juggling Letters | https://codeforces.com/problemset/problem/1397/A | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29998
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1396-E | codeforces | 1396-E | Distance Matching | https://codeforces.com/problemset/problem/1396/E | [
"constructive algorithms",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 442
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1396-D | codeforces | 1396-D | Rainbow Rectangles | https://codeforces.com/problemset/problem/1396/D | [
"data structures",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 352
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1396-C | codeforces | 1396-C | Monster Invaders | https://codeforces.com/problemset/problem/1396/C | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2862
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1396-B | codeforces | 1396-B | Stoned Game | https://codeforces.com/problemset/problem/1396/B | [
"brute force",
"constructive algorithms",
"games",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 13284
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1396-A | codeforces | 1396-A | Multiples of Length | https://codeforces.com/problemset/problem/1396/A | [
"constructive algorithms",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 16842
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1395-C | codeforces | 1395-C | Boboniu and Bit Operations | https://codeforces.com/problemset/problem/1395/C | [
"bitmasks",
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15428
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1395-B | codeforces | 1395-B | Boboniu Plays Chess | https://codeforces.com/problemset/problem/1395/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16424
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1395-A | codeforces | 1395-A | Boboniu Likes to Color Balls | https://codeforces.com/problemset/problem/1395/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 25684
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1394-E | codeforces | 1394-E | Boboniu and Banknote Collection | https://codeforces.com/problemset/problem/1394/E | [
"strings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 183
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1394-D | codeforces | 1394-D | Boboniu and Jianghu | https://codeforces.com/problemset/problem/1394/D | [
"dp",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1314
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1394-C | codeforces | 1394-C | Boboniu and String | https://codeforces.com/problemset/problem/1394/C | [
"binary search",
"geometry",
"ternary search"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1295
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1394-B | codeforces | 1394-B | Boboniu Walks on Graph | https://codeforces.com/problemset/problem/1394/B | [
"brute force",
"dfs and similar",
"graphs",
"hashing"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2180
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1394-A | codeforces | 1394-A | Boboniu Chats with Du | https://codeforces.com/problemset/problem/1394/A | [
"dp",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7164
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1393-E2 | codeforces | 1393-E2 | Twilight and Ancient Scroll (harder version) | https://codeforces.com/problemset/problem/1393/E2 | [
"dp",
"hashing",
"implementation",
"string suffix structures",
"strings",
"two pointers"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 529
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1393-E1 | codeforces | 1393-E1 | Twilight and Ancient Scroll (easier version) | https://codeforces.com/problemset/problem/1393/E1 | [
"dp",
"hashing",
"implementation",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 520
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1393-D | codeforces | 1393-D | Rarity and New Dress | https://codeforces.com/problemset/problem/1393/D | [
"dfs and similar",
"dp",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4236
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1393-C | codeforces | 1393-C | Pinkie Pie Eats Patty-cakes | https://codeforces.com/problemset/problem/1393/C | [
"constructive algorithms",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11109
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1393-B | codeforces | 1393-B | Applejack and Storages | https://codeforces.com/problemset/problem/1393/B | [
"constructive algorithms",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17474
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1393-A | codeforces | 1393-A | Rainbow Dash, Fluttershy and Chess Coloring | https://codeforces.com/problemset/problem/1393/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20866
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1392-I | codeforces | 1392-I | Kevin and Grid | https://codeforces.com/problemset/problem/1392/I | [
"fft",
"graphs",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 336
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1392-H | codeforces | 1392-H | ZS Shuffles Cards | https://codeforces.com/problemset/problem/1392/H | [
"combinatorics",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1199
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1392-G | codeforces | 1392-G | Omkar and Pies | https://codeforces.com/problemset/problem/1392/G | [
"bitmasks",
"dfs and similar",
"dp",
"math",
"shortest paths"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 772
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1392-F | codeforces | 1392-F | Omkar and Landslide | https://codeforces.com/problemset/problem/1392/F | [
"binary search",
"constructive algorithms",
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2685
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1392-E | codeforces | 1392-E | Omkar and Duck | https://codeforces.com/problemset/problem/1392/E | [
"bitmasks",
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3928
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1392-D | codeforces | 1392-D | Omkar and Bed Wars | https://codeforces.com/problemset/problem/1392/D | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10029
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1392-C | codeforces | 1392-C | Omkar and Waterslide | https://codeforces.com/problemset/problem/1392/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19736
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1392-B | codeforces | 1392-B | Omkar and Infinity Clock | https://codeforces.com/problemset/problem/1392/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18952
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1392-A | codeforces | 1392-A | Omkar and Password | https://codeforces.com/problemset/problem/1392/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21827
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1391-E | codeforces | 1391-E | Pairs of Pairs | https://codeforces.com/problemset/problem/1391/E | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 2087
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1391-D | codeforces | 1391-D | 505 | https://codeforces.com/problemset/problem/1391/D | [
"bitmasks",
"brute force",
"constructive algorithms",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5877
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1391-C | codeforces | 1391-C | Cyclic Permutations | https://codeforces.com/problemset/problem/1391/C | [
"combinatorics",
"dp",
"graphs",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 16185
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1391-B | codeforces | 1391-B | Fix You | https://codeforces.com/problemset/problem/1391/B | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30181
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1391-A | codeforces | 1391-A | Suborrays | https://codeforces.com/problemset/problem/1391/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25129
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1389-G | codeforces | 1389-G | Directing Edges | https://codeforces.com/problemset/problem/1389/G | [
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 562
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1389-F | codeforces | 1389-F | Bicolored Segments | https://codeforces.com/problemset/problem/1389/F | [
"data structures",
"dp",
"graph matchings",
"sortings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1305
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1389-E | codeforces | 1389-E | Calendar Ambiguity | https://codeforces.com/problemset/problem/1389/E | [
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3767
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1389-D | codeforces | 1389-D | Segment Intersections | https://codeforces.com/problemset/problem/1389/D | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4593
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1389-C | codeforces | 1389-C | Good String | https://codeforces.com/problemset/problem/1389/C | [
"brute force",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 20802
} | 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.