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:645-G | codeforces | 645-G | Armistice Area Apportionment | https://codeforces.com/problemset/problem/645/G | [
"binary search",
"geometry"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 195
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:645-F | codeforces | 645-F | Cowslip Collections | https://codeforces.com/problemset/problem/645/F | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1045
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:645-E | codeforces | 645-E | Intellectual Inquiry | https://codeforces.com/problemset/problem/645/E | [
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1438
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:645-D | codeforces | 645-D | Robot Rapping Results Report | https://codeforces.com/problemset/problem/645/D | [
"binary search",
"dp",
"graphs"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3490
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:645-C | codeforces | 645-C | Enduring Exodus | https://codeforces.com/problemset/problem/645/C | [
"binary search",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4474
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:645-B | codeforces | 645-B | Mischievous Mess Makers | https://codeforces.com/problemset/problem/645/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 3741
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:645-A | codeforces | 645-A | Amity Assessment | https://codeforces.com/problemset/problem/645/A | [
"brute force",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 3814
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:644-C | codeforces | 644-C | Hostname Aliases | https://codeforces.com/problemset/problem/644/C | [
"*special",
"binary search",
"data structures",
"implementation",
"sortings",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1028
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:644-B | codeforces | 644-B | Processing Queries | https://codeforces.com/problemset/problem/644/B | [
"*special",
"constructive algorithms",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2866
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:644-A | codeforces | 644-A | Parliament of Berland | https://codeforces.com/problemset/problem/644/A | [
"*special",
"constructive algorithms"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 4698
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:643-G | codeforces | 643-G | Choosing Ads | https://codeforces.com/problemset/problem/643/G | [
"data structures"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 1318
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:643-F | codeforces | 643-F | Bears and Juice | https://codeforces.com/problemset/problem/643/F | [
"dp",
"math",
"meet-in-the-middle"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 909
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:643-E | codeforces | 643-E | Bear and Destroying Subtrees | https://codeforces.com/problemset/problem/643/E | [
"dp",
"math",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 756
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:643-D | codeforces | 643-D | Bearish Fanpages | https://codeforces.com/problemset/problem/643/D | [] | null | null | stdin_stdout | 2,900 | {
"solved_count": 418
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:643-C | codeforces | 643-C | Levels and Regions | https://codeforces.com/problemset/problem/643/C | [
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1841
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:643-B | codeforces | 643-B | Bear and Two Paths | https://codeforces.com/problemset/problem/643/B | [
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 3431
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:643-A | codeforces | 643-A | Bear and Colors | https://codeforces.com/problemset/problem/643/A | [
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4847
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:641-G | codeforces | 641-G | Little Artem and Graph | https://codeforces.com/problemset/problem/641/G | [] | null | null | stdin_stdout | 2,300 | {
"solved_count": 136
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:641-F | codeforces | 641-F | Little Artem and 2-SAT | https://codeforces.com/problemset/problem/641/F | [] | null | null | stdin_stdout | 3,000 | {
"solved_count": 406
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:641-E | codeforces | 641-E | Little Artem and Time Machine | https://codeforces.com/problemset/problem/641/E | [
"data structures"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3980
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:641-D | codeforces | 641-D | Little Artem and Random Variable | https://codeforces.com/problemset/problem/641/D | [
"dp",
"implementation",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1605
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:641-C | codeforces | 641-C | Little Artem and Dance | https://codeforces.com/problemset/problem/641/C | [
"brute force",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3206
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:641-B | codeforces | 641-B | Little Artem and Matrix | https://codeforces.com/problemset/problem/641/B | [
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 4403
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:641-A | codeforces | 641-A | Little Artem and Grasshopper | https://codeforces.com/problemset/problem/641/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 6373
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:639-F | codeforces | 639-F | Bear and Chemistry | https://codeforces.com/problemset/problem/639/F | [
"data structures",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 632
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:639-E | codeforces | 639-E | Bear and Paradox | https://codeforces.com/problemset/problem/639/E | [
"binary search",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 662
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:639-D | codeforces | 639-D | Bear and Contribution | https://codeforces.com/problemset/problem/639/D | [
"data structures",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1102
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:639-C | codeforces | 639-C | Bear and Polynomials | https://codeforces.com/problemset/problem/639/C | [
"hashing",
"implementation",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1270
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:639-B | codeforces | 639-B | Bear and Forgotten Tree 3 | https://codeforces.com/problemset/problem/639/B | [
"constructive algorithms",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7031
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:639-A | codeforces | 639-A | Bear and Displayed Friends | https://codeforces.com/problemset/problem/639/A | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 6546
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:638-D | codeforces | 638-D | Three-dimensional Turtle Super Computer | https://codeforces.com/problemset/problem/638/D | [
"brute force",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 812
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:638-C | codeforces | 638-C | Road Improvement | https://codeforces.com/problemset/problem/638/C | [
"*special",
"dfs and similar",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2442
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:638-B | codeforces | 638-B | Making Genome in Berland | https://codeforces.com/problemset/problem/638/B | [
"*special",
"dfs and similar",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 2133
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:638-A | codeforces | 638-A | Home Numbers | https://codeforces.com/problemset/problem/638/A | [
"*special",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 4406
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:637-D | codeforces | 637-D | Running with Obstacles | https://codeforces.com/problemset/problem/637/D | [
"*special",
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2138
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:637-C | codeforces | 637-C | Promocodes with Mistakes | https://codeforces.com/problemset/problem/637/C | [
"*special",
"brute force",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 2536
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:637-B | codeforces | 637-B | Chat Order | https://codeforces.com/problemset/problem/637/B | [
"*special",
"binary search",
"constructive algorithms",
"data structures",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 24590
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:637-A | codeforces | 637-A | Voting for Photos | https://codeforces.com/problemset/problem/637/A | [
"*special",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 5896
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:635-A | codeforces | 635-A | Orchestra | https://codeforces.com/problemset/problem/635/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 3281
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:634-A | codeforces | 634-A | Island Puzzle | https://codeforces.com/problemset/problem/634/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 3470
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:633-H | codeforces | 633-H | Fibonacci-ish II | https://codeforces.com/problemset/problem/633/H | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 828
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:633-G | codeforces | 633-G | Yash And Trees | https://codeforces.com/problemset/problem/633/G | [
"bitmasks",
"data structures",
"dfs and similar",
"math",
"number theory"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 977
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:633-F | codeforces | 633-F | The Chocolate Spree | https://codeforces.com/problemset/problem/633/F | [
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1453
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:633-E | codeforces | 633-E | Startup Funding | https://codeforces.com/problemset/problem/633/E | [
"binary search",
"constructive algorithms",
"data structures",
"probabilities",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 658
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:633-D | codeforces | 633-D | Fibonacci-ish | https://codeforces.com/problemset/problem/633/D | [
"brute force",
"dp",
"hashing",
"implementation",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3090
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:633-C | codeforces | 633-C | Spy Syndrome 2 | https://codeforces.com/problemset/problem/633/C | [
"data structures",
"dp",
"hashing",
"implementation",
"sortings",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3463
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:633-B | codeforces | 633-B | A Trivial Problem | https://codeforces.com/problemset/problem/633/B | [
"brute force",
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 7326
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:633-A | codeforces | 633-A | Ebony and Ivory | https://codeforces.com/problemset/problem/633/A | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15009
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:632-F | codeforces | 632-F | Magic Matrix | https://codeforces.com/problemset/problem/632/F | [
"brute force",
"divide and conquer",
"graphs",
"matrices",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1347
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:632-E | codeforces | 632-E | Thief in a Shop | https://codeforces.com/problemset/problem/632/E | [
"divide and conquer",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 3718
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:632-D | codeforces | 632-D | Longest Subsequence | https://codeforces.com/problemset/problem/632/D | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4727
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:632-C | codeforces | 632-C | The Smallest String Concatenation | https://codeforces.com/problemset/problem/632/C | [
"sortings",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10969
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:632-B | codeforces | 632-B | Alice, Bob, Two Teams | https://codeforces.com/problemset/problem/632/B | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 4440
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:632-A | codeforces | 632-A | Grandma Laura and Apples | https://codeforces.com/problemset/problem/632/A | [] | null | null | stdin_stdout | 1,200 | {
"solved_count": 4998
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:631-E | codeforces | 631-E | Product Sum | https://codeforces.com/problemset/problem/631/E | [
"data structures",
"dp",
"geometry"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 3383
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:631-D | codeforces | 631-D | Messenger | https://codeforces.com/problemset/problem/631/D | [
"data structures",
"hashing",
"implementation",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2499
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:631-C | codeforces | 631-C | Report | https://codeforces.com/problemset/problem/631/C | [
"data structures",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4482
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:631-B | codeforces | 631-B | Print Check | https://codeforces.com/problemset/problem/631/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 7928
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:631-A | codeforces | 631-A | Interview | https://codeforces.com/problemset/problem/631/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 9805
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:630-R | codeforces | 630-R | Game | https://codeforces.com/problemset/problem/630/R | [
"games",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9710
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:630-Q | codeforces | 630-Q | Pyramids | https://codeforces.com/problemset/problem/630/Q | [
"geometry",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1504
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:630-P | codeforces | 630-P | Area of a Star | https://codeforces.com/problemset/problem/630/P | [
"geometry",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1415
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:630-O | codeforces | 630-O | Arrow | https://codeforces.com/problemset/problem/630/O | [
"geometry"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 933
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:630-N | codeforces | 630-N | Forecast | https://codeforces.com/problemset/problem/630/N | [
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 5264
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:630-M | codeforces | 630-M | Turn | https://codeforces.com/problemset/problem/630/M | [
"geometry",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1417
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:630-L | codeforces | 630-L | Cracking the Code | https://codeforces.com/problemset/problem/630/L | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 4113
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:630-K | codeforces | 630-K | Indivisibility | https://codeforces.com/problemset/problem/630/K | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6515
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:630-J | codeforces | 630-J | Divisibility | https://codeforces.com/problemset/problem/630/J | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12939
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:630-I | codeforces | 630-I | Parking Lot | https://codeforces.com/problemset/problem/630/I | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8554
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:630-H | codeforces | 630-H | Benches | https://codeforces.com/problemset/problem/630/H | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 5786
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:630-G | codeforces | 630-G | Challenge Pennants | https://codeforces.com/problemset/problem/630/G | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 3362
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:630-F | codeforces | 630-F | Selection of Personnel | https://codeforces.com/problemset/problem/630/F | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 8183
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:630-E | codeforces | 630-E | A rectangle | https://codeforces.com/problemset/problem/630/E | [
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2658
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:630-D | codeforces | 630-D | Hexagons! | https://codeforces.com/problemset/problem/630/D | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12864
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:630-C | codeforces | 630-C | Lucky Numbers | https://codeforces.com/problemset/problem/630/C | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 27734
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:630-B | codeforces | 630-B | Moore's Law | https://codeforces.com/problemset/problem/630/B | [
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8459
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:630-A | codeforces | 630-A | Again Twenty Five! | https://codeforces.com/problemset/problem/630/A | [
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 97141
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:629-E | codeforces | 629-E | Famil Door and Roads | https://codeforces.com/problemset/problem/629/E | [
"combinatorics",
"data structures",
"dfs and similar",
"dp",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1207
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:629-D | codeforces | 629-D | Babaei and Birthday Cake | https://codeforces.com/problemset/problem/629/D | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4627
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:629-C | codeforces | 629-C | Famil Door and Brackets | https://codeforces.com/problemset/problem/629/C | [
"dp",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3081
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:629-B | codeforces | 629-B | Far Relative’s Problem | https://codeforces.com/problemset/problem/629/B | [
"brute force"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 8373
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:629-A | codeforces | 629-A | Far Relative’s Birthday Cake | https://codeforces.com/problemset/problem/629/A | [
"brute force",
"combinatorics",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14975
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:628-F | codeforces | 628-F | Bear and Fair Set | https://codeforces.com/problemset/problem/628/F | [
"flows",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1064
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:628-E | codeforces | 628-E | Zbazi in Zeydabad | https://codeforces.com/problemset/problem/628/E | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1119
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:628-D | codeforces | 628-D | Magic Numbers | https://codeforces.com/problemset/problem/628/D | [
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 9029
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:628-C | codeforces | 628-C | Bear and String Distance | https://codeforces.com/problemset/problem/628/C | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6618
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:628-B | codeforces | 628-B | New Skateboard | https://codeforces.com/problemset/problem/628/B | [
"dp"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12313
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:628-A | codeforces | 628-A | Tennis Tournament | https://codeforces.com/problemset/problem/628/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 7166
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:627-F | codeforces | 627-F | Island Puzzle | https://codeforces.com/problemset/problem/627/F | [
"dfs and similar",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 271
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:627-E | codeforces | 627-E | Orchestra | https://codeforces.com/problemset/problem/627/E | [
"two pointers"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 839
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:627-D | codeforces | 627-D | Preorder Test | https://codeforces.com/problemset/problem/627/D | [
"binary search",
"dfs and similar",
"dp",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1039
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:627-C | codeforces | 627-C | Package Delivery | https://codeforces.com/problemset/problem/627/C | [
"data structures",
"divide and conquer",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1362
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:627-B | codeforces | 627-B | Factory Repairs | https://codeforces.com/problemset/problem/627/B | [
"data structures"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3486
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:627-A | codeforces | 627-A | XOR Equation | https://codeforces.com/problemset/problem/627/A | [
"dp",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4862
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:626-G | codeforces | 626-G | Raffles | https://codeforces.com/problemset/problem/626/G | [
"data structures",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 937
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:626-F | codeforces | 626-F | Group Projects | https://codeforces.com/problemset/problem/626/F | [
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 3780
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:626-E | codeforces | 626-E | Simple Skewness | https://codeforces.com/problemset/problem/626/E | [
"binary search",
"math",
"ternary search"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1676
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:626-D | codeforces | 626-D | Jerry's Protest | https://codeforces.com/problemset/problem/626/D | [
"brute force",
"combinatorics",
"dp",
"probabilities"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3249
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:626-C | codeforces | 626-C | Block Towers | https://codeforces.com/problemset/problem/626/C | [
"brute force",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4641
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:626-B | codeforces | 626-B | Cards | https://codeforces.com/problemset/problem/626/B | [
"constructive algorithms",
"dp",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 7134
} | 2026-08-17T01:43:56.191071+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.