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: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": 13842
} | 2026-11-02T05:37:07.883505+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": 20690
} | 2026-11-02T05:37:07.883505+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": 94216
} | 2026-11-02T05:37:07.883505+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": 15540
} | 2026-11-02T05:37:07.883505+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": 9656
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:705-A | codeforces | 705-A | Hulk | https://codeforces.com/problemset/problem/705/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 139826
} | 2026-11-02T05:37:07.883505+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": 407
} | 2026-11-02T05:37:07.883505+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": 1214
} | 2026-11-02T05:37:07.883505+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": 625
} | 2026-11-02T05:37:07.883505+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": 2333
} | 2026-11-02T05:37:07.883505+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": 10463
} | 2026-11-02T05:37:07.883505+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": 715
} | 2026-11-02T05:37:07.883505+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": 4298
} | 2026-11-02T05:37:07.883505+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": 2027
} | 2026-11-02T05:37:07.883505+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": 6115
} | 2026-11-02T05:37:07.883505+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": 69567
} | 2026-11-02T05:37:07.883505+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": 2083
} | 2026-11-02T05:37:07.883505+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": 3367
} | 2026-11-02T05:37:07.883505+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": 3814
} | 2026-11-02T05:37:07.883505+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": 25432
} | 2026-11-02T05:37:07.883505+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": 14194
} | 2026-11-02T05:37:07.883505+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": 58135
} | 2026-11-02T05:37:07.883505+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": 21557
} | 2026-11-02T05:37:07.883505+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": 12757
} | 2026-11-02T05:37:07.883505+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": 21487
} | 2026-11-02T05:37:07.883505+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": 1500
} | 2026-11-02T05:37:07.883505+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": 612
} | 2026-11-02T05:37:07.883505+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": 1622
} | 2026-11-02T05:37:07.883505+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": 4793
} | 2026-11-02T05:37:07.883505+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": 3393
} | 2026-11-02T05:37:07.883505+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": 8042
} | 2026-11-02T05:37:07.883505+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": 19931
} | 2026-11-02T05:37:07.883505+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": 583
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:698-E | codeforces | 698-E | Cron | https://codeforces.com/problemset/problem/698/E | [] | null | null | stdin_stdout | 2,800 | {
"solved_count": 222
} | 2026-11-02T05:37:07.883505+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": 628
} | 2026-11-02T05:37:07.883505+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": 1491
} | 2026-11-02T05:37:07.883505+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": 6321
} | 2026-11-02T05:37:07.883505+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": 41464
} | 2026-11-02T05:37:07.883505+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": 6082
} | 2026-11-02T05:37:07.883505+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": 13529
} | 2026-11-02T05:37:07.883505+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": 164
} | 2026-11-02T05:37:07.883505+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": 779
} | 2026-11-02T05:37:07.883505+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": 1743
} | 2026-11-02T05:37:07.883505+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": 2327
} | 2026-11-02T05:37:07.883505+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": 3940
} | 2026-11-02T05:37:07.883505+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": 6574
} | 2026-11-02T05:37:07.883505+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": 1496
} | 2026-11-02T05:37:07.883505+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": 3280
} | 2026-11-02T05:37:07.883505+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": 6884
} | 2026-11-02T05:37:07.883505+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": 3053
} | 2026-11-02T05:37:07.883505+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": 8298
} | 2026-11-02T05:37:07.883505+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": 11437
} | 2026-11-02T05:37:07.883505+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": 63
} | 2026-11-02T05:37:07.883505+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": 113
} | 2026-11-02T05:37:07.883505+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": 2468
} | 2026-11-02T05:37:07.883505+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": 154
} | 2026-11-02T05:37:07.883505+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-11-02T05:37:07.883505+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": 652
} | 2026-11-02T05:37:07.883505+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": 1500
} | 2026-11-02T05:37:07.883505+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": 2982
} | 2026-11-02T05:37:07.883505+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": 1052
} | 2026-11-02T05:37:07.883505+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": 5223
} | 2026-11-02T05:37:07.883505+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": 3270
} | 2026-11-02T05:37:07.883505+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": 143
} | 2026-11-02T05:37:07.883505+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": 271
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:690-B1 | codeforces | 690-B1 | Recover Polygon (easy) | https://codeforces.com/problemset/problem/690/B1 | [] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1021
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:690-A3 | codeforces | 690-A3 | Collective Mindsets (hard) | https://codeforces.com/problemset/problem/690/A3 | [] | null | null | stdin_stdout | 2,400 | {
"solved_count": 712
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:690-A2 | codeforces | 690-A2 | Collective Mindsets (medium) | https://codeforces.com/problemset/problem/690/A2 | [] | null | null | stdin_stdout | 2,300 | {
"solved_count": 771
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:690-A1 | codeforces | 690-A1 | Collective Mindsets (easy) | https://codeforces.com/problemset/problem/690/A1 | [] | null | null | stdin_stdout | 1,100 | {
"solved_count": 3143
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:689-E | codeforces | 689-E | Mike and Geometry Problem | https://codeforces.com/problemset/problem/689/E | [
"combinatorics",
"data structures",
"dp",
"geometry",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2367
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:689-D | codeforces | 689-D | Friends and Subsequences | https://codeforces.com/problemset/problem/689/D | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4466
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:689-C | codeforces | 689-C | Mike and Chocolate Thieves | https://codeforces.com/problemset/problem/689/C | [
"binary search",
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6375
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:689-B | codeforces | 689-B | Mike and Shortcuts | https://codeforces.com/problemset/problem/689/B | [
"dfs and similar",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6817
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:689-A | codeforces | 689-A | Mike and Cellphone | https://codeforces.com/problemset/problem/689/A | [
"brute force",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 5551
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:688-B | codeforces | 688-B | Lovely Palindromes | https://codeforces.com/problemset/problem/688/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 36751
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:688-A | codeforces | 688-A | Opponents | https://codeforces.com/problemset/problem/688/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14972
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:687-E | codeforces | 687-E | TOF | https://codeforces.com/problemset/problem/687/E | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 484
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:687-D | codeforces | 687-D | Dividing Kingdom II | https://codeforces.com/problemset/problem/687/D | [
"brute force",
"data structures",
"dsu",
"graphs",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1176
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:687-C | codeforces | 687-C | The Values You Can Make | https://codeforces.com/problemset/problem/687/C | [
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 9495
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:687-B | codeforces | 687-B | Remainders Game | https://codeforces.com/problemset/problem/687/B | [
"chinese remainder theorem",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7229
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:687-A | codeforces | 687-A | NP-Hard Problem | https://codeforces.com/problemset/problem/687/A | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 17252
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:686-B | codeforces | 686-B | Little Robber Girl's Zoo | https://codeforces.com/problemset/problem/686/B | [
"constructive algorithms",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 8077
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:686-A | codeforces | 686-A | Free Ice Cream | https://codeforces.com/problemset/problem/686/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 44987
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:685-E | codeforces | 685-E | Travelling Through the Snow Queen's Kingdom | https://codeforces.com/problemset/problem/685/E | [
"bitmasks",
"brute force",
"divide and conquer",
"graphs"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 690
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:685-D | codeforces | 685-D | Kay and Eternity | https://codeforces.com/problemset/problem/685/D | [
"brute force",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 565
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:685-C | codeforces | 685-C | Optimal Point | https://codeforces.com/problemset/problem/685/C | [
"binary search",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 711
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:685-B | codeforces | 685-B | Kay and Snowflake | https://codeforces.com/problemset/problem/685/B | [
"data structures",
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5814
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:685-A | codeforces | 685-A | Robbers' watch | https://codeforces.com/problemset/problem/685/A | [
"brute force",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4533
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:683-J | codeforces | 683-J | The Hero with Bombs | https://codeforces.com/problemset/problem/683/J | [
"*special"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 53
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:683-I | codeforces | 683-I | Loader | https://codeforces.com/problemset/problem/683/I | [
"*special",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 53
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:683-H | codeforces | 683-H | Exchange of Books | https://codeforces.com/problemset/problem/683/H | [
"*special"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 126
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:683-G | codeforces | 683-G | The Fraction | https://codeforces.com/problemset/problem/683/G | [
"*special"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 147
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:683-F | codeforces | 683-F | Reformat the String | https://codeforces.com/problemset/problem/683/F | [
"*special"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 169
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:683-E | codeforces | 683-E | Hammer throwing | https://codeforces.com/problemset/problem/683/E | [
"*special"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 205
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:683-D | codeforces | 683-D | Chocolate Bar | https://codeforces.com/problemset/problem/683/D | [
"*special",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 399
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:683-C | codeforces | 683-C | Symmetric Difference | https://codeforces.com/problemset/problem/683/C | [
"*special"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 342
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:683-B | codeforces | 683-B | The Teacher of Physical Education | https://codeforces.com/problemset/problem/683/B | [
"*special"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 341
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:683-A | codeforces | 683-A | The Check of the Point | https://codeforces.com/problemset/problem/683/A | [
"*special",
"geometry"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 1290
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:682-E | codeforces | 682-E | Alyona and Triangles | https://codeforces.com/problemset/problem/682/E | [
"geometry",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 768
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:682-D | codeforces | 682-D | Alyona and Strings | https://codeforces.com/problemset/problem/682/D | [
"dp",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3600
} | 2026-11-02T05:37:07.883505+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.