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:199-B | codeforces | 199-B | Special Olympics | https://codeforces.com/problemset/problem/199/B | [
"geometry"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 871
} | 2026-04-13T03:38:27.662191+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": 30195
} | 2026-04-13T03:38:27.662191+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": 545
} | 2026-04-13T03:38:27.662191+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": 116
} | 2026-04-13T03:38:27.662191+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": 423
} | 2026-04-13T03:38:27.662191+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": 5135
} | 2026-04-13T03:38:27.662191+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": 3320
} | 2026-04-13T03:38:27.662191+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": 4913
} | 2026-04-13T03:38:27.662191+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": 6827
} | 2026-04-13T03:38:27.662191+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": 1199
} | 2026-04-13T03:38:27.662191+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": 598
} | 2026-04-13T03:38:27.662191+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": 1038
} | 2026-04-13T03:38:27.662191+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": 2368
} | 2026-04-13T03:38:27.662191+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": 5830
} | 2026-04-13T03:38:27.662191+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": 853
} | 2026-04-13T03:38:27.662191+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": 1132
} | 2026-04-13T03:38:27.662191+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": 1233
} | 2026-04-13T03:38:27.662191+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": 5500
} | 2026-04-13T03:38:27.662191+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": 10111
} | 2026-04-13T03:38:27.662191+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": 3963
} | 2026-04-13T03:38:27.662191+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": 10897
} | 2026-04-13T03:38:27.662191+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": 401
} | 2026-04-13T03:38:27.662191+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": 605
} | 2026-04-13T03:38:27.662191+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": 600
} | 2026-04-13T03:38:27.662191+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": 1138
} | 2026-04-13T03:38:27.662191+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": 4663
} | 2026-04-13T03:38:27.662191+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": 6778
} | 2026-04-13T03:38:27.662191+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": 11542
} | 2026-04-13T03:38:27.662191+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": 952
} | 2026-04-13T03:38:27.662191+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": 392
} | 2026-04-13T03:38:27.662191+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": 9140
} | 2026-04-13T03:38:27.662191+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": 1093
} | 2026-04-13T03:38:27.662191+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": 4537
} | 2026-04-13T03:38:27.662191+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": 1727
} | 2026-04-13T03:38:27.662191+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": 2654
} | 2026-04-13T03:38:27.662191+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": 3172
} | 2026-04-13T03:38:27.662191+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": 3084
} | 2026-04-13T03:38:27.662191+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": 6238
} | 2026-04-13T03:38:27.662191+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": 4206
} | 2026-04-13T03:38:27.662191+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": 80311
} | 2026-04-13T03:38:27.662191+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": 509
} | 2026-04-13T03:38:27.662191+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": 346
} | 2026-04-13T03:38:27.662191+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": 344
} | 2026-04-13T03:38:27.662191+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": 556
} | 2026-04-13T03:38:27.662191+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": 750
} | 2026-04-13T03:38:27.662191+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": 494
} | 2026-04-13T03:38:27.662191+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": 783
} | 2026-04-13T03:38:27.662191+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": 846
} | 2026-04-13T03:38:27.662191+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": 117
} | 2026-04-13T03:38:27.662191+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": 581
} | 2026-04-13T03:38:27.662191+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": 1568
} | 2026-04-13T03:38:27.662191+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": 2282
} | 2026-04-13T03:38:27.662191+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": 3034
} | 2026-04-13T03:38:27.662191+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": 6148
} | 2026-04-13T03:38:27.662191+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": 18418
} | 2026-04-13T03:38:27.662191+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": 173
} | 2026-04-13T03:38:27.662191+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": 500
} | 2026-04-13T03:38:27.662191+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": 149
} | 2026-04-13T03:38:27.662191+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": 1778
} | 2026-04-13T03:38:27.662191+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": 6505
} | 2026-04-13T03:38:27.662191+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": 185
} | 2026-04-13T03:38:27.662191+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": 479
} | 2026-04-13T03:38:27.662191+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": 721
} | 2026-04-13T03:38:27.662191+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": 844
} | 2026-04-13T03:38:27.662191+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": 660
} | 2026-04-13T03:38:27.662191+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": 1660
} | 2026-04-13T03:38:27.662191+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": 9226
} | 2026-04-13T03:38:27.662191+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": 816
} | 2026-04-13T03:38:27.662191+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": 7349
} | 2026-04-13T03:38:27.662191+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": 346
} | 2026-04-13T03:38:27.662191+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": 3502
} | 2026-04-13T03:38:27.662191+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": 8749
} | 2026-04-13T03:38:27.662191+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": 2826
} | 2026-04-13T03:38:27.662191+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": 2059
} | 2026-04-13T03:38:27.662191+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": 808
} | 2026-04-13T03:38:27.662191+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": 8544
} | 2026-04-13T03:38:27.662191+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": 462
} | 2026-04-13T03:38:27.662191+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": 591
} | 2026-04-13T03:38:27.662191+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": 482
} | 2026-04-13T03:38:27.662191+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": 380
} | 2026-04-13T03:38:27.662191+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": 454
} | 2026-04-13T03:38:27.662191+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": 213
} | 2026-04-13T03:38:27.662191+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": 241
} | 2026-04-13T03:38:27.662191+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": 310
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:178-D3 | codeforces | 178-D3 | Magic Squares | https://codeforces.com/problemset/problem/178/D3 | [] | null | null | stdin_stdout | 2,100 | {
"solved_count": 270
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:178-D2 | codeforces | 178-D2 | Magic Squares | https://codeforces.com/problemset/problem/178/D2 | [] | null | null | stdin_stdout | 1,900 | {
"solved_count": 323
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:178-D1 | codeforces | 178-D1 | Magic Squares | https://codeforces.com/problemset/problem/178/D1 | [] | null | null | stdin_stdout | 1,500 | {
"solved_count": 730
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:178-C3 | codeforces | 178-C3 | Smart Beaver and Resolving Collisions | https://codeforces.com/problemset/problem/178/C3 | [] | null | null | stdin_stdout | 2,000 | {
"solved_count": 355
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:178-C2 | codeforces | 178-C2 | Smart Beaver and Resolving Collisions | https://codeforces.com/problemset/problem/178/C2 | [] | null | null | stdin_stdout | 1,900 | {
"solved_count": 336
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:178-C1 | codeforces | 178-C1 | Smart Beaver and Resolving Collisions | https://codeforces.com/problemset/problem/178/C1 | [] | null | null | stdin_stdout | 1,600 | {
"solved_count": 583
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:178-B3 | codeforces | 178-B3 | Greedy Merchants | https://codeforces.com/problemset/problem/178/B3 | [] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1516
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:178-B2 | codeforces | 178-B2 | Greedy Merchants | https://codeforces.com/problemset/problem/178/B2 | [] | null | null | stdin_stdout | 1,600 | {
"solved_count": 766
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:178-B1 | codeforces | 178-B1 | Greedy Merchants | https://codeforces.com/problemset/problem/178/B1 | [] | null | null | stdin_stdout | 1,600 | {
"solved_count": 862
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:178-A3 | codeforces | 178-A3 | Educational Game | https://codeforces.com/problemset/problem/178/A3 | [
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 1594
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:178-A2 | codeforces | 178-A2 | Educational Game | https://codeforces.com/problemset/problem/178/A2 | [
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 1848
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:178-A1 | codeforces | 178-A1 | Educational Game | https://codeforces.com/problemset/problem/178/A1 | [] | null | null | stdin_stdout | 1,000 | {
"solved_count": 1828
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:177-G2 | codeforces | 177-G2 | Fibonacci Strings | https://codeforces.com/problemset/problem/177/G2 | [
"matrices",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 240
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:177-G1 | codeforces | 177-G1 | Fibonacci Strings | https://codeforces.com/problemset/problem/177/G1 | [
"strings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 223
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:177-F2 | codeforces | 177-F2 | Script Generation | https://codeforces.com/problemset/problem/177/F2 | [] | null | null | stdin_stdout | 2,300 | {
"solved_count": 238
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:177-F1 | codeforces | 177-F1 | Script Generation | https://codeforces.com/problemset/problem/177/F1 | [] | null | null | stdin_stdout | 1,800 | {
"solved_count": 364
} | 2026-04-13T03:38:27.662191+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.