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: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": 3819
} | 2026-11-02T05:37:07.883505+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": 6435
} | 2026-11-02T05:37:07.883505+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": 15300
} | 2026-11-02T05:37:07.883505+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": 24849
} | 2026-11-02T05:37:07.883505+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": 47725
} | 2026-11-02T05:37:07.883505+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": 21442
} | 2026-11-02T05:37:07.883505+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": 30740
} | 2026-11-02T05:37:07.883505+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": 856
} | 2026-11-02T05:37:07.883505+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": 1106
} | 2026-11-02T05:37:07.883505+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": 2507
} | 2026-11-02T05:37:07.883505+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": 8393
} | 2026-11-02T05:37:07.883505+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": 13757
} | 2026-11-02T05:37:07.883505+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": 28767
} | 2026-11-02T05:37:07.883505+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": 34734
} | 2026-11-02T05:37:07.883505+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": 442
} | 2026-11-02T05:37:07.883505+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": 1172
} | 2026-11-02T05:37:07.883505+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": 3509
} | 2026-11-02T05:37:07.883505+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": 9860
} | 2026-11-02T05:37:07.883505+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": 32587
} | 2026-11-02T05:37:07.883505+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": 37423
} | 2026-11-02T05:37:07.883505+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": 43904
} | 2026-11-02T05:37:07.883505+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": 292
} | 2026-11-02T05:37:07.883505+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": 733
} | 2026-11-02T05:37:07.883505+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": 924
} | 2026-11-02T05:37:07.883505+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": 647
} | 2026-11-02T05:37:07.883505+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": 4252
} | 2026-11-02T05:37:07.883505+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": 12404
} | 2026-11-02T05:37:07.883505+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": 26270
} | 2026-11-02T05:37:07.883505+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": 2482
} | 2026-11-02T05:37:07.883505+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": 9703
} | 2026-11-02T05:37:07.883505+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": 11948
} | 2026-11-02T05:37:07.883505+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": 29892
} | 2026-11-02T05:37:07.883505+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": 40348
} | 2026-11-02T05:37:07.883505+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": 43478
} | 2026-11-02T05:37:07.883505+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": 110688
} | 2026-11-02T05:37:07.883505+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": 497
} | 2026-11-02T05:37:07.883505+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": 1624
} | 2026-11-02T05:37:07.883505+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": 3250
} | 2026-11-02T05:37:07.883505+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": 7837
} | 2026-11-02T05:37:07.883505+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": 18378
} | 2026-11-02T05:37:07.883505+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": 27999
} | 2026-11-02T05:37:07.883505+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": 24627
} | 2026-11-02T05:37:07.883505+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": 4677
} | 2026-11-02T05:37:07.883505+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": 1865
} | 2026-11-02T05:37:07.883505+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": 4198
} | 2026-11-02T05:37:07.883505+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": 13786
} | 2026-11-02T05:37:07.883505+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": 22344
} | 2026-11-02T05:37:07.883505+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": 26149
} | 2026-11-02T05:37:07.883505+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": 436
} | 2026-11-02T05:37:07.883505+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": 1224
} | 2026-11-02T05:37:07.883505+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": 4462
} | 2026-11-02T05:37:07.883505+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": 8550
} | 2026-11-02T05:37:07.883505+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": 22387
} | 2026-11-02T05:37:07.883505+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": 19462
} | 2026-11-02T05:37:07.883505+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": 19934
} | 2026-11-02T05:37:07.883505+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": 653
} | 2026-11-02T05:37:07.883505+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": 602
} | 2026-11-02T05:37:07.883505+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": 610
} | 2026-11-02T05:37:07.883505+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": 1243
} | 2026-11-02T05:37:07.883505+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": 12206
} | 2026-11-02T05:37:07.883505+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": 3221
} | 2026-11-02T05:37:07.883505+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": 7182
} | 2026-11-02T05:37:07.883505+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": 17570
} | 2026-11-02T05:37:07.883505+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": 14680
} | 2026-11-02T05:37:07.883505+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": 19582
} | 2026-11-02T05:37:07.883505+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": 354
} | 2026-11-02T05:37:07.883505+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-11-02T05:37:07.883505+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": 1851
} | 2026-11-02T05:37:07.883505+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": 7222
} | 2026-11-02T05:37:07.883505+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": 9869
} | 2026-11-02T05:37:07.883505+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": 3633
} | 2026-11-02T05:37:07.883505+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": 13038
} | 2026-11-02T05:37:07.883505+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": 14863
} | 2026-11-02T05:37:07.883505+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": 33665
} | 2026-11-02T05:37:07.883505+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": 32933
} | 2026-11-02T05:37:07.883505+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": 141219
} | 2026-11-02T05:37:07.883505+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": 632
} | 2026-11-02T05:37:07.883505+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": 2213
} | 2026-11-02T05:37:07.883505+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": 9874
} | 2026-11-02T05:37:07.883505+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": 3627
} | 2026-11-02T05:37:07.883505+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": 14222
} | 2026-11-02T05:37:07.883505+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": 19825
} | 2026-11-02T05:37:07.883505+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": 47805
} | 2026-11-02T05:37:07.883505+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": 115
} | 2026-11-02T05:37:07.883505+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": 746
} | 2026-11-02T05:37:07.883505+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": 1098
} | 2026-11-02T05:37:07.883505+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": 2701
} | 2026-11-02T05:37:07.883505+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": 12432
} | 2026-11-02T05:37:07.883505+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": 13624
} | 2026-11-02T05:37:07.883505+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": 16627
} | 2026-11-02T05:37:07.883505+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": 25552
} | 2026-11-02T05:37:07.883505+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": 33221
} | 2026-11-02T05:37:07.883505+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": 2526
} | 2026-11-02T05:37:07.883505+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": 2480
} | 2026-11-02T05:37:07.883505+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": 14167
} | 2026-11-02T05:37:07.883505+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": 18467
} | 2026-11-02T05:37:07.883505+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": 39414
} | 2026-11-02T05:37:07.883505+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": 47944
} | 2026-11-02T05:37:07.883505+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": 14558
} | 2026-11-02T05:37:07.883505+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": 18193
} | 2026-11-02T05:37:07.883505+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.