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: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": 1518
} | 2026-08-10T02:20:32.917453+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": 6096
} | 2026-08-10T02:20:32.917453+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": 2822
} | 2026-08-10T02:20:32.917453+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": 4461
} | 2026-08-10T02:20:32.917453+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-08-10T02:20:32.917453+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": 20142
} | 2026-08-10T02:20:32.917453+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": 544
} | 2026-08-10T02:20:32.917453+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": 493
} | 2026-08-10T02:20:32.917453+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": 1559
} | 2026-08-10T02:20:32.917453+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": 1406
} | 2026-08-10T02:20:32.917453+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": 3263
} | 2026-08-10T02:20:32.917453+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": 374
} | 2026-08-10T02:20:32.917453+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": 1065
} | 2026-08-10T02:20:32.917453+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": 1214
} | 2026-08-10T02:20:32.917453+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": 153256
} | 2026-08-10T02:20:32.917453+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": 760
} | 2026-08-10T02:20:32.917453+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": 884
} | 2026-08-10T02:20:32.917453+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": 30866
} | 2026-08-10T02:20:32.917453+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": 591
} | 2026-08-10T02:20:32.917453+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": 118
} | 2026-08-10T02:20:32.917453+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": 453
} | 2026-08-10T02:20:32.917453+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": 5395
} | 2026-08-10T02:20:32.917453+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": 3355
} | 2026-08-10T02:20:32.917453+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": 4953
} | 2026-08-10T02:20:32.917453+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": 6918
} | 2026-08-10T02:20:32.917453+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": 1268
} | 2026-08-10T02:20:32.917453+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": 651
} | 2026-08-10T02:20:32.917453+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": 1071
} | 2026-08-10T02:20:32.917453+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": 2503
} | 2026-08-10T02:20:32.917453+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": 5902
} | 2026-08-10T02:20:32.917453+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": 925
} | 2026-08-10T02:20:32.917453+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": 1139
} | 2026-08-10T02:20:32.917453+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": 1263
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:195-B | codeforces | 195-B | After Training | https://codeforces.com/problemset/problem/195/B | [
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 5546
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:195-A | codeforces | 195-A | Let's Watch Football | https://codeforces.com/problemset/problem/195/A | [
"binary search",
"brute force",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 10334
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:194-B | codeforces | 194-B | Square | https://codeforces.com/problemset/problem/194/B | [
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 4039
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:194-A | codeforces | 194-A | Exams | https://codeforces.com/problemset/problem/194/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 11036
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:193-E | codeforces | 193-E | Fibonacci Number | https://codeforces.com/problemset/problem/193/E | [
"brute force",
"math",
"matrices"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 425
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:193-D | codeforces | 193-D | Two Segments | https://codeforces.com/problemset/problem/193/D | [
"data structures"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 658
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:193-C | codeforces | 193-C | Hamming Distance | https://codeforces.com/problemset/problem/193/C | [
"constructive algorithms",
"greedy",
"math",
"matrices"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 708
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:193-B | codeforces | 193-B | Xor | https://codeforces.com/problemset/problem/193/B | [
"brute force"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1184
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:193-A | codeforces | 193-A | Cutting Figure | https://codeforces.com/problemset/problem/193/A | [
"constructive algorithms",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4749
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:192-B | codeforces | 192-B | Walking in the Rain | https://codeforces.com/problemset/problem/192/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 6857
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:192-A | codeforces | 192-A | Funky Numbers | https://codeforces.com/problemset/problem/192/A | [
"binary search",
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11662
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:191-E | codeforces | 191-E | Thwarting Demonstrations | https://codeforces.com/problemset/problem/191/E | [
"binary search",
"data structures",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 990
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:191-D | codeforces | 191-D | Metro Scheme | https://codeforces.com/problemset/problem/191/D | [
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 421
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:191-C | codeforces | 191-C | Fools and Roads | https://codeforces.com/problemset/problem/191/C | [
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 9843
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:191-B | codeforces | 191-B | Demonstration | https://codeforces.com/problemset/problem/191/B | [
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1108
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:191-A | codeforces | 191-A | Dynasty Puzzles | https://codeforces.com/problemset/problem/191/A | [
"dp"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4640
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:190-E | codeforces | 190-E | Counter Attack | https://codeforces.com/problemset/problem/190/E | [
"data structures",
"dsu",
"graphs",
"hashing",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1804
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:190-D | codeforces | 190-D | Non-Secret Cypher | https://codeforces.com/problemset/problem/190/D | [
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2700
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:190-C | codeforces | 190-C | STL | https://codeforces.com/problemset/problem/190/C | [
"dfs and similar"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3267
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:190-B | codeforces | 190-B | Surrounded | https://codeforces.com/problemset/problem/190/B | [
"geometry"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3120
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:190-A | codeforces | 190-A | Vasya and the Bus | https://codeforces.com/problemset/problem/190/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 6312
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:189-B | codeforces | 189-B | Counting Rhombi | https://codeforces.com/problemset/problem/189/B | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4249
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:189-A | codeforces | 189-A | Cut Ribbon | https://codeforces.com/problemset/problem/189/A | [
"brute force",
"dp"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 83911
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:188-H | codeforces | 188-H | Stack | https://codeforces.com/problemset/problem/188/H | [
"*special",
"expression parsing",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 712
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:188-G | codeforces | 188-G | Array Sorting | https://codeforces.com/problemset/problem/188/G | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 365
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:188-F | codeforces | 188-F | Binary Notation | https://codeforces.com/problemset/problem/188/F | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 349
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:188-E | codeforces | 188-E | HQ9+ | https://codeforces.com/problemset/problem/188/E | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 559
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:188-D | codeforces | 188-D | Asterisks | https://codeforces.com/problemset/problem/188/D | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 759
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:188-C | codeforces | 188-C | LCM | https://codeforces.com/problemset/problem/188/C | [
"*special",
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 528
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:188-B | codeforces | 188-B | A + Reverse B | https://codeforces.com/problemset/problem/188/B | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 813
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:188-A | codeforces | 188-A | Hexagonal Numbers | https://codeforces.com/problemset/problem/188/A | [
"*special"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 862
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:187-E | codeforces | 187-E | Heaven Tour | https://codeforces.com/problemset/problem/187/E | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 123
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:187-D | codeforces | 187-D | BRT Contract | https://codeforces.com/problemset/problem/187/D | [
"data structures"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 628
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:187-C | codeforces | 187-C | Weak Memory | https://codeforces.com/problemset/problem/187/C | [
"dfs and similar",
"dsu"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1638
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:187-B | codeforces | 187-B | AlgoRace | https://codeforces.com/problemset/problem/187/B | [
"dp",
"shortest paths"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2385
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:187-A | codeforces | 187-A | Permutations | https://codeforces.com/problemset/problem/187/A | [
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3068
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:186-B | codeforces | 186-B | Growing Mushrooms | https://codeforces.com/problemset/problem/186/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 6244
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:186-A | codeforces | 186-A | Comparing Strings | https://codeforces.com/problemset/problem/186/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 18715
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:185-E | codeforces | 185-E | Soap Time! - 2 | https://codeforces.com/problemset/problem/185/E | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 262
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:185-D | codeforces | 185-D | Visit of the Great | https://codeforces.com/problemset/problem/185/D | [
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 545
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:185-C | codeforces | 185-C | Clever Fat Rat | https://codeforces.com/problemset/problem/185/C | [
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 151
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:185-B | codeforces | 185-B | Mushroom Scientists | https://codeforces.com/problemset/problem/185/B | [
"math",
"ternary search"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1802
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:185-A | codeforces | 185-A | Plant | https://codeforces.com/problemset/problem/185/A | [
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6633
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:183-E | codeforces | 183-E | Candy Shop | https://codeforces.com/problemset/problem/183/E | [
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 236
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:183-D | codeforces | 183-D | T-shirt | https://codeforces.com/problemset/problem/183/D | [
"dp",
"greedy",
"probabilities"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 520
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:183-C | codeforces | 183-C | Cyclic Coloring | https://codeforces.com/problemset/problem/183/C | [
"dfs and similar"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 764
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:183-B | codeforces | 183-B | Zoo | https://codeforces.com/problemset/problem/183/B | [
"brute force",
"geometry"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 860
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:183-A | codeforces | 183-A | Headquarters | https://codeforces.com/problemset/problem/183/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 673
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:182-E | codeforces | 182-E | Wooden Fence | https://codeforces.com/problemset/problem/182/E | [
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1695
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:182-D | codeforces | 182-D | Common Divisors | https://codeforces.com/problemset/problem/182/D | [
"brute force",
"hashing",
"implementation",
"math",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9408
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:182-C | codeforces | 182-C | Optimal Sum | https://codeforces.com/problemset/problem/182/C | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 903
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:182-B | codeforces | 182-B | Vasya's Calendar | https://codeforces.com/problemset/problem/182/B | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 7424
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:182-A | codeforces | 182-A | Battlefield | https://codeforces.com/problemset/problem/182/A | [
"geometry",
"graphs",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 367
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:181-B | codeforces | 181-B | Number of Triplets | https://codeforces.com/problemset/problem/181/B | [
"binary search",
"brute force"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 3578
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:181-A | codeforces | 181-A | Series of Crimes | https://codeforces.com/problemset/problem/181/A | [
"brute force",
"geometry",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 8980
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:180-F | codeforces | 180-F | Mathematical Analysis Rocks! | https://codeforces.com/problemset/problem/180/F | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 2881
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:180-E | codeforces | 180-E | Cubes | https://codeforces.com/problemset/problem/180/E | [
"binary search",
"dp",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2097
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:180-D | codeforces | 180-D | Name | https://codeforces.com/problemset/problem/180/D | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 818
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:180-C | codeforces | 180-C | Letter | https://codeforces.com/problemset/problem/180/C | [
"dp"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8700
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:180-B | codeforces | 180-B | Divisibility Rules | https://codeforces.com/problemset/problem/180/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 488
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:180-A | codeforces | 180-A | Defragmentation | https://codeforces.com/problemset/problem/180/A | [
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 603
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:178-F3 | codeforces | 178-F3 | Representative Sampling | https://codeforces.com/problemset/problem/178/F3 | [] | null | null | stdin_stdout | 2,500 | {
"solved_count": 654
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:178-F2 | codeforces | 178-F2 | Representative Sampling | https://codeforces.com/problemset/problem/178/F2 | [
"dp",
"sortings",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 392
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:178-F1 | codeforces | 178-F1 | Representative Sampling | https://codeforces.com/problemset/problem/178/F1 | [] | null | null | stdin_stdout | 1,800 | {
"solved_count": 464
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:178-E3 | codeforces | 178-E3 | The Beaver's Problem - 2 | https://codeforces.com/problemset/problem/178/E3 | [] | null | null | stdin_stdout | 2,300 | {
"solved_count": 218
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:178-E2 | codeforces | 178-E2 | The Beaver's Problem - 2 | https://codeforces.com/problemset/problem/178/E2 | [] | null | null | stdin_stdout | 2,000 | {
"solved_count": 246
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:178-E1 | codeforces | 178-E1 | The Beaver's Problem - 2 | https://codeforces.com/problemset/problem/178/E1 | [] | null | null | stdin_stdout | 1,900 | {
"solved_count": 318
} | 2026-08-10T02:20:32.917453+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.