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: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": 120
} | 2026-06-01T05:00:40.145500+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": 1056
} | 2026-06-01T05:00:40.145500+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": 4827
} | 2026-06-01T05:00:40.145500+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": 8969
} | 2026-06-01T05:00:40.145500+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": 21867
} | 2026-06-01T05:00:40.145500+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": 917
} | 2026-06-01T05:00:40.145500+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": 2487
} | 2026-06-01T05:00:40.145500+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": 9359
} | 2026-06-01T05:00:40.145500+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": 15539
} | 2026-06-01T05:00:40.145500+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": 27611
} | 2026-06-01T05:00:40.145500+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": 42968
} | 2026-06-01T05:00:40.145500+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": 54
} | 2026-06-01T05:00:40.145500+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": 61
} | 2026-06-01T05:00:40.145500+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": 150
} | 2026-06-01T05:00:40.145500+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": 253
} | 2026-06-01T05:00:40.145500+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": 415
} | 2026-06-01T05:00:40.145500+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": 545
} | 2026-06-01T05:00:40.145500+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": 678
} | 2026-06-01T05:00:40.145500+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": 1253
} | 2026-06-01T05:00:40.145500+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": 2212
} | 2026-06-01T05:00:40.145500+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": 28271
} | 2026-06-01T05:00:40.145500+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": 24845
} | 2026-06-01T05:00:40.145500+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": 512
} | 2026-06-01T05:00:40.145500+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": 523
} | 2026-06-01T05:00:40.145500+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": 1295
} | 2026-06-01T05:00:40.145500+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": 1981
} | 2026-06-01T05:00:40.145500+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": 6359
} | 2026-06-01T05:00:40.145500+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": 16528
} | 2026-06-01T05:00:40.145500+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": 1407
} | 2026-06-01T05:00:40.145500+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": 5754
} | 2026-06-01T05:00:40.145500+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": 13565
} | 2026-06-01T05:00:40.145500+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": 44288
} | 2026-06-01T05:00:40.145500+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": 65533
} | 2026-06-01T05:00:40.145500+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": 53598
} | 2026-06-01T05:00:40.145500+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": 993
} | 2026-06-01T05:00:40.145500+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": 3580
} | 2026-06-01T05:00:40.145500+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": 6370
} | 2026-06-01T05:00:40.145500+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": 15014
} | 2026-06-01T05:00:40.145500+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": 24631
} | 2026-06-01T05:00:40.145500+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": 46621
} | 2026-06-01T05:00:40.145500+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": 21131
} | 2026-06-01T05:00:40.145500+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": 30470
} | 2026-06-01T05:00:40.145500+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": 718
} | 2026-06-01T05:00:40.145500+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": 1073
} | 2026-06-01T05:00:40.145500+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": 2429
} | 2026-06-01T05:00:40.145500+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": 8321
} | 2026-06-01T05:00:40.145500+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": 13696
} | 2026-06-01T05:00:40.145500+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": 28414
} | 2026-06-01T05:00:40.145500+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": 34298
} | 2026-06-01T05:00:40.145500+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": 415
} | 2026-06-01T05:00:40.145500+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": 1141
} | 2026-06-01T05:00:40.145500+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": 3449
} | 2026-06-01T05:00:40.145500+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": 9568
} | 2026-06-01T05:00:40.145500+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": 30654
} | 2026-06-01T05:00:40.145500+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": 36951
} | 2026-06-01T05:00:40.145500+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": 43074
} | 2026-06-01T05:00:40.145500+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": 279
} | 2026-06-01T05:00:40.145500+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": 491
} | 2026-06-01T05:00:40.145500+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": 841
} | 2026-06-01T05:00:40.145500+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": 532
} | 2026-06-01T05:00:40.145500+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": 4110
} | 2026-06-01T05:00:40.145500+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": 12252
} | 2026-06-01T05:00:40.145500+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": 24908
} | 2026-06-01T05:00:40.145500+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": 2423
} | 2026-06-01T05:00:40.145500+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": 9423
} | 2026-06-01T05:00:40.145500+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": 11771
} | 2026-06-01T05:00:40.145500+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": 29553
} | 2026-06-01T05:00:40.145500+00:00 |
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": 39161
} | 2026-06-01T05:00:40.145500+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": 42723
} | 2026-06-01T05:00:40.145500+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": 105531
} | 2026-06-01T05:00:40.145500+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": 423
} | 2026-06-01T05:00:40.145500+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": 1515
} | 2026-06-01T05:00:40.145500+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": 3186
} | 2026-06-01T05:00:40.145500+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": 7755
} | 2026-06-01T05:00:40.145500+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": 17983
} | 2026-06-01T05:00:40.145500+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": 27678
} | 2026-06-01T05:00:40.145500+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": 24397
} | 2026-06-01T05:00:40.145500+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": 4579
} | 2026-06-01T05:00:40.145500+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": 1822
} | 2026-06-01T05:00:40.145500+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": 4135
} | 2026-06-01T05:00:40.145500+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": 13506
} | 2026-06-01T05:00:40.145500+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": 22250
} | 2026-06-01T05:00:40.145500+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": 25960
} | 2026-06-01T05:00:40.145500+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": 366
} | 2026-06-01T05:00:40.145500+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": 1132
} | 2026-06-01T05:00:40.145500+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": 4324
} | 2026-06-01T05:00:40.145500+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": 8451
} | 2026-06-01T05:00:40.145500+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": 21139
} | 2026-06-01T05:00:40.145500+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": 19185
} | 2026-06-01T05:00:40.145500+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": 19886
} | 2026-06-01T05:00:40.145500+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": 649
} | 2026-06-01T05:00:40.145500+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": 596
} | 2026-06-01T05:00:40.145500+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": 604
} | 2026-06-01T05:00:40.145500+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": 1239
} | 2026-06-01T05:00:40.145500+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": 12105
} | 2026-06-01T05:00:40.145500+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": 3215
} | 2026-06-01T05:00:40.145500+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": 7163
} | 2026-06-01T05:00:40.145500+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": 17522
} | 2026-06-01T05:00:40.145500+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": 14601
} | 2026-06-01T05:00:40.145500+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": 19476
} | 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.