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: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": 582
} | 2026-08-17T01:43:56.191071+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-08-17T01:43:56.191071+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": 625
} | 2026-08-17T01:43:56.191071+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": 1481
} | 2026-08-17T01:43:56.191071+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": 6257
} | 2026-08-17T01:43:56.191071+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": 39841
} | 2026-08-17T01:43:56.191071+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": 6034
} | 2026-08-17T01:43:56.191071+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": 13451
} | 2026-08-17T01:43:56.191071+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-08-17T01:43:56.191071+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": 766
} | 2026-08-17T01:43:56.191071+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": 1705
} | 2026-08-17T01:43:56.191071+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": 2321
} | 2026-08-17T01:43:56.191071+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": 3880
} | 2026-08-17T01:43:56.191071+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": 6509
} | 2026-08-17T01:43:56.191071+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": 1486
} | 2026-08-17T01:43:56.191071+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": 3221
} | 2026-08-17T01:43:56.191071+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": 6727
} | 2026-08-17T01:43:56.191071+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": 3029
} | 2026-08-17T01:43:56.191071+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": 8268
} | 2026-08-17T01:43:56.191071+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": 11305
} | 2026-08-17T01:43:56.191071+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": 62
} | 2026-08-17T01:43:56.191071+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": 112
} | 2026-08-17T01:43:56.191071+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": 2453
} | 2026-08-17T01:43:56.191071+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-08-17T01:43:56.191071+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-08-17T01:43:56.191071+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": 646
} | 2026-08-17T01:43:56.191071+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": 1481
} | 2026-08-17T01:43:56.191071+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": 2948
} | 2026-08-17T01:43:56.191071+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": 1043
} | 2026-08-17T01:43:56.191071+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": 5147
} | 2026-08-17T01:43:56.191071+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": 3225
} | 2026-08-17T01:43:56.191071+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": 137
} | 2026-08-17T01:43:56.191071+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": 270
} | 2026-08-17T01:43:56.191071+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": 1018
} | 2026-08-17T01:43:56.191071+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": 701
} | 2026-08-17T01:43:56.191071+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": 757
} | 2026-08-17T01:43:56.191071+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": 3120
} | 2026-08-17T01:43:56.191071+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": 2350
} | 2026-08-17T01:43:56.191071+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": 4361
} | 2026-08-17T01:43:56.191071+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": 6311
} | 2026-08-17T01:43:56.191071+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": 6709
} | 2026-08-17T01:43:56.191071+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": 5520
} | 2026-08-17T01:43:56.191071+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": 36468
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:688-A | codeforces | 688-A | Opponents | https://codeforces.com/problemset/problem/688/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14919
} | 2026-08-17T01:43:56.191071+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": 483
} | 2026-08-17T01:43:56.191071+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": 1166
} | 2026-08-17T01:43:56.191071+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": 9091
} | 2026-08-17T01:43:56.191071+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": 7092
} | 2026-08-17T01:43:56.191071+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": 17005
} | 2026-08-17T01:43:56.191071+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": 8054
} | 2026-08-17T01:43:56.191071+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": 44399
} | 2026-08-17T01:43:56.191071+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": 681
} | 2026-08-17T01:43:56.191071+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": 560
} | 2026-08-17T01:43:56.191071+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": 709
} | 2026-08-17T01:43:56.191071+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": 5636
} | 2026-08-17T01:43:56.191071+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": 4517
} | 2026-08-17T01:43:56.191071+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": 51
} | 2026-08-17T01:43:56.191071+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": 51
} | 2026-08-17T01:43:56.191071+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": 125
} | 2026-08-17T01:43:56.191071+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": 145
} | 2026-08-17T01:43:56.191071+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-08-17T01:43:56.191071+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": 204
} | 2026-08-17T01:43:56.191071+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": 388
} | 2026-08-17T01:43:56.191071+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": 337
} | 2026-08-17T01:43:56.191071+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": 340
} | 2026-08-17T01:43:56.191071+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": 1264
} | 2026-08-17T01:43:56.191071+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": 762
} | 2026-08-17T01:43:56.191071+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": 3567
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:682-C | codeforces | 682-C | Alyona and the Tree | https://codeforces.com/problemset/problem/682/C | [
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8257
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:682-B | codeforces | 682-B | Alyona and Mex | https://codeforces.com/problemset/problem/682/B | [
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12846
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:682-A | codeforces | 682-A | Alyona and Numbers | https://codeforces.com/problemset/problem/682/A | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 24358
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:681-E | codeforces | 681-E | Runaway to a Shadow | https://codeforces.com/problemset/problem/681/E | [
"geometry",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 555
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:681-D | codeforces | 681-D | Gifts by the List | https://codeforces.com/problemset/problem/681/D | [
"constructive algorithms",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1917
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:681-C | codeforces | 681-C | Heap Operations | https://codeforces.com/problemset/problem/681/C | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10724
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:681-B | codeforces | 681-B | Economy Game | https://codeforces.com/problemset/problem/681/B | [
"brute force"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9511
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:681-A | codeforces | 681-A | A Good Contest | https://codeforces.com/problemset/problem/681/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16967
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:680-B | codeforces | 680-B | Bear and Finding Criminals | https://codeforces.com/problemset/problem/680/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 26500
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:680-A | codeforces | 680-A | Bear and Five Cards | https://codeforces.com/problemset/problem/680/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 13380
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:679-E | codeforces | 679-E | Bear and Bad Powers of 42 | https://codeforces.com/problemset/problem/679/E | [
"data structures"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 938
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:679-D | codeforces | 679-D | Bear and Chase | https://codeforces.com/problemset/problem/679/D | [
"brute force",
"dfs and similar",
"graphs",
"implementation",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 406
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:679-C | codeforces | 679-C | Bear and Square Grid | https://codeforces.com/problemset/problem/679/C | [
"dfs and similar",
"dsu",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1304
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:679-B | codeforces | 679-B | Bear and Tower of Cubes | https://codeforces.com/problemset/problem/679/B | [
"binary search",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2361
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:679-A | codeforces | 679-A | Bear and Prime 100 | https://codeforces.com/problemset/problem/679/A | [
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16032
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:678-F | codeforces | 678-F | Lena and Queries | https://codeforces.com/problemset/problem/678/F | [
"data structures",
"divide and conquer",
"geometry"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1114
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:678-E | codeforces | 678-E | Another Sith Tournament | https://codeforces.com/problemset/problem/678/E | [
"bitmasks",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2869
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:678-D | codeforces | 678-D | Iterated Linear Function | https://codeforces.com/problemset/problem/678/D | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5521
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:678-C | codeforces | 678-C | Joty and Chocolate | https://codeforces.com/problemset/problem/678/C | [
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11263
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:678-B | codeforces | 678-B | The Same Calendar | https://codeforces.com/problemset/problem/678/B | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4802
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:678-A | codeforces | 678-A | Johny Likes Numbers | https://codeforces.com/problemset/problem/678/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15407
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:677-E | codeforces | 677-E | Vanya and Balloons | https://codeforces.com/problemset/problem/677/E | [
"binary search",
"brute force",
"dp",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 814
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:677-D | codeforces | 677-D | Vanya and Treasure | https://codeforces.com/problemset/problem/677/D | [
"data structures",
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2111
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:677-C | codeforces | 677-C | Vanya and Label | https://codeforces.com/problemset/problem/677/C | [
"bitmasks",
"combinatorics",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7053
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:677-B | codeforces | 677-B | Vanya and Food Processor | https://codeforces.com/problemset/problem/677/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7968
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:677-A | codeforces | 677-A | Vanya and Fence | https://codeforces.com/problemset/problem/677/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 186799
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:676-E | codeforces | 676-E | The Last Fight Between Human and AI | https://codeforces.com/problemset/problem/676/E | [
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 969
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:676-D | codeforces | 676-D | Theseus and labyrinth | https://codeforces.com/problemset/problem/676/D | [
"graphs",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1999
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:676-C | codeforces | 676-C | Vasya and String | https://codeforces.com/problemset/problem/676/C | [
"binary search",
"dp",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 23639
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:676-B | codeforces | 676-B | Pyramid of Glasses | https://codeforces.com/problemset/problem/676/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5872
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:676-A | codeforces | 676-A | Nicholas and Permutation | https://codeforces.com/problemset/problem/676/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14901
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:675-E | codeforces | 675-E | Trains and Statistic | https://codeforces.com/problemset/problem/675/E | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3455
} | 2026-08-17T01:43:56.191071+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.