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:1335-C | codeforces | 1335-C | Two Teams Composing | https://codeforces.com/problemset/problem/1335/C | [
"binary search",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 39853
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1335-B | codeforces | 1335-B | Construct the String | https://codeforces.com/problemset/problem/1335/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 900 | {
"solved_count": 43152
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1335-A | codeforces | 1335-A | Candies and Two Sisters | https://codeforces.com/problemset/problem/1335/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 108091
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1334-G | codeforces | 1334-G | Substring Search | https://codeforces.com/problemset/problem/1334/G | [
"bitmasks",
"brute force",
"fft"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 493
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1334-F | codeforces | 1334-F | Strange Function | https://codeforces.com/problemset/problem/1334/F | [
"binary search",
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1611
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1334-E | codeforces | 1334-E | Divisor Paths | https://codeforces.com/problemset/problem/1334/E | [
"combinatorics",
"graphs",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3233
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1334-D | codeforces | 1334-D | Minimum Euler Cycle | https://codeforces.com/problemset/problem/1334/D | [
"constructive algorithms",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7791
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1334-C | codeforces | 1334-C | Circle of Monsters | https://codeforces.com/problemset/problem/1334/C | [
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 18177
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1334-B | codeforces | 1334-B | Middle Class | https://codeforces.com/problemset/problem/1334/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 27864
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1334-A | codeforces | 1334-A | Level Statistics | https://codeforces.com/problemset/problem/1334/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 24525
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1333-F | codeforces | 1333-F | Kate and imperfection | https://codeforces.com/problemset/problem/1333/F | [
"greedy",
"implementation",
"math",
"number theory",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4656
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1333-E | codeforces | 1333-E | Road to 1600 | https://codeforces.com/problemset/problem/1333/E | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1844
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1333-D | codeforces | 1333-D | Challenges in school №41 | https://codeforces.com/problemset/problem/1333/D | [
"brute force",
"constructive algorithms",
"games",
"graphs",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4176
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1333-C | codeforces | 1333-C | Eugene and an array | https://codeforces.com/problemset/problem/1333/C | [
"binary search",
"data structures",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 13678
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1333-B | codeforces | 1333-B | Kind Anton | https://codeforces.com/problemset/problem/1333/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22309
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1333-A | codeforces | 1333-A | Little Artem | https://codeforces.com/problemset/problem/1333/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 26022
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1332-G | codeforces | 1332-G | No Monotone Triples | https://codeforces.com/problemset/problem/1332/G | [
"data structures"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 424
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1332-F | codeforces | 1332-F | Independent Set | https://codeforces.com/problemset/problem/1332/F | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1204
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1332-E | codeforces | 1332-E | Height All the Same | https://codeforces.com/problemset/problem/1332/E | [
"combinatorics",
"constructive algorithms",
"math",
"matrices"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4395
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1332-D | codeforces | 1332-D | Walk on Matrix | https://codeforces.com/problemset/problem/1332/D | [
"bitmasks",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8513
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1332-C | codeforces | 1332-C | K-Complete Word | https://codeforces.com/problemset/problem/1332/C | [
"dfs and similar",
"dsu",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 21839
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1332-B | codeforces | 1332-B | Composite Coloring | https://codeforces.com/problemset/problem/1332/B | [
"brute force",
"constructive algorithms",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 19354
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1332-A | codeforces | 1332-A | Exercising Walk | https://codeforces.com/problemset/problem/1332/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19915
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1331-H | codeforces | 1331-H | It's showtime | https://codeforces.com/problemset/problem/1331/H | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 651
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1331-G | codeforces | 1331-G | Lingua Romana | https://codeforces.com/problemset/problem/1331/G | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 599
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1331-F | codeforces | 1331-F | Elementary! | https://codeforces.com/problemset/problem/1331/F | [
"*special",
"brute force",
"dp",
"strings"
] | null | null | stdin_stdout | null | {
"solved_count": 607
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1331-E | codeforces | 1331-E | Jordan Smiley | https://codeforces.com/problemset/problem/1331/E | [
"*special",
"dfs and similar",
"geometry",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 1241
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1331-D | codeforces | 1331-D | Again? | https://codeforces.com/problemset/problem/1331/D | [
"*special",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 12201
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1331-C | codeforces | 1331-C | ...And after happily lived ever they | https://codeforces.com/problemset/problem/1331/C | [
"*special",
"bitmasks"
] | null | null | stdin_stdout | null | {
"solved_count": 3218
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1331-B | codeforces | 1331-B | Limericks | https://codeforces.com/problemset/problem/1331/B | [
"*special",
"math",
"number theory"
] | null | null | stdin_stdout | null | {
"solved_count": 7172
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1331-A | codeforces | 1331-A | Is it rated? | https://codeforces.com/problemset/problem/1331/A | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 17544
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1330-B | codeforces | 1330-B | Dreamoon Likes Permutations | https://codeforces.com/problemset/problem/1330/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14650
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1330-A | codeforces | 1330-A | Dreamoon and Ranking Collection | https://codeforces.com/problemset/problem/1330/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 19516
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1329-E | codeforces | 1329-E | Dreamoon Loves AA | https://codeforces.com/problemset/problem/1329/E | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 353
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1329-D | codeforces | 1329-D | Dreamoon Likes Strings | https://codeforces.com/problemset/problem/1329/D | [
"constructive algorithms",
"data structures"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 568
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1329-C | codeforces | 1329-C | Drazil Likes Heap | https://codeforces.com/problemset/problem/1329/C | [
"constructive algorithms",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1838
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1329-B | codeforces | 1329-B | Dreamoon Likes Sequences | https://codeforces.com/problemset/problem/1329/B | [
"bitmasks",
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7195
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1329-A | codeforces | 1329-A | Dreamoon Likes Coloring | https://codeforces.com/problemset/problem/1329/A | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9807
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1328-F | codeforces | 1328-F | Make k Equal | https://codeforces.com/problemset/problem/1328/F | [
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3600
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1328-E | codeforces | 1328-E | Tree Queries | https://codeforces.com/problemset/problem/1328/E | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 12538
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1328-D | codeforces | 1328-D | Carousel | https://codeforces.com/problemset/problem/1328/D | [
"constructive algorithms",
"dp",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 14715
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1328-C | codeforces | 1328-C | Ternary XOR | https://codeforces.com/problemset/problem/1328/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 33471
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1328-B | codeforces | 1328-B | K-th Beautiful String | https://codeforces.com/problemset/problem/1328/B | [
"binary search",
"brute force",
"combinatorics",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 32555
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1328-A | codeforces | 1328-A | Divisibility Problem | https://codeforces.com/problemset/problem/1328/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 136713
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1327-G | codeforces | 1327-G | Letters and Question Marks | https://codeforces.com/problemset/problem/1327/G | [
"bitmasks",
"dp",
"string suffix structures"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 622
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1327-F | codeforces | 1327-F | AND Segments | https://codeforces.com/problemset/problem/1327/F | [
"bitmasks",
"combinatorics",
"data structures",
"dp",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2153
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1327-E | codeforces | 1327-E | Count The Blocks | https://codeforces.com/problemset/problem/1327/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9793
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1327-D | codeforces | 1327-D | Infinite Path | https://codeforces.com/problemset/problem/1327/D | [
"brute force",
"dfs and similar",
"graphs",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3602
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1327-C | codeforces | 1327-C | Game with Chips | https://codeforces.com/problemset/problem/1327/C | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14153
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1327-B | codeforces | 1327-B | Princesses and Princes | https://codeforces.com/problemset/problem/1327/B | [
"brute force",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19738
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1327-A | codeforces | 1327-A | Sum of Odd Integers | https://codeforces.com/problemset/problem/1327/A | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 46880
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1326-G | codeforces | 1326-G | Spiderweb Trees | https://codeforces.com/problemset/problem/1326/G | [
"dp",
"geometry",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 112
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1326-F2 | codeforces | 1326-F2 | Wise Men (Hard Version) | https://codeforces.com/problemset/problem/1326/F2 | [
"bitmasks",
"dp",
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 738
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1326-F1 | codeforces | 1326-F1 | Wise Men (Easy Version) | https://codeforces.com/problemset/problem/1326/F1 | [
"bitmasks",
"brute force",
"dp",
"meet-in-the-middle"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1088
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1326-E | codeforces | 1326-E | Bombs | https://codeforces.com/problemset/problem/1326/E | [
"data structures",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2590
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1326-D2 | codeforces | 1326-D2 | Prefix-Suffix Palindrome (Hard version) | https://codeforces.com/problemset/problem/1326/D2 | [
"binary search",
"greedy",
"hashing",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 12209
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1326-D1 | codeforces | 1326-D1 | Prefix-Suffix Palindrome (Easy version) | https://codeforces.com/problemset/problem/1326/D1 | [
"hashing",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13485
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1326-C | codeforces | 1326-C | Permutation Partitions | https://codeforces.com/problemset/problem/1326/C | [
"combinatorics",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16568
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1326-B | codeforces | 1326-B | Maximums | https://codeforces.com/problemset/problem/1326/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 25466
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1326-A | codeforces | 1326-A | Bad Ugly Numbers | https://codeforces.com/problemset/problem/1326/A | [
"constructive algorithms",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 33035
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1325-F | codeforces | 1325-F | Ehab's Last Theorem | https://codeforces.com/problemset/problem/1325/F | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2459
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1325-E | codeforces | 1325-E | Ehab's REAL Number Theory Problem | https://codeforces.com/problemset/problem/1325/E | [
"brute force",
"dfs and similar",
"graphs",
"number theory",
"shortest paths"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 2432
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1325-D | codeforces | 1325-D | Ehab the Xorcist | https://codeforces.com/problemset/problem/1325/D | [
"bitmasks",
"constructive algorithms",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 13875
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1325-C | codeforces | 1325-C | Ehab and Path-etic MEXs | https://codeforces.com/problemset/problem/1325/C | [
"constructive algorithms",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 18020
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1325-B | codeforces | 1325-B | CopyCopyCopyCopyCopy | https://codeforces.com/problemset/problem/1325/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 39155
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1325-A | codeforces | 1325-A | EhAb AnD gCd | https://codeforces.com/problemset/problem/1325/A | [
"constructive algorithms",
"greedy",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 47262
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1324-F | codeforces | 1324-F | Maximum White Subtree | https://codeforces.com/problemset/problem/1324/F | [
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 13822
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1324-E | codeforces | 1324-E | Sleeping Schedule | https://codeforces.com/problemset/problem/1324/E | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 17778
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1324-D | codeforces | 1324-D | Pair of Topics | https://codeforces.com/problemset/problem/1324/D | [
"binary search",
"data structures",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 35242
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1324-C | codeforces | 1324-C | Frog Jumps | https://codeforces.com/problemset/problem/1324/C | [
"binary search",
"data structures",
"dfs and similar",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 30903
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1324-B | codeforces | 1324-B | Yet Another Palindrome Problem | https://codeforces.com/problemset/problem/1324/B | [
"brute force",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 31055
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1324-A | codeforces | 1324-A | Yet Another Tetris Problem | https://codeforces.com/problemset/problem/1324/A | [
"implementation",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 27515
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1323-B | codeforces | 1323-B | Count Subrectangles | https://codeforces.com/problemset/problem/1323/B | [
"binary search",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12398
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1323-A | codeforces | 1323-A | Even Subset Sum Problem | https://codeforces.com/problemset/problem/1323/A | [
"brute force",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21040
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1322-F | codeforces | 1322-F | Assigning Fares | https://codeforces.com/problemset/problem/1322/F | [
"dp",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 170
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1322-E | codeforces | 1322-E | Median Mountain Range | https://codeforces.com/problemset/problem/1322/E | [
"data structures"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 415
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1322-D | codeforces | 1322-D | Reality Show | https://codeforces.com/problemset/problem/1322/D | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 913
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1322-C | codeforces | 1322-C | Instant Noodles | https://codeforces.com/problemset/problem/1322/C | [
"graphs",
"hashing",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2790
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1322-B | codeforces | 1322-B | Present | https://codeforces.com/problemset/problem/1322/B | [
"binary search",
"bitmasks",
"constructive algorithms",
"data structures",
"math",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4728
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1322-A | codeforces | 1322-A | Unusual Competitions | https://codeforces.com/problemset/problem/1322/A | [
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12951
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1321-C | codeforces | 1321-C | Remove Adjacent | https://codeforces.com/problemset/problem/1321/C | [
"brute force",
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10632
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1321-A | codeforces | 1321-A | Contest for Robots | https://codeforces.com/problemset/problem/1321/A | [
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 15083
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1320-F | codeforces | 1320-F | Blocks and Sensors | https://codeforces.com/problemset/problem/1320/F | [
"brute force"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 177
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1320-E | codeforces | 1320-E | Treeland and Viruses | https://codeforces.com/problemset/problem/1320/E | [
"data structures",
"dfs and similar",
"dp",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1128
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1320-D | codeforces | 1320-D | Reachable Strings | https://codeforces.com/problemset/problem/1320/D | [
"data structures",
"hashing",
"strings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1728
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1320-C | codeforces | 1320-C | World of Darkraft: Battle for Azathoth | https://codeforces.com/problemset/problem/1320/C | [
"brute force",
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3452
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1320-B | codeforces | 1320-B | Navigation System | https://codeforces.com/problemset/problem/1320/B | [
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6532
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1320-A | codeforces | 1320-A | Journey Planning | https://codeforces.com/problemset/problem/1320/A | [
"data structures",
"dp",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 22946
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1316-F | codeforces | 1316-F | Battalion Strength | https://codeforces.com/problemset/problem/1316/F | [
"data structures",
"divide and conquer",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 964
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1316-E | codeforces | 1316-E | Team Building | https://codeforces.com/problemset/problem/1316/E | [
"bitmasks",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 5819
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1316-D | codeforces | 1316-D | Nash Matrix | https://codeforces.com/problemset/problem/1316/D | [
"constructive algorithms",
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3669
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1316-C | codeforces | 1316-C | Primitive Primes | https://codeforces.com/problemset/problem/1316/C | [
"constructive algorithms",
"math",
"ternary search"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7625
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1316-B | codeforces | 1316-B | String Modification | https://codeforces.com/problemset/problem/1316/B | [
"brute force",
"constructive algorithms",
"implementation",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11857
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1316-A | codeforces | 1316-A | Grade Allocation | https://codeforces.com/problemset/problem/1316/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19897
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1315-C | codeforces | 1315-C | Restoring Permutation | https://codeforces.com/problemset/problem/1315/C | [
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10714
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1315-B | codeforces | 1315-B | Homecoming | https://codeforces.com/problemset/problem/1315/B | [
"binary search",
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9713
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1315-A | codeforces | 1315-A | Dead Pixel | https://codeforces.com/problemset/problem/1315/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 13011
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1313-E | codeforces | 1313-E | Concatenation with intersection | https://codeforces.com/problemset/problem/1313/E | [
"data structures",
"hashing",
"strings",
"two pointers"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 781
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1313-D | codeforces | 1313-D | Happy New Year | https://codeforces.com/problemset/problem/1313/D | [
"bitmasks",
"dp",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1595
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1313-C2 | codeforces | 1313-C2 | Skyscrapers (hard version) | https://codeforces.com/problemset/problem/1313/C2 | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7550
} | 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.