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:1776-C | codeforces | 1776-C | Library game | https://codeforces.com/problemset/problem/1776/C | [
"games",
"greedy",
"interactive",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1000
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1776-B | codeforces | 1776-B | Vittorio Plays with LEGO Bricks | https://codeforces.com/problemset/problem/1776/B | [
"dp",
"geometry"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1585
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1776-A | codeforces | 1776-A | Walking Boy | https://codeforces.com/problemset/problem/1776/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 8080
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1775-F | codeforces | 1775-F | Laboratory on Pluto | https://codeforces.com/problemset/problem/1775/F | [
"constructive algorithms",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 925
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1775-E | codeforces | 1775-E | The Human Equation | https://codeforces.com/problemset/problem/1775/E | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3967
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1775-D | codeforces | 1775-D | Friendly Spiders | https://codeforces.com/problemset/problem/1775/D | [
"dfs and similar",
"graphs",
"math",
"number theory",
"shortest paths"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8978
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1775-C | codeforces | 1775-C | Interesting Sequence | https://codeforces.com/problemset/problem/1775/C | [
"bitmasks",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14933
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1775-B | codeforces | 1775-B | Gardener and the Array | https://codeforces.com/problemset/problem/1775/B | [
"bitmasks",
"constructive algorithms"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 22057
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1775-A2 | codeforces | 1775-A2 | Gardener and the Capybaras (hard version) | https://codeforces.com/problemset/problem/1775/A2 | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 20066
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1775-A1 | codeforces | 1775-A1 | Gardener and the Capybaras (easy version) | https://codeforces.com/problemset/problem/1775/A1 | [
"brute force",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20487
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1774-H | codeforces | 1774-H | Maximum Permutation | https://codeforces.com/problemset/problem/1774/H | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 162
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1774-G | codeforces | 1774-G | Segment Covering | https://codeforces.com/problemset/problem/1774/G | [
"brute force",
"combinatorics",
"constructive algorithms",
"data structures",
"dp",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 705
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1774-F2 | codeforces | 1774-F2 | Magician and Pigs (Hard Version) | https://codeforces.com/problemset/problem/1774/F2 | [
"binary search",
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 931
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1774-F1 | codeforces | 1774-F1 | Magician and Pigs (Easy Version) | https://codeforces.com/problemset/problem/1774/F1 | [
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1304
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1774-E | codeforces | 1774-E | Two Chess Pieces | https://codeforces.com/problemset/problem/1774/E | [
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4027
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1774-D | codeforces | 1774-D | Same Count One | https://codeforces.com/problemset/problem/1774/D | [
"brute force",
"constructive algorithms",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9420
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1774-C | codeforces | 1774-C | Ice and Fire | https://codeforces.com/problemset/problem/1774/C | [
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13374
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1774-B | codeforces | 1774-B | Coloring | https://codeforces.com/problemset/problem/1774/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14150
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1774-A | codeforces | 1774-A | Add Plus Minus Sign | https://codeforces.com/problemset/problem/1774/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23699
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1773-L | codeforces | 1773-L | Lisa's Sequences | https://codeforces.com/problemset/problem/1773/L | [
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 130
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1773-K | codeforces | 1773-K | King's Puzzle | https://codeforces.com/problemset/problem/1773/K | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1693
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1773-J | codeforces | 1773-J | Jumbled Trees | https://codeforces.com/problemset/problem/1773/J | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 155
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1773-I | codeforces | 1773-I | Interactive Factorial Guessing | https://codeforces.com/problemset/problem/1773/I | [
"brute force",
"games",
"implementation",
"interactive"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 585
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1773-H | codeforces | 1773-H | Hot and Cold | https://codeforces.com/problemset/problem/1773/H | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 504
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1773-G | codeforces | 1773-G | Game of Questions | https://codeforces.com/problemset/problem/1773/G | [
"bitmasks",
"combinatorics",
"dp",
"fft",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 563
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1773-F | codeforces | 1773-F | Football | https://codeforces.com/problemset/problem/1773/F | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 4896
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1773-E | codeforces | 1773-E | Easy Assembly | https://codeforces.com/problemset/problem/1773/E | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 6144
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1773-D | codeforces | 1773-D | Dominoes | https://codeforces.com/problemset/problem/1773/D | [
"combinatorics",
"flows",
"graph matchings",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 650
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1773-C | codeforces | 1773-C | Cactus Meets Torus | https://codeforces.com/problemset/problem/1773/C | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 56
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1773-B | codeforces | 1773-B | BinCoin | https://codeforces.com/problemset/problem/1773/B | [
"binary search",
"divide and conquer",
"hashing",
"implementation",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 984
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1773-A | codeforces | 1773-A | Amazing Trick | https://codeforces.com/problemset/problem/1773/A | [
"constructive algorithms",
"graph matchings",
"math",
"probabilities"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1952
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1772-G | codeforces | 1772-G | Gaining Rating | https://codeforces.com/problemset/problem/1772/G | [
"binary search",
"greedy",
"implementation",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1644
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1772-F | codeforces | 1772-F | Copy of a Copy of a Copy | https://codeforces.com/problemset/problem/1772/F | [
"constructive algorithms",
"dfs and similar",
"graphs",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2877
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1772-E | codeforces | 1772-E | Permutation Game | https://codeforces.com/problemset/problem/1772/E | [
"games"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7779
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1772-D | codeforces | 1772-D | Absolute Sorting | https://codeforces.com/problemset/problem/1772/D | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 18918
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1772-C | codeforces | 1772-C | Different Differences | https://codeforces.com/problemset/problem/1772/C | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 26480
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1772-B | codeforces | 1772-B | Matrix Rotation | https://codeforces.com/problemset/problem/1772/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33457
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1772-A | codeforces | 1772-A | A+B? | https://codeforces.com/problemset/problem/1772/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 62015
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1771-F | codeforces | 1771-F | Hossam and Range Minimum Query | https://codeforces.com/problemset/problem/1771/F | [
"binary search",
"bitmasks",
"data structures",
"hashing",
"probabilities",
"strings",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1678
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1771-E | codeforces | 1771-E | Hossam and a Letter | https://codeforces.com/problemset/problem/1771/E | [
"brute force",
"dp",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 852
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1771-D | codeforces | 1771-D | Hossam and (sub-)palindromic tree | https://codeforces.com/problemset/problem/1771/D | [
"brute force",
"data structures",
"dfs and similar",
"dp",
"strings",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3308
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1771-C | codeforces | 1771-C | Hossam and Trainees | https://codeforces.com/problemset/problem/1771/C | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11981
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1771-B | codeforces | 1771-B | Hossam and Friends | https://codeforces.com/problemset/problem/1771/B | [
"binary search",
"constructive algorithms",
"dp",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 22715
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1771-A | codeforces | 1771-A | Hossam and Combinatorics | https://codeforces.com/problemset/problem/1771/A | [
"combinatorics",
"math",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 25648
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1770-H | codeforces | 1770-H | Koxia, Mahiru and Winter Festival | https://codeforces.com/problemset/problem/1770/H | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 171
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1770-G | codeforces | 1770-G | Koxia and Bracket | https://codeforces.com/problemset/problem/1770/G | [
"divide and conquer",
"fft",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 196
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1770-F | codeforces | 1770-F | Koxia and Sequence | https://codeforces.com/problemset/problem/1770/F | [
"bitmasks",
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 1088
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1770-E | codeforces | 1770-E | Koxia and Tree | https://codeforces.com/problemset/problem/1770/E | [
"combinatorics",
"dfs and similar",
"dp",
"dsu",
"math",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1643
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1770-D | codeforces | 1770-D | Koxia and Game | https://codeforces.com/problemset/problem/1770/D | [
"constructive algorithms",
"data structures",
"dfs and similar",
"dsu",
"flows",
"games",
"graph matchings",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4480
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1770-C | codeforces | 1770-C | Koxia and Number Theory | https://codeforces.com/problemset/problem/1770/C | [
"brute force",
"chinese remainder theorem",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9790
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1770-B | codeforces | 1770-B | Koxia and Permutation | https://codeforces.com/problemset/problem/1770/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 21033
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1770-A | codeforces | 1770-A | Koxia and Whiteboards | https://codeforces.com/problemset/problem/1770/A | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 25498
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1769-D3 | codeforces | 1769-D3 | Игра в Девятку III | https://codeforces.com/problemset/problem/1769/D3 | [
"*special",
"brute force"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 130
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1769-D2 | codeforces | 1769-D2 | Игра в Девятку II | https://codeforces.com/problemset/problem/1769/D2 | [
"*special",
"brute force"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 211
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1769-D1 | codeforces | 1769-D1 | Игра в Девятку I | https://codeforces.com/problemset/problem/1769/D1 | [
"*special",
"brute force",
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 424
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1769-C2 | codeforces | 1769-C2 | Подкрутка II | https://codeforces.com/problemset/problem/1769/C2 | [
"*special",
"dp"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 1094
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1769-C1 | codeforces | 1769-C1 | Подкрутка I | https://codeforces.com/problemset/problem/1769/C1 | [
"*special",
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 1127
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1769-B2 | codeforces | 1769-B2 | Копирование файлов II | https://codeforces.com/problemset/problem/1769/B2 | [
"*special",
"binary search",
"brute force",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 960
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1769-B1 | codeforces | 1769-B1 | Копирование файлов I | https://codeforces.com/problemset/problem/1769/B1 | [
"*special",
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 1632
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1769-A | codeforces | 1769-A | Узкая дорога | https://codeforces.com/problemset/problem/1769/A | [
"*special",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 2176
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1768-F | codeforces | 1768-F | Wonderful Jump | https://codeforces.com/problemset/problem/1768/F | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1302
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1768-E | codeforces | 1768-E | Partial Sorting | https://codeforces.com/problemset/problem/1768/E | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2371
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1768-D | codeforces | 1768-D | Lucky Permutation | https://codeforces.com/problemset/problem/1768/D | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9300
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1768-C | codeforces | 1768-C | Elemental Decompress | https://codeforces.com/problemset/problem/1768/C | [
"constructive algorithms",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15867
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1768-B | codeforces | 1768-B | Quick Sort | https://codeforces.com/problemset/problem/1768/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 25916
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1768-A | codeforces | 1768-A | Greatest Convex | https://codeforces.com/problemset/problem/1768/A | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31235
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1767-F | codeforces | 1767-F | Two Subtrees | https://codeforces.com/problemset/problem/1767/F | [
"data structures",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 461
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1767-E | codeforces | 1767-E | Algebra Flash | https://codeforces.com/problemset/problem/1767/E | [
"bitmasks",
"brute force",
"dp",
"graphs",
"math",
"meet-in-the-middle",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1327
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1767-D | codeforces | 1767-D | Playoff | https://codeforces.com/problemset/problem/1767/D | [
"combinatorics",
"constructive algorithms",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11355
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1767-C | codeforces | 1767-C | Count Binary Strings | https://codeforces.com/problemset/problem/1767/C | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3171
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1767-B | codeforces | 1767-B | Block Towers | https://codeforces.com/problemset/problem/1767/B | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22201
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1767-A | codeforces | 1767-A | Cut the Triangle | https://codeforces.com/problemset/problem/1767/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21650
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1766-F | codeforces | 1766-F | MCF | https://codeforces.com/problemset/problem/1766/F | [
"flows"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 424
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1766-E | codeforces | 1766-E | Decomposition | https://codeforces.com/problemset/problem/1766/E | [
"binary search",
"brute force",
"data structures",
"divide and conquer",
"dp",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1532
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1766-D | codeforces | 1766-D | Lucky Chains | https://codeforces.com/problemset/problem/1766/D | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10964
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1766-C | codeforces | 1766-C | Hamiltonian Wall | https://codeforces.com/problemset/problem/1766/C | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15109
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1766-B | codeforces | 1766-B | Notepad# | https://codeforces.com/problemset/problem/1766/B | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 24100
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1766-A | codeforces | 1766-A | Extremely Round | https://codeforces.com/problemset/problem/1766/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 50382
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1765-N | codeforces | 1765-N | Number Reduction | https://codeforces.com/problemset/problem/1765/N | [
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6119
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1765-M | codeforces | 1765-M | Minimum LCM | https://codeforces.com/problemset/problem/1765/M | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 34973
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1765-L | codeforces | 1765-L | Project Manager | https://codeforces.com/problemset/problem/1765/L | [
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 697
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1765-K | codeforces | 1765-K | Torus Path | https://codeforces.com/problemset/problem/1765/K | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6867
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1765-J | codeforces | 1765-J | Hero to Zero | https://codeforces.com/problemset/problem/1765/J | [
"graph matchings",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 396
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1765-I | codeforces | 1765-I | Infinite Chess | https://codeforces.com/problemset/problem/1765/I | [
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 308
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1765-H | codeforces | 1765-H | Hospital Queue | https://codeforces.com/problemset/problem/1765/H | [
"binary search",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1585
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1765-G | codeforces | 1765-G | Guess the String | https://codeforces.com/problemset/problem/1765/G | [
"constructive algorithms",
"interactive",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 497
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1765-F | codeforces | 1765-F | Chemistry Lab | https://codeforces.com/problemset/problem/1765/F | [
"dp",
"geometry",
"probabilities"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 798
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1765-E | codeforces | 1765-E | Exchange | https://codeforces.com/problemset/problem/1765/E | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 12025
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1765-D | codeforces | 1765-D | Watch the Videos | https://codeforces.com/problemset/problem/1765/D | [
"binary search",
"constructive algorithms",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4925
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1765-C | codeforces | 1765-C | Card Guessing | https://codeforces.com/problemset/problem/1765/C | [
"combinatorics",
"dp",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 674
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1765-B | codeforces | 1765-B | Broken Keyboard | https://codeforces.com/problemset/problem/1765/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 9959
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1765-A | codeforces | 1765-A | Access Levels | https://codeforces.com/problemset/problem/1765/A | [
"bitmasks",
"dsu",
"flows",
"graph matchings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 883
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1764-H | codeforces | 1764-H | Doremy's Paint 2 | https://codeforces.com/problemset/problem/1764/H | [
"data structures"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 304
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1764-G3 | codeforces | 1764-G3 | Doremy's Perfect DS Class (Hard Version) | https://codeforces.com/problemset/problem/1764/G3 | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 629
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1764-G2 | codeforces | 1764-G2 | Doremy's Perfect DS Class (Medium Version) | https://codeforces.com/problemset/problem/1764/G2 | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 746
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1764-G1 | codeforces | 1764-G1 | Doremy's Perfect DS Class (Easy Version) | https://codeforces.com/problemset/problem/1764/G1 | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 802
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1764-F | codeforces | 1764-F | Doremy's Experimental Tree | https://codeforces.com/problemset/problem/1764/F | [
"brute force",
"constructive algorithms",
"dfs and similar",
"dsu",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1265
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1764-E | codeforces | 1764-E | Doremy's Number Line | https://codeforces.com/problemset/problem/1764/E | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1469
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1764-D | codeforces | 1764-D | Doremy's Pegging Game | https://codeforces.com/problemset/problem/1764/D | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3231
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1764-C | codeforces | 1764-C | Doremy's City Construction | https://codeforces.com/problemset/problem/1764/C | [
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10548
} | 2026-08-10T02:20:32.917453+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.