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: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": 11179
} | 2026-08-17T01:43:56.191071+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": 7073
} | 2026-08-17T01:43:56.191071+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": 16378
} | 2026-08-17T01:43:56.191071+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": 1172
} | 2026-08-17T01:43:56.191071+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": 1078
} | 2026-08-17T01:43:56.191071+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": 8003
} | 2026-08-17T01:43:56.191071+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": 10820
} | 2026-08-17T01:43:56.191071+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": 18612
} | 2026-08-17T01:43:56.191071+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": 41564
} | 2026-08-17T01:43:56.191071+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": 27731
} | 2026-08-17T01:43:56.191071+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": 4940
} | 2026-08-17T01:43:56.191071+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": 2954
} | 2026-08-17T01:43:56.191071+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": 10059
} | 2026-08-17T01:43:56.191071+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": 17044
} | 2026-08-17T01:43:56.191071+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": 20172
} | 2026-08-17T01:43:56.191071+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": 46775
} | 2026-08-17T01:43:56.191071+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": 250
} | 2026-08-17T01:43:56.191071+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": 571
} | 2026-08-17T01:43:56.191071+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": 2117
} | 2026-08-17T01:43:56.191071+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": 792
} | 2026-08-17T01:43:56.191071+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": 636
} | 2026-08-17T01:43:56.191071+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": 5740
} | 2026-08-17T01:43:56.191071+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": 789
} | 2026-08-17T01:43:56.191071+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": 710
} | 2026-08-17T01:43:56.191071+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": 1473
} | 2026-08-17T01:43:56.191071+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": 7508
} | 2026-08-17T01:43:56.191071+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": 12816
} | 2026-08-17T01:43:56.191071+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": 13934
} | 2026-08-17T01:43:56.191071+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": 15712
} | 2026-08-17T01:43:56.191071+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": 223
} | 2026-08-17T01:43:56.191071+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": 1510
} | 2026-08-17T01:43:56.191071+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": 3376
} | 2026-08-17T01:43:56.191071+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": 3302
} | 2026-08-17T01:43:56.191071+00:00 |
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": 5412
} | 2026-08-17T01:43:56.191071+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": 19884
} | 2026-08-17T01:43:56.191071+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": 12582
} | 2026-08-17T01:43:56.191071+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": 14752
} | 2026-08-17T01:43:56.191071+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": 1864
} | 2026-08-17T01:43:56.191071+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": 2046
} | 2026-08-17T01:43:56.191071+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": 6110
} | 2026-08-17T01:43:56.191071+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": 6813
} | 2026-08-17T01:43:56.191071+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": 18025
} | 2026-08-17T01:43:56.191071+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": 18952
} | 2026-08-17T01:43:56.191071+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": 26920
} | 2026-08-17T01:43:56.191071+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": 1136
} | 2026-08-17T01:43:56.191071+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": 679
} | 2026-08-17T01:43:56.191071+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": 3361
} | 2026-08-17T01:43:56.191071+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": 7929
} | 2026-08-17T01:43:56.191071+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": 13065
} | 2026-08-17T01:43:56.191071+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": 17042
} | 2026-08-17T01:43:56.191071+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": 37378
} | 2026-08-17T01:43:56.191071+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-08-17T01:43:56.191071+00:00 |
codeforces:1302-I | codeforces | 1302-I | Deja vu | https://codeforces.com/problemset/problem/1302/I | [] | null | null | stdin_stdout | null | {
"solved_count": 10
} | 2026-08-17T01:43:56.191071+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": 11
} | 2026-08-17T01:43:56.191071+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": 24
} | 2026-08-17T01:43:56.191071+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": 80
} | 2026-08-17T01:43:56.191071+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-08-17T01:43:56.191071+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-08-17T01:43:56.191071+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": 389
} | 2026-08-17T01:43:56.191071+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-08-17T01:43:56.191071+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-08-17T01:43:56.191071+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": 1472
} | 2026-08-17T01:43:56.191071+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": 1676
} | 2026-08-17T01:43:56.191071+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": 4270
} | 2026-08-17T01:43:56.191071+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": 9971
} | 2026-08-17T01:43:56.191071+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": 15176
} | 2026-08-17T01:43:56.191071+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": 20213
} | 2026-08-17T01:43:56.191071+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": 26372
} | 2026-08-17T01:43:56.191071+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": 21778
} | 2026-08-17T01:43:56.191071+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": 270
} | 2026-08-17T01:43:56.191071+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": 712
} | 2026-08-17T01:43:56.191071+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": 4456
} | 2026-08-17T01:43:56.191071+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": 5664
} | 2026-08-17T01:43:56.191071+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": 12692
} | 2026-08-17T01:43:56.191071+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-08-17T01:43:56.191071+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-08-17T01:43:56.191071+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-08-17T01:43:56.191071+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-08-17T01:43:56.191071+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-08-17T01:43:56.191071+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-08-17T01:43:56.191071+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-08-17T01:43:56.191071+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-08-17T01:43:56.191071+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-08-17T01:43:56.191071+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": 3155
} | 2026-08-17T01:43:56.191071+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": 5555
} | 2026-08-17T01:43:56.191071+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": 8313
} | 2026-08-17T01:43:56.191071+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": 15209
} | 2026-08-17T01:43:56.191071+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": 15841
} | 2026-08-17T01:43:56.191071+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": 32981
} | 2026-08-17T01:43:56.191071+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": 49338
} | 2026-08-17T01:43:56.191071+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": 1577
} | 2026-08-17T01:43:56.191071+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": 2906
} | 2026-08-17T01:43:56.191071+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": 10557
} | 2026-08-17T01:43:56.191071+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": 14031
} | 2026-08-17T01:43:56.191071+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": 10010
} | 2026-08-17T01:43:56.191071+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": 24429
} | 2026-08-17T01:43:56.191071+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": 7241
} | 2026-08-17T01:43:56.191071+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": 5273
} | 2026-08-17T01:43:56.191071+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": 12831
} | 2026-08-17T01:43:56.191071+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": 48895
} | 2026-08-17T01:43:56.191071+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.