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:1305-D | codeforces | 1305-D | Kuroni and the Celebration | https://codeforces.com/problemset/problem/1305/D | [
"constructive algorithms",
"dfs and similar",
"interactive",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5372
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1305-C | codeforces | 1305-C | Kuroni and Impossible Calculation | https://codeforces.com/problemset/problem/1305/C | [
"brute force",
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 19059
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1305-B | codeforces | 1305-B | Kuroni and Simple Strings | https://codeforces.com/problemset/problem/1305/B | [
"constructive algorithms",
"greedy",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12514
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1305-A | codeforces | 1305-A | Kuroni and the Gifts | https://codeforces.com/problemset/problem/1305/A | [
"brute force",
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14655
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1304-F2 | codeforces | 1304-F2 | Animal Observation (hard version) | https://codeforces.com/problemset/problem/1304/F2 | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1819
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1304-F1 | codeforces | 1304-F1 | Animal Observation (easy version) | https://codeforces.com/problemset/problem/1304/F1 | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2003
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1304-E | codeforces | 1304-E | 1-Trees and Queries | https://codeforces.com/problemset/problem/1304/E | [
"data structures",
"dfs and similar",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5912
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1304-D | codeforces | 1304-D | Shortest and Longest LIS | https://codeforces.com/problemset/problem/1304/D | [
"constructive algorithms",
"graphs",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6693
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1304-C | codeforces | 1304-C | Air Conditioner | https://codeforces.com/problemset/problem/1304/C | [
"dp",
"greedy",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 17801
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1304-B | codeforces | 1304-B | Longest Palindrome | https://codeforces.com/problemset/problem/1304/B | [
"brute force",
"constructive algorithms",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 18766
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1304-A | codeforces | 1304-A | Two Rabbits | https://codeforces.com/problemset/problem/1304/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26838
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1303-G | codeforces | 1303-G | Sum of Prefix Sums | https://codeforces.com/problemset/problem/1303/G | [
"data structures",
"divide and conquer",
"geometry",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1019
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1303-F | codeforces | 1303-F | Number of Components | https://codeforces.com/problemset/problem/1303/F | [
"dsu",
"implementation"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 617
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1303-E | codeforces | 1303-E | Erase Subsequences | https://codeforces.com/problemset/problem/1303/E | [
"dp",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3210
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1303-D | codeforces | 1303-D | Fill The Bag | https://codeforces.com/problemset/problem/1303/D | [
"bitmasks",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7730
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1303-C | codeforces | 1303-C | Perfect Keyboard | https://codeforces.com/problemset/problem/1303/C | [
"dfs and similar",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12896
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1303-B | codeforces | 1303-B | National Project | https://codeforces.com/problemset/problem/1303/B | [
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16831
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1303-A | codeforces | 1303-A | Erasing Zeroes | https://codeforces.com/problemset/problem/1303/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 36848
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1302-J | codeforces | 1302-J | Keep talking and nobody explodes -- hard | https://codeforces.com/problemset/problem/1302/J | [] | null | null | stdin_stdout | null | {
"solved_count": 12
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1302-I | codeforces | 1302-I | Deja vu | https://codeforces.com/problemset/problem/1302/I | [] | null | null | stdin_stdout | null | {
"solved_count": 7
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1302-H | codeforces | 1302-H | Who needs suffix structures? | https://codeforces.com/problemset/problem/1302/H | [] | null | null | stdin_stdout | null | {
"solved_count": 10
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1302-G | codeforces | 1302-G | Keep talking and nobody explodes -- medium | https://codeforces.com/problemset/problem/1302/G | [] | null | null | stdin_stdout | null | {
"solved_count": 23
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1302-F | codeforces | 1302-F | Keep talking and nobody explodes -- easy | https://codeforces.com/problemset/problem/1302/F | [
"bitmasks",
"brute force",
"expression parsing"
] | null | null | stdin_stdout | null | {
"solved_count": 76
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1302-E | codeforces | 1302-E | Amazing bitset | https://codeforces.com/problemset/problem/1302/E | [] | null | null | stdin_stdout | null | {
"solved_count": 51
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1302-D | codeforces | 1302-D | Dijkstra | https://codeforces.com/problemset/problem/1302/D | [] | null | null | stdin_stdout | null | {
"solved_count": 98
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1302-C | codeforces | 1302-C | Segment tree or Fenwick? | https://codeforces.com/problemset/problem/1302/C | [
"data structures"
] | null | null | stdin_stdout | null | {
"solved_count": 388
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1302-B | codeforces | 1302-B | DAG | https://codeforces.com/problemset/problem/1302/B | [
"constructive algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": 156
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1302-A | codeforces | 1302-A | Nash equilibrium | https://codeforces.com/problemset/problem/1302/A | [] | null | null | stdin_stdout | null | {
"solved_count": 299
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1301-F | codeforces | 1301-F | Super Jaber | https://codeforces.com/problemset/problem/1301/F | [
"dfs and similar",
"graphs",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1417
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1301-E | codeforces | 1301-E | Nanosoft | https://codeforces.com/problemset/problem/1301/E | [
"binary search",
"data structures",
"dp",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1620
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1301-D | codeforces | 1301-D | Time to Run | https://codeforces.com/problemset/problem/1301/D | [
"constructive algorithms",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4245
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1301-C | codeforces | 1301-C | Ayoub's function | https://codeforces.com/problemset/problem/1301/C | [
"binary search",
"combinatorics",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9907
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1301-B | codeforces | 1301-B | Motarack's Birthday | https://codeforces.com/problemset/problem/1301/B | [
"binary search",
"greedy",
"ternary search"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15022
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1301-A | codeforces | 1301-A | Three Strings | https://codeforces.com/problemset/problem/1301/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20140
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1300-B | codeforces | 1300-B | Assigning to Classes | https://codeforces.com/problemset/problem/1300/B | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 26003
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1300-A | codeforces | 1300-A | Non-zero | https://codeforces.com/problemset/problem/1300/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21695
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1299-E | codeforces | 1299-E | So Mean | https://codeforces.com/problemset/problem/1299/E | [
"interactive",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 212
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1299-D | codeforces | 1299-D | Around the World | https://codeforces.com/problemset/problem/1299/D | [
"bitmasks",
"combinatorics",
"dfs and similar",
"dp",
"graphs",
"math",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 530
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1299-C | codeforces | 1299-C | Water Balance | https://codeforces.com/problemset/problem/1299/C | [
"data structures",
"geometry",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4352
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1299-B | codeforces | 1299-B | Aerodynamic | https://codeforces.com/problemset/problem/1299/B | [
"geometry"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5622
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1299-A | codeforces | 1299-A | Anu Has a Function | https://codeforces.com/problemset/problem/1299/A | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12561
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1297-I | codeforces | 1297-I | Falling Blocks | https://codeforces.com/problemset/problem/1297/I | [
"*special",
"data structures"
] | null | null | stdin_stdout | null | {
"solved_count": 38
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1297-H | codeforces | 1297-H | Paint the String | https://codeforces.com/problemset/problem/1297/H | [
"*special",
"dp",
"strings"
] | null | null | stdin_stdout | null | {
"solved_count": 53
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1297-G | codeforces | 1297-G | M-numbers | https://codeforces.com/problemset/problem/1297/G | [
"*special",
"dp",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 78
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1297-F | codeforces | 1297-F | Movie Fan | https://codeforces.com/problemset/problem/1297/F | [
"*special",
"data structures",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | null | {
"solved_count": 127
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1297-E | codeforces | 1297-E | Modernization of Treeland | https://codeforces.com/problemset/problem/1297/E | [
"*special",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 219
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1297-D | codeforces | 1297-D | Bonus Distribution | https://codeforces.com/problemset/problem/1297/D | [
"*special",
"binary search",
"greedy",
"sortings"
] | null | null | stdin_stdout | null | {
"solved_count": 274
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1297-C | codeforces | 1297-C | Dream Team | https://codeforces.com/problemset/problem/1297/C | [
"*special",
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 414
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1297-B | codeforces | 1297-B | Cartoons | https://codeforces.com/problemset/problem/1297/B | [
"*special",
"implementation",
"sortings"
] | null | null | stdin_stdout | null | {
"solved_count": 433
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1297-A | codeforces | 1297-A | Likes Display | https://codeforces.com/problemset/problem/1297/A | [
"*special",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 958
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1296-F | codeforces | 1296-F | Berland Beauty | https://codeforces.com/problemset/problem/1296/F | [
"constructive algorithms",
"dfs and similar",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3099
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1296-E2 | codeforces | 1296-E2 | String Coloring (hard version) | https://codeforces.com/problemset/problem/1296/E2 | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5463
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1296-E1 | codeforces | 1296-E1 | String Coloring (easy version) | https://codeforces.com/problemset/problem/1296/E1 | [
"constructive algorithms",
"dp",
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8224
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1296-D | codeforces | 1296-D | Fight with Monsters | https://codeforces.com/problemset/problem/1296/D | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15125
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1296-C | codeforces | 1296-C | Yet Another Walking Robot | https://codeforces.com/problemset/problem/1296/C | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15754
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1296-B | codeforces | 1296-B | Food Buying | https://codeforces.com/problemset/problem/1296/B | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 32762
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1296-A | codeforces | 1296-A | Array with Odd Sum | https://codeforces.com/problemset/problem/1296/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 48564
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1295-F | codeforces | 1295-F | Good Contest | https://codeforces.com/problemset/problem/1295/F | [
"combinatorics",
"dp",
"probabilities"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1511
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1295-E | codeforces | 1295-E | Permutation Separation | https://codeforces.com/problemset/problem/1295/E | [
"data structures",
"divide and conquer"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2779
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1295-D | codeforces | 1295-D | Same GCDs | https://codeforces.com/problemset/problem/1295/D | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 10277
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1295-C | codeforces | 1295-C | Obtain The String | https://codeforces.com/problemset/problem/1295/C | [
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13867
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1295-B | codeforces | 1295-B | Infinite Prefixes | https://codeforces.com/problemset/problem/1295/B | [
"math",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9890
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1295-A | codeforces | 1295-A | Display The Number | https://codeforces.com/problemset/problem/1295/A | [
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 24183
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1294-F | codeforces | 1294-F | Three Paths on a Tree | https://codeforces.com/problemset/problem/1294/F | [
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6937
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1294-E | codeforces | 1294-E | Obtain a Permutation | https://codeforces.com/problemset/problem/1294/E | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5184
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1294-D | codeforces | 1294-D | MEX maximizing | https://codeforces.com/problemset/problem/1294/D | [
"data structures",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12725
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1294-C | codeforces | 1294-C | Product of Three Numbers | https://codeforces.com/problemset/problem/1294/C | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 46817
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1294-B | codeforces | 1294-B | Collecting Packages | https://codeforces.com/problemset/problem/1294/B | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 22970
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1294-A | codeforces | 1294-A | Collecting Coins | https://codeforces.com/problemset/problem/1294/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 53677
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1293-B | codeforces | 1293-B | JOE is on TV! | https://codeforces.com/problemset/problem/1293/B | [
"combinatorics",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22322
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1293-A | codeforces | 1293-A | ConneR and the A.R.C. Markland-N | https://codeforces.com/problemset/problem/1293/A | [
"binary search",
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16177
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1292-F | codeforces | 1292-F | Nora's Toy Boxes | https://codeforces.com/problemset/problem/1292/F | [
"bitmasks",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 372
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1292-E | codeforces | 1292-E | Rin and The Unknown Flower | https://codeforces.com/problemset/problem/1292/E | [
"constructive algorithms",
"greedy",
"interactive",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 466
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1292-D | codeforces | 1292-D | Chaotic V. | https://codeforces.com/problemset/problem/1292/D | [
"dp",
"graphs",
"greedy",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 977
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1292-C | codeforces | 1292-C | Xenon's Attack on the Gangs | https://codeforces.com/problemset/problem/1292/C | [
"combinatorics",
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2255
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1292-B | codeforces | 1292-B | Aroma's Search | https://codeforces.com/problemset/problem/1292/B | [
"brute force",
"constructive algorithms",
"geometry",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6777
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1292-A | codeforces | 1292-A | NEKO's Maze Game | https://codeforces.com/problemset/problem/1292/A | [
"data structures",
"dsu",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 13886
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1291-F | codeforces | 1291-F | Coffee Varieties (easy version) | https://codeforces.com/problemset/problem/1291/F | [
"graphs",
"interactive"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 729
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1291-B | codeforces | 1291-B | Array Sharpening | https://codeforces.com/problemset/problem/1291/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15400
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1291-A | codeforces | 1291-A | Even But Not Even | https://codeforces.com/problemset/problem/1291/A | [
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 20725
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1290-F | codeforces | 1290-F | Making Shapes | https://codeforces.com/problemset/problem/1290/F | [
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 593
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1290-E | codeforces | 1290-E | Cartesian Tree | https://codeforces.com/problemset/problem/1290/E | [
"data structures"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 671
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1290-D | codeforces | 1290-D | Coffee Varieties (hard version) | https://codeforces.com/problemset/problem/1290/D | [
"constructive algorithms",
"graphs",
"interactive"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 954
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1290-C | codeforces | 1290-C | Prefix Enlightenment | https://codeforces.com/problemset/problem/1290/C | [
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2016
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1290-B | codeforces | 1290-B | Irreducible Anagrams | https://codeforces.com/problemset/problem/1290/B | [
"binary search",
"constructive algorithms",
"data structures",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7243
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1290-A | codeforces | 1290-A | Mind Control | https://codeforces.com/problemset/problem/1290/A | [
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8917
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1288-F | codeforces | 1288-F | Red-Blue Graph | https://codeforces.com/problemset/problem/1288/F | [
"constructive algorithms",
"flows"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 651
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1288-E | codeforces | 1288-E | Messenger Simulator | https://codeforces.com/problemset/problem/1288/E | [
"data structures"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4035
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1288-D | codeforces | 1288-D | Minimax Problem | https://codeforces.com/problemset/problem/1288/D | [
"binary search",
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 8337
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1288-C | codeforces | 1288-C | Two Arrays | https://codeforces.com/problemset/problem/1288/C | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15472
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1288-B | codeforces | 1288-B | Yet Another Meme Problem | https://codeforces.com/problemset/problem/1288/B | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17818
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1288-A | codeforces | 1288-A | Deadline | https://codeforces.com/problemset/problem/1288/A | [
"binary search",
"brute force",
"math",
"ternary search"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19336
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1287-B | codeforces | 1287-B | Hyperset | https://codeforces.com/problemset/problem/1287/B | [
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9796
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1287-A | codeforces | 1287-A | Angry Students | https://codeforces.com/problemset/problem/1287/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22975
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1286-F | codeforces | 1286-F | Harry The Potter | https://codeforces.com/problemset/problem/1286/F | [
"brute force",
"constructive algorithms",
"dp",
"fft",
"implementation",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 298
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1286-E | codeforces | 1286-E | Fedya the Potter Strikes Back | https://codeforces.com/problemset/problem/1286/E | [
"data structures",
"strings"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 672
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1286-D | codeforces | 1286-D | LCC | https://codeforces.com/problemset/problem/1286/D | [
"data structures",
"math",
"matrices",
"probabilities"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 729
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1286-C2 | codeforces | 1286-C2 | Madhouse (Hard version) | https://codeforces.com/problemset/problem/1286/C2 | [
"brute force",
"constructive algorithms",
"hashing",
"interactive",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 746
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1286-C1 | codeforces | 1286-C1 | Madhouse (Easy version) | https://codeforces.com/problemset/problem/1286/C1 | [
"brute force",
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1581
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1286-B | codeforces | 1286-B | Numbers on Tree | https://codeforces.com/problemset/problem/1286/B | [
"constructive algorithms",
"data structures",
"dfs and similar",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5507
} | 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.