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:626-A | codeforces | 626-A | Robot Sequence | https://codeforces.com/problemset/problem/626/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 6934
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:625-E | codeforces | 625-E | Frog Fights | https://codeforces.com/problemset/problem/625/E | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 423
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:625-D | codeforces | 625-D | Finals in arithmetic | https://codeforces.com/problemset/problem/625/D | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 709
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:625-C | codeforces | 625-C | K-special Tables | https://codeforces.com/problemset/problem/625/C | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 7204
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:625-B | codeforces | 625-B | War of the Corporations | https://codeforces.com/problemset/problem/625/B | [
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 11681
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:625-A | codeforces | 625-A | Guest From the Past | https://codeforces.com/problemset/problem/625/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5683
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:624-B | codeforces | 624-B | Making a String | https://codeforces.com/problemset/problem/624/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 8471
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:624-A | codeforces | 624-A | Save Luke | https://codeforces.com/problemset/problem/624/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 11232
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:623-E | codeforces | 623-E | Transforming Sequence | https://codeforces.com/problemset/problem/623/E | [
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 726
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:623-D | codeforces | 623-D | Birthday | https://codeforces.com/problemset/problem/623/D | [
"greedy",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 586
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:623-C | codeforces | 623-C | Electric Charges | https://codeforces.com/problemset/problem/623/C | [
"binary search",
"dp"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 590
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:623-B | codeforces | 623-B | Array GCD | https://codeforces.com/problemset/problem/623/B | [
"dp",
"greedy",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2424
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:623-A | codeforces | 623-A | Graph and String | https://codeforces.com/problemset/problem/623/A | [
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4822
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:622-F | codeforces | 622-F | The Sum of the k-th Powers | https://codeforces.com/problemset/problem/622/F | [
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 5137
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:622-E | codeforces | 622-E | Ants in Leaves | https://codeforces.com/problemset/problem/622/E | [
"dfs and similar",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2534
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:622-D | codeforces | 622-D | Optimal Number Permutation | https://codeforces.com/problemset/problem/622/D | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3447
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:622-C | codeforces | 622-C | Not Equal on a Segment | https://codeforces.com/problemset/problem/622/C | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7600
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:622-B | codeforces | 622-B | The Time | https://codeforces.com/problemset/problem/622/B | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 11081
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:622-A | codeforces | 622-A | Infinite Sequence | https://codeforces.com/problemset/problem/622/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 10329
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:621-E | codeforces | 621-E | Wet Shark and Blocks | https://codeforces.com/problemset/problem/621/E | [
"dp",
"matrices"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3370
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:621-D | codeforces | 621-D | Rat Kwesh and Cheese | https://codeforces.com/problemset/problem/621/D | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1127
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:621-C | codeforces | 621-C | Wet Shark and Flowers | https://codeforces.com/problemset/problem/621/C | [
"combinatorics",
"math",
"number theory",
"probabilities"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6461
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:621-B | codeforces | 621-B | Wet Shark and Bishops | https://codeforces.com/problemset/problem/621/B | [
"combinatorics",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11680
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:621-A | codeforces | 621-A | Wet Shark and Odd and Even | https://codeforces.com/problemset/problem/621/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 22917
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:620-F | codeforces | 620-F | Xors on Segments | https://codeforces.com/problemset/problem/620/F | [
"data structures",
"strings",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 914
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:620-E | codeforces | 620-E | New Year Tree | https://codeforces.com/problemset/problem/620/E | [
"bitmasks",
"data structures",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 7524
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:620-D | codeforces | 620-D | Professor GukiZ and Two Arrays | https://codeforces.com/problemset/problem/620/D | [
"binary search",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2061
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:620-C | codeforces | 620-C | Pearls in a Row | https://codeforces.com/problemset/problem/620/C | [
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8013
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:620-B | codeforces | 620-B | Grandfather Dovlet’s calculator | https://codeforces.com/problemset/problem/620/B | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 10621
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:620-A | codeforces | 620-A | Professor GukiZ's Robot | https://codeforces.com/problemset/problem/620/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14763
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:618-G | codeforces | 618-G | Combining Slimes | https://codeforces.com/problemset/problem/618/G | [
"dp",
"math",
"matrices",
"probabilities"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 274
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:618-F | codeforces | 618-F | Double Knapsack | https://codeforces.com/problemset/problem/618/F | [
"constructive algorithms",
"two pointers"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 2132
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:618-E | codeforces | 618-E | Robot Arm | https://codeforces.com/problemset/problem/618/E | [
"data structures",
"geometry"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 727
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:618-D | codeforces | 618-D | Hamiltonian Spanning Tree | https://codeforces.com/problemset/problem/618/D | [
"dfs and similar",
"dp",
"graph matchings",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2057
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:618-C | codeforces | 618-C | Constellation | https://codeforces.com/problemset/problem/618/C | [
"geometry",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4735
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:618-B | codeforces | 618-B | Guess the Permutation | https://codeforces.com/problemset/problem/618/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 8379
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:618-A | codeforces | 618-A | Slime Combining | https://codeforces.com/problemset/problem/618/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 8892
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:617-E | codeforces | 617-E | XOR and Favorite Number | https://codeforces.com/problemset/problem/617/E | [
"data structures"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 11067
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:617-D | codeforces | 617-D | Polyline | https://codeforces.com/problemset/problem/617/D | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4460
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:617-C | codeforces | 617-C | Watering Flowers | https://codeforces.com/problemset/problem/617/C | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5288
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:617-B | codeforces | 617-B | Chocolate | https://codeforces.com/problemset/problem/617/B | [
"combinatorics"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 20371
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:617-A | codeforces | 617-A | Elephant | https://codeforces.com/problemset/problem/617/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 259060
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:616-F | codeforces | 616-F | Expensive Strings | https://codeforces.com/problemset/problem/616/F | [
"data structures",
"sortings",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 778
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:616-E | codeforces | 616-E | Sum of Remainders | https://codeforces.com/problemset/problem/616/E | [
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3735
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:616-D | codeforces | 616-D | Longest k-Good Segment | https://codeforces.com/problemset/problem/616/D | [
"binary search",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13085
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:616-C | codeforces | 616-C | The Labyrinth | https://codeforces.com/problemset/problem/616/C | [
"dfs and similar"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6957
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:616-B | codeforces | 616-B | Dinner with Emma | https://codeforces.com/problemset/problem/616/B | [
"games",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 13309
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:616-A | codeforces | 616-A | Comparing Two Long Integers | https://codeforces.com/problemset/problem/616/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 10946
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:615-E | codeforces | 615-E | Hexagons | https://codeforces.com/problemset/problem/615/E | [
"binary search",
"implementation",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1108
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:615-D | codeforces | 615-D | Multipliers | https://codeforces.com/problemset/problem/615/D | [
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4360
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:615-C | codeforces | 615-C | Running Track | https://codeforces.com/problemset/problem/615/C | [
"dp",
"greedy",
"strings",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2494
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:615-B | codeforces | 615-B | Longtail Hedgehog | https://codeforces.com/problemset/problem/615/B | [
"dp",
"graphs"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5824
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:615-A | codeforces | 615-A | Bulbs | https://codeforces.com/problemset/problem/615/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20745
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:614-B | codeforces | 614-B | Gena's Code | https://codeforces.com/problemset/problem/614/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7325
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:614-A | codeforces | 614-A | Link/Cut Tree | https://codeforces.com/problemset/problem/614/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7860
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:613-E | codeforces | 613-E | Puzzle Lover | https://codeforces.com/problemset/problem/613/E | [
"dp",
"hashing",
"strings"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 542
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:613-D | codeforces | 613-D | Kingdom and its Cities | https://codeforces.com/problemset/problem/613/D | [
"dfs and similar",
"divide and conquer",
"dp",
"graphs",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 4300
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:613-C | codeforces | 613-C | Necklace | https://codeforces.com/problemset/problem/613/C | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1113
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:613-B | codeforces | 613-B | Skills | https://codeforces.com/problemset/problem/613/B | [
"binary search",
"brute force",
"dp",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2498
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:613-A | codeforces | 613-A | Peter and Snow Blower | https://codeforces.com/problemset/problem/613/A | [
"binary search",
"geometry",
"ternary search"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3474
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:612-F | codeforces | 612-F | Simba on the Circle | https://codeforces.com/problemset/problem/612/F | [
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 491
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:612-E | codeforces | 612-E | Square Root of Permutation | https://codeforces.com/problemset/problem/612/E | [
"combinatorics",
"constructive algorithms",
"dfs and similar",
"graphs",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2128
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:612-D | codeforces | 612-D | The Union of k-Segments | https://codeforces.com/problemset/problem/612/D | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4480
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:612-C | codeforces | 612-C | Replace To Make Regular Bracket Sequence | https://codeforces.com/problemset/problem/612/C | [
"data structures",
"expression parsing",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10163
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:612-B | codeforces | 612-B | HDD is Outdated Technology | https://codeforces.com/problemset/problem/612/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 7667
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:612-A | codeforces | 612-A | The Text Splitting | https://codeforces.com/problemset/problem/612/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 7917
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:611-H | codeforces | 611-H | New Year and Forgotten Tree | https://codeforces.com/problemset/problem/611/H | [
"constructive algorithms",
"flows",
"graphs"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 868
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:611-G | codeforces | 611-G | New Year and Cake | https://codeforces.com/problemset/problem/611/G | [
"geometry",
"two pointers"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 501
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:611-F | codeforces | 611-F | New Year and Cleaning | https://codeforces.com/problemset/problem/611/F | [
"binary search",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 563
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:611-E | codeforces | 611-E | New Year and Three Musketeers | https://codeforces.com/problemset/problem/611/E | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 930
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:611-D | codeforces | 611-D | New Year and Ancient Prophecy | https://codeforces.com/problemset/problem/611/D | [
"dp",
"hashing",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2807
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:611-C | codeforces | 611-C | New Year and Domino | https://codeforces.com/problemset/problem/611/C | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9129
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:611-B | codeforces | 611-B | New Year and Old Property | https://codeforces.com/problemset/problem/611/B | [
"bitmasks",
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11270
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:611-A | codeforces | 611-A | New Year and Days | https://codeforces.com/problemset/problem/611/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 12255
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:610-E | codeforces | 610-E | Alphabet Permutations | https://codeforces.com/problemset/problem/610/E | [
"data structures",
"strings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1097
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:610-D | codeforces | 610-D | Vika and Segments | https://codeforces.com/problemset/problem/610/D | [
"constructive algorithms",
"data structures",
"geometry",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1777
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:610-C | codeforces | 610-C | Harmony Analysis | https://codeforces.com/problemset/problem/610/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2988
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:610-B | codeforces | 610-B | Vika and Squares | https://codeforces.com/problemset/problem/610/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 8416
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:610-A | codeforces | 610-A | Pasha and Stick | https://codeforces.com/problemset/problem/610/A | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 28197
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:609-F | codeforces | 609-F | Frogs and mosquitoes | https://codeforces.com/problemset/problem/609/F | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1673
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:609-E | codeforces | 609-E | Minimum spanning tree for each edge | https://codeforces.com/problemset/problem/609/E | [
"data structures",
"dfs and similar",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 10833
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:609-D | codeforces | 609-D | Gadgets for dollars and pounds | https://codeforces.com/problemset/problem/609/D | [
"binary search",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3251
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:609-C | codeforces | 609-C | Load Balancing | https://codeforces.com/problemset/problem/609/C | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7500
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:609-B | codeforces | 609-B | The Best Gift | https://codeforces.com/problemset/problem/609/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10197
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:609-A | codeforces | 609-A | USB Flash Drives | https://codeforces.com/problemset/problem/609/A | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19658
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:608-B | codeforces | 608-B | Hamming Distance Sum | https://codeforces.com/problemset/problem/608/B | [
"combinatorics",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7580
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:608-A | codeforces | 608-A | Saitama Destroys Hotel | https://codeforces.com/problemset/problem/608/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 10043
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:607-E | codeforces | 607-E | Cross Sum | https://codeforces.com/problemset/problem/607/E | [
"binary search",
"geometry"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 369
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:607-D | codeforces | 607-D | Power Tree | https://codeforces.com/problemset/problem/607/D | [
"data structures",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 690
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:607-C | codeforces | 607-C | Marbles | https://codeforces.com/problemset/problem/607/C | [
"hashing",
"strings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 855
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:607-B | codeforces | 607-B | Zuma | https://codeforces.com/problemset/problem/607/B | [
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 17255
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:607-A | codeforces | 607-A | Chain Reaction | https://codeforces.com/problemset/problem/607/A | [
"binary search",
"dp"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11095
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:606-B | codeforces | 606-B | Testing Robots | https://codeforces.com/problemset/problem/606/B | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2861
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:606-A | codeforces | 606-A | Magic Spheres | https://codeforces.com/problemset/problem/606/A | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8334
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:605-E | codeforces | 605-E | Intergalaxy Trips | https://codeforces.com/problemset/problem/605/E | [
"probabilities",
"shortest paths"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1623
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:605-D | codeforces | 605-D | Board Game | https://codeforces.com/problemset/problem/605/D | [
"data structures",
"dfs and similar"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 974
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:605-C | codeforces | 605-C | Freelancer's Dreams | https://codeforces.com/problemset/problem/605/C | [
"geometry"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1329
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:605-B | codeforces | 605-B | Lazy Student | https://codeforces.com/problemset/problem/605/B | [
"constructive algorithms",
"data structures",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3898
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:605-A | codeforces | 605-A | Sorting Railway Cars | https://codeforces.com/problemset/problem/605/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7649
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:604-B | codeforces | 604-B | More Cowbell | https://codeforces.com/problemset/problem/604/B | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9063
} | 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.