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:219-C | codeforces | 219-C | Color Stripe | https://codeforces.com/problemset/problem/219/C | [
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7185
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:219-B | codeforces | 219-B | Special Offer! Super Price 999 Bourles! | https://codeforces.com/problemset/problem/219/B | [
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 6155
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:219-A | codeforces | 219-A | k-String | https://codeforces.com/problemset/problem/219/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 32484
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:218-B | codeforces | 218-B | Airport | https://codeforces.com/problemset/problem/218/B | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 18449
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:218-A | codeforces | 218-A | Mountain Scenery | https://codeforces.com/problemset/problem/218/A | [
"brute force",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10574
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:217-E | codeforces | 217-E | Alien DNA | https://codeforces.com/problemset/problem/217/E | [
"data structures",
"dsu",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 355
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:217-D | codeforces | 217-D | Bitonix' Patrol | https://codeforces.com/problemset/problem/217/D | [
"bitmasks",
"brute force",
"combinatorics",
"dfs and similar",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 273
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:217-C | codeforces | 217-C | Formurosa | https://codeforces.com/problemset/problem/217/C | [
"divide and conquer",
"dp",
"expression parsing"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 368
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:217-B | codeforces | 217-B | Blackboard Fibonacci | https://codeforces.com/problemset/problem/217/B | [
"brute force",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1101
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:217-A | codeforces | 217-A | Ice Skating | https://codeforces.com/problemset/problem/217/A | [
"brute force",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 24525
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:216-E | codeforces | 216-E | Martian Luck | https://codeforces.com/problemset/problem/216/E | [
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 668
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:216-D | codeforces | 216-D | Spider's Web | https://codeforces.com/problemset/problem/216/D | [
"binary search",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1503
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:216-C | codeforces | 216-C | Hiring Staff | https://codeforces.com/problemset/problem/216/C | [
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1933
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:216-B | codeforces | 216-B | Forming Teams | https://codeforces.com/problemset/problem/216/B | [
"dfs and similar",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7055
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:216-A | codeforces | 216-A | Tiling with Hexagons | https://codeforces.com/problemset/problem/216/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 5281
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:215-E | codeforces | 215-E | Periodical Numbers | https://codeforces.com/problemset/problem/215/E | [
"combinatorics",
"dp",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 674
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:215-D | codeforces | 215-D | Hot Days | https://codeforces.com/problemset/problem/215/D | [
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1692
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:215-C | codeforces | 215-C | Crosses | https://codeforces.com/problemset/problem/215/C | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 719
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:215-B | codeforces | 215-B | Olympic Medal | https://codeforces.com/problemset/problem/215/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 5993
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:215-A | codeforces | 215-A | Bicycle Chain | https://codeforces.com/problemset/problem/215/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16213
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:214-B | codeforces | 214-B | Hometask | https://codeforces.com/problemset/problem/214/B | [
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5366
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:214-A | codeforces | 214-A | System of Equations | https://codeforces.com/problemset/problem/214/A | [
"brute force"
] | null | null | stdin_stdout | 800 | {
"solved_count": 43222
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:213-E | codeforces | 213-E | Two Permutations | https://codeforces.com/problemset/problem/213/E | [
"data structures",
"hashing",
"strings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 972
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:213-D | codeforces | 213-D | Stars | https://codeforces.com/problemset/problem/213/D | [
"constructive algorithms",
"geometry"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 364
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:213-C | codeforces | 213-C | Relay Race | https://codeforces.com/problemset/problem/213/C | [
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3274
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:213-B | codeforces | 213-B | Numbers | https://codeforces.com/problemset/problem/213/B | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1989
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:213-A | codeforces | 213-A | Game | https://codeforces.com/problemset/problem/213/A | [
"dfs and similar",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1894
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:212-E | codeforces | 212-E | IT Restaurants | https://codeforces.com/problemset/problem/212/E | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 2216
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:212-D | codeforces | 212-D | Cutting a Fence | https://codeforces.com/problemset/problem/212/D | [
"binary search",
"data structures",
"dsu"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 615
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:212-C | codeforces | 212-C | Cowboys | https://codeforces.com/problemset/problem/212/C | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 488
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:212-B | codeforces | 212-B | Polycarpus is Looking for Good Substrings | https://codeforces.com/problemset/problem/212/B | [
"bitmasks",
"hashing",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 369
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:212-A | codeforces | 212-A | Privatization | https://codeforces.com/problemset/problem/212/A | [
"flows",
"graphs"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 229
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:209-C | codeforces | 209-C | Trails and Glades | https://codeforces.com/problemset/problem/209/C | [
"constructive algorithms",
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 878
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:209-B | codeforces | 209-B | Pixels | https://codeforces.com/problemset/problem/209/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 488
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:209-A | codeforces | 209-A | Multicolored Marbles | https://codeforces.com/problemset/problem/209/A | [
"dp",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2881
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:208-E | codeforces | 208-E | Blood Cousins | https://codeforces.com/problemset/problem/208/E | [
"binary search",
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 9058
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:208-D | codeforces | 208-D | Prizes, Prizes, more Prizes | https://codeforces.com/problemset/problem/208/D | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8062
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:208-C | codeforces | 208-C | Police Station | https://codeforces.com/problemset/problem/208/C | [
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2158
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:208-B | codeforces | 208-B | Solitaire | https://codeforces.com/problemset/problem/208/B | [
"dfs and similar",
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1500
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:208-A | codeforces | 208-A | Dubstep | https://codeforces.com/problemset/problem/208/A | [
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 105624
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:207-D9 | codeforces | 207-D9 | The Beaver's Problem - 3 | https://codeforces.com/problemset/problem/207/D9 | [] | null | null | stdin_stdout | 1,800 | {
"solved_count": 99
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:207-D8 | codeforces | 207-D8 | The Beaver's Problem - 3 | https://codeforces.com/problemset/problem/207/D8 | [] | null | null | stdin_stdout | 2,300 | {
"solved_count": 101
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:207-D7 | codeforces | 207-D7 | The Beaver's Problem - 3 | https://codeforces.com/problemset/problem/207/D7 | [] | null | null | stdin_stdout | 1,600 | {
"solved_count": 113
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:207-D6 | codeforces | 207-D6 | The Beaver's Problem - 3 | https://codeforces.com/problemset/problem/207/D6 | [] | null | null | stdin_stdout | 2,100 | {
"solved_count": 90
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:207-D5 | codeforces | 207-D5 | The Beaver's Problem - 3 | https://codeforces.com/problemset/problem/207/D5 | [] | null | null | stdin_stdout | 1,600 | {
"solved_count": 157
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:207-D4 | codeforces | 207-D4 | The Beaver's Problem - 3 | https://codeforces.com/problemset/problem/207/D4 | [] | null | null | stdin_stdout | 2,100 | {
"solved_count": 174
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:207-D3 | codeforces | 207-D3 | The Beaver's Problem - 3 | https://codeforces.com/problemset/problem/207/D3 | [] | null | null | stdin_stdout | 2,000 | {
"solved_count": 149
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:207-D2 | codeforces | 207-D2 | The Beaver's Problem - 3 | https://codeforces.com/problemset/problem/207/D2 | [] | null | null | stdin_stdout | 2,000 | {
"solved_count": 118
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:207-D10 | codeforces | 207-D10 | The Beaver's Problem - 3 | https://codeforces.com/problemset/problem/207/D10 | [] | null | null | stdin_stdout | 2,100 | {
"solved_count": 87
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:207-D1 | codeforces | 207-D1 | The Beaver's Problem - 3 | https://codeforces.com/problemset/problem/207/D1 | [] | null | null | stdin_stdout | 1,800 | {
"solved_count": 125
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:207-C3 | codeforces | 207-C3 | Game with Two Trees | https://codeforces.com/problemset/problem/207/C3 | [
"data structures"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 164
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:207-C2 | codeforces | 207-C2 | Game with Two Trees | https://codeforces.com/problemset/problem/207/C2 | [] | null | null | stdin_stdout | 2,200 | {
"solved_count": 105
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:207-C1 | codeforces | 207-C1 | Game with Two Trees | https://codeforces.com/problemset/problem/207/C1 | [] | null | null | stdin_stdout | 2,100 | {
"solved_count": 137
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:207-B3 | codeforces | 207-B3 | Military Trainings | https://codeforces.com/problemset/problem/207/B3 | [] | null | null | stdin_stdout | 1,700 | {
"solved_count": 216
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:207-B2 | codeforces | 207-B2 | Military Trainings | https://codeforces.com/problemset/problem/207/B2 | [] | null | null | stdin_stdout | 1,900 | {
"solved_count": 240
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:207-B1 | codeforces | 207-B1 | Military Trainings | https://codeforces.com/problemset/problem/207/B1 | [] | null | null | stdin_stdout | 1,600 | {
"solved_count": 360
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:207-A3 | codeforces | 207-A3 | Beaver's Calculator 1.0 | https://codeforces.com/problemset/problem/207/A3 | [
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 277
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:207-A2 | codeforces | 207-A2 | Beaver's Calculator 1.0 | https://codeforces.com/problemset/problem/207/A2 | [
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 305
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:207-A1 | codeforces | 207-A1 | Beaver's Calculator 1.0 | https://codeforces.com/problemset/problem/207/A1 | [
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 370
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:205-B | codeforces | 205-B | Little Elephant and Sorting | https://codeforces.com/problemset/problem/205/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 6482
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:205-A | codeforces | 205-A | Little Elephant and Rozdil | https://codeforces.com/problemset/problem/205/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 25324
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:204-E | codeforces | 204-E | Little Elephant and Strings | https://codeforces.com/problemset/problem/204/E | [
"data structures",
"implementation",
"string suffix structures",
"two pointers"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1450
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:204-D | codeforces | 204-D | Little Elephant and Retro Strings | https://codeforces.com/problemset/problem/204/D | [
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 639
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:204-C | codeforces | 204-C | Little Elephant and Furik and Rubik | https://codeforces.com/problemset/problem/204/C | [
"math",
"probabilities"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1247
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:204-B | codeforces | 204-B | Little Elephant and Cards | https://codeforces.com/problemset/problem/204/B | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5918
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:204-A | codeforces | 204-A | Little Elephant and Interval | https://codeforces.com/problemset/problem/204/A | [
"binary search",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6658
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:203-E | codeforces | 203-E | Transportation | https://codeforces.com/problemset/problem/203/E | [
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 310
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:203-D | codeforces | 203-D | Hit Ball | https://codeforces.com/problemset/problem/203/D | [
"geometry",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1516
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:203-C | codeforces | 203-C | Photographer | https://codeforces.com/problemset/problem/203/C | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 6067
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:203-B | codeforces | 203-B | Game on Paper | https://codeforces.com/problemset/problem/203/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 2792
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:203-A | codeforces | 203-A | Two Problems | https://codeforces.com/problemset/problem/203/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 4430
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:202-B | codeforces | 202-B | Brand New Easy Problem | https://codeforces.com/problemset/problem/202/B | [
"brute force"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 859
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:202-A | codeforces | 202-A | LLPS | https://codeforces.com/problemset/problem/202/A | [
"binary search",
"bitmasks",
"brute force",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19847
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:201-E | codeforces | 201-E | Thoroughly Bureaucratic Organization | https://codeforces.com/problemset/problem/201/E | [
"binary search",
"combinatorics"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 486
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:201-D | codeforces | 201-D | Brand New Problem | https://codeforces.com/problemset/problem/201/D | [
"bitmasks",
"brute force",
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 455
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:201-C | codeforces | 201-C | Fragile Bridges | https://codeforces.com/problemset/problem/201/C | [
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1514
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:201-B | codeforces | 201-B | Guess That Car! | https://codeforces.com/problemset/problem/201/B | [
"math",
"ternary search"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1393
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:201-A | codeforces | 201-A | Clear Symmetry | https://codeforces.com/problemset/problem/201/A | [
"constructive algorithms",
"dp",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3252
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:200-E | codeforces | 200-E | Tractor College | https://codeforces.com/problemset/problem/200/E | [
"implementation",
"math",
"number theory",
"ternary search"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 367
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:200-D | codeforces | 200-D | Programming Language | https://codeforces.com/problemset/problem/200/D | [
"binary search",
"brute force",
"expression parsing",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1056
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:200-C | codeforces | 200-C | Football Championship | https://codeforces.com/problemset/problem/200/C | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1111
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:200-B | codeforces | 200-B | Drinks | https://codeforces.com/problemset/problem/200/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 149715
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:200-A | codeforces | 200-A | Cinema | https://codeforces.com/problemset/problem/200/A | [
"brute force",
"data structures"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 735
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:199-B | codeforces | 199-B | Special Olympics | https://codeforces.com/problemset/problem/199/B | [
"geometry"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 878
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:199-A | codeforces | 199-A | Hexadecimal's theorem | https://codeforces.com/problemset/problem/199/A | [
"brute force",
"constructive algorithms",
"implementation",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 30415
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:198-E | codeforces | 198-E | Gripping Story | https://codeforces.com/problemset/problem/198/E | [
"binary search",
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 558
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:198-D | codeforces | 198-D | Cube Snake | https://codeforces.com/problemset/problem/198/D | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 117
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:198-C | codeforces | 198-C | Delivering Carcinogen | https://codeforces.com/problemset/problem/198/C | [
"binary search",
"geometry"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 428
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:198-B | codeforces | 198-B | Jumping on Walls | https://codeforces.com/problemset/problem/198/B | [
"shortest paths"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 5205
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:198-A | codeforces | 198-A | About Bacteria | https://codeforces.com/problemset/problem/198/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3335
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:197-B | codeforces | 197-B | Limit | https://codeforces.com/problemset/problem/197/B | [
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 4925
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:197-A | codeforces | 197-A | Plate Game | https://codeforces.com/problemset/problem/197/A | [
"constructive algorithms",
"games",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6860
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:196-E | codeforces | 196-E | Opening Portals | https://codeforces.com/problemset/problem/196/E | [
"dsu",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1207
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:196-D | codeforces | 196-D | The Next Good String | https://codeforces.com/problemset/problem/196/D | [
"data structures",
"greedy",
"hashing",
"strings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 603
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:196-C | codeforces | 196-C | Paint Tree | https://codeforces.com/problemset/problem/196/C | [
"constructive algorithms",
"divide and conquer",
"geometry",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1048
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:196-B | codeforces | 196-B | Infinite Maze | https://codeforces.com/problemset/problem/196/B | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2379
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:196-A | codeforces | 196-A | Lexicographically Maximum Subsequence | https://codeforces.com/problemset/problem/196/A | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 5852
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:195-E | codeforces | 195-E | Building Forest | https://codeforces.com/problemset/problem/195/E | [
"data structures",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 861
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:195-D | codeforces | 195-D | Analyzing Polyline | https://codeforces.com/problemset/problem/195/D | [
"geometry",
"math",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1137
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:195-C | codeforces | 195-C | Try and Catch | https://codeforces.com/problemset/problem/195/C | [
"expression parsing",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1241
} | 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.