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:1355-E | codeforces | 1355-E | Restorer Distance | https://codeforces.com/problemset/problem/1355/E | [
"binary search",
"greedy",
"math",
"sortings",
"ternary search"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 6069
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1355-D | codeforces | 1355-D | Game With Array | https://codeforces.com/problemset/problem/1355/D | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 19203
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1355-C | codeforces | 1355-C | Count Triangles | https://codeforces.com/problemset/problem/1355/C | [
"binary search",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 12318
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1355-B | codeforces | 1355-B | Young Explorers | https://codeforces.com/problemset/problem/1355/B | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 27714
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1355-A | codeforces | 1355-A | Sequence with Digits | https://codeforces.com/problemset/problem/1355/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 29211
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1354-G | codeforces | 1354-G | Find a Gift | https://codeforces.com/problemset/problem/1354/G | [
"binary search",
"interactive",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1068
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1354-F | codeforces | 1354-F | Summoning Minions | https://codeforces.com/problemset/problem/1354/F | [
"constructive algorithms",
"dp",
"flows",
"graph matchings",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1537
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1354-E | codeforces | 1354-E | Graph Coloring | https://codeforces.com/problemset/problem/1354/E | [
"dfs and similar",
"dp",
"graphs"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3838
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1354-D | codeforces | 1354-D | Multiset | https://codeforces.com/problemset/problem/1354/D | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 10626
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1354-C2 | codeforces | 1354-C2 | Not So Simple Polygon Embedding | https://codeforces.com/problemset/problem/1354/C2 | [
"binary search",
"brute force",
"geometry",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6424
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1354-C1 | codeforces | 1354-C1 | Simple Polygon Embedding | https://codeforces.com/problemset/problem/1354/C1 | [
"binary search",
"geometry",
"math",
"ternary search"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16415
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1354-B | codeforces | 1354-B | Ternary String | https://codeforces.com/problemset/problem/1354/B | [
"binary search",
"dp",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 35954
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1354-A | codeforces | 1354-A | Alarm Clock | https://codeforces.com/problemset/problem/1354/A | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 25045
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1353-F | codeforces | 1353-F | Decreasing Heights | https://codeforces.com/problemset/problem/1353/F | [
"brute force",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3709
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1353-E | codeforces | 1353-E | K-periodic Garland | https://codeforces.com/problemset/problem/1353/E | [
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7960
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1353-D | codeforces | 1353-D | Constructing the Array | https://codeforces.com/problemset/problem/1353/D | [
"constructive algorithms",
"data structures",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 20743
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1353-C | codeforces | 1353-C | Board Moves | https://codeforces.com/problemset/problem/1353/C | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 39254
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1353-B | codeforces | 1353-B | Two Arrays And Swaps | https://codeforces.com/problemset/problem/1353/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 59493
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1353-A | codeforces | 1353-A | Most Unstable Array | https://codeforces.com/problemset/problem/1353/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 45104
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1352-G | codeforces | 1352-G | Special Permutation | https://codeforces.com/problemset/problem/1352/G | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 25433
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1352-F | codeforces | 1352-F | Binary String Reconstruction | https://codeforces.com/problemset/problem/1352/F | [
"constructive algorithms",
"dfs and similar",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 19870
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1352-E | codeforces | 1352-E | Special Elements | https://codeforces.com/problemset/problem/1352/E | [
"brute force",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 24574
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1352-D | codeforces | 1352-D | Alice, Bob and Candies | https://codeforces.com/problemset/problem/1352/D | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 30558
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1352-C | codeforces | 1352-C | K-th Not Divisible by n | https://codeforces.com/problemset/problem/1352/C | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 73341
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1352-B | codeforces | 1352-B | Same Parity Summands | https://codeforces.com/problemset/problem/1352/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 46533
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1352-A | codeforces | 1352-A | Sum of Round Numbers | https://codeforces.com/problemset/problem/1352/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 108301
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1351-C | codeforces | 1351-C | Skier | https://codeforces.com/problemset/problem/1351/C | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9373
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1351-B | codeforces | 1351-B | Square? | https://codeforces.com/problemset/problem/1351/B | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18713
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1351-A | codeforces | 1351-A | A+B (Trial Problem) | https://codeforces.com/problemset/problem/1351/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27292
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1350-B | codeforces | 1350-B | Orac and Models | https://codeforces.com/problemset/problem/1350/B | [
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 30980
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1350-A | codeforces | 1350-A | Orac and Factors | https://codeforces.com/problemset/problem/1350/A | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 27588
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1349-F2 | codeforces | 1349-F2 | Slime and Sequences (Hard Version) | https://codeforces.com/problemset/problem/1349/F2 | [
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 143
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1349-F1 | codeforces | 1349-F1 | Slime and Sequences (Easy Version) | https://codeforces.com/problemset/problem/1349/F1 | [
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 675
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1349-E | codeforces | 1349-E | Slime and Hats | https://codeforces.com/problemset/problem/1349/E | [
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 127
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1349-D | codeforces | 1349-D | Slime and Biscuits | https://codeforces.com/problemset/problem/1349/D | [
"math",
"probabilities"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 1247
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1349-C | codeforces | 1349-C | Orac and Game of Life | https://codeforces.com/problemset/problem/1349/C | [
"dfs and similar",
"graphs",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4928
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1349-B | codeforces | 1349-B | Orac and Medians | https://codeforces.com/problemset/problem/1349/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 9038
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1349-A | codeforces | 1349-A | Orac and LCM | https://codeforces.com/problemset/problem/1349/A | [
"data structures",
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 22601
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1348-F | codeforces | 1348-F | Phoenix and Memory | https://codeforces.com/problemset/problem/1348/F | [
"data structures",
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 970
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1348-E | codeforces | 1348-E | Phoenix and Berries | https://codeforces.com/problemset/problem/1348/E | [
"brute force",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2528
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1348-D | codeforces | 1348-D | Phoenix and Science | https://codeforces.com/problemset/problem/1348/D | [
"binary search",
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 9404
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1348-C | codeforces | 1348-C | Phoenix and Distribution | https://codeforces.com/problemset/problem/1348/C | [
"constructive algorithms",
"greedy",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15634
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1348-B | codeforces | 1348-B | Phoenix and Beauty | https://codeforces.com/problemset/problem/1348/B | [
"constructive algorithms",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 27968
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1348-A | codeforces | 1348-A | Phoenix and Balance | https://codeforces.com/problemset/problem/1348/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 43398
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1346-I | codeforces | 1346-I | Pac-Man 2.0 | https://codeforces.com/problemset/problem/1346/I | [
"*special",
"dp"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 65
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1346-H | codeforces | 1346-H | Game with Segments | https://codeforces.com/problemset/problem/1346/H | [
"*special",
"data structures",
"games"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 65
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1346-G | codeforces | 1346-G | Two IP Cameras | https://codeforces.com/problemset/problem/1346/G | [
"*special",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 153
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1346-F | codeforces | 1346-F | Dune II: Battle For Arrakis | https://codeforces.com/problemset/problem/1346/F | [
"*special",
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 256
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1346-E | codeforces | 1346-E | Magic Tricks | https://codeforces.com/problemset/problem/1346/E | [
"*special",
"dp",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 416
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1346-D | codeforces | 1346-D | Constructing the Dungeon | https://codeforces.com/problemset/problem/1346/D | [
"*special",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 554
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1346-C | codeforces | 1346-C | Spring Cleaning | https://codeforces.com/problemset/problem/1346/C | [
"*special",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 683
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1346-B | codeforces | 1346-B | Boot Camp | https://codeforces.com/problemset/problem/1346/B | [
"*special",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 1294
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1346-A | codeforces | 1346-A | Color Revolution | https://codeforces.com/problemset/problem/1346/A | [
"*special",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 2225
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1345-B | codeforces | 1345-B | Card Constructions | https://codeforces.com/problemset/problem/1345/B | [
"binary search",
"brute force",
"dp",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 28516
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1345-A | codeforces | 1345-A | Puzzle Pieces | https://codeforces.com/problemset/problem/1345/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24884
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1344-F | codeforces | 1344-F | Piet's Palette | https://codeforces.com/problemset/problem/1344/F | [
"matrices"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 627
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1344-E | codeforces | 1344-E | Train Tracks | https://codeforces.com/problemset/problem/1344/E | [
"data structures",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 694
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1344-D | codeforces | 1344-D | Résumé Review | https://codeforces.com/problemset/problem/1344/D | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1346
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1344-C | codeforces | 1344-C | Quantifier Question | https://codeforces.com/problemset/problem/1344/C | [
"dfs and similar",
"dp",
"graphs",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 2034
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1344-B | codeforces | 1344-B | Monopole Magnets | https://codeforces.com/problemset/problem/1344/B | [
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6410
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1344-A | codeforces | 1344-A | Hilbert's Hotel | https://codeforces.com/problemset/problem/1344/A | [
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 16626
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1343-F | codeforces | 1343-F | Restore the Permutation by Sorted Segments | https://codeforces.com/problemset/problem/1343/F | [
"brute force",
"constructive algorithms",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1429
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1343-E | codeforces | 1343-E | Weights Distributing | https://codeforces.com/problemset/problem/1343/E | [
"brute force",
"graphs",
"greedy",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5868
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1343-D | codeforces | 1343-D | Constant Palindrome Sum | https://codeforces.com/problemset/problem/1343/D | [
"brute force",
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 13650
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1343-C | codeforces | 1343-C | Alternating Subsequence | https://codeforces.com/problemset/problem/1343/C | [
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 45288
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1343-B | codeforces | 1343-B | Balanced Array | https://codeforces.com/problemset/problem/1343/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 66717
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1343-A | codeforces | 1343-A | Candies | https://codeforces.com/problemset/problem/1343/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 54252
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1342-F | codeforces | 1342-F | Make It Ascending | https://codeforces.com/problemset/problem/1342/F | [
"bitmasks",
"brute force",
"dp"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1170
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1342-E | codeforces | 1342-E | Placing Rooks | https://codeforces.com/problemset/problem/1342/E | [
"combinatorics",
"fft",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3742
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1342-D | codeforces | 1342-D | Multiple Testcases | https://codeforces.com/problemset/problem/1342/D | [
"binary search",
"constructive algorithms",
"data structures",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6405
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1342-C | codeforces | 1342-C | Yet Another Counting Problem | https://codeforces.com/problemset/problem/1342/C | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15149
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1342-B | codeforces | 1342-B | Binary Period | https://codeforces.com/problemset/problem/1342/B | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 24763
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1342-A | codeforces | 1342-A | Road To Zero | https://codeforces.com/problemset/problem/1342/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 47255
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1341-B | codeforces | 1341-B | Nastya and Door | https://codeforces.com/problemset/problem/1341/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 21307
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1341-A | codeforces | 1341-A | Nastya and Rice | https://codeforces.com/problemset/problem/1341/A | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 30629
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1340-F | codeforces | 1340-F | Nastya and CBS | https://codeforces.com/problemset/problem/1340/F | [
"brute force",
"data structures",
"hashing"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 835
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1340-D | codeforces | 1340-D | Nastya and Time Machine | https://codeforces.com/problemset/problem/1340/D | [
"constructive algorithms",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1099
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1340-C | codeforces | 1340-C | Nastya and Unexpected Guest | https://codeforces.com/problemset/problem/1340/C | [
"dfs and similar",
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2483
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1340-B | codeforces | 1340-B | Nastya and Scoreboard | https://codeforces.com/problemset/problem/1340/B | [
"bitmasks",
"dp",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8356
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1340-A | codeforces | 1340-A | Nastya and Strange Generator | https://codeforces.com/problemset/problem/1340/A | [
"brute force",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13723
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1339-B | codeforces | 1339-B | Sorted Adjacent Differences | https://codeforces.com/problemset/problem/1339/B | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 28597
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1339-A | codeforces | 1339-A | Filling Diamonds | https://codeforces.com/problemset/problem/1339/A | [
"brute force",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 34548
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1338-E | codeforces | 1338-E | JYPnation | https://codeforces.com/problemset/problem/1338/E | [
"graphs"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 436
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1338-D | codeforces | 1338-D | Nested Rubber Bands | https://codeforces.com/problemset/problem/1338/D | [
"constructive algorithms",
"dfs and similar",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1161
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1338-C | codeforces | 1338-C | Perfect Triples | https://codeforces.com/problemset/problem/1338/C | [
"bitmasks",
"brute force",
"constructive algorithms",
"divide and conquer",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3498
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1338-B | codeforces | 1338-B | Edge Weight Assignment | https://codeforces.com/problemset/problem/1338/B | [
"bitmasks",
"constructive algorithms",
"dfs and similar",
"greedy",
"math",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9720
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1338-A | codeforces | 1338-A | Powered Addition | https://codeforces.com/problemset/problem/1338/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 31827
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1337-B | codeforces | 1337-B | Kana and Dragon Quest game | https://codeforces.com/problemset/problem/1337/B | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 37219
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1337-A | codeforces | 1337-A | Ichihime and Triangle | https://codeforces.com/problemset/problem/1337/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 43608
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1336-F | codeforces | 1336-F | Journey | https://codeforces.com/problemset/problem/1336/F | [
"data structures",
"divide and conquer",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 285
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1336-E2 | codeforces | 1336-E2 | Chiori and Doll Picking (hard version) | https://codeforces.com/problemset/problem/1336/E2 | [
"bitmasks",
"brute force",
"combinatorics",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 721
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1336-E1 | codeforces | 1336-E1 | Chiori and Doll Picking (easy version) | https://codeforces.com/problemset/problem/1336/E1 | [
"bitmasks",
"brute force",
"combinatorics",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 911
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1336-D | codeforces | 1336-D | Yui and Mahjong Set | https://codeforces.com/problemset/problem/1336/D | [
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 609
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1336-C | codeforces | 1336-C | Kaavi and Magic Spell | https://codeforces.com/problemset/problem/1336/C | [
"dp",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4200
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1336-B | codeforces | 1336-B | Xenia and Colorful Gems | https://codeforces.com/problemset/problem/1336/B | [
"binary search",
"greedy",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 12341
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1336-A | codeforces | 1336-A | Linova and Kingdom | https://codeforces.com/problemset/problem/1336/A | [
"dfs and similar",
"dp",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 25681
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1335-F | codeforces | 1335-F | Robots on a Grid | https://codeforces.com/problemset/problem/1335/F | [
"data structures",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"matrices"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2463
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1335-E2 | codeforces | 1335-E2 | Three Blocks Palindrome (hard version) | https://codeforces.com/problemset/problem/1335/E2 | [
"brute force",
"data structures",
"dp",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9567
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1335-E1 | codeforces | 1335-E1 | Three Blocks Palindrome (easy version) | https://codeforces.com/problemset/problem/1335/E1 | [
"binary search",
"brute force",
"data structures",
"dp",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11854
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1335-D | codeforces | 1335-D | Anti-Sudoku | https://codeforces.com/problemset/problem/1335/D | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 29721
} | 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.