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:1802-A | codeforces | 1802-A | Likes | https://codeforces.com/problemset/problem/1802/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16723
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1801-G | codeforces | 1801-G | A task for substrings | https://codeforces.com/problemset/problem/1801/G | [
"data structures",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 720
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1801-F | codeforces | 1801-F | Another n-dimensional chocolate bar | https://codeforces.com/problemset/problem/1801/F | [
"dp",
"math",
"meet-in-the-middle",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 751
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1801-E | codeforces | 1801-E | Gasoline prices | https://codeforces.com/problemset/problem/1801/E | [
"data structures",
"divide and conquer",
"dsu",
"hashing",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 619
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1801-D | codeforces | 1801-D | The way home | https://codeforces.com/problemset/problem/1801/D | [
"binary search",
"data structures",
"dp",
"graphs",
"greedy",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2887
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1801-C | codeforces | 1801-C | Music Festival | https://codeforces.com/problemset/problem/1801/C | [
"binary search",
"data structures",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4114
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1801-B | codeforces | 1801-B | Buying gifts | https://codeforces.com/problemset/problem/1801/B | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7584
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1801-A | codeforces | 1801-A | The Very Beautiful Blanket | https://codeforces.com/problemset/problem/1801/A | [
"bitmasks",
"constructive algorithms"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9798
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1800-G | codeforces | 1800-G | Symmetree | https://codeforces.com/problemset/problem/1800/G | [
"dfs and similar",
"hashing",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2538
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1800-F | codeforces | 1800-F | Dasha and Nightmares | https://codeforces.com/problemset/problem/1800/F | [
"bitmasks",
"hashing",
"meet-in-the-middle",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4772
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1800-E2 | codeforces | 1800-E2 | Unforgivable Curse (hard version) | https://codeforces.com/problemset/problem/1800/E2 | [
"brute force",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15335
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1800-E1 | codeforces | 1800-E1 | Unforgivable Curse (easy version) | https://codeforces.com/problemset/problem/1800/E1 | [
"brute force",
"constructive algorithms",
"dsu",
"graphs",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15666
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1800-D | codeforces | 1800-D | Remove Two Letters | https://codeforces.com/problemset/problem/1800/D | [
"data structures",
"greedy",
"hashing",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 29634
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1800-C2 | codeforces | 1800-C2 | Powering the Hero (hard version) | https://codeforces.com/problemset/problem/1800/C2 | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 27311
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1800-C1 | codeforces | 1800-C1 | Powering the Hero (easy version) | https://codeforces.com/problemset/problem/1800/C1 | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 27170
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1800-B | codeforces | 1800-B | Count the Number of Pairs | https://codeforces.com/problemset/problem/1800/B | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 28535
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1800-A | codeforces | 1800-A | Is It a Cat? | https://codeforces.com/problemset/problem/1800/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 36809
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1799-H | codeforces | 1799-H | Tree Cutting | https://codeforces.com/problemset/problem/1799/H | [
"bitmasks",
"dfs and similar",
"dp"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 393
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1799-G | codeforces | 1799-G | Count Voting | https://codeforces.com/problemset/problem/1799/G | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1079
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1799-F | codeforces | 1799-F | Halve or Subtract | https://codeforces.com/problemset/problem/1799/F | [
"binary search",
"brute force",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1085
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1799-E | codeforces | 1799-E | City Union | https://codeforces.com/problemset/problem/1799/E | [
"constructive algorithms",
"dfs and similar",
"dsu",
"geometry",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1408
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1799-D2 | codeforces | 1799-D2 | Hot Start Up (hard version) | https://codeforces.com/problemset/problem/1799/D2 | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3095
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1799-D1 | codeforces | 1799-D1 | Hot Start Up (easy version) | https://codeforces.com/problemset/problem/1799/D1 | [
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5871
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1799-C | codeforces | 1799-C | Double Lexicographically Minimum | https://codeforces.com/problemset/problem/1799/C | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6960
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1799-B | codeforces | 1799-B | Equalize by Divide | https://codeforces.com/problemset/problem/1799/B | [
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12799
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1799-A | codeforces | 1799-A | Recent Actions | https://codeforces.com/problemset/problem/1799/A | [
"data structures",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12344
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1798-F | codeforces | 1798-F | Gifts from Grandfather Ahmed | https://codeforces.com/problemset/problem/1798/F | [
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 647
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1798-E | codeforces | 1798-E | Multitest Generator | https://codeforces.com/problemset/problem/1798/E | [
"brute force",
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2071
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1798-D | codeforces | 1798-D | Shocking Arrangement | https://codeforces.com/problemset/problem/1798/D | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14300
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1798-C | codeforces | 1798-C | Candy Store | https://codeforces.com/problemset/problem/1798/C | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9463
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1798-B | codeforces | 1798-B | Three Sevens | https://codeforces.com/problemset/problem/1798/B | [
"brute force",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 18845
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1798-A | codeforces | 1798-A | Showstopper | https://codeforces.com/problemset/problem/1798/A | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21074
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1797-F | codeforces | 1797-F | Li Hua and Path | https://codeforces.com/problemset/problem/1797/F | [
"data structures",
"dfs and similar",
"divide and conquer",
"dsu",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 566
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1797-E | codeforces | 1797-E | Li Hua and Array | https://codeforces.com/problemset/problem/1797/E | [
"brute force",
"data structures",
"dsu",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1645
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1797-D | codeforces | 1797-D | Li Hua and Tree | https://codeforces.com/problemset/problem/1797/D | [
"brute force",
"data structures",
"dfs and similar",
"dp",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4661
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1797-C | codeforces | 1797-C | Li Hua and Chess | https://codeforces.com/problemset/problem/1797/C | [
"constructive algorithms",
"greedy",
"interactive"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8966
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1797-B | codeforces | 1797-B | Li Hua and Pattern | https://codeforces.com/problemset/problem/1797/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 25076
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1797-A | codeforces | 1797-A | Li Hua and Maze | https://codeforces.com/problemset/problem/1797/A | [
"constructive algorithms",
"flows",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19544
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1796-F | codeforces | 1796-F | Strange Triples | https://codeforces.com/problemset/problem/1796/F | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 225
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1796-E | codeforces | 1796-E | Colored Subgraphs | https://codeforces.com/problemset/problem/1796/E | [
"dfs and similar",
"dp",
"games",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1037
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1796-D | codeforces | 1796-D | Maximum Subarray | https://codeforces.com/problemset/problem/1796/D | [
"data structures",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5487
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1796-C | codeforces | 1796-C | Maximum Set | https://codeforces.com/problemset/problem/1796/C | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12229
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1796-B | codeforces | 1796-B | Asterisk-Minor Template | https://codeforces.com/problemset/problem/1796/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 18366
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1796-A | codeforces | 1796-A | Typical Interview Problem | https://codeforces.com/problemset/problem/1796/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19704
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1795-G | codeforces | 1795-G | Removal Sequences | https://codeforces.com/problemset/problem/1795/G | [
"bitmasks",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 820
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1795-F | codeforces | 1795-F | Blocking Chips | https://codeforces.com/problemset/problem/1795/F | [
"binary search",
"constructive algorithms",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1380
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1795-E | codeforces | 1795-E | Explosions? | https://codeforces.com/problemset/problem/1795/E | [
"binary search",
"data structures",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2394
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1795-D | codeforces | 1795-D | Triangle Coloring | https://codeforces.com/problemset/problem/1795/D | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13271
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1795-C | codeforces | 1795-C | Tea Tasting | https://codeforces.com/problemset/problem/1795/C | [
"binary search",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 18294
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1795-B | codeforces | 1795-B | Ideal Point | https://codeforces.com/problemset/problem/1795/B | [
"brute force",
"geometry",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 24160
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1795-A | codeforces | 1795-A | Two Towers | https://codeforces.com/problemset/problem/1795/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24690
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1794-E | codeforces | 1794-E | Labeling the Tree with Distances | https://codeforces.com/problemset/problem/1794/E | [
"data structures",
"dp",
"greedy",
"hashing",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1537
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1794-D | codeforces | 1794-D | Counting Factorizations | https://codeforces.com/problemset/problem/1794/D | [
"combinatorics",
"divide and conquer",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4525
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1794-C | codeforces | 1794-C | Scoring Subsequences | https://codeforces.com/problemset/problem/1794/C | [
"binary search",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 22454
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1794-B | codeforces | 1794-B | Not Dividing | https://codeforces.com/problemset/problem/1794/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 40777
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1794-A | codeforces | 1794-A | Prefix and Suffix Array | https://codeforces.com/problemset/problem/1794/A | [
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18874
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1793-F | codeforces | 1793-F | Rebrending | https://codeforces.com/problemset/problem/1793/F | [
"brute force",
"data structures",
"divide and conquer",
"implementation"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1637
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1793-E | codeforces | 1793-E | Velepin and Marketing | https://codeforces.com/problemset/problem/1793/E | [
"binary search",
"data structures",
"dp",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1335
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1793-D | codeforces | 1793-D | Moscow Gorillas | https://codeforces.com/problemset/problem/1793/D | [
"binary search",
"dp",
"greedy",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7173
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1793-C | codeforces | 1793-C | Dora and Search | https://codeforces.com/problemset/problem/1793/C | [
"constructive algorithms",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 33751
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1793-B | codeforces | 1793-B | Fedya and Array | https://codeforces.com/problemset/problem/1793/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17138
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1793-A | codeforces | 1793-A | Yet Another Promotion | https://codeforces.com/problemset/problem/1793/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18848
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1792-F2 | codeforces | 1792-F2 | Graph Coloring (hard version) | https://codeforces.com/problemset/problem/1792/F2 | [
"brute force",
"combinatorics",
"divide and conquer",
"dp",
"fft",
"graphs"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 503
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1792-F1 | codeforces | 1792-F1 | Graph Coloring (easy version) | https://codeforces.com/problemset/problem/1792/F1 | [
"combinatorics",
"dp",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 991
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1792-E | codeforces | 1792-E | Divisors and Table | https://codeforces.com/problemset/problem/1792/E | [
"brute force",
"dfs and similar",
"dp",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1602
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1792-D | codeforces | 1792-D | Fixed Prefix Permutations | https://codeforces.com/problemset/problem/1792/D | [
"binary search",
"bitmasks",
"data structures",
"hashing",
"math",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8145
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1792-C | codeforces | 1792-C | Min Max Sort | https://codeforces.com/problemset/problem/1792/C | [
"binary search",
"brute force",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 16856
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1792-B | codeforces | 1792-B | Stand-up Comedian | https://codeforces.com/problemset/problem/1792/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 24240
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1792-A | codeforces | 1792-A | GamingForces | https://codeforces.com/problemset/problem/1792/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31057
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1791-G2 | codeforces | 1791-G2 | Teleporters (Hard Version) | https://codeforces.com/problemset/problem/1791/G2 | [
"binary search",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6043
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1791-G1 | codeforces | 1791-G1 | Teleporters (Easy Version) | https://codeforces.com/problemset/problem/1791/G1 | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 34484
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1791-F | codeforces | 1791-F | Range Update Point Query | https://codeforces.com/problemset/problem/1791/F | [
"binary search",
"brute force",
"data structures"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15634
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1791-E | codeforces | 1791-E | Negatives and Positives | https://codeforces.com/problemset/problem/1791/E | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 41902
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1791-D | codeforces | 1791-D | Distinct Split | https://codeforces.com/problemset/problem/1791/D | [
"brute force",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 50127
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1791-C | codeforces | 1791-C | Prepend and Append | https://codeforces.com/problemset/problem/1791/C | [
"implementation",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 75608
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1791-B | codeforces | 1791-B | Following Directions | https://codeforces.com/problemset/problem/1791/B | [
"geometry",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 52947
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1791-A | codeforces | 1791-A | Codeforces Checking | https://codeforces.com/problemset/problem/1791/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 81360
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1790-G | codeforces | 1790-G | Tokens on Graph | https://codeforces.com/problemset/problem/1790/G | [
"constructive algorithms",
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1319
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1790-F | codeforces | 1790-F | Timofey and Black-White Tree | https://codeforces.com/problemset/problem/1790/F | [
"brute force",
"dfs and similar",
"divide and conquer",
"graphs",
"greedy",
"math",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4025
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1790-E | codeforces | 1790-E | Vlad and a Pair of Numbers | https://codeforces.com/problemset/problem/1790/E | [
"bitmasks",
"constructive algorithms"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17378
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1790-D | codeforces | 1790-D | Matryoshkas | https://codeforces.com/problemset/problem/1790/D | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 32181
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1790-C | codeforces | 1790-C | Premutation | https://codeforces.com/problemset/problem/1790/C | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 26904
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1790-B | codeforces | 1790-B | Taisia and Dice | https://codeforces.com/problemset/problem/1790/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29045
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1790-A | codeforces | 1790-A | Polycarp and the Day of Pi | https://codeforces.com/problemset/problem/1790/A | [
"implementation",
"math",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 41158
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1789-F | codeforces | 1789-F | Serval and Brain Power | https://codeforces.com/problemset/problem/1789/F | [
"bitmasks",
"brute force",
"dp",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1002
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1789-E | codeforces | 1789-E | Serval and Music Game | https://codeforces.com/problemset/problem/1789/E | [
"brute force",
"dp",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 970
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1789-D | codeforces | 1789-D | Serval and Shift-Shift-Shift | https://codeforces.com/problemset/problem/1789/D | [
"bitmasks",
"brute force",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1939
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1789-C | codeforces | 1789-C | Serval and Toxel's Arrays | https://codeforces.com/problemset/problem/1789/C | [
"combinatorics",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9968
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1789-B | codeforces | 1789-B | Serval and Inversion Magic | https://codeforces.com/problemset/problem/1789/B | [
"brute force",
"implementation",
"strings",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17602
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1789-A | codeforces | 1789-A | Serval and Mocha's Array | https://codeforces.com/problemset/problem/1789/A | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34336
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1788-F | codeforces | 1788-F | XOR, Tree, and Queries | https://codeforces.com/problemset/problem/1788/F | [
"bitmasks",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1175
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1788-E | codeforces | 1788-E | Sum Over Zero | https://codeforces.com/problemset/problem/1788/E | [
"data structures",
"dfs and similar",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3307
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1788-D | codeforces | 1788-D | Moving Dots | https://codeforces.com/problemset/problem/1788/D | [
"binary search",
"brute force",
"combinatorics",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4698
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1788-C | codeforces | 1788-C | Matching Numbers | https://codeforces.com/problemset/problem/1788/C | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 19521
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1788-B | codeforces | 1788-B | Sum of Two Numbers | https://codeforces.com/problemset/problem/1788/B | [
"constructive algorithms",
"greedy",
"implementation",
"math",
"probabilities"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22417
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1788-A | codeforces | 1788-A | One and Two | https://codeforces.com/problemset/problem/1788/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 54547
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1787-I | codeforces | 1787-I | Treasure Hunt | https://codeforces.com/problemset/problem/1787/I | [
"data structures",
"divide and conquer",
"two pointers"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 362
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1787-H | codeforces | 1787-H | Codeforces Scoreboard | https://codeforces.com/problemset/problem/1787/H | [
"binary search",
"data structures",
"dp",
"geometry"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 340
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1787-G | codeforces | 1787-G | Colorful Tree Again | https://codeforces.com/problemset/problem/1787/G | [
"brute force",
"data structures",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 563
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1787-F | codeforces | 1787-F | Inverse Transformation | https://codeforces.com/problemset/problem/1787/F | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 805
} | 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.