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:1070-G | codeforces | 1070-G | Monsters and Potions | https://codeforces.com/problemset/problem/1070/G | [
"brute force",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 931
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1070-F | codeforces | 1070-F | Debate | https://codeforces.com/problemset/problem/1070/F | [
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3859
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1070-E | codeforces | 1070-E | Getting Deals Done | https://codeforces.com/problemset/problem/1070/E | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1459
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1070-D | codeforces | 1070-D | Garbage Disposal | https://codeforces.com/problemset/problem/1070/D | [
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 5241
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1070-C | codeforces | 1070-C | Cloud Computing | https://codeforces.com/problemset/problem/1070/C | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2307
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1070-B | codeforces | 1070-B | Berkomnadzor | https://codeforces.com/problemset/problem/1070/B | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 679
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1070-A | codeforces | 1070-A | Find a Number | https://codeforces.com/problemset/problem/1070/A | [
"dp",
"graphs",
"number theory",
"shortest paths"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2624
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1068-C | codeforces | 1068-C | Colored Rooks | https://codeforces.com/problemset/problem/1068/C | [
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3358
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1068-B | codeforces | 1068-B | LCM | https://codeforces.com/problemset/problem/1068/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 13065
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1068-A | codeforces | 1068-A | Birthday | https://codeforces.com/problemset/problem/1068/A | [
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7278
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1067-E | codeforces | 1067-E | Random Forest Rank | https://codeforces.com/problemset/problem/1067/E | [
"dp",
"graph matchings",
"math",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 555
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1067-D | codeforces | 1067-D | Computer Game | https://codeforces.com/problemset/problem/1067/D | [
"dp",
"greedy",
"math",
"probabilities"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 491
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1067-C | codeforces | 1067-C | Knights | https://codeforces.com/problemset/problem/1067/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 716
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1067-B | codeforces | 1067-B | Multihedgehog | https://codeforces.com/problemset/problem/1067/B | [
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2869
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1067-A | codeforces | 1067-A | Array Without Local Maximums | https://codeforces.com/problemset/problem/1067/A | [
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3153
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1066-F | codeforces | 1066-F | Yet another 2D Walking | https://codeforces.com/problemset/problem/1066/F | [
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2278
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1066-E | codeforces | 1066-E | Binary Numbers AND Sum | https://codeforces.com/problemset/problem/1066/E | [
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6589
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1066-D | codeforces | 1066-D | Boxes Packing | https://codeforces.com/problemset/problem/1066/D | [
"binary search",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5955
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1066-C | codeforces | 1066-C | Books Queries | https://codeforces.com/problemset/problem/1066/C | [
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10369
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1066-B | codeforces | 1066-B | Heaters | https://codeforces.com/problemset/problem/1066/B | [
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9394
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1066-A | codeforces | 1066-A | Vova and Train | https://codeforces.com/problemset/problem/1066/A | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15445
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1065-G | codeforces | 1065-G | Fibonacci Suffix | https://codeforces.com/problemset/problem/1065/G | [
"strings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 313
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1065-F | codeforces | 1065-F | Up and Down the Tree | https://codeforces.com/problemset/problem/1065/F | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1329
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1065-E | codeforces | 1065-E | Side Transmutations | https://codeforces.com/problemset/problem/1065/E | [
"combinatorics",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1300
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1065-D | codeforces | 1065-D | Three Pieces | https://codeforces.com/problemset/problem/1065/D | [
"dfs and similar",
"dp",
"shortest paths"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1446
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1065-C | codeforces | 1065-C | Make It Equal | https://codeforces.com/problemset/problem/1065/C | [
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8298
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1065-B | codeforces | 1065-B | Vasya and Isolated Vertices | https://codeforces.com/problemset/problem/1065/B | [
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11639
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1065-A | codeforces | 1065-A | Vasya and Chocolate | https://codeforces.com/problemset/problem/1065/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15279
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1064-B | codeforces | 1064-B | Equations of Mathematical Magic | https://codeforces.com/problemset/problem/1064/B | [
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 7948
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1064-A | codeforces | 1064-A | Make a triangle! | https://codeforces.com/problemset/problem/1064/A | [
"brute force",
"geometry",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25251
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1063-F | codeforces | 1063-F | String Journey | https://codeforces.com/problemset/problem/1063/F | [
"data structures",
"dp",
"string suffix structures"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 1013
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1063-E | codeforces | 1063-E | Lasers and Mirrors | https://codeforces.com/problemset/problem/1063/E | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 403
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1063-D | codeforces | 1063-D | Candies for Children | https://codeforces.com/problemset/problem/1063/D | [
"brute force",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 472
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1063-C | codeforces | 1063-C | Dwarves, Hats and Extrasensory Abilities | https://codeforces.com/problemset/problem/1063/C | [
"binary search",
"constructive algorithms",
"geometry",
"interactive"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3287
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1063-B | codeforces | 1063-B | Labyrinth | https://codeforces.com/problemset/problem/1063/B | [
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9351
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1063-A | codeforces | 1063-A | Oh Those Palindromes | https://codeforces.com/problemset/problem/1063/A | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11065
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1062-F | codeforces | 1062-F | Upgrading Cities | https://codeforces.com/problemset/problem/1062/F | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 996
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1062-E | codeforces | 1062-E | Company | https://codeforces.com/problemset/problem/1062/E | [
"binary search",
"data structures",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2092
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1062-D | codeforces | 1062-D | Fun with Integers | https://codeforces.com/problemset/problem/1062/D | [
"dfs and similar",
"graphs",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4177
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1062-C | codeforces | 1062-C | Banh-mi | https://codeforces.com/problemset/problem/1062/C | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5970
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1062-B | codeforces | 1062-B | Math | https://codeforces.com/problemset/problem/1062/B | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9944
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1062-A | codeforces | 1062-A | A Prank | https://codeforces.com/problemset/problem/1062/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9335
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1061-F | codeforces | 1061-F | Lost Root | https://codeforces.com/problemset/problem/1061/F | [
"interactive",
"probabilities"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 908
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1061-E | codeforces | 1061-E | Politics | https://codeforces.com/problemset/problem/1061/E | [
"flows",
"graphs"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 604
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1061-D | codeforces | 1061-D | TV Shows | https://codeforces.com/problemset/problem/1061/D | [
"data structures",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2563
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1061-C | codeforces | 1061-C | Multiplicity | https://codeforces.com/problemset/problem/1061/C | [
"data structures",
"dp",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10815
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1061-B | codeforces | 1061-B | Views Matter | https://codeforces.com/problemset/problem/1061/B | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7657
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1061-A | codeforces | 1061-A | Coins | https://codeforces.com/problemset/problem/1061/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24168
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1060-H | codeforces | 1060-H | Sophisticated Device | https://codeforces.com/problemset/problem/1060/H | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 255
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1060-G | codeforces | 1060-G | Balls and Pockets | https://codeforces.com/problemset/problem/1060/G | [
"data structures"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 259
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1060-F | codeforces | 1060-F | Shrinking Tree | https://codeforces.com/problemset/problem/1060/F | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 789
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1060-E | codeforces | 1060-E | Sergey and Subway | https://codeforces.com/problemset/problem/1060/E | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3524
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1060-D | codeforces | 1060-D | Social Circles | https://codeforces.com/problemset/problem/1060/D | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3886
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1060-C | codeforces | 1060-C | Maximum Subrectangle | https://codeforces.com/problemset/problem/1060/C | [
"binary search",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5222
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1060-B | codeforces | 1060-B | Maximum Sum of Digits | https://codeforces.com/problemset/problem/1060/B | [
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 9528
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1060-A | codeforces | 1060-A | Phone Numbers | https://codeforces.com/problemset/problem/1060/A | [
"brute force"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15756
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1059-E | codeforces | 1059-E | Split the Tree | https://codeforces.com/problemset/problem/1059/E | [
"binary search",
"data structures",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1626
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1059-D | codeforces | 1059-D | Nature Reserve | https://codeforces.com/problemset/problem/1059/D | [
"binary search",
"geometry",
"ternary search"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3006
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1059-C | codeforces | 1059-C | Sequence Transformation | https://codeforces.com/problemset/problem/1059/C | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7549
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1059-B | codeforces | 1059-B | Forgery | https://codeforces.com/problemset/problem/1059/B | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 7596
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1059-A | codeforces | 1059-A | Cashier | https://codeforces.com/problemset/problem/1059/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 13836
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1057-C | codeforces | 1057-C | Tanya and Colored Candies | https://codeforces.com/problemset/problem/1057/C | [
"*special",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1176
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1057-B | codeforces | 1057-B | DDoS | https://codeforces.com/problemset/problem/1057/B | [
"*special",
"brute force"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 1973
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1057-A | codeforces | 1057-A | Bmail Computer Network | https://codeforces.com/problemset/problem/1057/A | [
"*special",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 900 | {
"solved_count": 7536
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1056-H | codeforces | 1056-H | Detect Robots | https://codeforces.com/problemset/problem/1056/H | [
"data structures",
"strings"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 253
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1056-G | codeforces | 1056-G | Take Metro | https://codeforces.com/problemset/problem/1056/G | [
"brute force",
"data structures",
"graphs"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 300
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1056-F | codeforces | 1056-F | Write The Contest | https://codeforces.com/problemset/problem/1056/F | [
"binary search",
"dp",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 704
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1056-E | codeforces | 1056-E | Check Transcription | https://codeforces.com/problemset/problem/1056/E | [
"brute force",
"data structures",
"hashing",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2832
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1056-D | codeforces | 1056-D | Decorate Apple Tree | https://codeforces.com/problemset/problem/1056/D | [
"constructive algorithms",
"dfs and similar",
"dp",
"graphs",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6745
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1056-C | codeforces | 1056-C | Pick Heroes | https://codeforces.com/problemset/problem/1056/C | [
"greedy",
"implementation",
"interactive",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2581
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1056-B | codeforces | 1056-B | Divide Candies | https://codeforces.com/problemset/problem/1056/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4558
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1056-A | codeforces | 1056-A | Determine Line | https://codeforces.com/problemset/problem/1056/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 7333
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1055-G | codeforces | 1055-G | Jellyfish Nightmare | https://codeforces.com/problemset/problem/1055/G | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 105
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1055-F | codeforces | 1055-F | Tree and XOR | https://codeforces.com/problemset/problem/1055/F | [
"strings",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 612
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1055-E | codeforces | 1055-E | Segments on the Line | https://codeforces.com/problemset/problem/1055/E | [
"binary search",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 909
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1055-D | codeforces | 1055-D | Refactoring | https://codeforces.com/problemset/problem/1055/D | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 650
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1055-C | codeforces | 1055-C | Lucky Days | https://codeforces.com/problemset/problem/1055/C | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2057
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1055-B | codeforces | 1055-B | Alice and Hairdresser | https://codeforces.com/problemset/problem/1055/B | [
"dsu",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 5559
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1055-A | codeforces | 1055-A | Metro | https://codeforces.com/problemset/problem/1055/A | [
"graphs"
] | null | null | stdin_stdout | 900 | {
"solved_count": 13514
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1054-H | codeforces | 1054-H | Epic Convolution | https://codeforces.com/problemset/problem/1054/H | [
"chinese remainder theorem",
"fft",
"math",
"number theory"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 214
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1054-G | codeforces | 1054-G | New Road Network | https://codeforces.com/problemset/problem/1054/G | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 456
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1054-F | codeforces | 1054-F | Electric Scheme | https://codeforces.com/problemset/problem/1054/F | [
"flows",
"graph matchings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 387
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1054-E | codeforces | 1054-E | Chips Puzzle | https://codeforces.com/problemset/problem/1054/E | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 514
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1054-D | codeforces | 1054-D | Changing Array | https://codeforces.com/problemset/problem/1054/D | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2419
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1054-C | codeforces | 1054-C | Candies Distribution | https://codeforces.com/problemset/problem/1054/C | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4497
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1054-B | codeforces | 1054-B | Appending Mex | https://codeforces.com/problemset/problem/1054/B | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 7098
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1054-A | codeforces | 1054-A | Elevator or Stairs? | https://codeforces.com/problemset/problem/1054/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 9610
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1053-E | codeforces | 1053-E | Euler tour | https://codeforces.com/problemset/problem/1053/E | [
"constructive algorithms",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 246
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1051-G | codeforces | 1051-G | Distinctification | https://codeforces.com/problemset/problem/1051/G | [
"data structures",
"dsu",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 485
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1051-F | codeforces | 1051-F | The Shortest Statement | https://codeforces.com/problemset/problem/1051/F | [
"graphs",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 3776
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1051-E | codeforces | 1051-E | Vasya and Big Integers | https://codeforces.com/problemset/problem/1051/E | [
"binary search",
"data structures",
"dp",
"hashing",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1222
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1051-D | codeforces | 1051-D | Bicolorings | https://codeforces.com/problemset/problem/1051/D | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8181
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1051-C | codeforces | 1051-C | Vasya and Multisets | https://codeforces.com/problemset/problem/1051/C | [
"brute force",
"dp",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9908
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1051-B | codeforces | 1051-B | Relatively Prime Pairs | https://codeforces.com/problemset/problem/1051/B | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 18867
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1051-A | codeforces | 1051-A | Vasya And Password | https://codeforces.com/problemset/problem/1051/A | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8893
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1047-B | codeforces | 1047-B | Cover Points | https://codeforces.com/problemset/problem/1047/B | [
"geometry",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18815
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1047-A | codeforces | 1047-A | Little C Loves 3 I | https://codeforces.com/problemset/problem/1047/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21328
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1046-I | codeforces | 1046-I | Say Hello | https://codeforces.com/problemset/problem/1046/I | [
"geometry"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 577
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1046-F | codeforces | 1046-F | Splitting money | https://codeforces.com/problemset/problem/1046/F | [
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 3121
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1046-C | codeforces | 1046-C | Space Formula | https://codeforces.com/problemset/problem/1046/C | [
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 3364
} | 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.