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: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": 575
} | 2026-04-13T03:38:27.662191+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": 1002
} | 2026-04-13T03:38:27.662191+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": 2910
} | 2026-04-13T03:38:27.662191+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": 2855
} | 2026-04-13T03:38:27.662191+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": 5066
} | 2026-04-13T03:38:27.662191+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": 17644
} | 2026-04-13T03:38:27.662191+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": 22929
} | 2026-04-13T03:38:27.662191+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": 21292
} | 2026-04-13T03:38:27.662191+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": 284
} | 2026-04-13T03:38:27.662191+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": 1532
} | 2026-04-13T03:38:27.662191+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": 6344
} | 2026-04-13T03:38:27.662191+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": 12727
} | 2026-04-13T03:38:27.662191+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": 26035
} | 2026-04-13T03:38:27.662191+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": 32810
} | 2026-04-13T03:38:27.662191+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": 2295
} | 2026-04-13T03:38:27.662191+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": 3115
} | 2026-04-13T03:38:27.662191+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": 6898
} | 2026-04-13T03:38:27.662191+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": 16160
} | 2026-04-13T03:38:27.662191+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": 28658
} | 2026-04-13T03:38:27.662191+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": 31258
} | 2026-04-13T03:38:27.662191+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": 40494
} | 2026-04-13T03:38:27.662191+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": 43961
} | 2026-04-13T03:38:27.662191+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": 10913
} | 2026-04-13T03:38:27.662191+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": 14419
} | 2026-04-13T03:38:27.662191+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": 13893
} | 2026-04-13T03:38:27.662191+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": 23509
} | 2026-04-13T03:38:27.662191+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": 32558
} | 2026-04-13T03:38:27.662191+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": 41451
} | 2026-04-13T03:38:27.662191+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": 41472
} | 2026-04-13T03:38:27.662191+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": 83060
} | 2026-04-13T03:38:27.662191+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": 895
} | 2026-04-13T03:38:27.662191+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": 2276
} | 2026-04-13T03:38:27.662191+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": 4080
} | 2026-04-13T03:38:27.662191+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": 7075
} | 2026-04-13T03:38:27.662191+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": 28050
} | 2026-04-13T03:38:27.662191+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": 26089
} | 2026-04-13T03:38:27.662191+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": 1250
} | 2026-04-13T03:38:27.662191+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": 3761
} | 2026-04-13T03:38:27.662191+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": 15787
} | 2026-04-13T03:38:27.662191+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": 25370
} | 2026-04-13T03:38:27.662191+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": 23421
} | 2026-04-13T03:38:27.662191+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": 33276
} | 2026-04-13T03:38:27.662191+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": 2264
} | 2026-04-13T03:38:27.662191+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": 6286
} | 2026-04-13T03:38:27.662191+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": 12488
} | 2026-04-13T03:38:27.662191+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": 19538
} | 2026-04-13T03:38:27.662191+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": 27900
} | 2026-04-13T03:38:27.662191+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": 36827
} | 2026-04-13T03:38:27.662191+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": 56875
} | 2026-04-13T03:38:27.662191+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": 396
} | 2026-04-13T03:38:27.662191+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": 508
} | 2026-04-13T03:38:27.662191+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": 2874
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1995-C | codeforces | 1995-C | Squaring | https://codeforces.com/problemset/problem/1995/C | [
"brute force",
"constructive algorithms",
"greedy",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 10243
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1995-B2 | codeforces | 1995-B2 | Bouquet (Hard Version) | https://codeforces.com/problemset/problem/1995/B2 | [
"binary search",
"data structures",
"greedy",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10127
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1995-B1 | codeforces | 1995-B1 | Bouquet (Easy Version) | https://codeforces.com/problemset/problem/1995/B1 | [
"binary search",
"brute force",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20898
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1995-A | codeforces | 1995-A | Diagonals | https://codeforces.com/problemset/problem/1995/A | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26370
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1994-H | codeforces | 1994-H | Fortnite | https://codeforces.com/problemset/problem/1994/H | [
"combinatorics",
"constructive algorithms",
"games",
"greedy",
"hashing",
"interactive",
"math",
"number theory",
"strings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 771
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1994-G | codeforces | 1994-G | Minecraft | https://codeforces.com/problemset/problem/1994/G | [
"bitmasks",
"brute force",
"dp",
"graphs",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1611
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1994-F | codeforces | 1994-F | Stardew Valley | https://codeforces.com/problemset/problem/1994/F | [
"constructive algorithms",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1519
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1994-E | codeforces | 1994-E | Wooden Game | https://codeforces.com/problemset/problem/1994/E | [
"bitmasks",
"greedy",
"math",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5462
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1994-D | codeforces | 1994-D | Funny Game | https://codeforces.com/problemset/problem/1994/D | [
"constructive algorithms",
"dsu",
"graphs",
"greedy",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7343
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1994-C | codeforces | 1994-C | Hungry Games | https://codeforces.com/problemset/problem/1994/C | [
"binary search",
"dp",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13470
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1994-B | codeforces | 1994-B | Fun Game | https://codeforces.com/problemset/problem/1994/B | [
"bitmasks",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19419
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1994-A | codeforces | 1994-A | Diverse Game | https://codeforces.com/problemset/problem/1994/A | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22249
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1993-F2 | codeforces | 1993-F2 | Dyn-scripted Robot (Hard Version) | https://codeforces.com/problemset/problem/1993/F2 | [
"chinese remainder theorem",
"math",
"number theory"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 540
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1993-F1 | codeforces | 1993-F1 | Dyn-scripted Robot (Easy Version) | https://codeforces.com/problemset/problem/1993/F1 | [
"brute force",
"chinese remainder theorem",
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1182
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1993-E | codeforces | 1993-E | Xor-Grid Problem | https://codeforces.com/problemset/problem/1993/E | [
"bitmasks",
"constructive algorithms",
"dp",
"implementation"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 725
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1993-D | codeforces | 1993-D | Med-imize | https://codeforces.com/problemset/problem/1993/D | [
"binary search",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4454
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1993-C | codeforces | 1993-C | Light Switches | https://codeforces.com/problemset/problem/1993/C | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16124
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1993-B | codeforces | 1993-B | Parity and Sum | https://codeforces.com/problemset/problem/1993/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 26349
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1993-A | codeforces | 1993-A | Question Marks | https://codeforces.com/problemset/problem/1993/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33054
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1992-G | codeforces | 1992-G | Ultra-Meow | https://codeforces.com/problemset/problem/1992/G | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4125
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1992-F | codeforces | 1992-F | Valuable Cards | https://codeforces.com/problemset/problem/1992/F | [
"brute force",
"dp",
"greedy",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7353
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1992-E | codeforces | 1992-E | Novice's Mistake | https://codeforces.com/problemset/problem/1992/E | [
"brute force",
"constructive algorithms",
"implementation",
"math",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10718
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1992-D | codeforces | 1992-D | Test of Love | https://codeforces.com/problemset/problem/1992/D | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 23913
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1992-C | codeforces | 1992-C | Gorilla and Permutation | https://codeforces.com/problemset/problem/1992/C | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 33167
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1992-B | codeforces | 1992-B | Angry Monk | https://codeforces.com/problemset/problem/1992/B | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 37849
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1992-A | codeforces | 1992-A | Only Pluses | https://codeforces.com/problemset/problem/1992/A | [
"brute force",
"constructive algorithms",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 48999
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1991-I | codeforces | 1991-I | Grid Game | https://codeforces.com/problemset/problem/1991/I | [
"constructive algorithms",
"games",
"graph matchings",
"greedy",
"interactive"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 171
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1991-H | codeforces | 1991-H | Prime Split Game | https://codeforces.com/problemset/problem/1991/H | [
"bitmasks",
"dp",
"fft",
"games",
"math",
"number theory"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 559
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1991-G | codeforces | 1991-G | Grid Reset | https://codeforces.com/problemset/problem/1991/G | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 743
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1991-F | codeforces | 1991-F | Triangle Formation | https://codeforces.com/problemset/problem/1991/F | [
"brute force",
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2770
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1991-E | codeforces | 1991-E | Coloring Game | https://codeforces.com/problemset/problem/1991/E | [
"constructive algorithms",
"dfs and similar",
"games",
"graphs",
"greedy",
"interactive"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5094
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1991-D | codeforces | 1991-D | Prime XOR Coloring | https://codeforces.com/problemset/problem/1991/D | [
"bitmasks",
"constructive algorithms",
"graphs",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7862
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1991-C | codeforces | 1991-C | Absolute Zero | https://codeforces.com/problemset/problem/1991/C | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17653
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1991-B | codeforces | 1991-B | AND Reconstruction | https://codeforces.com/problemset/problem/1991/B | [
"bitmasks",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 18856
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1991-A | codeforces | 1991-A | Maximize the Last Element | https://codeforces.com/problemset/problem/1991/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24339
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1990-F | codeforces | 1990-F | Polygonal Segments | https://codeforces.com/problemset/problem/1990/F | [
"brute force",
"data structures",
"divide and conquer",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 428
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1990-E2 | codeforces | 1990-E2 | Catch the Mole(Hard Version) | https://codeforces.com/problemset/problem/1990/E2 | [
"binary search",
"data structures",
"dfs and similar",
"divide and conquer",
"interactive",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1096
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1990-E1 | codeforces | 1990-E1 | Catch the Mole(Easy Version) | https://codeforces.com/problemset/problem/1990/E1 | [
"binary search",
"data structures",
"dfs and similar",
"interactive",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1134
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1990-D | codeforces | 1990-D | Grid Puzzle | https://codeforces.com/problemset/problem/1990/D | [
"bitmasks",
"brute force",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7691
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1990-C | codeforces | 1990-C | Mad MAD Sum | https://codeforces.com/problemset/problem/1990/C | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14508
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1990-B | codeforces | 1990-B | Array Craft | https://codeforces.com/problemset/problem/1990/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19801
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1990-A | codeforces | 1990-A | Submission Bait | https://codeforces.com/problemset/problem/1990/A | [
"brute force",
"games",
"greedy",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 26774
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1989-F | codeforces | 1989-F | Simultaneous Coloring | https://codeforces.com/problemset/problem/1989/F | [
"dfs and similar",
"divide and conquer",
"graphs"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 600
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1989-E | codeforces | 1989-E | Distance to Different | https://codeforces.com/problemset/problem/1989/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2485
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1989-D | codeforces | 1989-D | Smithing Skill | https://codeforces.com/problemset/problem/1989/D | [
"brute force",
"data structures",
"dp",
"greedy",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7077
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1989-C | codeforces | 1989-C | Two Movies | https://codeforces.com/problemset/problem/1989/C | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 22364
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1989-B | codeforces | 1989-B | Substring and Subsequence | https://codeforces.com/problemset/problem/1989/B | [
"brute force",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 23258
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1989-A | codeforces | 1989-A | Catch the Coin | https://codeforces.com/problemset/problem/1989/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29288
} | 2026-04-13T03:38:27.662191+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.