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:714-A | codeforces | 714-A | Meeting of Old Friends | https://codeforces.com/problemset/problem/714/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 11155
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:713-E | codeforces | 713-E | Sonya Partymaker | https://codeforces.com/problemset/problem/713/E | [
"binary search",
"dp"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 407
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:713-D | codeforces | 713-D | Animals and Puzzle | https://codeforces.com/problemset/problem/713/D | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1365
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:713-C | codeforces | 713-C | Sonya and Problem Wihtout a Legend | https://codeforces.com/problemset/problem/713/C | [
"dp",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 6587
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:713-B | codeforces | 713-B | Searching Rectangles | https://codeforces.com/problemset/problem/713/B | [
"binary search",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1508
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:713-A | codeforces | 713-A | Sonya and Queries | https://codeforces.com/problemset/problem/713/A | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8875
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:712-E | codeforces | 712-E | Memory and Casinos | https://codeforces.com/problemset/problem/712/E | [
"data structures",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 702
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:712-D | codeforces | 712-D | Memory and Scores | https://codeforces.com/problemset/problem/712/D | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2001
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:712-C | codeforces | 712-C | Memory and De-Evolution | https://codeforces.com/problemset/problem/712/C | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6216
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:712-B | codeforces | 712-B | Memory and Trident | https://codeforces.com/problemset/problem/712/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10329
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:712-A | codeforces | 712-A | Memory and Crow | https://codeforces.com/problemset/problem/712/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12596
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:711-E | codeforces | 711-E | ZS and The Birthday Paradox | https://codeforces.com/problemset/problem/711/E | [
"math",
"number theory",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1375
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:711-D | codeforces | 711-D | Directed Roads | https://codeforces.com/problemset/problem/711/D | [
"combinatorics",
"dfs and similar",
"graphs",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5020
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:711-C | codeforces | 711-C | Coloring Trees | https://codeforces.com/problemset/problem/711/C | [
"dp"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9386
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:711-B | codeforces | 711-B | Chris and Magic Square | https://codeforces.com/problemset/problem/711/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8643
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:711-A | codeforces | 711-A | Bus to Udayland | https://codeforces.com/problemset/problem/711/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31006
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:710-F | codeforces | 710-F | String Set Queries | https://codeforces.com/problemset/problem/710/F | [
"brute force",
"data structures",
"hashing",
"interactive",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2523
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:710-E | codeforces | 710-E | Generate a String | https://codeforces.com/problemset/problem/710/E | [
"dfs and similar",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5794
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:710-D | codeforces | 710-D | Two Arithmetic Progressions | https://codeforces.com/problemset/problem/710/D | [
"math",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1850
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:710-C | codeforces | 710-C | Magic Odd Square | https://codeforces.com/problemset/problem/710/C | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5566
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:710-B | codeforces | 710-B | Optimal Point on a Line | https://codeforces.com/problemset/problem/710/B | [
"brute force",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10627
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:710-A | codeforces | 710-A | King Moves | https://codeforces.com/problemset/problem/710/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14815
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:709-B | codeforces | 709-B | Checkpoints | https://codeforces.com/problemset/problem/709/B | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5029
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:709-A | codeforces | 709-A | Juicer | https://codeforces.com/problemset/problem/709/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 38149
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:708-E | codeforces | 708-E | Student's Camp | https://codeforces.com/problemset/problem/708/E | [
"dp",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 1349
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:708-D | codeforces | 708-D | Incorrect Flow | https://codeforces.com/problemset/problem/708/D | [
"flows"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 888
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:708-C | codeforces | 708-C | Centroids | https://codeforces.com/problemset/problem/708/C | [
"data structures",
"dfs and similar",
"dp",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 4416
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:708-B | codeforces | 708-B | Recover the String | https://codeforces.com/problemset/problem/708/B | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3456
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:708-A | codeforces | 708-A | Letters Cyclic Shift | https://codeforces.com/problemset/problem/708/A | [
"constructive algorithms",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9820
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:707-E | codeforces | 707-E | Garlands | https://codeforces.com/problemset/problem/707/E | [
"data structures"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1347
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:707-D | codeforces | 707-D | Persistent Bookcase | https://codeforces.com/problemset/problem/707/D | [
"bitmasks",
"data structures",
"dfs and similar",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3006
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:707-C | codeforces | 707-C | Pythagorean Triples | https://codeforces.com/problemset/problem/707/C | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13503
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:707-B | codeforces | 707-B | Bakery | https://codeforces.com/problemset/problem/707/B | [
"graphs"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13619
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:707-A | codeforces | 707-A | Brain's Photos | https://codeforces.com/problemset/problem/707/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 56039
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:706-E | codeforces | 706-E | Working routine | https://codeforces.com/problemset/problem/706/E | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1264
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:706-D | codeforces | 706-D | Vasiliy's Multiset | https://codeforces.com/problemset/problem/706/D | [
"binary search",
"bitmasks",
"data structures",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 12702
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:706-C | codeforces | 706-C | Hard problem | https://codeforces.com/problemset/problem/706/C | [
"dp",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 19574
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:706-B | codeforces | 706-B | Interesting drink | https://codeforces.com/problemset/problem/706/B | [
"binary search",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 85484
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:706-A | codeforces | 706-A | Beru-taxi | https://codeforces.com/problemset/problem/706/A | [
"brute force",
"geometry",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 15372
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:705-B | codeforces | 705-B | Spider Man | https://codeforces.com/problemset/problem/705/B | [
"games",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 9584
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:705-A | codeforces | 705-A | Hulk | https://codeforces.com/problemset/problem/705/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 133023
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:704-E | codeforces | 704-E | Iron Man | https://codeforces.com/problemset/problem/704/E | [
"data structures",
"geometry",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 348
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:704-D | codeforces | 704-D | Captain America | https://codeforces.com/problemset/problem/704/D | [
"flows",
"greedy"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 1012
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:704-C | codeforces | 704-C | Black Widow | https://codeforces.com/problemset/problem/704/C | [
"dp",
"graphs",
"implementation",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 525
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:704-B | codeforces | 704-B | Ant Man | https://codeforces.com/problemset/problem/704/B | [
"dp",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2183
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:704-A | codeforces | 704-A | Thor | https://codeforces.com/problemset/problem/704/A | [
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10245
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:703-E | codeforces | 703-E | Mishka and Divisors | https://codeforces.com/problemset/problem/703/E | [
"dp",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 673
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:703-D | codeforces | 703-D | Mishka and Interesting sum | https://codeforces.com/problemset/problem/703/D | [
"data structures"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4075
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:703-C | codeforces | 703-C | Chris and Road | https://codeforces.com/problemset/problem/703/C | [
"geometry",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1974
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:703-B | codeforces | 703-B | Mishka and trip | https://codeforces.com/problemset/problem/703/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 6069
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:703-A | codeforces | 703-A | Mishka and Game | https://codeforces.com/problemset/problem/703/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 66952
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:702-F | codeforces | 702-F | T-Shirts | https://codeforces.com/problemset/problem/702/F | [
"data structures"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1938
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:702-E | codeforces | 702-E | Analysis of Pathes in Functional Graph | https://codeforces.com/problemset/problem/702/E | [
"data structures",
"graphs"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3134
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:702-D | codeforces | 702-D | Road to Post Office | https://codeforces.com/problemset/problem/702/D | [
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3746
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:702-C | codeforces | 702-C | Cellular Network | https://codeforces.com/problemset/problem/702/C | [
"binary search",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 23224
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:702-B | codeforces | 702-B | Powers of Two | https://codeforces.com/problemset/problem/702/B | [
"brute force",
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13763
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:702-A | codeforces | 702-A | Maximum Increase | https://codeforces.com/problemset/problem/702/A | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 55442
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:701-C | codeforces | 701-C | They Are Everywhere | https://codeforces.com/problemset/problem/701/C | [
"binary search",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 19993
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:701-B | codeforces | 701-B | Cells Not Under Attack | https://codeforces.com/problemset/problem/701/B | [
"data structures",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12568
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:701-A | codeforces | 701-A | Cards | https://codeforces.com/problemset/problem/701/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21234
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:700-E | codeforces | 700-E | Cool Slogans | https://codeforces.com/problemset/problem/700/E | [
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 1395
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:700-D | codeforces | 700-D | Huffman Coding on Segment | https://codeforces.com/problemset/problem/700/D | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 526
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:700-C | codeforces | 700-C | Break Up | https://codeforces.com/problemset/problem/700/C | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1479
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:700-B | codeforces | 700-B | Connecting Universities | https://codeforces.com/problemset/problem/700/B | [
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4652
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:700-A | codeforces | 700-A | As Fast As Possible | https://codeforces.com/problemset/problem/700/A | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3355
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:699-B | codeforces | 699-B | One Bomb | https://codeforces.com/problemset/problem/699/B | [
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7960
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:699-A | codeforces | 699-A | Launch of Collider | https://codeforces.com/problemset/problem/699/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19346
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:698-F | codeforces | 698-F | Coprime Permutation | https://codeforces.com/problemset/problem/698/F | [
"combinatorics",
"number theory"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 490
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:698-E | codeforces | 698-E | Cron | https://codeforces.com/problemset/problem/698/E | [] | null | null | stdin_stdout | 2,800 | {
"solved_count": 141
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:698-D | codeforces | 698-D | Limak and Shooting Points | https://codeforces.com/problemset/problem/698/D | [
"brute force",
"geometry",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 581
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:698-C | codeforces | 698-C | LRU | https://codeforces.com/problemset/problem/698/C | [
"bitmasks",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1445
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:698-B | codeforces | 698-B | Fix a Tree | https://codeforces.com/problemset/problem/698/B | [
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6200
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:698-A | codeforces | 698-A | Vacations | https://codeforces.com/problemset/problem/698/A | [
"dp"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 38415
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:697-B | codeforces | 697-B | Barnicle | https://codeforces.com/problemset/problem/697/B | [
"brute force",
"implementation",
"math",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 5993
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:697-A | codeforces | 697-A | Pineapple Incident | https://codeforces.com/problemset/problem/697/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 13380
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:696-F | codeforces | 696-F | ...Dary! | https://codeforces.com/problemset/problem/696/F | [
"binary search",
"geometry",
"two pointers"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 136
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:696-E | codeforces | 696-E | ...Wait for it... | https://codeforces.com/problemset/problem/696/E | [
"data structures",
"dsu",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 629
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:696-D | codeforces | 696-D | Legen... | https://codeforces.com/problemset/problem/696/D | [
"data structures",
"dp",
"matrices",
"strings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1632
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:696-C | codeforces | 696-C | PLEASE | https://codeforces.com/problemset/problem/696/C | [
"combinatorics",
"dp",
"implementation",
"math",
"matrices"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2218
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:696-B | codeforces | 696-B | Puzzles | https://codeforces.com/problemset/problem/696/B | [
"dfs and similar",
"math",
"probabilities",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3821
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:696-A | codeforces | 696-A | Lorenzo Von Matterhorn | https://codeforces.com/problemset/problem/696/A | [
"brute force",
"data structures",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6466
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:691-F | codeforces | 691-F | Couple Cover | https://codeforces.com/problemset/problem/691/F | [
"brute force",
"dp",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1443
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:691-E | codeforces | 691-E | Xor-sequences | https://codeforces.com/problemset/problem/691/E | [
"matrices"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3111
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:691-D | codeforces | 691-D | Swaps in Permutation | https://codeforces.com/problemset/problem/691/D | [
"dfs and similar",
"dsu",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6591
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:691-C | codeforces | 691-C | Exponential notation | https://codeforces.com/problemset/problem/691/C | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2981
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:691-B | codeforces | 691-B | s-palindrome | https://codeforces.com/problemset/problem/691/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8228
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:691-A | codeforces | 691-A | Fashion in Berland | https://codeforces.com/problemset/problem/691/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 11160
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:690-F3 | codeforces | 690-F3 | Tree of Life (hard) | https://codeforces.com/problemset/problem/690/F3 | [
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 61
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:690-F2 | codeforces | 690-F2 | Tree of Life (medium) | https://codeforces.com/problemset/problem/690/F2 | [
"constructive algorithms",
"hashing",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 93
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:690-F1 | codeforces | 690-F1 | Tree of Life (easy) | https://codeforces.com/problemset/problem/690/F1 | [] | null | null | stdin_stdout | 1,300 | {
"solved_count": 2429
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:690-E2 | codeforces | 690-E2 | Photographs (II) | https://codeforces.com/problemset/problem/690/E2 | [] | null | null | stdin_stdout | 2,600 | {
"solved_count": 149
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:690-E1 | codeforces | 690-E1 | Photographs (I) | https://codeforces.com/problemset/problem/690/E1 | [] | null | null | stdin_stdout | 1,800 | {
"solved_count": 736
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:690-D3 | codeforces | 690-D3 | The Wall (hard) | https://codeforces.com/problemset/problem/690/D3 | [
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 631
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:690-D2 | codeforces | 690-D2 | The Wall (medium) | https://codeforces.com/problemset/problem/690/D2 | [
"combinatorics"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1471
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:690-D1 | codeforces | 690-D1 | The Wall (easy) | https://codeforces.com/problemset/problem/690/D1 | [] | null | null | stdin_stdout | 1,200 | {
"solved_count": 2920
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:690-C3 | codeforces | 690-C3 | Brain Network (hard) | https://codeforces.com/problemset/problem/690/C3 | [
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1013
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:690-C2 | codeforces | 690-C2 | Brain Network (medium) | https://codeforces.com/problemset/problem/690/C2 | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5039
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:690-C1 | codeforces | 690-C1 | Brain Network (easy) | https://codeforces.com/problemset/problem/690/C1 | [] | null | null | stdin_stdout | 1,300 | {
"solved_count": 3184
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:690-B3 | codeforces | 690-B3 | Recover Polygon (hard) | https://codeforces.com/problemset/problem/690/B3 | [
"data structures"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 111
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:690-B2 | codeforces | 690-B2 | Recover Polygon (medium) | https://codeforces.com/problemset/problem/690/B2 | [
"geometry"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 232
} | 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.