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: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": 267
} | 2026-06-01T05:00:40.145500+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": 537
} | 2026-06-01T05:00:40.145500+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": 1807
} | 2026-06-01T05:00:40.145500+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": 7152
} | 2026-06-01T05:00:40.145500+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": 9696
} | 2026-06-01T05:00:40.145500+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": 3534
} | 2026-06-01T05:00:40.145500+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": 11838
} | 2026-06-01T05:00:40.145500+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": 14564
} | 2026-06-01T05:00:40.145500+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": 33174
} | 2026-06-01T05:00:40.145500+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": 32126
} | 2026-06-01T05:00:40.145500+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": 132975
} | 2026-06-01T05:00:40.145500+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": 532
} | 2026-06-01T05:00:40.145500+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": 2055
} | 2026-06-01T05:00:40.145500+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": 9730
} | 2026-06-01T05:00:40.145500+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": 3557
} | 2026-06-01T05:00:40.145500+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": 14101
} | 2026-06-01T05:00:40.145500+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": 19526
} | 2026-06-01T05:00:40.145500+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": 46000
} | 2026-06-01T05:00:40.145500+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": 108
} | 2026-06-01T05:00:40.145500+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": 686
} | 2026-06-01T05:00:40.145500+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": 1009
} | 2026-06-01T05:00:40.145500+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": 2481
} | 2026-06-01T05:00:40.145500+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": 11868
} | 2026-06-01T05:00:40.145500+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": 13336
} | 2026-06-01T05:00:40.145500+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": 16494
} | 2026-06-01T05:00:40.145500+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": 25372
} | 2026-06-01T05:00:40.145500+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": 32724
} | 2026-06-01T05:00:40.145500+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": 2370
} | 2026-06-01T05:00:40.145500+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": 2343
} | 2026-06-01T05:00:40.145500+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": 13656
} | 2026-06-01T05:00:40.145500+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": 17336
} | 2026-06-01T05:00:40.145500+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": 38901
} | 2026-06-01T05:00:40.145500+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": 46453
} | 2026-06-01T05:00:40.145500+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": 13214
} | 2026-06-01T05:00:40.145500+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": 17178
} | 2026-06-01T05:00:40.145500+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": 34361
} | 2026-06-01T05:00:40.145500+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": 30634
} | 2026-06-01T05:00:40.145500+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": 30870
} | 2026-06-01T05:00:40.145500+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": 27361
} | 2026-06-01T05:00:40.145500+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": 11911
} | 2026-06-01T05:00:40.145500+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": 20934
} | 2026-06-01T05:00:40.145500+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": 163
} | 2026-06-01T05:00:40.145500+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": 348
} | 2026-06-01T05:00:40.145500+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": 883
} | 2026-06-01T05:00:40.145500+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": 2708
} | 2026-06-01T05:00:40.145500+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": 4660
} | 2026-06-01T05:00:40.145500+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": 12900
} | 2026-06-01T05:00:40.145500+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": 10573
} | 2026-06-01T05:00:40.145500+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": 15005
} | 2026-06-01T05:00:40.145500+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": 176
} | 2026-06-01T05:00:40.145500+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": 1079
} | 2026-06-01T05:00:40.145500+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": 1695
} | 2026-06-01T05:00:40.145500+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": 3435
} | 2026-06-01T05:00:40.145500+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": 6453
} | 2026-06-01T05:00:40.145500+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": 21950
} | 2026-06-01T05:00:40.145500+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": 895
} | 2026-06-01T05:00:40.145500+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": 5425
} | 2026-06-01T05:00:40.145500+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": 3555
} | 2026-06-01T05:00:40.145500+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": 7602
} | 2026-06-01T05:00:40.145500+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": 11739
} | 2026-06-01T05:00:40.145500+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": 19727
} | 2026-06-01T05:00:40.145500+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": 10672
} | 2026-06-01T05:00:40.145500+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": 9625
} | 2026-06-01T05:00:40.145500+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": 12946
} | 2026-06-01T05:00:40.145500+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": 721
} | 2026-06-01T05:00:40.145500+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": 1524
} | 2026-06-01T05:00:40.145500+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": 7328
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1313-C1 | codeforces | 1313-C1 | Skyscrapers (easy version) | https://codeforces.com/problemset/problem/1313/C1 | [
"brute force",
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11079
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1313-B | codeforces | 1313-B | Different Rules | https://codeforces.com/problemset/problem/1313/B | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7014
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1313-A | codeforces | 1313-A | Fast Food Restaurant | https://codeforces.com/problemset/problem/1313/A | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16270
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1312-G | codeforces | 1312-G | Autocompletion | https://codeforces.com/problemset/problem/1312/G | [
"data structures",
"dfs and similar",
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1082
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1312-F | codeforces | 1312-F | Attack on Red Kingdom | https://codeforces.com/problemset/problem/1312/F | [
"games",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1031
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1312-E | codeforces | 1312-E | Array Shrinking | https://codeforces.com/problemset/problem/1312/E | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 7515
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1312-D | codeforces | 1312-D | Count the Arrays | https://codeforces.com/problemset/problem/1312/D | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10574
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1312-C | codeforces | 1312-C | Adding Powers | https://codeforces.com/problemset/problem/1312/C | [
"bitmasks",
"greedy",
"implementation",
"math",
"number theory",
"ternary search"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 18394
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1312-B | codeforces | 1312-B | Bogosort | https://codeforces.com/problemset/problem/1312/B | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 39669
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1312-A | codeforces | 1312-A | Two Regular Polygons | https://codeforces.com/problemset/problem/1312/A | [
"geometry",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27576
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1311-F | codeforces | 1311-F | Moving Points | https://codeforces.com/problemset/problem/1311/F | [
"data structures",
"divide and conquer",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4877
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1311-E | codeforces | 1311-E | Construct the Binary Tree | https://codeforces.com/problemset/problem/1311/E | [
"brute force",
"constructive algorithms",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2731
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1311-D | codeforces | 1311-D | Three Integers | https://codeforces.com/problemset/problem/1311/D | [
"brute force",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 9937
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1311-C | codeforces | 1311-C | Perform the Combo | https://codeforces.com/problemset/problem/1311/C | [
"brute force"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16875
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1311-B | codeforces | 1311-B | WeirdSort | https://codeforces.com/problemset/problem/1311/B | [
"dfs and similar",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 20064
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1311-A | codeforces | 1311-A | Add Odd or Subtract Even | https://codeforces.com/problemset/problem/1311/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 46383
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1310-F | codeforces | 1310-F | Bad Cryptography | https://codeforces.com/problemset/problem/1310/F | [
"math",
"number theory"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 103
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1310-E | codeforces | 1310-E | Strange Function | https://codeforces.com/problemset/problem/1310/E | [
"dp"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 404
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1310-D | codeforces | 1310-D | Tourism | https://codeforces.com/problemset/problem/1310/D | [
"dp",
"graphs",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2056
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1310-C | codeforces | 1310-C | Au Pont Rouge | https://codeforces.com/problemset/problem/1310/C | [
"binary search",
"dp",
"strings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 730
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1310-B | codeforces | 1310-B | Double Elimination | https://codeforces.com/problemset/problem/1310/B | [
"dp",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 579
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1310-A | codeforces | 1310-A | Recommendations | https://codeforces.com/problemset/problem/1310/A | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5603
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1307-G | codeforces | 1307-G | Cow and Exercise | https://codeforces.com/problemset/problem/1307/G | [
"flows",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 598
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1307-F | codeforces | 1307-F | Cow and Vacation | https://codeforces.com/problemset/problem/1307/F | [
"dfs and similar",
"dsu",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 679
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1307-E | codeforces | 1307-E | Cow and Treats | https://codeforces.com/problemset/problem/1307/E | [
"binary search",
"combinatorics",
"dp",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1367
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1307-D | codeforces | 1307-D | Cow and Fields | https://codeforces.com/problemset/problem/1307/D | [
"binary search",
"data structures",
"dfs and similar",
"graphs",
"greedy",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7272
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1307-C | codeforces | 1307-C | Cow and Message | https://codeforces.com/problemset/problem/1307/C | [
"brute force",
"dp",
"math",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12689
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1307-B | codeforces | 1307-B | Cow and Friend | https://codeforces.com/problemset/problem/1307/B | [
"geometry",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13865
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1307-A | codeforces | 1307-A | Cow and Haybales | https://codeforces.com/problemset/problem/1307/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15640
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1305-H | codeforces | 1305-H | Kuroni the Private Tutor | https://codeforces.com/problemset/problem/1305/H | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 173
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1305-G | codeforces | 1305-G | Kuroni and Antihype | https://codeforces.com/problemset/problem/1305/G | [
"bitmasks",
"brute force",
"dp",
"dsu",
"graphs"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 1397
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1305-F | codeforces | 1305-F | Kuroni and the Punishment | https://codeforces.com/problemset/problem/1305/F | [
"math",
"number theory",
"probabilities"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 3247
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1305-E | codeforces | 1305-E | Kuroni and the Score Distribution | https://codeforces.com/problemset/problem/1305/E | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3274
} | 2026-06-01T05:00:40.145500+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.