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:1207-A | codeforces | 1207-A | There Are Two Types Of Burgers | https://codeforces.com/problemset/problem/1207/A | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23429
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1206-B | codeforces | 1206-B | Make Product Equal One | https://codeforces.com/problemset/problem/1206/B | [
"dp",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 29577
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1206-A | codeforces | 1206-A | Choose Two Numbers | https://codeforces.com/problemset/problem/1206/A | [
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26094
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1205-F | codeforces | 1205-F | Beauty of a Permutation | https://codeforces.com/problemset/problem/1205/F | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 140
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1205-E | codeforces | 1205-E | Expected Value Again | https://codeforces.com/problemset/problem/1205/E | [
"combinatorics",
"strings"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 375
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1205-D | codeforces | 1205-D | Almost All | https://codeforces.com/problemset/problem/1205/D | [
"constructive algorithms",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 768
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1205-C | codeforces | 1205-C | Palindromic Paths | https://codeforces.com/problemset/problem/1205/C | [
"implementation",
"interactive"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1268
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1205-B | codeforces | 1205-B | Shortest Cycle | https://codeforces.com/problemset/problem/1205/B | [
"bitmasks",
"brute force",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7518
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1205-A | codeforces | 1205-A | Almost Equal | https://codeforces.com/problemset/problem/1205/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14725
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1204-E | codeforces | 1204-E | Natasha, Sasha and the Prefix Sums | https://codeforces.com/problemset/problem/1204/E | [
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2083
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1204-D2 | codeforces | 1204-D2 | Kirk and a Binary String (hard version) | https://codeforces.com/problemset/problem/1204/D2 | [
"data structures",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3399
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1204-D1 | codeforces | 1204-D1 | Kirk and a Binary String (easy version) | https://codeforces.com/problemset/problem/1204/D1 | [
"brute force",
"greedy",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3223
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1204-C | codeforces | 1204-C | Anna, Svyatoslav and Maps | https://codeforces.com/problemset/problem/1204/C | [
"dp",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7257
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1204-B | codeforces | 1204-B | Mislove Has Lost an Array | https://codeforces.com/problemset/problem/1204/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18351
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1204-A | codeforces | 1204-A | BowWow and the Timetable | https://codeforces.com/problemset/problem/1204/A | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22367
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1203-F2 | codeforces | 1203-F2 | Complete the Projects (hard version) | https://codeforces.com/problemset/problem/1203/F2 | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3326
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1203-F1 | codeforces | 1203-F1 | Complete the Projects (easy version) | https://codeforces.com/problemset/problem/1203/F1 | [
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4060
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1203-E | codeforces | 1203-E | Boxers | https://codeforces.com/problemset/problem/1203/E | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15007
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1203-D2 | codeforces | 1203-D2 | Remove the Substring (hard version) | https://codeforces.com/problemset/problem/1203/D2 | [
"binary search",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8152
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1203-D1 | codeforces | 1203-D1 | Remove the Substring (easy version) | https://codeforces.com/problemset/problem/1203/D1 | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9507
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1203-C | codeforces | 1203-C | Common Divisors | https://codeforces.com/problemset/problem/1203/C | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 24564
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1203-B | codeforces | 1203-B | Equal Rectangles | https://codeforces.com/problemset/problem/1203/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 16990
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1203-A | codeforces | 1203-A | Circle of Students | https://codeforces.com/problemset/problem/1203/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17692
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1202-F | codeforces | 1202-F | You Are Given Some Letters... | https://codeforces.com/problemset/problem/1202/F | [
"binary search",
"implementation",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 543
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1202-E | codeforces | 1202-E | You Are Given Some Strings... | https://codeforces.com/problemset/problem/1202/E | [
"brute force",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2797
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1202-D | codeforces | 1202-D | Print a 1337-string... | https://codeforces.com/problemset/problem/1202/D | [
"combinatorics",
"constructive algorithms",
"math",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5469
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1202-C | codeforces | 1202-C | You Are Given a WASD-string... | https://codeforces.com/problemset/problem/1202/C | [
"brute force",
"data structures",
"dp",
"greedy",
"implementation",
"math",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2773
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1202-B | codeforces | 1202-B | You Are Given a Decimal String... | https://codeforces.com/problemset/problem/1202/B | [
"brute force",
"dp",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4849
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1202-A | codeforces | 1202-A | You Are Given Two Binary Strings... | https://codeforces.com/problemset/problem/1202/A | [
"bitmasks",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10770
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1201-E2 | codeforces | 1201-E2 | Knightmare (hard) | https://codeforces.com/problemset/problem/1201/E2 | [
"graphs",
"interactive",
"shortest paths"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 167
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1201-E1 | codeforces | 1201-E1 | Knightmare (easy) | https://codeforces.com/problemset/problem/1201/E1 | [
"graphs",
"interactive",
"shortest paths"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 146
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1201-D | codeforces | 1201-D | Treasure Hunting | https://codeforces.com/problemset/problem/1201/D | [
"binary search",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2537
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1201-C | codeforces | 1201-C | Maximum Median | https://codeforces.com/problemset/problem/1201/C | [
"binary search",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 33910
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1201-B | codeforces | 1201-B | Zero Array | https://codeforces.com/problemset/problem/1201/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 25748
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1201-A | codeforces | 1201-A | Important Exam | https://codeforces.com/problemset/problem/1201/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 17076
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1200-F | codeforces | 1200-F | Graph Traveler | https://codeforces.com/problemset/problem/1200/F | [
"brute force",
"data structures",
"dfs and similar",
"dp",
"graphs",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1164
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1200-E | codeforces | 1200-E | Compress Words | https://codeforces.com/problemset/problem/1200/E | [
"brute force",
"hashing",
"implementation",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 9473
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1200-D | codeforces | 1200-D | White Lines | https://codeforces.com/problemset/problem/1200/D | [
"brute force",
"data structures",
"dp",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4404
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1200-C | codeforces | 1200-C | Round Corridor | https://codeforces.com/problemset/problem/1200/C | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10643
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1200-B | codeforces | 1200-B | Block Adventure | https://codeforces.com/problemset/problem/1200/B | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14686
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1200-A | codeforces | 1200-A | Hotelier | https://codeforces.com/problemset/problem/1200/A | [
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21856
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1199-B | codeforces | 1199-B | Water Lily | https://codeforces.com/problemset/problem/1199/B | [
"geometry",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22455
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1199-A | codeforces | 1199-A | City Day | https://codeforces.com/problemset/problem/1199/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16350
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1198-F | codeforces | 1198-F | GCD Groups 2 | https://codeforces.com/problemset/problem/1198/F | [
"greedy",
"number theory",
"probabilities"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1080
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1198-E | codeforces | 1198-E | Rectangle Painting 2 | https://codeforces.com/problemset/problem/1198/E | [
"flows",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1302
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1198-D | codeforces | 1198-D | Rectangle Painting 1 | https://codeforces.com/problemset/problem/1198/D | [
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3754
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1198-C | codeforces | 1198-C | Matching vs Independent Set | https://codeforces.com/problemset/problem/1198/C | [
"constructive algorithms",
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4076
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1198-B | codeforces | 1198-B | Welfare State | https://codeforces.com/problemset/problem/1198/B | [
"binary search",
"brute force",
"data structures",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10018
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1198-A | codeforces | 1198-A | MP3 | https://codeforces.com/problemset/problem/1198/A | [
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10171
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1197-F | codeforces | 1197-F | Coloring Game | https://codeforces.com/problemset/problem/1197/F | [
"dp",
"games",
"matrices"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 343
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1197-E | codeforces | 1197-E | Culture Code | https://codeforces.com/problemset/problem/1197/E | [
"binary search",
"combinatorics",
"data structures",
"dp",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1859
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1197-D | codeforces | 1197-D | Yet Another Subarray Problem | https://codeforces.com/problemset/problem/1197/D | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5805
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1197-C | codeforces | 1197-C | Array Splitting | https://codeforces.com/problemset/problem/1197/C | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15276
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1197-B | codeforces | 1197-B | Pillars | https://codeforces.com/problemset/problem/1197/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 14530
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1197-A | codeforces | 1197-A | DIY Wooden Ladder | https://codeforces.com/problemset/problem/1197/A | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 14060
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1196-F | codeforces | 1196-F | K-th Path | https://codeforces.com/problemset/problem/1196/F | [
"brute force",
"constructive algorithms",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3191
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1196-E | codeforces | 1196-E | Connected Component on a Chessboard | https://codeforces.com/problemset/problem/1196/E | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3919
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1196-D2 | codeforces | 1196-D2 | RGB Substring (hard version) | https://codeforces.com/problemset/problem/1196/D2 | [
"data structures",
"dp",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10475
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1196-D1 | codeforces | 1196-D1 | RGB Substring (easy version) | https://codeforces.com/problemset/problem/1196/D1 | [
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11156
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1196-C | codeforces | 1196-C | Robot Breakout | https://codeforces.com/problemset/problem/1196/C | [
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9783
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1196-B | codeforces | 1196-B | Odd Sum Segments | https://codeforces.com/problemset/problem/1196/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17563
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1196-A | codeforces | 1196-A | Three Piles of Candies | https://codeforces.com/problemset/problem/1196/A | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29168
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1195-F | codeforces | 1195-F | Geometers Anonymous Club | https://codeforces.com/problemset/problem/1195/F | [
"data structures",
"geometry",
"math",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1043
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1195-E | codeforces | 1195-E | OpenStreetMap | https://codeforces.com/problemset/problem/1195/E | [
"data structures",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3553
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1195-D2 | codeforces | 1195-D2 | Submarine in the Rybinsk Sea (hard edition) | https://codeforces.com/problemset/problem/1195/D2 | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4905
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1195-D1 | codeforces | 1195-D1 | Submarine in the Rybinsk Sea (easy edition) | https://codeforces.com/problemset/problem/1195/D1 | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8210
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1195-C | codeforces | 1195-C | Basketball Exercise | https://codeforces.com/problemset/problem/1195/C | [
"dp"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 35369
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1195-B | codeforces | 1195-B | Sport Mafia | https://codeforces.com/problemset/problem/1195/B | [
"binary search",
"brute force",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22009
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1195-A | codeforces | 1195-A | Drinks Choosing | https://codeforces.com/problemset/problem/1195/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 14246
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1194-G | codeforces | 1194-G | Another Meme Problem | https://codeforces.com/problemset/problem/1194/G | [
"dp"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 333
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1194-F | codeforces | 1194-F | Crossword Expert | https://codeforces.com/problemset/problem/1194/F | [
"combinatorics",
"dp",
"number theory",
"probabilities",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1221
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1194-E | codeforces | 1194-E | Count The Rectangles | https://codeforces.com/problemset/problem/1194/E | [
"bitmasks",
"brute force",
"data structures",
"geometry",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2065
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1194-D | codeforces | 1194-D | 1-2-K Game | https://codeforces.com/problemset/problem/1194/D | [
"games",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7225
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1194-C | codeforces | 1194-C | From S To T | https://codeforces.com/problemset/problem/1194/C | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14617
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1194-B | codeforces | 1194-B | Yet Another Crosses Problem | https://codeforces.com/problemset/problem/1194/B | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 10723
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1194-A | codeforces | 1194-A | Remove a Progression | https://codeforces.com/problemset/problem/1194/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17420
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1193-C | codeforces | 1193-C | Scissors and Tape | https://codeforces.com/problemset/problem/1193/C | [
"*special",
"constructive algorithms",
"geometry"
] | null | null | stdin_stdout | null | {
"solved_count": 48
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1193-B | codeforces | 1193-B | Magic Tree | https://codeforces.com/problemset/problem/1193/B | [
"*special",
"data structures",
"dp",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 510
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1193-A | codeforces | 1193-A | Amusement Park | https://codeforces.com/problemset/problem/1193/A | [
"*special",
"dp",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 468
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1192-C | codeforces | 1192-C | Cubeword | https://codeforces.com/problemset/problem/1192/C | [
"*special",
"brute force",
"dp",
"meet-in-the-middle"
] | null | null | stdin_stdout | null | {
"solved_count": 367
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1192-B | codeforces | 1192-B | Dynamic Diameter | https://codeforces.com/problemset/problem/1192/B | [
"*special",
"data structures",
"dfs and similar",
"divide and conquer",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 1581
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1192-A | codeforces | 1192-A | Building Skyscrapers | https://codeforces.com/problemset/problem/1192/A | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 80
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1191-B | codeforces | 1191-B | Tokitsukaze and Mahjong | https://codeforces.com/problemset/problem/1191/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9870
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1191-A | codeforces | 1191-A | Tokitsukaze and Enhancement | https://codeforces.com/problemset/problem/1191/A | [
"brute force"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19000
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1190-F | codeforces | 1190-F | Tokitsukaze and Powers | https://codeforces.com/problemset/problem/1190/F | [
"number theory",
"probabilities"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 108
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1190-E | codeforces | 1190-E | Tokitsukaze and Explosion | https://codeforces.com/problemset/problem/1190/E | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 262
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1190-D | codeforces | 1190-D | Tokitsukaze and Strange Rectangle | https://codeforces.com/problemset/problem/1190/D | [
"data structures",
"divide and conquer",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2688
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1190-C | codeforces | 1190-C | Tokitsukaze and Duel | https://codeforces.com/problemset/problem/1190/C | [
"brute force",
"games",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2246
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1190-B | codeforces | 1190-B | Tokitsukaze, CSL and Stone Game | https://codeforces.com/problemset/problem/1190/B | [
"games"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6851
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1190-A | codeforces | 1190-A | Tokitsukaze and Discard Items | https://codeforces.com/problemset/problem/1190/A | [
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9821
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1189-C | codeforces | 1189-C | Candies! | https://codeforces.com/problemset/problem/1189/C | [
"data structures",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11083
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1189-B | codeforces | 1189-B | Number Circle | https://codeforces.com/problemset/problem/1189/B | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15362
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1189-A | codeforces | 1189-A | Keanu Reeves | https://codeforces.com/problemset/problem/1189/A | [
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16118
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1188-E | codeforces | 1188-E | Problem from Red Panda | https://codeforces.com/problemset/problem/1188/E | [
"combinatorics"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 290
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1188-D | codeforces | 1188-D | Make Equal | https://codeforces.com/problemset/problem/1188/D | [
"dp"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 910
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1188-C | codeforces | 1188-C | Array Beauty | https://codeforces.com/problemset/problem/1188/C | [
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2142
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1188-B | codeforces | 1188-B | Count Pairs | https://codeforces.com/problemset/problem/1188/B | [
"math",
"matrices",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 5187
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1188-A2 | codeforces | 1188-A2 | Add on a Tree: Revolution | https://codeforces.com/problemset/problem/1188/A2 | [
"constructive algorithms",
"dfs and similar",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1297
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1188-A1 | codeforces | 1188-A1 | Add on a Tree | https://codeforces.com/problemset/problem/1188/A1 | [
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8953
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1187-G | codeforces | 1187-G | Gang Up | https://codeforces.com/problemset/problem/1187/G | [
"flows",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 692
} | 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.