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:690-B1 | codeforces | 690-B1 | Recover Polygon (easy) | https://codeforces.com/problemset/problem/690/B1 | [] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1013
} | 2026-06-01T05:00:40.145500+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": 672
} | 2026-06-01T05:00:40.145500+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": 748
} | 2026-06-01T05:00:40.145500+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": 3099
} | 2026-06-01T05:00:40.145500+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": 2133
} | 2026-06-01T05:00:40.145500+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": 4144
} | 2026-06-01T05:00:40.145500+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": 6203
} | 2026-06-01T05:00:40.145500+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": 6628
} | 2026-06-01T05:00:40.145500+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": 5491
} | 2026-06-01T05:00:40.145500+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": 36156
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:688-A | codeforces | 688-A | Opponents | https://codeforces.com/problemset/problem/688/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14832
} | 2026-06-01T05:00:40.145500+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": 437
} | 2026-06-01T05:00:40.145500+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": 1053
} | 2026-06-01T05:00:40.145500+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": 8449
} | 2026-06-01T05:00:40.145500+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": 6902
} | 2026-06-01T05:00:40.145500+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": 16543
} | 2026-06-01T05:00:40.145500+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": 8017
} | 2026-06-01T05:00:40.145500+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": 43648
} | 2026-06-01T05:00:40.145500+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": 611
} | 2026-06-01T05:00:40.145500+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": 517
} | 2026-06-01T05:00:40.145500+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": 648
} | 2026-06-01T05:00:40.145500+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": 5420
} | 2026-06-01T05:00:40.145500+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": 4504
} | 2026-06-01T05:00:40.145500+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": 46
} | 2026-06-01T05:00:40.145500+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": 49
} | 2026-06-01T05:00:40.145500+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": 124
} | 2026-06-01T05:00:40.145500+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": 144
} | 2026-06-01T05:00:40.145500+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": 168
} | 2026-06-01T05:00:40.145500+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": 202
} | 2026-06-01T05:00:40.145500+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": 386
} | 2026-06-01T05:00:40.145500+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": 336
} | 2026-06-01T05:00:40.145500+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": 339
} | 2026-06-01T05:00:40.145500+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": 1250
} | 2026-06-01T05:00:40.145500+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": 718
} | 2026-06-01T05:00:40.145500+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": 3522
} | 2026-06-01T05:00:40.145500+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": 8103
} | 2026-06-01T05:00:40.145500+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": 12780
} | 2026-06-01T05:00:40.145500+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": 24058
} | 2026-06-01T05:00:40.145500+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": 507
} | 2026-06-01T05:00:40.145500+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": 1891
} | 2026-06-01T05:00:40.145500+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": 10638
} | 2026-06-01T05:00:40.145500+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": 9458
} | 2026-06-01T05:00:40.145500+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": 16894
} | 2026-06-01T05:00:40.145500+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": 26302
} | 2026-06-01T05:00:40.145500+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": 13309
} | 2026-06-01T05:00:40.145500+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": 825
} | 2026-06-01T05:00:40.145500+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": 343
} | 2026-06-01T05:00:40.145500+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": 1265
} | 2026-06-01T05:00:40.145500+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": 2233
} | 2026-06-01T05:00:40.145500+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": 15562
} | 2026-06-01T05:00:40.145500+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": 1042
} | 2026-06-01T05:00:40.145500+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": 2744
} | 2026-06-01T05:00:40.145500+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": 5424
} | 2026-06-01T05:00:40.145500+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": 11097
} | 2026-06-01T05:00:40.145500+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": 4754
} | 2026-06-01T05:00:40.145500+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": 15226
} | 2026-06-01T05:00:40.145500+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": 756
} | 2026-06-01T05:00:40.145500+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": 1973
} | 2026-06-01T05:00:40.145500+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": 6971
} | 2026-06-01T05:00:40.145500+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": 7929
} | 2026-06-01T05:00:40.145500+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": 182085
} | 2026-06-01T05:00:40.145500+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": 942
} | 2026-06-01T05:00:40.145500+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": 1965
} | 2026-06-01T05:00:40.145500+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": 22797
} | 2026-06-01T05:00:40.145500+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": 5839
} | 2026-06-01T05:00:40.145500+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": 14725
} | 2026-06-01T05:00:40.145500+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": 3363
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:675-D | codeforces | 675-D | Tree Construction | https://codeforces.com/problemset/problem/675/D | [
"data structures",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4318
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:675-C | codeforces | 675-C | Money Transfers | https://codeforces.com/problemset/problem/675/C | [
"constructive algorithms",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3861
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:675-B | codeforces | 675-B | Restoring Painting | https://codeforces.com/problemset/problem/675/B | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7737
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:675-A | codeforces | 675-A | Infinite Sequence | https://codeforces.com/problemset/problem/675/A | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15602
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:673-B | codeforces | 673-B | Problems for Round | https://codeforces.com/problemset/problem/673/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 3669
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:673-A | codeforces | 673-A | Bear and Game | https://codeforces.com/problemset/problem/673/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 10874
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:672-B | codeforces | 672-B | Different is Good | https://codeforces.com/problemset/problem/672/B | [
"constructive algorithms",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 18577
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:672-A | codeforces | 672-A | Summer Camp | https://codeforces.com/problemset/problem/672/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16707
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:671-E | codeforces | 671-E | Organizing a Race | https://codeforces.com/problemset/problem/671/E | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 493
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:671-D | codeforces | 671-D | Roads in Yusland | https://codeforces.com/problemset/problem/671/D | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1318
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:671-C | codeforces | 671-C | Ultimate Weirdness of an Array | https://codeforces.com/problemset/problem/671/C | [
"data structures",
"number theory"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 782
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:671-B | codeforces | 671-B | Robin Hood | https://codeforces.com/problemset/problem/671/B | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3298
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:671-A | codeforces | 671-A | Recycling Bottles | https://codeforces.com/problemset/problem/671/A | [
"dp",
"geometry",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4401
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:670-F | codeforces | 670-F | Restore a Number | https://codeforces.com/problemset/problem/670/F | [
"brute force",
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 900
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:670-E | codeforces | 670-E | Correct Bracket Sequence Editor | https://codeforces.com/problemset/problem/670/E | [
"data structures",
"dsu",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3470
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:670-D2 | codeforces | 670-D2 | Magic Powder - 2 | https://codeforces.com/problemset/problem/670/D2 | [
"binary search",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 19628
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:670-D1 | codeforces | 670-D1 | Magic Powder - 1 | https://codeforces.com/problemset/problem/670/D1 | [
"binary search",
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 24310
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:670-C | codeforces | 670-C | Cinema | https://codeforces.com/problemset/problem/670/C | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 10042
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:670-B | codeforces | 670-B | Game of Robots | https://codeforces.com/problemset/problem/670/B | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 12018
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:670-A | codeforces | 670-A | Holidays | https://codeforces.com/problemset/problem/670/A | [
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18693
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:669-A | codeforces | 669-A | Little Artem and Presents | https://codeforces.com/problemset/problem/669/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 11701
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:667-B | codeforces | 667-B | Coat of Anticubism | https://codeforces.com/problemset/problem/667/B | [
"constructive algorithms",
"geometry"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 5884
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:667-A | codeforces | 667-A | Pouring Rain | https://codeforces.com/problemset/problem/667/A | [
"geometry",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 8487
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:666-E | codeforces | 666-E | Forensic Examination | https://codeforces.com/problemset/problem/666/E | [
"data structures",
"string suffix structures"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 1565
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:666-D | codeforces | 666-D | Chain Reaction | https://codeforces.com/problemset/problem/666/D | [
"brute force",
"geometry"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 311
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:666-C | codeforces | 666-C | Codeword | https://codeforces.com/problemset/problem/666/C | [
"combinatorics",
"strings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 915
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:666-B | codeforces | 666-B | World Tour | https://codeforces.com/problemset/problem/666/B | [
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2394
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:666-A | codeforces | 666-A | Reberland Linguistics | https://codeforces.com/problemset/problem/666/A | [
"dp",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3812
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:665-F | codeforces | 665-F | Four Divisors | https://codeforces.com/problemset/problem/665/F | [
"data structures",
"dp",
"math",
"number theory",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 755
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:665-E | codeforces | 665-E | Beautiful Subarrays | https://codeforces.com/problemset/problem/665/E | [
"data structures",
"divide and conquer",
"strings",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4484
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:665-D | codeforces | 665-D | Simple Subset | https://codeforces.com/problemset/problem/665/D | [
"constructive algorithms",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4189
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:665-C | codeforces | 665-C | Simple Strings | https://codeforces.com/problemset/problem/665/C | [
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17548
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:665-B | codeforces | 665-B | Shopping | https://codeforces.com/problemset/problem/665/B | [
"brute force"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 3898
} | 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.