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: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": 1268
} | 2026-06-01T05:00:40.145500+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": 551
} | 2026-06-01T05:00:40.145500+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": 1663
} | 2026-06-01T05:00:40.145500+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": 4942
} | 2026-06-01T05:00:40.145500+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": 543
} | 2026-06-01T05:00:40.145500+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": 519
} | 2026-06-01T05:00:40.145500+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": 1088
} | 2026-06-01T05:00:40.145500+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": 197
} | 2026-06-01T05:00:40.145500+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": 177
} | 2026-06-01T05:00:40.145500+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": 197
} | 2026-06-01T05:00:40.145500+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": 589
} | 2026-06-01T05:00:40.145500+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": 437
} | 2026-06-01T05:00:40.145500+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": 1553
} | 2026-06-01T05:00:40.145500+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": 710
} | 2026-06-01T05:00:40.145500+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": 545
} | 2026-06-01T05:00:40.145500+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": 607
} | 2026-06-01T05:00:40.145500+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": 669
} | 2026-06-01T05:00:40.145500+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": 593
} | 2026-06-01T05:00:40.145500+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": 1783
} | 2026-06-01T05:00:40.145500+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": 1499
} | 2026-06-01T05:00:40.145500+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": 2299
} | 2026-06-01T05:00:40.145500+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": 2891
} | 2026-06-01T05:00:40.145500+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": 7736
} | 2026-06-01T05:00:40.145500+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": 12341
} | 2026-06-01T05:00:40.145500+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": 397
} | 2026-06-01T05:00:40.145500+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": 578
} | 2026-06-01T05:00:40.145500+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": 2008
} | 2026-06-01T05:00:40.145500+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": 1619
} | 2026-06-01T05:00:40.145500+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": 2177
} | 2026-06-01T05:00:40.145500+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": 605
} | 2026-06-01T05:00:40.145500+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": 1698
} | 2026-06-01T05:00:40.145500+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": 5959
} | 2026-06-01T05:00:40.145500+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": 54978
} | 2026-06-01T05:00:40.145500+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": 65356
} | 2026-06-01T05:00:40.145500+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": 13469
} | 2026-06-01T05:00:40.145500+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": 5364
} | 2026-06-01T05:00:40.145500+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": 1584
} | 2026-06-01T05:00:40.145500+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": 783
} | 2026-06-01T05:00:40.145500+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": 551
} | 2026-06-01T05:00:40.145500+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": 4340
} | 2026-06-01T05:00:40.145500+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": 4226
} | 2026-06-01T05:00:40.145500+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": 299
} | 2026-06-01T05:00:40.145500+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": 186
} | 2026-06-01T05:00:40.145500+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": 1494
} | 2026-06-01T05:00:40.145500+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": 819
} | 2026-06-01T05:00:40.145500+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": 532
} | 2026-06-01T05:00:40.145500+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": 327
} | 2026-06-01T05:00:40.145500+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": 639
} | 2026-06-01T05:00:40.145500+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": 519
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:306-A | codeforces | 306-A | Candies | https://codeforces.com/problemset/problem/306/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 8203
} | 2026-06-01T05:00:40.145500+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": 734
} | 2026-06-01T05:00:40.145500+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": 555
} | 2026-06-01T05:00:40.145500+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": 2667
} | 2026-06-01T05:00:40.145500+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": 2290
} | 2026-06-01T05:00:40.145500+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": 5228
} | 2026-06-01T05:00:40.145500+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": 3162
} | 2026-06-01T05:00:40.145500+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": 12076
} | 2026-06-01T05:00:40.145500+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": 390
} | 2026-06-01T05:00:40.145500+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": 353
} | 2026-06-01T05:00:40.145500+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": 967
} | 2026-06-01T05:00:40.145500+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": 1427
} | 2026-06-01T05:00:40.145500+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": 8592
} | 2026-06-01T05:00:40.145500+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": 9434
} | 2026-06-01T05:00:40.145500+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": 9780
} | 2026-06-01T05:00:40.145500+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": 406
} | 2026-06-01T05:00:40.145500+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": 3047
} | 2026-06-01T05:00:40.145500+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": 488
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:301-B | codeforces | 301-B | Yaroslav and Time | https://codeforces.com/problemset/problem/301/B | [
"binary search",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2846
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:301-A | codeforces | 301-A | Yaroslav and Sequence | https://codeforces.com/problemset/problem/301/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3259
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:300-E | codeforces | 300-E | Empire Strikes Back | https://codeforces.com/problemset/problem/300/E | [
"binary search",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1112
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:300-D | codeforces | 300-D | Painting Square | https://codeforces.com/problemset/problem/300/D | [
"dp",
"fft"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 858
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:300-C | codeforces | 300-C | Beautiful Numbers | https://codeforces.com/problemset/problem/300/C | [
"brute force",
"combinatorics"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 11996
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:300-B | codeforces | 300-B | Coach | https://codeforces.com/problemset/problem/300/B | [
"brute force",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7201
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:300-A | codeforces | 300-A | Array | https://codeforces.com/problemset/problem/300/A | [
"brute force",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 27725
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:299-B | codeforces | 299-B | Ksusha the Squirrel | https://codeforces.com/problemset/problem/299/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 6466
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:299-A | codeforces | 299-A | Ksusha and Array | https://codeforces.com/problemset/problem/299/A | [
"brute force",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 9480
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:298-B | codeforces | 298-B | Sail | https://codeforces.com/problemset/problem/298/B | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 15842
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:298-A | codeforces | 298-A | Snow Footprints | https://codeforces.com/problemset/problem/298/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11678
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:297-E | codeforces | 297-E | Mystic Carvings | https://codeforces.com/problemset/problem/297/E | [
"data structures"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 433
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:297-D | codeforces | 297-D | Color the Carpet | https://codeforces.com/problemset/problem/297/D | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 628
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:297-C | codeforces | 297-C | Splitting the Uniqueness | https://codeforces.com/problemset/problem/297/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1022
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:297-B | codeforces | 297-B | Fish Weight | https://codeforces.com/problemset/problem/297/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 3771
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:297-A | codeforces | 297-A | Parity Game | https://codeforces.com/problemset/problem/297/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3863
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:296-B | codeforces | 296-B | Yaroslav and Two Strings | https://codeforces.com/problemset/problem/296/B | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2698
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:296-A | codeforces | 296-A | Yaroslav and Permutations | https://codeforces.com/problemset/problem/296/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 26120
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:295-E | codeforces | 295-E | Yaroslav and Points | https://codeforces.com/problemset/problem/295/E | [
"data structures"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 824
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:295-D | codeforces | 295-D | Greg and Caves | https://codeforces.com/problemset/problem/295/D | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 741
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:295-C | codeforces | 295-C | Greg and Friends | https://codeforces.com/problemset/problem/295/C | [
"combinatorics",
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1942
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:295-B | codeforces | 295-B | Greg and Graph | https://codeforces.com/problemset/problem/295/B | [
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 17841
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:295-A | codeforces | 295-A | Greg and Array | https://codeforces.com/problemset/problem/295/A | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 26335
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:294-E | codeforces | 294-E | Shaass the Great | https://codeforces.com/problemset/problem/294/E | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1119
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:294-D | codeforces | 294-D | Shaass and Painter Robot | https://codeforces.com/problemset/problem/294/D | [
"brute force",
"implementation",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 378
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:294-C | codeforces | 294-C | Shaass and Lights | https://codeforces.com/problemset/problem/294/C | [
"combinatorics",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4385
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:294-B | codeforces | 294-B | Shaass and Bookshelf | https://codeforces.com/problemset/problem/294/B | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5053
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:294-A | codeforces | 294-A | Shaass and Oskols | https://codeforces.com/problemset/problem/294/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28537
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:293-E | codeforces | 293-E | Close Vertices | https://codeforces.com/problemset/problem/293/E | [
"data structures",
"divide and conquer",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 2006
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:293-D | codeforces | 293-D | Ksusha and Square | https://codeforces.com/problemset/problem/293/D | [
"geometry",
"math",
"probabilities",
"two pointers"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 261
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:293-C | codeforces | 293-C | Cube Problem | https://codeforces.com/problemset/problem/293/C | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 636
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:293-B | codeforces | 293-B | Distinct Paths | https://codeforces.com/problemset/problem/293/B | [
"brute force",
"combinatorics"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 942
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:293-A | codeforces | 293-A | Weird Game | https://codeforces.com/problemset/problem/293/A | [
"games",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3201
} | 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.