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:1772-E | codeforces | 1772-E | Permutation Game | https://codeforces.com/problemset/problem/1772/E | [
"games"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7706
} | 2026-06-01T05:00:40.145500+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": 18600
} | 2026-06-01T05:00:40.145500+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": 26225
} | 2026-06-01T05:00:40.145500+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": 33198
} | 2026-06-01T05:00:40.145500+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": 60898
} | 2026-06-01T05:00:40.145500+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": 1570
} | 2026-06-01T05:00:40.145500+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": 802
} | 2026-06-01T05:00:40.145500+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": 3230
} | 2026-06-01T05:00:40.145500+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": 11793
} | 2026-06-01T05:00:40.145500+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": 21687
} | 2026-06-01T05:00:40.145500+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": 25381
} | 2026-06-01T05:00:40.145500+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": 165
} | 2026-06-01T05:00:40.145500+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": 188
} | 2026-06-01T05:00:40.145500+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": 948
} | 2026-06-01T05:00:40.145500+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": 1612
} | 2026-06-01T05:00:40.145500+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": 4408
} | 2026-06-01T05:00:40.145500+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": 9691
} | 2026-06-01T05:00:40.145500+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": 20900
} | 2026-06-01T05:00:40.145500+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": 25294
} | 2026-06-01T05:00:40.145500+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": 125
} | 2026-06-01T05:00:40.145500+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": 205
} | 2026-06-01T05:00:40.145500+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": 422
} | 2026-06-01T05:00:40.145500+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": 1082
} | 2026-06-01T05:00:40.145500+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": 1123
} | 2026-06-01T05:00:40.145500+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": 953
} | 2026-06-01T05:00:40.145500+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": 1607
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1769-A | codeforces | 1769-A | Узкая дорога | https://codeforces.com/problemset/problem/1769/A | [
"*special",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 2163
} | 2026-06-01T05:00:40.145500+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": 1252
} | 2026-06-01T05:00:40.145500+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": 2277
} | 2026-06-01T05:00:40.145500+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": 9076
} | 2026-06-01T05:00:40.145500+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": 15763
} | 2026-06-01T05:00:40.145500+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": 25704
} | 2026-06-01T05:00:40.145500+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": 31107
} | 2026-06-01T05:00:40.145500+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": 434
} | 2026-06-01T05:00:40.145500+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": 1259
} | 2026-06-01T05:00:40.145500+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": 11226
} | 2026-06-01T05:00:40.145500+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": 3059
} | 2026-06-01T05:00:40.145500+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": 21972
} | 2026-06-01T05:00:40.145500+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": 21566
} | 2026-06-01T05:00:40.145500+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": 361
} | 2026-06-01T05:00:40.145500+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": 1486
} | 2026-06-01T05:00:40.145500+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": 10782
} | 2026-06-01T05:00:40.145500+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": 15019
} | 2026-06-01T05:00:40.145500+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": 23890
} | 2026-06-01T05:00:40.145500+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": 47498
} | 2026-06-01T05:00:40.145500+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": 6012
} | 2026-06-01T05:00:40.145500+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": 32671
} | 2026-06-01T05:00:40.145500+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": 667
} | 2026-06-01T05:00:40.145500+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": 6778
} | 2026-06-01T05:00:40.145500+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": 306
} | 2026-06-01T05:00:40.145500+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": 264
} | 2026-06-01T05:00:40.145500+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": 1534
} | 2026-06-01T05:00:40.145500+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": 481
} | 2026-06-01T05:00:40.145500+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": 762
} | 2026-06-01T05:00:40.145500+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": 11881
} | 2026-06-01T05:00:40.145500+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": 4873
} | 2026-06-01T05:00:40.145500+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": 558
} | 2026-06-01T05:00:40.145500+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": 9885
} | 2026-06-01T05:00:40.145500+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": 852
} | 2026-06-01T05:00:40.145500+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": 253
} | 2026-06-01T05:00:40.145500+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": 575
} | 2026-06-01T05:00:40.145500+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": 651
} | 2026-06-01T05:00:40.145500+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": 710
} | 2026-06-01T05:00:40.145500+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": 1197
} | 2026-06-01T05:00:40.145500+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": 1433
} | 2026-06-01T05:00:40.145500+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": 3158
} | 2026-06-01T05:00:40.145500+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": 10472
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1764-B | codeforces | 1764-B | Doremy's Perfect Math Class | https://codeforces.com/problemset/problem/1764/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 17973
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1764-A | codeforces | 1764-A | Doremy's Paint | https://codeforces.com/problemset/problem/1764/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17496
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1763-F | codeforces | 1763-F | Edge Queries | https://codeforces.com/problemset/problem/1763/F | [
"data structures",
"dfs and similar",
"dp",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 645
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1763-E | codeforces | 1763-E | Node Pairs | https://codeforces.com/problemset/problem/1763/E | [
"dp",
"graphs",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2218
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1763-D | codeforces | 1763-D | Valid Bitonic Permutations | https://codeforces.com/problemset/problem/1763/D | [
"combinatorics",
"dp",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2350
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1763-C | codeforces | 1763-C | Another Array Problem | https://codeforces.com/problemset/problem/1763/C | [
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 7828
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1763-B | codeforces | 1763-B | Incinerate | https://codeforces.com/problemset/problem/1763/B | [
"binary search",
"brute force",
"data structures",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 16457
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1763-A | codeforces | 1763-A | Absolute Maximization | https://codeforces.com/problemset/problem/1763/A | [
"bitmasks",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17026
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1762-G | codeforces | 1762-G | Unequal Adjacent Elements | https://codeforces.com/problemset/problem/1762/G | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 144
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1762-F | codeforces | 1762-F | Good Pairs | https://codeforces.com/problemset/problem/1762/F | [
"binary search",
"data structures",
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 891
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1762-E | codeforces | 1762-E | Tree Sum | https://codeforces.com/problemset/problem/1762/E | [
"combinatorics",
"math",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 853
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1762-D | codeforces | 1762-D | GCD Queries | https://codeforces.com/problemset/problem/1762/D | [
"constructive algorithms",
"interactive",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4379
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1762-C | codeforces | 1762-C | Binary Strings are Fun | https://codeforces.com/problemset/problem/1762/C | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10187
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1762-B | codeforces | 1762-B | Make Array Good | https://codeforces.com/problemset/problem/1762/B | [
"constructive algorithms",
"implementation",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 18657
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1762-A | codeforces | 1762-A | Divide and Conquer | https://codeforces.com/problemset/problem/1762/A | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20616
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1761-G | codeforces | 1761-G | Centroid Guess | https://codeforces.com/problemset/problem/1761/G | [
"interactive",
"probabilities",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 155
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1761-F2 | codeforces | 1761-F2 | Anti-median (Hard Version) | https://codeforces.com/problemset/problem/1761/F2 | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 103
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1761-F1 | codeforces | 1761-F1 | Anti-median (Easy Version) | https://codeforces.com/problemset/problem/1761/F1 | [
"dp",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 260
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1761-E | codeforces | 1761-E | Make It Connected | https://codeforces.com/problemset/problem/1761/E | [
"binary search",
"brute force",
"constructive algorithms",
"dsu",
"graphs",
"greedy",
"matrices",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2167
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1761-D | codeforces | 1761-D | Carry Bit | https://codeforces.com/problemset/problem/1761/D | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2791
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1761-C | codeforces | 1761-C | Set Construction | https://codeforces.com/problemset/problem/1761/C | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10761
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1761-B | codeforces | 1761-B | Elimination of a Ring | https://codeforces.com/problemset/problem/1761/B | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 14765
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1761-A | codeforces | 1761-A | Two Permutations | https://codeforces.com/problemset/problem/1761/A | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 37954
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1760-G | codeforces | 1760-G | SlavicG's Favorite Problem | https://codeforces.com/problemset/problem/1760/G | [
"bitmasks",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10416
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1760-F | codeforces | 1760-F | Quests | https://codeforces.com/problemset/problem/1760/F | [
"binary search",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14848
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1760-E | codeforces | 1760-E | Binary Inversions | https://codeforces.com/problemset/problem/1760/E | [
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 23075
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1760-D | codeforces | 1760-D | Challenging Valleys | https://codeforces.com/problemset/problem/1760/D | [
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 27163
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1760-C | codeforces | 1760-C | Advantage | https://codeforces.com/problemset/problem/1760/C | [
"data structures",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 44060
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1760-B | codeforces | 1760-B | Atilla's Favorite Problem | https://codeforces.com/problemset/problem/1760/B | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 53635
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1760-A | codeforces | 1760-A | Medium Number | https://codeforces.com/problemset/problem/1760/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 80556
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1759-G | codeforces | 1759-G | Restore the Permutation | https://codeforces.com/problemset/problem/1759/G | [
"binary search",
"constructive algorithms",
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5532
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1759-F | codeforces | 1759-F | All Possible Digits | https://codeforces.com/problemset/problem/1759/F | [
"binary search",
"data structures",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4523
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1759-E | codeforces | 1759-E | The Humanoid | https://codeforces.com/problemset/problem/1759/E | [
"brute force",
"dp",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12571
} | 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.