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: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": 5842
} | 2026-11-02T05:37:07.883505+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": 8829
} | 2026-11-02T05:37:07.883505+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": 18537
} | 2026-11-02T05:37:07.883505+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": 19579
} | 2026-11-02T05:37:07.883505+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": 34298
} | 2026-11-02T05:37:07.883505+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": 55203
} | 2026-11-02T05:37:07.883505+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": 77694
} | 2026-11-02T05:37:07.883505+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": 3755
} | 2026-11-02T05:37:07.883505+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": 6920
} | 2026-11-02T05:37:07.883505+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": 16294
} | 2026-11-02T05:37:07.883505+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": 14383
} | 2026-11-02T05:37:07.883505+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": 24167
} | 2026-11-02T05:37:07.883505+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": 37563
} | 2026-11-02T05:37:07.883505+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": 33551
} | 2026-11-02T05:37:07.883505+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": 42893
} | 2026-11-02T05:37:07.883505+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": 16691
} | 2026-11-02T05:37:07.883505+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": 26264
} | 2026-11-02T05:37:07.883505+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": 25590
} | 2026-11-02T05:37:07.883505+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": 185
} | 2026-11-02T05:37:07.883505+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": 339
} | 2026-11-02T05:37:07.883505+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": 1037
} | 2026-11-02T05:37:07.883505+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": 2149
} | 2026-11-02T05:37:07.883505+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": 4514
} | 2026-11-02T05:37:07.883505+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": 10141
} | 2026-11-02T05:37:07.883505+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": 1123
} | 2026-11-02T05:37:07.883505+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": 3431
} | 2026-11-02T05:37:07.883505+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": 1324
} | 2026-11-02T05:37:07.883505+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": 8966
} | 2026-11-02T05:37:07.883505+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": 22535
} | 2026-11-02T05:37:07.883505+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": 25456
} | 2026-11-02T05:37:07.883505+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": 27072
} | 2026-11-02T05:37:07.883505+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": 476
} | 2026-11-02T05:37:07.883505+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": 1476
} | 2026-11-02T05:37:07.883505+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": 5320
} | 2026-11-02T05:37:07.883505+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": 13747
} | 2026-11-02T05:37:07.883505+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": 27765
} | 2026-11-02T05:37:07.883505+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": 32625
} | 2026-11-02T05:37:07.883505+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": 34198
} | 2026-11-02T05:37:07.883505+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": 861
} | 2026-11-02T05:37:07.883505+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": 673
} | 2026-11-02T05:37:07.883505+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": 930
} | 2026-11-02T05:37:07.883505+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": 4800
} | 2026-11-02T05:37:07.883505+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": 13860
} | 2026-11-02T05:37:07.883505+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": 22322
} | 2026-11-02T05:37:07.883505+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": 27870
} | 2026-11-02T05:37:07.883505+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": 33210
} | 2026-11-02T05:37:07.883505+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": 110
} | 2026-11-02T05:37:07.883505+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": 295
} | 2026-11-02T05:37:07.883505+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": 617
} | 2026-11-02T05:37:07.883505+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": 1036
} | 2026-11-02T05:37:07.883505+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": 3071
} | 2026-11-02T05:37:07.883505+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": 2989
} | 2026-11-02T05:37:07.883505+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": 5236
} | 2026-11-02T05:37:07.883505+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": 18157
} | 2026-11-02T05:37:07.883505+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": 23663
} | 2026-11-02T05:37:07.883505+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": 21543
} | 2026-11-02T05:37:07.883505+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": 315
} | 2026-11-02T05:37:07.883505+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": 1604
} | 2026-11-02T05:37:07.883505+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": 6772
} | 2026-11-02T05:37:07.883505+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": 13265
} | 2026-11-02T05:37:07.883505+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": 26396
} | 2026-11-02T05:37:07.883505+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": 33350
} | 2026-11-02T05:37:07.883505+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": 2430
} | 2026-11-02T05:37:07.883505+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": 3306
} | 2026-11-02T05:37:07.883505+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": 7375
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2000-E | codeforces | 2000-E | Photoshoot for Gorillas | https://codeforces.com/problemset/problem/2000/E | [
"combinatorics",
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16938
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2000-D | codeforces | 2000-D | Right Left Wrong | https://codeforces.com/problemset/problem/2000/D | [
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 30561
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2000-C | codeforces | 2000-C | Numeric String Template | https://codeforces.com/problemset/problem/2000/C | [
"data structures",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 32545
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2000-B | codeforces | 2000-B | Seating in a Bus | https://codeforces.com/problemset/problem/2000/B | [
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 42032
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2000-A | codeforces | 2000-A | Primary Task | https://codeforces.com/problemset/problem/2000/A | [
"implementation",
"math",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 45471
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1999-G2 | codeforces | 1999-G2 | Ruler (hard version) | https://codeforces.com/problemset/problem/1999/G2 | [
"binary search",
"interactive",
"ternary search"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11921
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1999-G1 | codeforces | 1999-G1 | Ruler (easy version) | https://codeforces.com/problemset/problem/1999/G1 | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15401
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1999-F | codeforces | 1999-F | Expected Median | https://codeforces.com/problemset/problem/1999/F | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14870
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1999-E | codeforces | 1999-E | Triple Operations | https://codeforces.com/problemset/problem/1999/E | [
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 24678
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1999-D | codeforces | 1999-D | Slavic's Exam | https://codeforces.com/problemset/problem/1999/D | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 33693
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1999-C | codeforces | 1999-C | Showering | https://codeforces.com/problemset/problem/1999/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 42697
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1999-B | codeforces | 1999-B | Card Game | https://codeforces.com/problemset/problem/1999/B | [
"brute force",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 43368
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1999-A | codeforces | 1999-A | A+B Again? | https://codeforces.com/problemset/problem/1999/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 90641
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1998-E2 | codeforces | 1998-E2 | Eliminating Balls With Merging (Hard Version) | https://codeforces.com/problemset/problem/1998/E2 | [
"binary search",
"brute force",
"data structures",
"divide and conquer",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 965
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1998-E1 | codeforces | 1998-E1 | Eliminating Balls With Merging (Easy Version) | https://codeforces.com/problemset/problem/1998/E1 | [
"binary search",
"brute force",
"data structures",
"divide and conquer",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2379
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1998-D | codeforces | 1998-D | Determine Winning Islands in Race | https://codeforces.com/problemset/problem/1998/D | [
"data structures",
"dp",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4240
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1998-C | codeforces | 1998-C | Perform Operations to Maximize Score | https://codeforces.com/problemset/problem/1998/C | [
"binary search",
"brute force",
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7302
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1998-B | codeforces | 1998-B | Minimize Equal Sum Subarrays | https://codeforces.com/problemset/problem/1998/B | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 28806
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1998-A | codeforces | 1998-A | Find K Distinct Points with Fixed Center | https://codeforces.com/problemset/problem/1998/A | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26391
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1997-F | codeforces | 1997-F | Chips on a Line | https://codeforces.com/problemset/problem/1997/F | [
"brute force",
"combinatorics",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1362
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1997-E | codeforces | 1997-E | Level Up | https://codeforces.com/problemset/problem/1997/E | [
"binary search",
"brute force",
"data structures",
"divide and conquer",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3943
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1997-D | codeforces | 1997-D | Maximize the Root | https://codeforces.com/problemset/problem/1997/D | [
"binary search",
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 16624
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1997-C | codeforces | 1997-C | Even Positions | https://codeforces.com/problemset/problem/1997/C | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 26001
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1997-B | codeforces | 1997-B | Make Three Regions | https://codeforces.com/problemset/problem/1997/B | [
"constructive algorithms",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 23828
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1997-A | codeforces | 1997-A | Strong Password | https://codeforces.com/problemset/problem/1997/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34119
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1996-G | codeforces | 1996-G | Penacony | https://codeforces.com/problemset/problem/1996/G | [
"brute force",
"data structures",
"graphs",
"greedy",
"hashing"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2448
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1996-F | codeforces | 1996-F | Bomb | https://codeforces.com/problemset/problem/1996/F | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6683
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1996-E | codeforces | 1996-E | Decode | https://codeforces.com/problemset/problem/1996/E | [
"combinatorics",
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13103
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1996-D | codeforces | 1996-D | Fun | https://codeforces.com/problemset/problem/1996/D | [
"binary search",
"brute force",
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 20330
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1996-C | codeforces | 1996-C | Sort | https://codeforces.com/problemset/problem/1996/C | [
"dp",
"greedy",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 28926
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1996-B | codeforces | 1996-B | Scale | https://codeforces.com/problemset/problem/1996/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 37476
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1996-A | codeforces | 1996-A | Legs | https://codeforces.com/problemset/problem/1996/A | [
"binary search",
"math",
"ternary search"
] | null | null | stdin_stdout | 800 | {
"solved_count": 60498
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1995-E2 | codeforces | 1995-E2 | Let Me Teach You a Lesson (Hard Version) | https://codeforces.com/problemset/problem/1995/E2 | [
"data structures",
"dp",
"matrices",
"two pointers"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 424
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1995-E1 | codeforces | 1995-E1 | Let Me Teach You a Lesson (Easy Version) | https://codeforces.com/problemset/problem/1995/E1 | [
"2-sat",
"data structures",
"dp",
"matrices",
"two pointers"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 546
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1995-D | codeforces | 1995-D | Cases | https://codeforces.com/problemset/problem/1995/D | [
"bitmasks",
"brute force",
"dp",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3114
} | 2026-11-02T05:37:07.883505+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.