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:665-A | codeforces | 665-A | Buses Between Cities | https://codeforces.com/problemset/problem/665/A | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 3194
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:664-A | codeforces | 664-A | Complicated GCD | https://codeforces.com/problemset/problem/664/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22022
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:663-A | codeforces | 663-A | Rebus | https://codeforces.com/problemset/problem/663/A | [
"constructive algorithms",
"expression parsing",
"greedy",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3790
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:662-E | codeforces | 662-E | To Hack or not to Hack | https://codeforces.com/problemset/problem/662/E | [
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 164
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:662-D | codeforces | 662-D | International Olympiad | https://codeforces.com/problemset/problem/662/D | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1716
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:662-C | codeforces | 662-C | Binary Table | https://codeforces.com/problemset/problem/662/C | [
"bitmasks",
"brute force",
"divide and conquer",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 2456
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:662-B | codeforces | 662-B | Graph Coloring | https://codeforces.com/problemset/problem/662/B | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1681
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:662-A | codeforces | 662-A | Gambling Nim | https://codeforces.com/problemset/problem/662/A | [
"bitmasks",
"math",
"matrices",
"probabilities"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 602
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:661-H | codeforces | 661-H | Rotate Matrix | https://codeforces.com/problemset/problem/661/H | [
"*special"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 94
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:661-G | codeforces | 661-G | Hungarian Notation | https://codeforces.com/problemset/problem/661/G | [
"*special"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 77
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:661-F | codeforces | 661-F | Primes in Interval | https://codeforces.com/problemset/problem/661/F | [
"*special"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 604
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:661-E | codeforces | 661-E | Divisibility Check | https://codeforces.com/problemset/problem/661/E | [
"*special"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 92
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:661-D | codeforces | 661-D | Maximal Difference | https://codeforces.com/problemset/problem/661/D | [
"*special"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 138
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:661-C | codeforces | 661-C | Array Sum | https://codeforces.com/problemset/problem/661/C | [
"*special"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 139
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:661-B | codeforces | 661-B | Seasons | https://codeforces.com/problemset/problem/661/B | [
"*special"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 237
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:661-A | codeforces | 661-A | Lazy Caterer Sequence | https://codeforces.com/problemset/problem/661/A | [
"*special"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 650
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:660-F | codeforces | 660-F | Bear and Bowling 4 | https://codeforces.com/problemset/problem/660/F | [
"binary search",
"data structures",
"divide and conquer",
"geometry",
"ternary search"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2338
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:660-E | codeforces | 660-E | Different Subsets For All Tuples | https://codeforces.com/problemset/problem/660/E | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1965
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:660-D | codeforces | 660-D | Number of Parallelograms | https://codeforces.com/problemset/problem/660/D | [
"geometry"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4764
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:660-C | codeforces | 660-C | Hard Process | https://codeforces.com/problemset/problem/660/C | [
"binary search",
"dp",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10806
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:660-B | codeforces | 660-B | Seating On Bus | https://codeforces.com/problemset/problem/660/B | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 5895
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:660-A | codeforces | 660-A | Co-prime Array | https://codeforces.com/problemset/problem/660/A | [
"greedy",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10484
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:659-G | codeforces | 659-G | Fence Divercity | https://codeforces.com/problemset/problem/659/G | [
"combinatorics",
"dp",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1318
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:659-F | codeforces | 659-F | Polycarp and Hay | https://codeforces.com/problemset/problem/659/F | [
"dfs and similar",
"dsu",
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1957
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:659-E | codeforces | 659-E | New Reform | https://codeforces.com/problemset/problem/659/E | [
"data structures",
"dfs and similar",
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8011
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:659-D | codeforces | 659-D | Bicycle Race | https://codeforces.com/problemset/problem/659/D | [
"geometry",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6722
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:659-C | codeforces | 659-C | Tanya and Toys | https://codeforces.com/problemset/problem/659/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 11975
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:659-B | codeforces | 659-B | Qualifying Contest | https://codeforces.com/problemset/problem/659/B | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6637
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:659-A | codeforces | 659-A | Round House | https://codeforces.com/problemset/problem/659/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16875
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:658-A | codeforces | 658-A | Bear and Reverse Radewoosh | https://codeforces.com/problemset/problem/658/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 7715
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:656-G | codeforces | 656-G | You're a Professional | https://codeforces.com/problemset/problem/656/G | [
"*special"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 515
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:656-F | codeforces | 656-F | Ace It! | https://codeforces.com/problemset/problem/656/F | [
"*special"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 961
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:656-E | codeforces | 656-E | Out of Controls | https://codeforces.com/problemset/problem/656/E | [
"*special"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 768
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:656-D | codeforces | 656-D | Rosetta Problem | https://codeforces.com/problemset/problem/656/D | [
"*special"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 999
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:656-C | codeforces | 656-C | Without Text | https://codeforces.com/problemset/problem/656/C | [
"*special"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 734
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:656-B | codeforces | 656-B | Scrambled | https://codeforces.com/problemset/problem/656/B | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1770
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:656-A | codeforces | 656-A | Da Vinci Powers | https://codeforces.com/problemset/problem/656/A | [
"*special"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3822
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:653-G | codeforces | 653-G | Move by Prime | https://codeforces.com/problemset/problem/653/G | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 646
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:653-F | codeforces | 653-F | Paper task | https://codeforces.com/problemset/problem/653/F | [
"data structures",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1174
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:653-E | codeforces | 653-E | Bear and Forgotten Tree 2 | https://codeforces.com/problemset/problem/653/E | [
"dfs and similar",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1741
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:653-D | codeforces | 653-D | Delivery Bears | https://codeforces.com/problemset/problem/653/D | [
"binary search",
"flows",
"graphs"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2942
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:653-C | codeforces | 653-C | Bear and Up-Down | https://codeforces.com/problemset/problem/653/C | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1780
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:653-B | codeforces | 653-B | Bear and Compressing | https://codeforces.com/problemset/problem/653/B | [
"brute force",
"dfs and similar",
"dp",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 5350
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:653-A | codeforces | 653-A | Bear and Three Balls | https://codeforces.com/problemset/problem/653/A | [
"brute force",
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 9219
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:652-F | codeforces | 652-F | Ants on a Circle | https://codeforces.com/problemset/problem/652/F | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 656
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:652-E | codeforces | 652-E | Pursuit For Artifacts | https://codeforces.com/problemset/problem/652/E | [
"dfs and similar",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2891
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:652-D | codeforces | 652-D | Nested Segments | https://codeforces.com/problemset/problem/652/D | [
"data structures",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4841
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:652-C | codeforces | 652-C | Foe Pairs | https://codeforces.com/problemset/problem/652/C | [
"combinatorics",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3777
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:652-B | codeforces | 652-B | z-sort | https://codeforces.com/problemset/problem/652/B | [
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 11846
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:652-A | codeforces | 652-A | Gabriel and Caterpillar | https://codeforces.com/problemset/problem/652/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 5271
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:651-B | codeforces | 651-B | Beautiful Paintings | https://codeforces.com/problemset/problem/651/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12246
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:651-A | codeforces | 651-A | Joysticks | https://codeforces.com/problemset/problem/651/A | [
"dp",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 24165
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:650-E | codeforces | 650-E | Clockwork Bomb | https://codeforces.com/problemset/problem/650/E | [
"data structures",
"dfs and similar",
"dsu",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 682
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:650-D | codeforces | 650-D | Zip-line | https://codeforces.com/problemset/problem/650/D | [
"binary search",
"data structures",
"dp",
"hashing"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1600
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:650-C | codeforces | 650-C | Table Compression | https://codeforces.com/problemset/problem/650/C | [
"dfs and similar",
"dp",
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2186
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:650-B | codeforces | 650-B | Image Preview | https://codeforces.com/problemset/problem/650/B | [
"binary search",
"brute force",
"dp",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3497
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:650-A | codeforces | 650-A | Watchmen | https://codeforces.com/problemset/problem/650/A | [
"data structures",
"geometry",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16677
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:649-E | codeforces | 649-E | Автобус | https://codeforces.com/problemset/problem/649/E | [
"binary search",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 156
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:649-D | codeforces | 649-D | Дефрагментация памяти | https://codeforces.com/problemset/problem/649/D | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 436
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:649-C | codeforces | 649-C | Печать условий | https://codeforces.com/problemset/problem/649/C | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 558
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:649-B | codeforces | 649-B | Этажи | https://codeforces.com/problemset/problem/649/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 639
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:649-A | codeforces | 649-A | Любимые числа Поликарпа | https://codeforces.com/problemset/problem/649/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 1680
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:648-E | codeforces | 648-E | Собери число | https://codeforces.com/problemset/problem/648/E | [
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 158
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:648-D | codeforces | 648-D | Собачки и миски | https://codeforces.com/problemset/problem/648/D | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 352
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:648-C | codeforces | 648-C | Путь Робота | https://codeforces.com/problemset/problem/648/C | [
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 1366
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:648-B | codeforces | 648-B | Собери стол | https://codeforces.com/problemset/problem/648/B | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 2171
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:648-A | codeforces | 648-A | Наибольший подъем | https://codeforces.com/problemset/problem/648/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 1127
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:645-G | codeforces | 645-G | Armistice Area Apportionment | https://codeforces.com/problemset/problem/645/G | [
"binary search",
"geometry"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 128
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:645-F | codeforces | 645-F | Cowslip Collections | https://codeforces.com/problemset/problem/645/F | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 971
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:645-E | codeforces | 645-E | Intellectual Inquiry | https://codeforces.com/problemset/problem/645/E | [
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1413
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:645-D | codeforces | 645-D | Robot Rapping Results Report | https://codeforces.com/problemset/problem/645/D | [
"binary search",
"dp",
"graphs"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3352
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:645-C | codeforces | 645-C | Enduring Exodus | https://codeforces.com/problemset/problem/645/C | [
"binary search",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4324
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:645-B | codeforces | 645-B | Mischievous Mess Makers | https://codeforces.com/problemset/problem/645/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 3712
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:645-A | codeforces | 645-A | Amity Assessment | https://codeforces.com/problemset/problem/645/A | [
"brute force",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 3784
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:644-C | codeforces | 644-C | Hostname Aliases | https://codeforces.com/problemset/problem/644/C | [
"*special",
"binary search",
"data structures",
"implementation",
"sortings",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1001
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:644-B | codeforces | 644-B | Processing Queries | https://codeforces.com/problemset/problem/644/B | [
"*special",
"constructive algorithms",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2849
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:644-A | codeforces | 644-A | Parliament of Berland | https://codeforces.com/problemset/problem/644/A | [
"*special",
"constructive algorithms"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 4673
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:643-G | codeforces | 643-G | Choosing Ads | https://codeforces.com/problemset/problem/643/G | [
"data structures"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 1164
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:643-F | codeforces | 643-F | Bears and Juice | https://codeforces.com/problemset/problem/643/F | [
"dp",
"math",
"meet-in-the-middle"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 837
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:643-E | codeforces | 643-E | Bear and Destroying Subtrees | https://codeforces.com/problemset/problem/643/E | [
"dp",
"math",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 702
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:643-D | codeforces | 643-D | Bearish Fanpages | https://codeforces.com/problemset/problem/643/D | [] | null | null | stdin_stdout | 2,900 | {
"solved_count": 340
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:643-C | codeforces | 643-C | Levels and Regions | https://codeforces.com/problemset/problem/643/C | [
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1741
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:643-B | codeforces | 643-B | Bear and Two Paths | https://codeforces.com/problemset/problem/643/B | [
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 3406
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:643-A | codeforces | 643-A | Bear and Colors | https://codeforces.com/problemset/problem/643/A | [
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4827
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:641-G | codeforces | 641-G | Little Artem and Graph | https://codeforces.com/problemset/problem/641/G | [] | null | null | stdin_stdout | 2,300 | {
"solved_count": 119
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:641-F | codeforces | 641-F | Little Artem and 2-SAT | https://codeforces.com/problemset/problem/641/F | [] | null | null | stdin_stdout | 3,000 | {
"solved_count": 246
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:641-E | codeforces | 641-E | Little Artem and Time Machine | https://codeforces.com/problemset/problem/641/E | [
"data structures"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3897
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:641-D | codeforces | 641-D | Little Artem and Random Variable | https://codeforces.com/problemset/problem/641/D | [
"dp",
"implementation",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1575
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:641-C | codeforces | 641-C | Little Artem and Dance | https://codeforces.com/problemset/problem/641/C | [
"brute force",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3194
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:641-B | codeforces | 641-B | Little Artem and Matrix | https://codeforces.com/problemset/problem/641/B | [
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 4393
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:641-A | codeforces | 641-A | Little Artem and Grasshopper | https://codeforces.com/problemset/problem/641/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 6330
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:639-F | codeforces | 639-F | Bear and Chemistry | https://codeforces.com/problemset/problem/639/F | [
"data structures",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 450
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:639-E | codeforces | 639-E | Bear and Paradox | https://codeforces.com/problemset/problem/639/E | [
"binary search",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 617
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:639-D | codeforces | 639-D | Bear and Contribution | https://codeforces.com/problemset/problem/639/D | [
"data structures",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1067
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:639-C | codeforces | 639-C | Bear and Polynomials | https://codeforces.com/problemset/problem/639/C | [
"hashing",
"implementation",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1255
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:639-B | codeforces | 639-B | Bear and Forgotten Tree 3 | https://codeforces.com/problemset/problem/639/B | [
"constructive algorithms",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7006
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:639-A | codeforces | 639-A | Bear and Displayed Friends | https://codeforces.com/problemset/problem/639/A | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 6422
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:638-D | codeforces | 638-D | Three-dimensional Turtle Super Computer | https://codeforces.com/problemset/problem/638/D | [
"brute force",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 793
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:638-C | codeforces | 638-C | Road Improvement | https://codeforces.com/problemset/problem/638/C | [
"*special",
"dfs and similar",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2318
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:638-B | codeforces | 638-B | Making Genome in Berland | https://codeforces.com/problemset/problem/638/B | [
"*special",
"dfs and similar",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 2121
} | 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.