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: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": 4388
} | 2026-06-01T05:00:40.145500+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": 2126
} | 2026-06-01T05:00:40.145500+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": 2527
} | 2026-06-01T05:00:40.145500+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": 23862
} | 2026-06-01T05:00:40.145500+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": 5845
} | 2026-06-01T05:00:40.145500+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": 3230
} | 2026-06-01T05:00:40.145500+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": 3455
} | 2026-06-01T05:00:40.145500+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": 696
} | 2026-06-01T05:00:40.145500+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": 877
} | 2026-06-01T05:00:40.145500+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": 1400
} | 2026-06-01T05:00:40.145500+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": 623
} | 2026-06-01T05:00:40.145500+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": 3055
} | 2026-06-01T05:00:40.145500+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": 3390
} | 2026-06-01T05:00:40.145500+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": 7260
} | 2026-06-01T05:00:40.145500+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": 14761
} | 2026-06-01T05:00:40.145500+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": 1285
} | 2026-06-01T05:00:40.145500+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": 3581
} | 2026-06-01T05:00:40.145500+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": 4608
} | 2026-06-01T05:00:40.145500+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": 10554
} | 2026-06-01T05:00:40.145500+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": 4397
} | 2026-06-01T05:00:40.145500+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": 4922
} | 2026-06-01T05:00:40.145500+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": 3231
} | 2026-06-01T05:00:40.145500+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": 2446
} | 2026-06-01T05:00:40.145500+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": 4455
} | 2026-06-01T05:00:40.145500+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": 7882
} | 2026-06-01T05:00:40.145500+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": 9769
} | 2026-06-01T05:00:40.145500+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": 9639
} | 2026-06-01T05:00:40.145500+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": 1473
} | 2026-06-01T05:00:40.145500+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": 1372
} | 2026-06-01T05:00:40.145500+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": 894
} | 2026-06-01T05:00:40.145500+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": 5236
} | 2026-06-01T05:00:40.145500+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": 1407
} | 2026-06-01T05:00:40.145500+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": 4086
} | 2026-06-01T05:00:40.145500+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": 6396
} | 2026-06-01T05:00:40.145500+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": 12775
} | 2026-06-01T05:00:40.145500+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": 8338
} | 2026-06-01T05:00:40.145500+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": 5692
} | 2026-06-01T05:00:40.145500+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": 3322
} | 2026-06-01T05:00:40.145500+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": 8080
} | 2026-06-01T05:00:40.145500+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": 2640
} | 2026-06-01T05:00:40.145500+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": 12724
} | 2026-06-01T05:00:40.145500+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": 27117
} | 2026-06-01T05:00:40.145500+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": 8385
} | 2026-06-01T05:00:40.145500+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": 94371
} | 2026-06-01T05:00:40.145500+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": 1169
} | 2026-06-01T05:00:40.145500+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": 4514
} | 2026-06-01T05:00:40.145500+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": 3033
} | 2026-06-01T05:00:40.145500+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": 8347
} | 2026-06-01T05:00:40.145500+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": 14867
} | 2026-06-01T05:00:40.145500+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": 966
} | 2026-06-01T05:00:40.145500+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": 1089
} | 2026-06-01T05:00:40.145500+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": 8395
} | 2026-06-01T05:00:40.145500+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": 6536
} | 2026-06-01T05:00:40.145500+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": 12097
} | 2026-06-01T05:00:40.145500+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": 7094
} | 2026-06-01T05:00:40.145500+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": 251
} | 2026-06-01T05:00:40.145500+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": 711
} | 2026-06-01T05:00:40.145500+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": 1002
} | 2026-06-01T05:00:40.145500+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": 1319
} | 2026-06-01T05:00:40.145500+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": 3415
} | 2026-06-01T05:00:40.145500+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": 4808
} | 2026-06-01T05:00:40.145500+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": 607
} | 2026-06-01T05:00:40.145500+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": 3615
} | 2026-06-01T05:00:40.145500+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": 1588
} | 2026-06-01T05:00:40.145500+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": 3187
} | 2026-06-01T05:00:40.145500+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": 4619
} | 2026-06-01T05:00:40.145500+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": 6941
} | 2026-06-01T05:00:40.145500+00:00 |
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": 6712
} | 2026-06-01T05:00:40.145500+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": 419
} | 2026-06-01T05:00:40.145500+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": 679
} | 2026-06-01T05:00:40.145500+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": 7175
} | 2026-06-01T05:00:40.145500+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": 11589
} | 2026-06-01T05:00:40.145500+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": 5671
} | 2026-06-01T05:00:40.145500+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": 8407
} | 2026-06-01T05:00:40.145500+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": 11189
} | 2026-06-01T05:00:40.145500+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": 621
} | 2026-06-01T05:00:40.145500+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": 556
} | 2026-06-01T05:00:40.145500+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": 526
} | 2026-06-01T05:00:40.145500+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": 2377
} | 2026-06-01T05:00:40.145500+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": 4800
} | 2026-06-01T05:00:40.145500+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": 4993
} | 2026-06-01T05:00:40.145500+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": 2477
} | 2026-06-01T05:00:40.145500+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": 3411
} | 2026-06-01T05:00:40.145500+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": 7544
} | 2026-06-01T05:00:40.145500+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": 10986
} | 2026-06-01T05:00:40.145500+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": 10280
} | 2026-06-01T05:00:40.145500+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": 3262
} | 2026-06-01T05:00:40.145500+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": 1088
} | 2026-06-01T05:00:40.145500+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": 6296
} | 2026-06-01T05:00:40.145500+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": 11622
} | 2026-06-01T05:00:40.145500+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": 22741
} | 2026-06-01T05:00:40.145500+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": 889
} | 2026-06-01T05:00:40.145500+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": 7213
} | 2026-06-01T05:00:40.145500+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": 2009
} | 2026-06-01T05:00:40.145500+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": 7904
} | 2026-06-01T05:00:40.145500+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": 10531
} | 2026-06-01T05:00:40.145500+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": 14381
} | 2026-06-01T05:00:40.145500+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": 272
} | 2026-06-01T05:00:40.145500+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": 1836
} | 2026-06-01T05:00:40.145500+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": 699
} | 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.