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:733-D | codeforces | 733-D | Kostya the Sculptor | https://codeforces.com/problemset/problem/733/D | [
"data structures",
"hashing"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4365
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:733-C | codeforces | 733-C | Epidemic in Monstropolis | https://codeforces.com/problemset/problem/733/C | [
"constructive algorithms",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3564
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:733-B | codeforces | 733-B | Parade | https://codeforces.com/problemset/problem/733/B | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10962
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:733-A | codeforces | 733-A | Grasshopper And the String | https://codeforces.com/problemset/problem/733/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16976
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:732-F | codeforces | 732-F | Tourist Reform | https://codeforces.com/problemset/problem/732/F | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3339
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:732-E | codeforces | 732-E | Sockets | https://codeforces.com/problemset/problem/732/E | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1669
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:732-D | codeforces | 732-D | Exams | https://codeforces.com/problemset/problem/732/D | [
"binary search",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5934
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:732-C | codeforces | 732-C | Sanatorium | https://codeforces.com/problemset/problem/732/C | [
"binary search",
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10193
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:732-B | codeforces | 732-B | Cormen --- The Best Friend Of a Man | https://codeforces.com/problemset/problem/732/B | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 25829
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:732-A | codeforces | 732-A | Buy a Shovel | https://codeforces.com/problemset/problem/732/A | [
"brute force",
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 89478
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:731-F | codeforces | 731-F | Video Cards | https://codeforces.com/problemset/problem/731/F | [
"brute force",
"data structures",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3156
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:731-E | codeforces | 731-E | Funny Game | https://codeforces.com/problemset/problem/731/E | [
"dp",
"games"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1886
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:731-D | codeforces | 731-D | 80-th Level Archeology | https://codeforces.com/problemset/problem/731/D | [
"brute force",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1282
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:731-C | codeforces | 731-C | Socks | https://codeforces.com/problemset/problem/731/C | [
"dfs and similar",
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7889
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:731-B | codeforces | 731-B | Coupons and Discounts | https://codeforces.com/problemset/problem/731/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 8354
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:731-A | codeforces | 731-A | Night at the Museum | https://codeforces.com/problemset/problem/731/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 53486
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:730-L | codeforces | 730-L | Expression Queries | https://codeforces.com/problemset/problem/730/L | [
"data structures"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 93
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:730-K | codeforces | 730-K | Roads Orientation Problem | https://codeforces.com/problemset/problem/730/K | [
"graphs"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 157
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:730-J | codeforces | 730-J | Bottles | https://codeforces.com/problemset/problem/730/J | [
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3997
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:730-I | codeforces | 730-I | Olympiad in Programming and Sports | https://codeforces.com/problemset/problem/730/I | [
"dp",
"flows",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2757
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:730-H | codeforces | 730-H | Delete Them | https://codeforces.com/problemset/problem/730/H | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 3276
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:730-G | codeforces | 730-G | Car Repair Shop | https://codeforces.com/problemset/problem/730/G | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2313
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:730-F | codeforces | 730-F | Ber Patio | https://codeforces.com/problemset/problem/730/F | [] | null | null | stdin_stdout | 3,100 | {
"solved_count": 106
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:730-E | codeforces | 730-E | Award Ceremony | https://codeforces.com/problemset/problem/730/E | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 773
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:730-D | codeforces | 730-D | Running Over The Bridges | https://codeforces.com/problemset/problem/730/D | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 915
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:730-C | codeforces | 730-C | Bulmart | https://codeforces.com/problemset/problem/730/C | [
"binary search",
"dfs and similar"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1380
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:730-B | codeforces | 730-B | Minimum and Maximum | https://codeforces.com/problemset/problem/730/B | [
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2785
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:730-A | codeforces | 730-A | Toda 2 | https://codeforces.com/problemset/problem/730/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1737
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:729-F | codeforces | 729-F | Financiers Game | https://codeforces.com/problemset/problem/729/F | [
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1073
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:729-E | codeforces | 729-E | Subordinates | https://codeforces.com/problemset/problem/729/E | [
"constructive algorithms",
"data structures",
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2400
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:729-D | codeforces | 729-D | Sea Battle | https://codeforces.com/problemset/problem/729/D | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4096
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:729-C | codeforces | 729-C | Road to Cinema | https://codeforces.com/problemset/problem/729/C | [
"binary search",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4191
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:729-B | codeforces | 729-B | Spotlights | https://codeforces.com/problemset/problem/729/B | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8711
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:729-A | codeforces | 729-A | Interview with Oleg | https://codeforces.com/problemset/problem/729/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 8110
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:727-F | codeforces | 727-F | Polycarp's problems | https://codeforces.com/problemset/problem/727/F | [
"binary search",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 963
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:727-E | codeforces | 727-E | Games on a CD | https://codeforces.com/problemset/problem/727/E | [
"data structures",
"hashing",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1576
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:727-D | codeforces | 727-D | T-shirts Distribution | https://codeforces.com/problemset/problem/727/D | [
"constructive algorithms",
"flows",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2085
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:727-C | codeforces | 727-C | Guess the Array | https://codeforces.com/problemset/problem/727/C | [
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8996
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:727-B | codeforces | 727-B | Bill Total Value | https://codeforces.com/problemset/problem/727/B | [
"expression parsing",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2134
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:727-A | codeforces | 727-A | Transformation: from A to B | https://codeforces.com/problemset/problem/727/A | [
"brute force",
"dfs and similar",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 18181
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:725-G | codeforces | 725-G | Messages on a Tree | https://codeforces.com/problemset/problem/725/G | [] | null | null | stdin_stdout | 3,300 | {
"solved_count": 180
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:725-F | codeforces | 725-F | Family Photos | https://codeforces.com/problemset/problem/725/F | [
"games",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 726
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:725-E | codeforces | 725-E | Too Much Money | https://codeforces.com/problemset/problem/725/E | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 711
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:725-D | codeforces | 725-D | Contest Balloons | https://codeforces.com/problemset/problem/725/D | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3101
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:725-C | codeforces | 725-C | Hidden Word | https://codeforces.com/problemset/problem/725/C | [
"brute force",
"constructive algorithms",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2946
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:725-B | codeforces | 725-B | Food on the Plane | https://codeforces.com/problemset/problem/725/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 5328
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:725-A | codeforces | 725-A | Jumping Ball | https://codeforces.com/problemset/problem/725/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 7502
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:724-G | codeforces | 724-G | Xor-matic Number of the Graph | https://codeforces.com/problemset/problem/724/G | [
"bitmasks",
"graphs",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1521
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:724-F | codeforces | 724-F | Uniformly Branched Trees | https://codeforces.com/problemset/problem/724/F | [
"combinatorics",
"dp",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 531
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:724-E | codeforces | 724-E | Goods transportation | https://codeforces.com/problemset/problem/724/E | [
"dp",
"flows",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1675
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:724-D | codeforces | 724-D | Dense Subsequence | https://codeforces.com/problemset/problem/724/D | [
"data structures",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2461
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:724-C | codeforces | 724-C | Ray Tracing | https://codeforces.com/problemset/problem/724/C | [
"greedy",
"hashing",
"implementation",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2284
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:724-B | codeforces | 724-B | Batch Sort | https://codeforces.com/problemset/problem/724/B | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4251
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:724-A | codeforces | 724-A | Checking the Calendar | https://codeforces.com/problemset/problem/724/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 7564
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:723-F | codeforces | 723-F | st-Spanning Tree | https://codeforces.com/problemset/problem/723/F | [
"dsu",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1753
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:723-E | codeforces | 723-E | One-Way Reform | https://codeforces.com/problemset/problem/723/E | [
"constructive algorithms",
"dfs and similar",
"flows",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2284
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:723-D | codeforces | 723-D | Lakes in Berland | https://codeforces.com/problemset/problem/723/D | [
"dfs and similar",
"dsu",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7516
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:723-C | codeforces | 723-C | Polycarp at the Radio | https://codeforces.com/problemset/problem/723/C | [
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5230
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:723-B | codeforces | 723-B | Text Document Analysis | https://codeforces.com/problemset/problem/723/B | [
"expression parsing",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10983
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:723-A | codeforces | 723-A | The New Year: Meeting Friends | https://codeforces.com/problemset/problem/723/A | [
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 101638
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:722-F | codeforces | 722-F | Cyclic Cipher | https://codeforces.com/problemset/problem/722/F | [
"chinese remainder theorem",
"data structures",
"implementation",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 609
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:722-E | codeforces | 722-E | Research Rover | https://codeforces.com/problemset/problem/722/E | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1097
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:722-D | codeforces | 722-D | Generating Sets | https://codeforces.com/problemset/problem/722/D | [
"binary search",
"data structures",
"dfs and similar",
"greedy",
"strings",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3356
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:722-C | codeforces | 722-C | Destroying Array | https://codeforces.com/problemset/problem/722/C | [
"data structures",
"dsu"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11537
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:722-B | codeforces | 722-B | Verse Pattern | https://codeforces.com/problemset/problem/722/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 6768
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:722-A | codeforces | 722-A | Broken Clock | https://codeforces.com/problemset/problem/722/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6963
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:721-E | codeforces | 721-E | Road to Home | https://codeforces.com/problemset/problem/721/E | [
"binary search",
"dp"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 357
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:721-D | codeforces | 721-D | Maxim and Array | https://codeforces.com/problemset/problem/721/D | [
"constructive algorithms",
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2493
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:721-C | codeforces | 721-C | Journey | https://codeforces.com/problemset/problem/721/C | [
"dp",
"graphs"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6568
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:721-B | codeforces | 721-B | Passwords | https://codeforces.com/problemset/problem/721/B | [
"implementation",
"math",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12479
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:721-A | codeforces | 721-A | One-dimensional Japanese Crossword | https://codeforces.com/problemset/problem/721/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19371
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:720-F | codeforces | 720-F | Array Covering | https://codeforces.com/problemset/problem/720/F | [
"data structures"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 207
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:720-E | codeforces | 720-E | Cipher | https://codeforces.com/problemset/problem/720/E | [
"implementation"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 72
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:720-D | codeforces | 720-D | Slalom | https://codeforces.com/problemset/problem/720/D | [
"data structures",
"dp",
"sortings"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 331
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:720-C | codeforces | 720-C | Homework | https://codeforces.com/problemset/problem/720/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 157
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:720-B | codeforces | 720-B | Cactusophobia | https://codeforces.com/problemset/problem/720/B | [
"dfs and similar",
"flows"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 467
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:720-A | codeforces | 720-A | Closing ceremony | https://codeforces.com/problemset/problem/720/A | [
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 962
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:719-B | codeforces | 719-B | Anatoly and Cockroaches | https://codeforces.com/problemset/problem/719/B | [
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8828
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:719-A | codeforces | 719-A | Vitya in the Countryside | https://codeforces.com/problemset/problem/719/A | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16439
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:718-E | codeforces | 718-E | Matvey's Birthday | https://codeforces.com/problemset/problem/718/E | [
"bitmasks",
"graphs"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 430
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:718-D | codeforces | 718-D | Andrew and Chemistry | https://codeforces.com/problemset/problem/718/D | [
"dp",
"hashing",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 495
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:718-C | codeforces | 718-C | Sasha and Array | https://codeforces.com/problemset/problem/718/C | [
"data structures",
"math",
"matrices"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 4668
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:718-A | codeforces | 718-A | Efim and Strange Grade | https://codeforces.com/problemset/problem/718/A | [
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4633
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:717-I | codeforces | 717-I | Cowboy Beblop at his computer | https://codeforces.com/problemset/problem/717/I | [
"geometry"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 214
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:717-H | codeforces | 717-H | Pokermon League challenge | https://codeforces.com/problemset/problem/717/H | [
"math",
"probabilities"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 472
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:717-G | codeforces | 717-G | Underfail | https://codeforces.com/problemset/problem/717/G | [
"flows"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 736
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:717-F | codeforces | 717-F | Heroes of Making Magic III | https://codeforces.com/problemset/problem/717/F | [
"data structures"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 382
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:717-E | codeforces | 717-E | Paint it really, really dark gray | https://codeforces.com/problemset/problem/717/E | [
"dfs and similar"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1587
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:717-D | codeforces | 717-D | Dexterina’s Lab | https://codeforces.com/problemset/problem/717/D | [
"games",
"matrices",
"probabilities"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1593
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:717-C | codeforces | 717-C | Potions Homework | https://codeforces.com/problemset/problem/717/C | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 4309
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:717-B | codeforces | 717-B | R3D3’s Summer Adventure | https://codeforces.com/problemset/problem/717/B | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 181
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:717-A | codeforces | 717-A | Festival Organization | https://codeforces.com/problemset/problem/717/A | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 436
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:716-B | codeforces | 716-B | Complete the Word | https://codeforces.com/problemset/problem/716/B | [
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13040
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:716-A | codeforces | 716-A | Crazy Computer | https://codeforces.com/problemset/problem/716/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24079
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:715-E | codeforces | 715-E | Complete the Permutations | https://codeforces.com/problemset/problem/715/E | [
"combinatorics",
"fft",
"graphs",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 456
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:715-D | codeforces | 715-D | Create a Maze | https://codeforces.com/problemset/problem/715/D | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 390
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:715-C | codeforces | 715-C | Digit Tree | https://codeforces.com/problemset/problem/715/C | [
"dfs and similar",
"divide and conquer",
"dsu",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 2624
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:715-B | codeforces | 715-B | Complete The Graph | https://codeforces.com/problemset/problem/715/B | [
"binary search",
"constructive algorithms",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3471
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:715-A | codeforces | 715-A | Plus and Square Root | https://codeforces.com/problemset/problem/715/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5878
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:714-B | codeforces | 714-B | Filya and Homework | https://codeforces.com/problemset/problem/714/B | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 15547
} | 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.