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:903-G | codeforces | 903-G | Yet Another Maxflow Problem | https://codeforces.com/problemset/problem/903/G | [
"data structures",
"flows",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 766
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:903-F | codeforces | 903-F | Clear The Matrix | https://codeforces.com/problemset/problem/903/F | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 804
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:903-E | codeforces | 903-E | Swapping Characters | https://codeforces.com/problemset/problem/903/E | [
"brute force",
"hashing",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1628
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:903-D | codeforces | 903-D | Almost Difference | https://codeforces.com/problemset/problem/903/D | [
"data structures",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4658
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:903-C | codeforces | 903-C | Boxes Packing | https://codeforces.com/problemset/problem/903/C | [
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 23422
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:903-B | codeforces | 903-B | The Modcrab | https://codeforces.com/problemset/problem/903/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8160
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:903-A | codeforces | 903-A | Hungry Student Problem | https://codeforces.com/problemset/problem/903/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 15633
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:902-B | codeforces | 902-B | Coloring a Tree | https://codeforces.com/problemset/problem/902/B | [
"dfs and similar",
"dsu",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12090
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:902-A | codeforces | 902-A | Visiting a Friend | https://codeforces.com/problemset/problem/902/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10332
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:901-E | codeforces | 901-E | Cyclic Cipher | https://codeforces.com/problemset/problem/901/E | [
"fft",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 107
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:901-D | codeforces | 901-D | Weighting a Tree | https://codeforces.com/problemset/problem/901/D | [
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 678
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:901-C | codeforces | 901-C | Bipartite Segments | https://codeforces.com/problemset/problem/901/C | [
"binary search",
"data structures",
"dfs and similar",
"dsu",
"graphs",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1341
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:901-B | codeforces | 901-B | GCD of Polynomials | https://codeforces.com/problemset/problem/901/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1653
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:901-A | codeforces | 901-A | Hashing Trees | https://codeforces.com/problemset/problem/901/A | [
"constructive algorithms",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5413
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:900-E | codeforces | 900-E | Maximum Questions | https://codeforces.com/problemset/problem/900/E | [
"data structures",
"dp",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1450
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:900-D | codeforces | 900-D | Unusual Sequences | https://codeforces.com/problemset/problem/900/D | [
"bitmasks",
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3964
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:900-C | codeforces | 900-C | Remove Extra One | https://codeforces.com/problemset/problem/900/C | [
"brute force",
"data structures",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5068
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:900-B | codeforces | 900-B | Position in Fraction | https://codeforces.com/problemset/problem/900/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 8467
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:900-A | codeforces | 900-A | Find Extra One | https://codeforces.com/problemset/problem/900/A | [
"geometry",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15131
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:899-F | codeforces | 899-F | Letters Removing | https://codeforces.com/problemset/problem/899/F | [
"data structures",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2090
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:899-E | codeforces | 899-E | Segments Removal | https://codeforces.com/problemset/problem/899/E | [
"data structures",
"dsu",
"flows",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3649
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:899-D | codeforces | 899-D | Shovel Sale | https://codeforces.com/problemset/problem/899/D | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3282
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:899-C | codeforces | 899-C | Dividing the numbers | https://codeforces.com/problemset/problem/899/C | [
"constructive algorithms",
"graphs",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9107
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:899-B | codeforces | 899-B | Months and Years | https://codeforces.com/problemset/problem/899/B | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 6478
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:899-A | codeforces | 899-A | Splitting in Teams | https://codeforces.com/problemset/problem/899/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 11163
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:898-F | codeforces | 898-F | Restoring the Expression | https://codeforces.com/problemset/problem/898/F | [
"brute force",
"hashing",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1500
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:898-E | codeforces | 898-E | Squares and not squares | https://codeforces.com/problemset/problem/898/E | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4895
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:898-D | codeforces | 898-D | Alarm Clock | https://codeforces.com/problemset/problem/898/D | [
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4628
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:898-C | codeforces | 898-C | Phone Numbers | https://codeforces.com/problemset/problem/898/C | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 5886
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:898-B | codeforces | 898-B | Proper Nutrition | https://codeforces.com/problemset/problem/898/B | [
"brute force",
"implementation",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10841
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:898-A | codeforces | 898-A | Rounding | https://codeforces.com/problemset/problem/898/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17719
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:897-B | codeforces | 897-B | Chtholly's request | https://codeforces.com/problemset/problem/897/B | [
"brute force"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 7613
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:897-A | codeforces | 897-A | Scarborough Fair | https://codeforces.com/problemset/problem/897/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15210
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:896-E | codeforces | 896-E | Welcome home, Chtholly | https://codeforces.com/problemset/problem/896/E | [
"data structures",
"dsu"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 2553
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:896-D | codeforces | 896-D | Nephren Runs a Cinema | https://codeforces.com/problemset/problem/896/D | [
"chinese remainder theorem",
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 766
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:896-C | codeforces | 896-C | Willem, Chtholly and Seniorious | https://codeforces.com/problemset/problem/896/C | [
"data structures",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 4641
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:896-B | codeforces | 896-B | Ithea Plays With Chtholly | https://codeforces.com/problemset/problem/896/B | [
"binary search",
"constructive algorithms",
"games",
"greedy",
"interactive"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2338
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:896-A | codeforces | 896-A | Nephren gives a riddle | https://codeforces.com/problemset/problem/896/A | [
"binary search",
"dfs and similar"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3903
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:895-E | codeforces | 895-E | Eyes Closed | https://codeforces.com/problemset/problem/895/E | [
"data structures",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1316
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:895-D | codeforces | 895-D | String Mark | https://codeforces.com/problemset/problem/895/D | [
"combinatorics",
"math",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1281
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:895-C | codeforces | 895-C | Square Subsets | https://codeforces.com/problemset/problem/895/C | [
"bitmasks",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 7770
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:895-B | codeforces | 895-B | XK Segments | https://codeforces.com/problemset/problem/895/B | [
"binary search",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3842
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:895-A | codeforces | 895-A | Pizza Separation | https://codeforces.com/problemset/problem/895/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 6969
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:894-E | codeforces | 894-E | Ralph and Mushrooms | https://codeforces.com/problemset/problem/894/E | [
"dp",
"graphs"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3442
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:894-D | codeforces | 894-D | Ralph And His Tour in Binary Country | https://codeforces.com/problemset/problem/894/D | [
"brute force",
"data structures",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1235
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:894-C | codeforces | 894-C | Marco and GCD Sequence | https://codeforces.com/problemset/problem/894/C | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4659
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:894-B | codeforces | 894-B | Ralph And His Magic Field | https://codeforces.com/problemset/problem/894/B | [
"combinatorics",
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4727
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:894-A | codeforces | 894-A | QAQ | https://codeforces.com/problemset/problem/894/A | [
"brute force",
"dp"
] | null | null | stdin_stdout | 800 | {
"solved_count": 40018
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:893-F | codeforces | 893-F | Subtree Minimum Query | https://codeforces.com/problemset/problem/893/F | [
"data structures",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2604
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:893-E | codeforces | 893-E | Counting Arrays | https://codeforces.com/problemset/problem/893/E | [
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4338
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:893-D | codeforces | 893-D | Credit Card | https://codeforces.com/problemset/problem/893/D | [
"data structures",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3355
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:893-C | codeforces | 893-C | Rumor | https://codeforces.com/problemset/problem/893/C | [
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 29322
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:893-B | codeforces | 893-B | Beautiful Divisors | https://codeforces.com/problemset/problem/893/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 12851
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:893-A | codeforces | 893-A | Chess For Three | https://codeforces.com/problemset/problem/893/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 11148
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:892-B | codeforces | 892-B | Wrath | https://codeforces.com/problemset/problem/892/B | [
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10213
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:892-A | codeforces | 892-A | Greed | https://codeforces.com/problemset/problem/892/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 15160
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:891-E | codeforces | 891-E | Lust | https://codeforces.com/problemset/problem/891/E | [
"combinatorics",
"math",
"matrices"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1281
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:891-D | codeforces | 891-D | Sloth | https://codeforces.com/problemset/problem/891/D | [
"dfs and similar",
"dp",
"graph matchings",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 488
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:891-C | codeforces | 891-C | Envy | https://codeforces.com/problemset/problem/891/C | [
"data structures",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3193
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:891-B | codeforces | 891-B | Gluttony | https://codeforces.com/problemset/problem/891/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3281
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:891-A | codeforces | 891-A | Pride | https://codeforces.com/problemset/problem/891/A | [
"brute force",
"dp",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15121
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:889-E | codeforces | 889-E | Mod Mod Mod | https://codeforces.com/problemset/problem/889/E | [
"binary search",
"dp",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 815
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:888-G | codeforces | 888-G | Xor-MST | https://codeforces.com/problemset/problem/888/G | [
"bitmasks",
"constructive algorithms",
"data structures"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 6146
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:888-F | codeforces | 888-F | Connecting Vertices | https://codeforces.com/problemset/problem/888/F | [
"dp",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1185
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:888-E | codeforces | 888-E | Maximum Subsequence | https://codeforces.com/problemset/problem/888/E | [
"bitmasks",
"divide and conquer",
"meet-in-the-middle"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9814
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:888-D | codeforces | 888-D | Almost Identity Permutations | https://codeforces.com/problemset/problem/888/D | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10916
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:888-C | codeforces | 888-C | K-Dominant Character | https://codeforces.com/problemset/problem/888/C | [
"binary search",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9111
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:888-B | codeforces | 888-B | Buggy Robot | https://codeforces.com/problemset/problem/888/B | [
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 10863
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:888-A | codeforces | 888-A | Local Extrema | https://codeforces.com/problemset/problem/888/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12156
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:887-F | codeforces | 887-F | Row of Models | https://codeforces.com/problemset/problem/887/F | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 214
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:887-E | codeforces | 887-E | Little Brother | https://codeforces.com/problemset/problem/887/E | [
"binary search",
"geometry",
"sortings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 222
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:887-D | codeforces | 887-D | Ratings and Reality Shows | https://codeforces.com/problemset/problem/887/D | [
"data structures",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 575
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:887-C | codeforces | 887-C | Solution for Cube | https://codeforces.com/problemset/problem/887/C | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 2998
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:887-B | codeforces | 887-B | Cubes for Masha | https://codeforces.com/problemset/problem/887/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6202
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:887-A | codeforces | 887-A | Div. 64 | https://codeforces.com/problemset/problem/887/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 12029
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:886-F | codeforces | 886-F | Symmetric Projections | https://codeforces.com/problemset/problem/886/F | [
"geometry"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 311
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:886-E | codeforces | 886-E | Maximum Element | https://codeforces.com/problemset/problem/886/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1256
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:886-D | codeforces | 886-D | Restoration of string | https://codeforces.com/problemset/problem/886/D | [
"constructive algorithms",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2045
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:886-C | codeforces | 886-C | Petya and Catacombs | https://codeforces.com/problemset/problem/886/C | [
"dsu",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 5701
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:886-B | codeforces | 886-B | Vlad and Cafes | https://codeforces.com/problemset/problem/886/B | [] | null | null | stdin_stdout | 1,000 | {
"solved_count": 8465
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:886-A | codeforces | 886-A | ACM ICPC | https://codeforces.com/problemset/problem/886/A | [
"brute force"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 11317
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:884-F | codeforces | 884-F | Anti-Palindromize | https://codeforces.com/problemset/problem/884/F | [
"flows",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1337
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:884-E | codeforces | 884-E | Binary Matrix | https://codeforces.com/problemset/problem/884/E | [
"dsu"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 832
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:884-D | codeforces | 884-D | Boxes And Balls | https://codeforces.com/problemset/problem/884/D | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2277
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:884-C | codeforces | 884-C | Bertown Subway | https://codeforces.com/problemset/problem/884/C | [
"dfs and similar",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5233
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:884-B | codeforces | 884-B | Japanese Crosswords Strike Back | https://codeforces.com/problemset/problem/884/B | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 7739
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:884-A | codeforces | 884-A | Book Reading | https://codeforces.com/problemset/problem/884/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 11443
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:883-M | codeforces | 883-M | Quadcopter Competition | https://codeforces.com/problemset/problem/883/M | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 3914
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:883-L | codeforces | 883-L | Berland.Taxi | https://codeforces.com/problemset/problem/883/L | [
"data structures"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 313
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:883-K | codeforces | 883-K | Road Widening | https://codeforces.com/problemset/problem/883/K | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1254
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:883-J | codeforces | 883-J | Renovation | https://codeforces.com/problemset/problem/883/J | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 661
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:883-I | codeforces | 883-I | Photo Processing | https://codeforces.com/problemset/problem/883/I | [
"binary search",
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2424
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:883-H | codeforces | 883-H | Palindromic Cut | https://codeforces.com/problemset/problem/883/H | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1806
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:883-G | codeforces | 883-G | Orientation of Edges | https://codeforces.com/problemset/problem/883/G | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1557
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:883-F | codeforces | 883-F | Lost in Transliteration | https://codeforces.com/problemset/problem/883/F | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 2426
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:883-E | codeforces | 883-E | Field of Wonders | https://codeforces.com/problemset/problem/883/E | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 2074
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:883-D | codeforces | 883-D | Packmen Strike Back | https://codeforces.com/problemset/problem/883/D | [
"binary search",
"dp",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 507
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:883-C | codeforces | 883-C | Downloading B++ | https://codeforces.com/problemset/problem/883/C | [
"binary search",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 894
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:883-B | codeforces | 883-B | Berland Army | https://codeforces.com/problemset/problem/883/B | [
"constructive algorithms",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 485
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:883-A | codeforces | 883-A | Automatic Door | https://codeforces.com/problemset/problem/883/A | [
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 707
} | 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.