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:2018-E1 | codeforces | 2018-E1 | Complex Segments (Easy Version) | https://codeforces.com/problemset/problem/2018/E1 | [
"binary search",
"data structures",
"divide and conquer",
"dsu",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 241
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2018-D | codeforces | 2018-D | Max Plus Min Plus Size | https://codeforces.com/problemset/problem/2018/D | [
"data structures",
"dp",
"dsu",
"greedy",
"implementation",
"matrices",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2205
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2018-C | codeforces | 2018-C | Tree Pruning | https://codeforces.com/problemset/problem/2018/C | [
"brute force",
"dfs and similar",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9804
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2018-B | codeforces | 2018-B | Speedbreaker | https://codeforces.com/problemset/problem/2018/B | [
"binary search",
"data structures",
"dp",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5221
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2018-A | codeforces | 2018-A | Cards Partition | https://codeforces.com/problemset/problem/2018/A | [
"2-sat",
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12697
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2014-H | codeforces | 2014-H | Robin Hood Archery | https://codeforces.com/problemset/problem/2014/H | [
"data structures",
"divide and conquer",
"greedy",
"hashing"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5820
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2014-G | codeforces | 2014-G | Milky Days | https://codeforces.com/problemset/problem/2014/G | [
"brute force",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1814
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2014-F | codeforces | 2014-F | Sheriff's Defense | https://codeforces.com/problemset/problem/2014/F | [
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5172
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2014-E | codeforces | 2014-E | Rendez-vous de Marian et Robin | https://codeforces.com/problemset/problem/2014/E | [
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8877
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2014-D | codeforces | 2014-D | Robert Hood and Mrs Hood | https://codeforces.com/problemset/problem/2014/D | [
"brute force",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16050
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2014-C | codeforces | 2014-C | Robin Hood in Town | https://codeforces.com/problemset/problem/2014/C | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 27627
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2014-B | codeforces | 2014-B | Robin Hood and the Major Oak | https://codeforces.com/problemset/problem/2014/B | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33307
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2014-A | codeforces | 2014-A | Robin Helps | https://codeforces.com/problemset/problem/2014/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 45945
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2013-F2 | codeforces | 2013-F2 | Game in Tree (Hard Version) | https://codeforces.com/problemset/problem/2013/F2 | [
"binary search",
"data structures",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 167
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2013-F1 | codeforces | 2013-F1 | Game in Tree (Easy Version) | https://codeforces.com/problemset/problem/2013/F1 | [
"binary search",
"brute force",
"data structures",
"dp",
"games",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 661
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2013-E | codeforces | 2013-E | Prefix GCD | https://codeforces.com/problemset/problem/2013/E | [
"brute force",
"dp",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4252
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2013-D | codeforces | 2013-D | Minimize the Difference | https://codeforces.com/problemset/problem/2013/D | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7531
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2013-C | codeforces | 2013-C | Password Cracking | https://codeforces.com/problemset/problem/2013/C | [
"constructive algorithms",
"interactive",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14688
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2013-B | codeforces | 2013-B | Battle for Survive | https://codeforces.com/problemset/problem/2013/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 28387
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2013-A | codeforces | 2013-A | Zhan's Blender | https://codeforces.com/problemset/problem/2013/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31310
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2011-I | codeforces | 2011-I | Stack and Queue | https://codeforces.com/problemset/problem/2011/I | [
"*special",
"data structures",
"divide and conquer"
] | null | null | stdin_stdout | null | {
"solved_count": 24
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2011-H | codeforces | 2011-H | Strange Matrix | https://codeforces.com/problemset/problem/2011/H | [
"*special",
"graphs",
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 58
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2011-G | codeforces | 2011-G | Removal of a Permutation | https://codeforces.com/problemset/problem/2011/G | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 51
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2011-F | codeforces | 2011-F | Good Subarray | https://codeforces.com/problemset/problem/2011/F | [
"*special",
"data structures",
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 132
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2011-E | codeforces | 2011-E | Rock-Paper-Scissors Bot | https://codeforces.com/problemset/problem/2011/E | [
"*special",
"greedy",
"strings"
] | null | null | stdin_stdout | null | {
"solved_count": 184
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2011-D | codeforces | 2011-D | Among Wolves | https://codeforces.com/problemset/problem/2011/D | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 284
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2011-C | codeforces | 2011-C | Split the Expression | https://codeforces.com/problemset/problem/2011/C | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 381
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2011-B | codeforces | 2011-B | Shuffle | https://codeforces.com/problemset/problem/2011/B | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 678
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2011-A | codeforces | 2011-A | Problem Solving | https://codeforces.com/problemset/problem/2011/A | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 1141
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2010-C2 | codeforces | 2010-C2 | Message Transmission Error (hard version) | https://codeforces.com/problemset/problem/2010/C2 | [
"hashing",
"string suffix structures",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4626
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2010-C1 | codeforces | 2010-C1 | Message Transmission Error (easy version) | https://codeforces.com/problemset/problem/2010/C1 | [
"brute force",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9303
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2010-B | codeforces | 2010-B | Three Brothers | https://codeforces.com/problemset/problem/2010/B | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24778
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2010-A | codeforces | 2010-A | Alternating Sum of Numbers | https://codeforces.com/problemset/problem/2010/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21325
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2009-G3 | codeforces | 2009-G3 | Yunli's Subarray Queries (extreme version) | https://codeforces.com/problemset/problem/2009/G3 | [
"data structures",
"dp",
"implementation"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 542
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2009-G2 | codeforces | 2009-G2 | Yunli's Subarray Queries (hard version) | https://codeforces.com/problemset/problem/2009/G2 | [
"binary search",
"data structures",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1769
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2009-G1 | codeforces | 2009-G1 | Yunli's Subarray Queries (easy version) | https://codeforces.com/problemset/problem/2009/G1 | [
"binary search",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5436
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2009-F | codeforces | 2009-F | Firefly's Queries | https://codeforces.com/problemset/problem/2009/F | [
"bitmasks",
"data structures",
"flows",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8545
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2009-E | codeforces | 2009-E | Klee's SUPER DUPER LARGE Array!!! | https://codeforces.com/problemset/problem/2009/E | [
"binary search",
"math",
"ternary search"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17790
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2009-D | codeforces | 2009-D | Satyam and Counting | https://codeforces.com/problemset/problem/2009/D | [
"geometry",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 18891
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2009-C | codeforces | 2009-C | The Legend of Freya the Frog | https://codeforces.com/problemset/problem/2009/C | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 33222
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2009-B | codeforces | 2009-B | osu!mania | https://codeforces.com/problemset/problem/2009/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 53523
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2009-A | codeforces | 2009-A | Minimize! | https://codeforces.com/problemset/problem/2009/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 73605
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2008-H | codeforces | 2008-H | Sakurako's Test | https://codeforces.com/problemset/problem/2008/H | [
"binary search",
"brute force",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3626
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2008-G | codeforces | 2008-G | Sakurako's Task | https://codeforces.com/problemset/problem/2008/G | [
"binary search",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6717
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2008-F | codeforces | 2008-F | Sakurako's Box | https://codeforces.com/problemset/problem/2008/F | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15749
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2008-E | codeforces | 2008-E | Alternating String | https://codeforces.com/problemset/problem/2008/E | [
"brute force",
"data structures",
"dp",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13397
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2008-D | codeforces | 2008-D | Sakurako's Hobby | https://codeforces.com/problemset/problem/2008/D | [
"dp",
"dsu",
"graphs",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 23551
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2008-C | codeforces | 2008-C | Longest Good Array | https://codeforces.com/problemset/problem/2008/C | [
"binary search",
"brute force",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 36662
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2008-B | codeforces | 2008-B | Square or Not | https://codeforces.com/problemset/problem/2008/B | [
"brute force",
"math",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33063
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2008-A | codeforces | 2008-A | Sakurako's Exam | https://codeforces.com/problemset/problem/2008/A | [
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 41969
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2007-C | codeforces | 2007-C | Dora and C++ | https://codeforces.com/problemset/problem/2007/C | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 16086
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2007-B | codeforces | 2007-B | Index and Maximum Value | https://codeforces.com/problemset/problem/2007/B | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 25725
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2007-A | codeforces | 2007-A | Dora's Set | https://codeforces.com/problemset/problem/2007/A | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25332
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2006-F | codeforces | 2006-F | Dora's Paint | https://codeforces.com/problemset/problem/2006/F | [
"brute force",
"combinatorics",
"constructive algorithms",
"graphs",
"implementation"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 168
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2006-E | codeforces | 2006-E | Iris's Full Binary Tree | https://codeforces.com/problemset/problem/2006/E | [
"brute force",
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 320
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2006-D | codeforces | 2006-D | Iris and Adjacent Products | https://codeforces.com/problemset/problem/2006/D | [
"data structures",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 984
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2006-C | codeforces | 2006-C | Eri and Expanded Sets | https://codeforces.com/problemset/problem/2006/C | [
"data structures",
"divide and conquer",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2085
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2006-B | codeforces | 2006-B | Iris and the Tree | https://codeforces.com/problemset/problem/2006/B | [
"brute force",
"data structures",
"dfs and similar",
"dsu",
"math",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4379
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2006-A | codeforces | 2006-A | Iris and Game on the Tree | https://codeforces.com/problemset/problem/2006/A | [
"constructive algorithms",
"dfs and similar",
"games",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9486
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2005-E2 | codeforces | 2005-E2 | Subtangle Game (Hard Version) | https://codeforces.com/problemset/problem/2005/E2 | [
"data structures",
"dp",
"games",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1069
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2005-E1 | codeforces | 2005-E1 | Subtangle Game (Easy Version) | https://codeforces.com/problemset/problem/2005/E1 | [
"dp",
"games",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3341
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2005-D | codeforces | 2005-D | Alter the GCD | https://codeforces.com/problemset/problem/2005/D | [
"binary search",
"brute force",
"data structures",
"divide and conquer",
"implementation",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1263
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2005-C | codeforces | 2005-C | Lazy Narek | https://codeforces.com/problemset/problem/2005/C | [
"dp",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8736
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2005-B2 | codeforces | 2005-B2 | The Strict Teacher (Hard Version) | https://codeforces.com/problemset/problem/2005/B2 | [
"binary search",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 21842
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2005-B1 | codeforces | 2005-B1 | The Strict Teacher (Easy Version) | https://codeforces.com/problemset/problem/2005/B1 | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 24883
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2005-A | codeforces | 2005-A | Simple Palindrome | https://codeforces.com/problemset/problem/2005/A | [
"combinatorics",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 26391
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2004-G | codeforces | 2004-G | Substring Compression | https://codeforces.com/problemset/problem/2004/G | [
"data structures",
"dp",
"matrices"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 423
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2004-F | codeforces | 2004-F | Make a Palindrome | https://codeforces.com/problemset/problem/2004/F | [
"binary search",
"brute force",
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1424
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2004-E | codeforces | 2004-E | Not a Nim Problem | https://codeforces.com/problemset/problem/2004/E | [
"brute force",
"games",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5119
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2004-D | codeforces | 2004-D | Colored Portals | https://codeforces.com/problemset/problem/2004/D | [
"binary search",
"brute force",
"data structures",
"graphs",
"greedy",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13331
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2004-C | codeforces | 2004-C | Splitting Items | https://codeforces.com/problemset/problem/2004/C | [
"games",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 27308
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2004-B | codeforces | 2004-B | Game with Doors | https://codeforces.com/problemset/problem/2004/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 31702
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2004-A | codeforces | 2004-A | Closest Point | https://codeforces.com/problemset/problem/2004/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33797
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2003-F | codeforces | 2003-F | Turtle and Three Sequences | https://codeforces.com/problemset/problem/2003/F | [
"brute force",
"data structures",
"dp",
"greedy",
"math",
"probabilities",
"two pointers"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 808
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2003-E2 | codeforces | 2003-E2 | Turtle and Inversions (Hard Version) | https://codeforces.com/problemset/problem/2003/E2 | [
"brute force",
"data structures",
"divide and conquer",
"dp",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 645
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2003-E1 | codeforces | 2003-E1 | Turtle and Inversions (Easy Version) | https://codeforces.com/problemset/problem/2003/E1 | [
"brute force",
"divide and conquer",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 888
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2003-D2 | codeforces | 2003-D2 | Turtle and a MEX Problem (Hard Version) | https://codeforces.com/problemset/problem/2003/D2 | [
"dfs and similar",
"dp",
"graphs",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4670
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2003-D1 | codeforces | 2003-D1 | Turtle and a MEX Problem (Easy Version) | https://codeforces.com/problemset/problem/2003/D1 | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13510
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2003-C | codeforces | 2003-C | Turtle and Good Pairs | https://codeforces.com/problemset/problem/2003/C | [
"constructive algorithms",
"greedy",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 21773
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2003-B | codeforces | 2003-B | Turtle and Piggy Are Playing a Game 2 | https://codeforces.com/problemset/problem/2003/B | [
"games",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27585
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2003-A | codeforces | 2003-A | Turtle and Good Strings | https://codeforces.com/problemset/problem/2003/A | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32742
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2002-H | codeforces | 2002-H | Counting 101 | https://codeforces.com/problemset/problem/2002/H | [
"greedy"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 104
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2002-G | codeforces | 2002-G | Lattice Optimizing | https://codeforces.com/problemset/problem/2002/G | [
"bitmasks",
"brute force",
"hashing",
"meet-in-the-middle"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 283
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2002-F2 | codeforces | 2002-F2 | Court Blue (Hard Version) | https://codeforces.com/problemset/problem/2002/F2 | [
"brute force",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 579
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2002-F1 | codeforces | 2002-F1 | Court Blue (Easy Version) | https://codeforces.com/problemset/problem/2002/F1 | [
"brute force",
"dfs and similar",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1008
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2002-E | codeforces | 2002-E | Cosmic Rays | https://codeforces.com/problemset/problem/2002/E | [
"brute force",
"data structures",
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2935
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2002-D2 | codeforces | 2002-D2 | DFS Checker (Hard Version) | https://codeforces.com/problemset/problem/2002/D2 | [
"binary search",
"data structures",
"dfs and similar",
"graphs",
"hashing",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2886
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2002-D1 | codeforces | 2002-D1 | DFS Checker (Easy Version) | https://codeforces.com/problemset/problem/2002/D1 | [
"brute force",
"data structures",
"dfs and similar",
"graphs",
"hashing",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5115
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2002-C | codeforces | 2002-C | Black Circles | https://codeforces.com/problemset/problem/2002/C | [
"brute force",
"geometry",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17779
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2002-B | codeforces | 2002-B | Removals Game | https://codeforces.com/problemset/problem/2002/B | [
"constructive algorithms",
"games"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 23109
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2002-A | codeforces | 2002-A | Distanced Coloring | https://codeforces.com/problemset/problem/2002/A | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21348
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2001-E2 | codeforces | 2001-E2 | Deterministic Heap (Hard Version) | https://codeforces.com/problemset/problem/2001/E2 | [
"combinatorics",
"dp",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 289
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2001-E1 | codeforces | 2001-E1 | Deterministic Heap (Easy Version) | https://codeforces.com/problemset/problem/2001/E1 | [
"combinatorics",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1552
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2001-D | codeforces | 2001-D | Longest Max Min Subsequence | https://codeforces.com/problemset/problem/2001/D | [
"brute force",
"constructive algorithms",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6446
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2001-C | codeforces | 2001-C | Guess The Tree | https://codeforces.com/problemset/problem/2001/C | [
"binary search",
"brute force",
"dfs and similar",
"divide and conquer",
"dsu",
"greedy",
"interactive",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12866
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2001-B | codeforces | 2001-B | Generate Permutation | https://codeforces.com/problemset/problem/2001/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26154
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2001-A | codeforces | 2001-A | Make All Equal | https://codeforces.com/problemset/problem/2001/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32959
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2000-H | codeforces | 2000-H | Ksyusha and the Loaded Set | https://codeforces.com/problemset/problem/2000/H | [
"binary search",
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2336
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2000-G | codeforces | 2000-G | Call During the Journey | https://codeforces.com/problemset/problem/2000/G | [
"binary search",
"brute force",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3155
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2000-F | codeforces | 2000-F | Color Rows and Columns | https://codeforces.com/problemset/problem/2000/F | [
"dp",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6991
} | 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.