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: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": 2514
} | 2026-06-01T05:00:40.145500+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": 621
} | 2026-06-01T05:00:40.145500+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": 4487
} | 2026-06-01T05:00:40.145500+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": 2303
} | 2026-06-01T05:00:40.145500+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": 3817
} | 2026-06-01T05:00:40.145500+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": 1269
} | 2026-06-01T05:00:40.145500+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": 1242
} | 2026-06-01T05:00:40.145500+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": 7424
} | 2026-06-01T05:00:40.145500+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": 3829
} | 2026-06-01T05:00:40.145500+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": 6926
} | 2026-06-01T05:00:40.145500+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": 3133
} | 2026-06-01T05:00:40.145500+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": 1206
} | 2026-06-01T05:00:40.145500+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": 4633
} | 2026-06-01T05:00:40.145500+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": 4708
} | 2026-06-01T05:00:40.145500+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": 39538
} | 2026-06-01T05:00:40.145500+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": 2510
} | 2026-06-01T05:00:40.145500+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": 4243
} | 2026-06-01T05:00:40.145500+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": 3335
} | 2026-06-01T05:00:40.145500+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": 28519
} | 2026-06-01T05:00:40.145500+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": 12698
} | 2026-06-01T05:00:40.145500+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": 11069
} | 2026-06-01T05:00:40.145500+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": 10020
} | 2026-06-01T05:00:40.145500+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": 14978
} | 2026-06-01T05:00:40.145500+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": 1129
} | 2026-06-01T05:00:40.145500+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": 236
} | 2026-06-01T05:00:40.145500+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": 3038
} | 2026-06-01T05:00:40.145500+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": 3245
} | 2026-06-01T05:00:40.145500+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": 14480
} | 2026-06-01T05:00:40.145500+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": 674
} | 2026-06-01T05:00:40.145500+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": 5917
} | 2026-06-01T05:00:40.145500+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": 1099
} | 2026-06-01T05:00:40.145500+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": 9288
} | 2026-06-01T05:00:40.145500+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": 10585
} | 2026-06-01T05:00:40.145500+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": 9012
} | 2026-06-01T05:00:40.145500+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": 10773
} | 2026-06-01T05:00:40.145500+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": 12035
} | 2026-06-01T05:00:40.145500+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": 186
} | 2026-06-01T05:00:40.145500+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": 183
} | 2026-06-01T05:00:40.145500+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": 553
} | 2026-06-01T05:00:40.145500+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": 2982
} | 2026-06-01T05:00:40.145500+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": 5965
} | 2026-06-01T05:00:40.145500+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": 11970
} | 2026-06-01T05:00:40.145500+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": 293
} | 2026-06-01T05:00:40.145500+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": 1220
} | 2026-06-01T05:00:40.145500+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": 1960
} | 2026-06-01T05:00:40.145500+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": 5682
} | 2026-06-01T05:00:40.145500+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": 8425
} | 2026-06-01T05:00:40.145500+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": 11239
} | 2026-06-01T05:00:40.145500+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": 1288
} | 2026-06-01T05:00:40.145500+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": 782
} | 2026-06-01T05:00:40.145500+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": 2237
} | 2026-06-01T05:00:40.145500+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": 5181
} | 2026-06-01T05:00:40.145500+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": 7642
} | 2026-06-01T05:00:40.145500+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": 11304
} | 2026-06-01T05:00:40.145500+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": 3851
} | 2026-06-01T05:00:40.145500+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": 265
} | 2026-06-01T05:00:40.145500+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": 1217
} | 2026-06-01T05:00:40.145500+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": 625
} | 2026-06-01T05:00:40.145500+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": 2319
} | 2026-06-01T05:00:40.145500+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": 1785
} | 2026-06-01T05:00:40.145500+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": 1520
} | 2026-06-01T05:00:40.145500+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": 2388
} | 2026-06-01T05:00:40.145500+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": 2039
} | 2026-06-01T05:00:40.145500+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": 491
} | 2026-06-01T05:00:40.145500+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": 666
} | 2026-06-01T05:00:40.145500+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": 424
} | 2026-06-01T05:00:40.145500+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": 655
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:879-B | codeforces | 879-B | Table Tennis | https://codeforces.com/problemset/problem/879/B | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14515
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:879-A | codeforces | 879-A | Borya's Diagnosis | https://codeforces.com/problemset/problem/879/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 9588
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:878-E | codeforces | 878-E | Numbers on the blackboard | https://codeforces.com/problemset/problem/878/E | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 739
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:878-D | codeforces | 878-D | Magic Breeding | https://codeforces.com/problemset/problem/878/D | [
"bitmasks"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 870
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:878-C | codeforces | 878-C | Tournament | https://codeforces.com/problemset/problem/878/C | [
"data structures",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1031
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:878-B | codeforces | 878-B | Teams Formation | https://codeforces.com/problemset/problem/878/B | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1120
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:878-A | codeforces | 878-A | Short Program | https://codeforces.com/problemset/problem/878/A | [
"bitmasks",
"constructive algorithms"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5999
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:877-F | codeforces | 877-F | Ann and Books | https://codeforces.com/problemset/problem/877/F | [
"data structures",
"flows",
"hashing"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2352
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:877-E | codeforces | 877-E | Danil and a Part-time Job | https://codeforces.com/problemset/problem/877/E | [
"bitmasks",
"data structures",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5554
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:877-D | codeforces | 877-D | Olya and Energy Drinks | https://codeforces.com/problemset/problem/877/D | [
"data structures",
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5132
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:877-C | codeforces | 877-C | Slava and tanks | https://codeforces.com/problemset/problem/877/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6071
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:877-B | codeforces | 877-B | Nikita and string | https://codeforces.com/problemset/problem/877/B | [
"brute force",
"dp"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11975
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:877-A | codeforces | 877-A | Alex and broken contest | https://codeforces.com/problemset/problem/877/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 11563
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:876-B | codeforces | 876-B | Divisiblity of Differences | https://codeforces.com/problemset/problem/876/B | [
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 10355
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:876-A | codeforces | 876-A | Trip For Meal | https://codeforces.com/problemset/problem/876/A | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 10048
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:875-F | codeforces | 875-F | Royal Questions | https://codeforces.com/problemset/problem/875/F | [
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1590
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:875-E | codeforces | 875-E | Delivery Club | https://codeforces.com/problemset/problem/875/E | [
"binary search",
"data structures",
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1011
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:875-D | codeforces | 875-D | High Cry | https://codeforces.com/problemset/problem/875/D | [
"binary search",
"bitmasks",
"combinatorics",
"data structures",
"divide and conquer"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2506
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:875-C | codeforces | 875-C | National Property | https://codeforces.com/problemset/problem/875/C | [
"2-sat",
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2375
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:875-B | codeforces | 875-B | Sorting the Coins | https://codeforces.com/problemset/problem/875/B | [
"dsu",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5394
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:875-A | codeforces | 875-A | Classroom Watch | https://codeforces.com/problemset/problem/875/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10271
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:873-F | codeforces | 873-F | Forbidden Indices | https://codeforces.com/problemset/problem/873/F | [
"dsu",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1884
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:873-E | codeforces | 873-E | Awards For Contestants | https://codeforces.com/problemset/problem/873/E | [
"brute force",
"data structures",
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 796
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:873-D | codeforces | 873-D | Merge Sort | https://codeforces.com/problemset/problem/873/D | [
"constructive algorithms",
"divide and conquer"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4104
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:873-C | codeforces | 873-C | Strange Game On Matrix | https://codeforces.com/problemset/problem/873/C | [
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 3659
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:873-B | codeforces | 873-B | Balanced Substring | https://codeforces.com/problemset/problem/873/B | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9130
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:873-A | codeforces | 873-A | Chores | https://codeforces.com/problemset/problem/873/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 10642
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:871-E | codeforces | 871-E | Restore the Tree | https://codeforces.com/problemset/problem/871/E | [
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 176
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:870-F | codeforces | 870-F | Paths | https://codeforces.com/problemset/problem/870/F | [
"data structures",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 683
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:870-E | codeforces | 870-E | Points, Lines and Ready-made Titles | https://codeforces.com/problemset/problem/870/E | [
"dfs and similar",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1317
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:870-D | codeforces | 870-D | Something with XOR Queries | https://codeforces.com/problemset/problem/870/D | [
"brute force",
"interactive",
"probabilities"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1299
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:870-C | codeforces | 870-C | Maximum splitting | https://codeforces.com/problemset/problem/870/C | [
"dp",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9782
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:870-B | codeforces | 870-B | Maximum of Maximums of Minimums | https://codeforces.com/problemset/problem/870/B | [
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10684
} | 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.