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:329-A | codeforces | 329-A | Purification | https://codeforces.com/problemset/problem/329/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4855
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:328-B | codeforces | 328-B | Sheldon and Ice Pieces | https://codeforces.com/problemset/problem/328/B | [
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 1600
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:328-A | codeforces | 328-A | IQ Test | https://codeforces.com/problemset/problem/328/A | [
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2433
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:327-E | codeforces | 327-E | Axis Walking | https://codeforces.com/problemset/problem/327/E | [
"bitmasks",
"combinatorics",
"constructive algorithms",
"dp",
"meet-in-the-middle"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1638
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:327-D | codeforces | 327-D | Block Tower | https://codeforces.com/problemset/problem/327/D | [
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2529
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:327-C | codeforces | 327-C | Magic Five | https://codeforces.com/problemset/problem/327/C | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3712
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:327-B | codeforces | 327-B | Hungry Sequence | https://codeforces.com/problemset/problem/327/B | [
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 21863
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:327-A | codeforces | 327-A | Flipping Game | https://codeforces.com/problemset/problem/327/A | [
"brute force",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 51625
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:325-E | codeforces | 325-E | The Red Button | https://codeforces.com/problemset/problem/325/E | [
"combinatorics",
"dfs and similar",
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1027
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:325-D | codeforces | 325-D | Reclamation | https://codeforces.com/problemset/problem/325/D | [
"dsu"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 601
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:325-C | codeforces | 325-C | Monsters and Diamonds | https://codeforces.com/problemset/problem/325/C | [
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 499
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:325-B | codeforces | 325-B | Stadium and Games | https://codeforces.com/problemset/problem/325/B | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1682
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:325-A | codeforces | 325-A | Square and Rectangles | https://codeforces.com/problemset/problem/325/A | [
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 2317
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:323-C | codeforces | 323-C | Two permutations | https://codeforces.com/problemset/problem/323/C | [
"data structures"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 710
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:323-B | codeforces | 323-B | Tournament-graph | https://codeforces.com/problemset/problem/323/B | [
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 498
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:323-A | codeforces | 323-A | Black-and-White Cube | https://codeforces.com/problemset/problem/323/A | [
"combinatorics",
"constructive algorithms"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 977
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:322-B | codeforces | 322-B | Ciel and Flowers | https://codeforces.com/problemset/problem/322/B | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13332
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:322-A | codeforces | 322-A | Ciel and Dancing | https://codeforces.com/problemset/problem/322/A | [
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 9075
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:321-E | codeforces | 321-E | Ciel and Gondolas | https://codeforces.com/problemset/problem/321/E | [
"data structures",
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 6625
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:321-D | codeforces | 321-D | Ciel and Flipboard | https://codeforces.com/problemset/problem/321/D | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 658
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:321-C | codeforces | 321-C | Ciel the Commander | https://codeforces.com/problemset/problem/321/C | [
"constructive algorithms",
"dfs and similar",
"divide and conquer",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 9818
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:321-B | codeforces | 321-B | Ciel and Duel | https://codeforces.com/problemset/problem/321/B | [
"dp",
"flows",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3938
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:321-A | codeforces | 321-A | Ciel and Robot | https://codeforces.com/problemset/problem/321/A | [
"binary search",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3929
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:320-B | codeforces | 320-B | Ping-Pong (Easy Version) | https://codeforces.com/problemset/problem/320/B | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7871
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:320-A | codeforces | 320-A | Magic Numbers | https://codeforces.com/problemset/problem/320/A | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 46299
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:319-E | codeforces | 319-E | Ping-Pong | https://codeforces.com/problemset/problem/319/E | [
"data structures"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 818
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:319-D | codeforces | 319-D | Have You Ever Heard About the Word? | https://codeforces.com/problemset/problem/319/D | [
"greedy",
"hashing",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 791
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:319-C | codeforces | 319-C | Kalila and Dimna in the Logging Industry | https://codeforces.com/problemset/problem/319/C | [
"dp",
"geometry"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 6906
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:319-B | codeforces | 319-B | Psychos in a Line | https://codeforces.com/problemset/problem/319/B | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4902
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:319-A | codeforces | 319-A | Malek Dance Club | https://codeforces.com/problemset/problem/319/A | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 3043
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:318-B | codeforces | 318-B | Strings of Power | https://codeforces.com/problemset/problem/318/B | [
"implementation",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 8381
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:318-A | codeforces | 318-A | Even Odds | https://codeforces.com/problemset/problem/318/A | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 147209
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:317-E | codeforces | 317-E | Princess and Her Shadow | https://codeforces.com/problemset/problem/317/E | [
"constructive algorithms",
"shortest paths"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 175
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:317-D | codeforces | 317-D | Game with Powers | https://codeforces.com/problemset/problem/317/D | [
"dp",
"games"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1302
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:317-C | codeforces | 317-C | Balance | https://codeforces.com/problemset/problem/317/C | [
"constructive algorithms",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 584
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:317-B | codeforces | 317-B | Ants | https://codeforces.com/problemset/problem/317/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1687
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:317-A | codeforces | 317-A | Perfect Pair | https://codeforces.com/problemset/problem/317/A | [
"brute force"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4957
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:316-G3 | codeforces | 316-G3 | Good Substrings | https://codeforces.com/problemset/problem/316/G3 | [
"string suffix structures"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 546
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:316-G2 | codeforces | 316-G2 | Good Substrings | https://codeforces.com/problemset/problem/316/G2 | [
"string suffix structures"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 521
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:316-G1 | codeforces | 316-G1 | Good Substrings | https://codeforces.com/problemset/problem/316/G1 | [
"hashing",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1093
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:316-F3 | codeforces | 316-F3 | Suns and Rays | https://codeforces.com/problemset/problem/316/F3 | [
"constructive algorithms",
"dfs and similar",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 198
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:316-F2 | codeforces | 316-F2 | Suns and Rays | https://codeforces.com/problemset/problem/316/F2 | [] | null | null | stdin_stdout | 2,300 | {
"solved_count": 178
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:316-F1 | codeforces | 316-F1 | Suns and Rays | https://codeforces.com/problemset/problem/316/F1 | [
"dfs and similar",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 203
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:316-E3 | codeforces | 316-E3 | Summer Homework | https://codeforces.com/problemset/problem/316/E3 | [
"data structures",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 591
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:316-E2 | codeforces | 316-E2 | Summer Homework | https://codeforces.com/problemset/problem/316/E2 | [
"data structures",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 439
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:316-E1 | codeforces | 316-E1 | Summer Homework | https://codeforces.com/problemset/problem/316/E1 | [
"brute force",
"data structures"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 1561
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:316-D3 | codeforces | 316-D3 | PE Lesson | https://codeforces.com/problemset/problem/316/D3 | [
"dp",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 747
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:316-D2 | codeforces | 316-D2 | PE Lesson | https://codeforces.com/problemset/problem/316/D2 | [
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 551
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:316-D1 | codeforces | 316-D1 | PE Lesson | https://codeforces.com/problemset/problem/316/D1 | [
"brute force",
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 631
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:316-C2 | codeforces | 316-C2 | Tidying Up | https://codeforces.com/problemset/problem/316/C2 | [
"flows",
"graph matchings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 670
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:316-C1 | codeforces | 316-C1 | Tidying Up | https://codeforces.com/problemset/problem/316/C1 | [
"flows"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 615
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:316-B2 | codeforces | 316-B2 | EKG | https://codeforces.com/problemset/problem/316/B2 | [
"dfs and similar",
"dp"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 1794
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:316-B1 | codeforces | 316-B1 | EKG | https://codeforces.com/problemset/problem/316/B1 | [
"brute force",
"dfs and similar"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 1506
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:316-A2 | codeforces | 316-A2 | Special Task | https://codeforces.com/problemset/problem/316/A2 | [
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 2311
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:316-A1 | codeforces | 316-A1 | Special Task | https://codeforces.com/problemset/problem/316/A1 | [
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 2907
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:315-B | codeforces | 315-B | Sereja and Array | https://codeforces.com/problemset/problem/315/B | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 7799
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:315-A | codeforces | 315-A | Sereja and Bottles | https://codeforces.com/problemset/problem/315/A | [
"brute force"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12442
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:314-E | codeforces | 314-E | Sereja and Squares | https://codeforces.com/problemset/problem/314/E | [
"dp"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 440
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:314-D | codeforces | 314-D | Sereja and Straight Lines | https://codeforces.com/problemset/problem/314/D | [
"binary search",
"data structures",
"geometry",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 620
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:314-C | codeforces | 314-C | Sereja and Subsequences | https://codeforces.com/problemset/problem/314/C | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2096
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:314-B | codeforces | 314-B | Sereja and Periods | https://codeforces.com/problemset/problem/314/B | [
"binary search",
"dfs and similar",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1654
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:314-A | codeforces | 314-A | Sereja and Contest | https://codeforces.com/problemset/problem/314/A | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2194
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:313-E | codeforces | 313-E | Ilya and Two Numbers | https://codeforces.com/problemset/problem/313/E | [
"constructive algorithms",
"data structures",
"dsu",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 635
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:313-D | codeforces | 313-D | Ilya and Roads | https://codeforces.com/problemset/problem/313/D | [
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1749
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:313-C | codeforces | 313-C | Ilya and Matrix | https://codeforces.com/problemset/problem/313/C | [
"constructive algorithms",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 5999
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:313-B | codeforces | 313-B | Ilya and Queries | https://codeforces.com/problemset/problem/313/B | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 56831
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:313-A | codeforces | 313-A | Ilya and Bank Account | https://codeforces.com/problemset/problem/313/A | [
"implementation",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 66437
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:312-B | codeforces | 312-B | Archer | https://codeforces.com/problemset/problem/312/B | [
"math",
"probabilities"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13791
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:312-A | codeforces | 312-A | Whose sentence is it? | https://codeforces.com/problemset/problem/312/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 5419
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:311-E | codeforces | 311-E | Biologist | https://codeforces.com/problemset/problem/311/E | [
"flows"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1674
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:311-D | codeforces | 311-D | Interval Cubing | https://codeforces.com/problemset/problem/311/D | [
"data structures",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 833
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:311-C | codeforces | 311-C | Fetch the Treasure | https://codeforces.com/problemset/problem/311/C | [
"brute force",
"data structures",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 602
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:311-B | codeforces | 311-B | Cats Transport | https://codeforces.com/problemset/problem/311/B | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 4490
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:311-A | codeforces | 311-A | The Closest Pair | https://codeforces.com/problemset/problem/311/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4246
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:309-E | codeforces | 309-E | Sheep | https://codeforces.com/problemset/problem/309/E | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 301
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:309-D | codeforces | 309-D | Tennis Rackets | https://codeforces.com/problemset/problem/309/D | [
"brute force",
"geometry"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 204
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:309-C | codeforces | 309-C | Memory for Arrays | https://codeforces.com/problemset/problem/309/C | [
"binary search",
"bitmasks",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1499
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:309-B | codeforces | 309-B | Context Advertising | https://codeforces.com/problemset/problem/309/B | [
"dp",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 966
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:309-A | codeforces | 309-A | Morning run | https://codeforces.com/problemset/problem/309/A | [
"binary search",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 559
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:306-D | codeforces | 306-D | Polygon | https://codeforces.com/problemset/problem/306/D | [
"constructive algorithms",
"geometry"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 340
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:306-C | codeforces | 306-C | White, Black and White Again | https://codeforces.com/problemset/problem/306/C | [
"combinatorics",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 665
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:306-B | codeforces | 306-B | Optimizer | https://codeforces.com/problemset/problem/306/B | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 534
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:306-A | codeforces | 306-A | Candies | https://codeforces.com/problemset/problem/306/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 8270
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:305-E | codeforces | 305-E | Playing with String | https://codeforces.com/problemset/problem/305/E | [
"games"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 794
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:305-D | codeforces | 305-D | Olya and Graph | https://codeforces.com/problemset/problem/305/D | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 583
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:305-C | codeforces | 305-C | Ivan and Powers of Two | https://codeforces.com/problemset/problem/305/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2679
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:305-B | codeforces | 305-B | Continued Fractions | https://codeforces.com/problemset/problem/305/B | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2320
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:305-A | codeforces | 305-A | Strange Addition | https://codeforces.com/problemset/problem/305/A | [
"brute force",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5263
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:304-B | codeforces | 304-B | Calendar | https://codeforces.com/problemset/problem/304/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 3181
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:304-A | codeforces | 304-A | Pythagorean Theorem II | https://codeforces.com/problemset/problem/304/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12189
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:303-E | codeforces | 303-E | Random Ranking | https://codeforces.com/problemset/problem/303/E | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 473
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:303-D | codeforces | 303-D | Rotatable Number | https://codeforces.com/problemset/problem/303/D | [
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 440
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:303-C | codeforces | 303-C | Minimum Modular | https://codeforces.com/problemset/problem/303/C | [
"brute force",
"graphs",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 988
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:303-B | codeforces | 303-B | Rectangle Puzzle II | https://codeforces.com/problemset/problem/303/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1433
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:303-A | codeforces | 303-A | Lucky Permutation Triple | https://codeforces.com/problemset/problem/303/A | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 8650
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:302-B | codeforces | 302-B | Eugeny and Play List | https://codeforces.com/problemset/problem/302/B | [
"binary search",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9531
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:302-A | codeforces | 302-A | Eugeny and Array | https://codeforces.com/problemset/problem/302/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 9846
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:301-E | codeforces | 301-E | Yaroslav and Arrangements | https://codeforces.com/problemset/problem/301/E | [
"dp"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 511
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:301-D | codeforces | 301-D | Yaroslav and Divisors | https://codeforces.com/problemset/problem/301/D | [
"data structures"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3154
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:301-C | codeforces | 301-C | Yaroslav and Algorithm | https://codeforces.com/problemset/problem/301/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 513
} | 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.