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:888-A | codeforces | 888-A | Local Extrema | https://codeforces.com/problemset/problem/888/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12253
} | 2026-11-02T05:37:07.883505+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": 222
} | 2026-11-02T05:37:07.883505+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": 225
} | 2026-11-02T05:37:07.883505+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": 583
} | 2026-11-02T05:37:07.883505+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": 3007
} | 2026-11-02T05:37:07.883505+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": 6460
} | 2026-11-02T05:37:07.883505+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": 12151
} | 2026-11-02T05:37:07.883505+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": 315
} | 2026-11-02T05:37:07.883505+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": 1288
} | 2026-11-02T05:37:07.883505+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": 2082
} | 2026-11-02T05:37:07.883505+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": 5710
} | 2026-11-02T05:37:07.883505+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": 8548
} | 2026-11-02T05:37:07.883505+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": 11418
} | 2026-11-02T05:37:07.883505+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": 1356
} | 2026-11-02T05:37:07.883505+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": 842
} | 2026-11-02T05:37:07.883505+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": 2298
} | 2026-11-02T05:37:07.883505+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": 5277
} | 2026-11-02T05:37:07.883505+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": 7777
} | 2026-11-02T05:37:07.883505+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": 11516
} | 2026-11-02T05:37:07.883505+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": 3949
} | 2026-11-02T05:37:07.883505+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": 317
} | 2026-11-02T05:37:07.883505+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": 1258
} | 2026-11-02T05:37:07.883505+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": 665
} | 2026-11-02T05:37:07.883505+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": 2457
} | 2026-11-02T05:37:07.883505+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": 1813
} | 2026-11-02T05:37:07.883505+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": 1566
} | 2026-11-02T05:37:07.883505+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": 2431
} | 2026-11-02T05:37:07.883505+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": 2079
} | 2026-11-02T05:37:07.883505+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": 513
} | 2026-11-02T05:37:07.883505+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": 898
} | 2026-11-02T05:37:07.883505+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": 488
} | 2026-11-02T05:37:07.883505+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": 711
} | 2026-11-02T05:37:07.883505+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": 15107
} | 2026-11-02T05:37:07.883505+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": 9709
} | 2026-11-02T05:37:07.883505+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": 782
} | 2026-11-02T05:37:07.883505+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": 1006
} | 2026-11-02T05:37:07.883505+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": 1084
} | 2026-11-02T05:37:07.883505+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": 1141
} | 2026-11-02T05:37:07.883505+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": 6118
} | 2026-11-02T05:37:07.883505+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": 2582
} | 2026-11-02T05:37:07.883505+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": 6088
} | 2026-11-02T05:37:07.883505+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": 5410
} | 2026-11-02T05:37:07.883505+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": 6117
} | 2026-11-02T05:37:07.883505+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": 12359
} | 2026-11-02T05:37:07.883505+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": 11649
} | 2026-11-02T05:37:07.883505+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": 10559
} | 2026-11-02T05:37:07.883505+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": 10201
} | 2026-11-02T05:37:07.883505+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": 1715
} | 2026-11-02T05:37:07.883505+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": 1060
} | 2026-11-02T05:37:07.883505+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": 2623
} | 2026-11-02T05:37:07.883505+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": 2444
} | 2026-11-02T05:37:07.883505+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": 5418
} | 2026-11-02T05:37:07.883505+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": 10415
} | 2026-11-02T05:37:07.883505+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": 2018
} | 2026-11-02T05:37:07.883505+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": 834
} | 2026-11-02T05:37:07.883505+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": 4236
} | 2026-11-02T05:37:07.883505+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": 3701
} | 2026-11-02T05:37:07.883505+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": 9359
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:873-A | codeforces | 873-A | Chores | https://codeforces.com/problemset/problem/873/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 10801
} | 2026-11-02T05:37:07.883505+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": 246
} | 2026-11-02T05:37:07.883505+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": 749
} | 2026-11-02T05:37:07.883505+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": 1352
} | 2026-11-02T05:37:07.883505+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": 1334
} | 2026-11-02T05:37:07.883505+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": 9884
} | 2026-11-02T05:37:07.883505+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": 10972
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:870-A | codeforces | 870-A | Search for Pretty Integers | https://codeforces.com/problemset/problem/870/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 10959
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:869-E | codeforces | 869-E | The Untended Antiquity | https://codeforces.com/problemset/problem/869/E | [
"data structures",
"hashing"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2465
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:869-D | codeforces | 869-D | The Overdosing Ubiquity | https://codeforces.com/problemset/problem/869/D | [
"brute force",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 376
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:869-C | codeforces | 869-C | The Intriguing Obsession | https://codeforces.com/problemset/problem/869/C | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5391
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:869-B | codeforces | 869-B | The Eternal Immortality | https://codeforces.com/problemset/problem/869/B | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16066
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:869-A | codeforces | 869-A | The Artful Expedient | https://codeforces.com/problemset/problem/869/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 9867
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:868-G | codeforces | 868-G | El Toll Caves | https://codeforces.com/problemset/problem/868/G | [
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 200
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:868-F | codeforces | 868-F | Yet Another Minimization Problem | https://codeforces.com/problemset/problem/868/F | [
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 5801
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:868-E | codeforces | 868-E | Policeman and a Tree | https://codeforces.com/problemset/problem/868/E | [
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 575
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:868-D | codeforces | 868-D | Huge Strings | https://codeforces.com/problemset/problem/868/D | [
"bitmasks",
"brute force",
"dp",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1038
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:868-C | codeforces | 868-C | Qualification Rounds | https://codeforces.com/problemset/problem/868/C | [
"bitmasks",
"brute force",
"constructive algorithms",
"dp"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5125
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:868-B | codeforces | 868-B | Race Against Time | https://codeforces.com/problemset/problem/868/B | [
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 4001
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:868-A | codeforces | 868-A | Bark to Unlock | https://codeforces.com/problemset/problem/868/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 10283
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:867-A | codeforces | 867-A | Between the Offices | https://codeforces.com/problemset/problem/867/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21057
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:865-G | codeforces | 865-G | Flowers and Chocolate | https://codeforces.com/problemset/problem/865/G | [
"combinatorics",
"math",
"matrices"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 340
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:865-F | codeforces | 865-F | Egg Roulette | https://codeforces.com/problemset/problem/865/F | [
"bitmasks",
"brute force",
"divide and conquer",
"math",
"meet-in-the-middle"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 81
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:865-E | codeforces | 865-E | Hex Dyslexia | https://codeforces.com/problemset/problem/865/E | [
"bitmasks",
"brute force",
"dp",
"graphs"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 167
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:865-D | codeforces | 865-D | Buy Low Sell High | https://codeforces.com/problemset/problem/865/D | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 9193
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:865-C | codeforces | 865-C | Gotta Go Fast | https://codeforces.com/problemset/problem/865/C | [
"binary search",
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 971
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:865-B | codeforces | 865-B | Ordering Pizza | https://codeforces.com/problemset/problem/865/B | [
"binary search",
"sortings",
"ternary search"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1969
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:865-A | codeforces | 865-A | Save the problem! | https://codeforces.com/problemset/problem/865/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 4460
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:864-F | codeforces | 864-F | Cities Excursions | https://codeforces.com/problemset/problem/864/F | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 717
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:864-E | codeforces | 864-E | Fire | https://codeforces.com/problemset/problem/864/E | [
"dp",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4929
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:864-D | codeforces | 864-D | Make a Permutation! | https://codeforces.com/problemset/problem/864/D | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6443
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:864-C | codeforces | 864-C | Bus | https://codeforces.com/problemset/problem/864/C | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6264
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:864-B | codeforces | 864-B | Polycarp and Letters | https://codeforces.com/problemset/problem/864/B | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 10183
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:864-A | codeforces | 864-A | Fair Game | https://codeforces.com/problemset/problem/864/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 12394
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:863-G | codeforces | 863-G | Graphic Settings | https://codeforces.com/problemset/problem/863/G | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 68
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:863-F | codeforces | 863-F | Almost Permutation | https://codeforces.com/problemset/problem/863/F | [
"flows"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1654
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:863-E | codeforces | 863-E | Turn Off The TV | https://codeforces.com/problemset/problem/863/E | [
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4481
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:863-D | codeforces | 863-D | Yet Another Array Queries Problem | https://codeforces.com/problemset/problem/863/D | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3948
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:863-C | codeforces | 863-C | 1-2-3 | https://codeforces.com/problemset/problem/863/C | [
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2748
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:863-B | codeforces | 863-B | Kayaking | https://codeforces.com/problemset/problem/863/B | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11938
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:863-A | codeforces | 863-A | Quasi-palindrome | https://codeforces.com/problemset/problem/863/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 11178
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:862-F | codeforces | 862-F | Mahmoud and Ehab and the final stage | https://codeforces.com/problemset/problem/862/F | [
"data structures",
"strings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 300
} | 2026-11-02T05:37:07.883505+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.