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:1968-G1 | codeforces | 1968-G1 | Division + LCP (easy version) | https://codeforces.com/problemset/problem/1968/G1 | [
"binary search",
"data structures",
"dp",
"hashing",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5607
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1968-F | codeforces | 1968-F | Equal XOR Segments | https://codeforces.com/problemset/problem/1968/F | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7209
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1968-E | codeforces | 1968-E | Cells Arrangement | https://codeforces.com/problemset/problem/1968/E | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13059
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1968-D | codeforces | 1968-D | Permutation Game | https://codeforces.com/problemset/problem/1968/D | [
"brute force",
"dfs and similar",
"games",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17904
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1968-C | codeforces | 1968-C | Assembly via Remainders | https://codeforces.com/problemset/problem/1968/C | [
"constructive algorithms",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 30102
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1968-B | codeforces | 1968-B | Prefiquence | https://codeforces.com/problemset/problem/1968/B | [
"greedy",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32278
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1968-A | codeforces | 1968-A | Maximize? | https://codeforces.com/problemset/problem/1968/A | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 40437
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1967-F | codeforces | 1967-F | Next and Prev | https://codeforces.com/problemset/problem/1967/F | [
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 109
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1967-E2 | codeforces | 1967-E2 | Again Counting Arrays (Hard Version) | https://codeforces.com/problemset/problem/1967/E2 | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 244
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1967-E1 | codeforces | 1967-E1 | Again Counting Arrays (Easy Version) | https://codeforces.com/problemset/problem/1967/E1 | [
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 486
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1967-D | codeforces | 1967-D | Long Way to be Non-decreasing | https://codeforces.com/problemset/problem/1967/D | [
"binary search",
"dfs and similar",
"graphs",
"implementation",
"shortest paths",
"two pointers"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1070
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1967-C | codeforces | 1967-C | Fenwick Tree | https://codeforces.com/problemset/problem/1967/C | [
"bitmasks",
"brute force",
"combinatorics",
"data structures",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2347
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1967-B2 | codeforces | 1967-B2 | Reverse Card (Hard Version) | https://codeforces.com/problemset/problem/1967/B2 | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 5056
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1967-B1 | codeforces | 1967-B1 | Reverse Card (Easy Version) | https://codeforces.com/problemset/problem/1967/B1 | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16625
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1967-A | codeforces | 1967-A | Permutation Counting | https://codeforces.com/problemset/problem/1967/A | [
"binary search",
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15477
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1966-B | codeforces | 1966-B | Rectangle Filling | https://codeforces.com/problemset/problem/1966/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17657
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1966-A | codeforces | 1966-A | Card Exchange | https://codeforces.com/problemset/problem/1966/A | [
"constructive algorithms",
"games",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19822
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1965-F | codeforces | 1965-F | Conference | https://codeforces.com/problemset/problem/1965/F | [
"data structures",
"flows"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 304
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1965-E | codeforces | 1965-E | Connected Cubes | https://codeforces.com/problemset/problem/1965/E | [
"constructive algorithms",
"games"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 484
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1965-D | codeforces | 1965-D | Missing Subarray Sum | https://codeforces.com/problemset/problem/1965/D | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 609
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1965-C | codeforces | 1965-C | Folding Strip | https://codeforces.com/problemset/problem/1965/C | [
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2532
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1965-B | codeforces | 1965-B | Missing Subsequence Sum | https://codeforces.com/problemset/problem/1965/B | [
"bitmasks",
"constructive algorithms",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8418
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1965-A | codeforces | 1965-A | Everything Nim | https://codeforces.com/problemset/problem/1965/A | [
"games",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17554
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1958-J | codeforces | 1958-J | Necromancer | https://codeforces.com/problemset/problem/1958/J | [
"*special"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 50
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1958-I | codeforces | 1958-I | Equal Trees | https://codeforces.com/problemset/problem/1958/I | [
"*special",
"graphs",
"meet-in-the-middle"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 53
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1958-H | codeforces | 1958-H | Composite Spells | https://codeforces.com/problemset/problem/1958/H | [
"*special",
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 97
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1958-G | codeforces | 1958-G | Observation Towers | https://codeforces.com/problemset/problem/1958/G | [
"*special"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 131
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1958-F | codeforces | 1958-F | Narrow Paths | https://codeforces.com/problemset/problem/1958/F | [
"*special",
"combinatorics"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 268
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1958-E | codeforces | 1958-E | Yet Another Permutation Constructive | https://codeforces.com/problemset/problem/1958/E | [
"*special",
"constructive algorithms"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 343
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1958-D | codeforces | 1958-D | Staircase | https://codeforces.com/problemset/problem/1958/D | [
"*special"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 747
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1958-C | codeforces | 1958-C | Firewood | https://codeforces.com/problemset/problem/1958/C | [
"*special"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 1037
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1958-B | codeforces | 1958-B | Clock in the Pool | https://codeforces.com/problemset/problem/1958/B | [
"*special",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 1231
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1958-A | codeforces | 1958-A | 1-3-5 | https://codeforces.com/problemset/problem/1958/A | [
"*special",
"dp"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 2641
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1957-F2 | codeforces | 1957-F2 | Frequency Mismatch (Hard Version) | https://codeforces.com/problemset/problem/1957/F2 | [
"binary search",
"data structures",
"dfs and similar",
"hashing",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 758
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1957-F1 | codeforces | 1957-F1 | Frequency Mismatch (Easy Version) | https://codeforces.com/problemset/problem/1957/F1 | [
"binary search",
"data structures",
"divide and conquer",
"hashing",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 755
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1957-E | codeforces | 1957-E | Carousel of Combinations | https://codeforces.com/problemset/problem/1957/E | [
"brute force",
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1713
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1957-D | codeforces | 1957-D | A BIT of an Inequality | https://codeforces.com/problemset/problem/1957/D | [
"bitmasks",
"brute force",
"dp",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6168
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1957-C | codeforces | 1957-C | How Does the Rook Move? | https://codeforces.com/problemset/problem/1957/C | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12367
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1957-B | codeforces | 1957-B | A BIT of a Construction | https://codeforces.com/problemset/problem/1957/B | [
"bitmasks",
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20958
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1957-A | codeforces | 1957-A | Stickogon | https://codeforces.com/problemset/problem/1957/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25968
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1956-F | codeforces | 1956-F | Nene and the Passing Game | https://codeforces.com/problemset/problem/1956/F | [
"constructive algorithms",
"data structures",
"dsu",
"graphs",
"sortings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 775
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1956-E2 | codeforces | 1956-E2 | Nene vs. Monsters (Hard Version) | https://codeforces.com/problemset/problem/1956/E2 | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1158
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1956-E1 | codeforces | 1956-E1 | Nene vs. Monsters (Easy Version) | https://codeforces.com/problemset/problem/1956/E1 | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1713
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1956-D | codeforces | 1956-D | Nene and the Mex Operator | https://codeforces.com/problemset/problem/1956/D | [
"bitmasks",
"brute force",
"constructive algorithms",
"divide and conquer",
"dp",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4954
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1956-C | codeforces | 1956-C | Nene's Magical Matrix | https://codeforces.com/problemset/problem/1956/C | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15551
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1956-B | codeforces | 1956-B | Nene and the Card Game | https://codeforces.com/problemset/problem/1956/B | [
"games",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23155
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1956-A | codeforces | 1956-A | Nene's Game | https://codeforces.com/problemset/problem/1956/A | [
"binary search",
"brute force",
"data structures",
"games",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24866
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1955-H | codeforces | 1955-H | The Most Reckless Defense | https://codeforces.com/problemset/problem/1955/H | [
"bitmasks",
"brute force",
"constructive algorithms",
"dp",
"flows",
"graph matchings",
"shortest paths"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1603
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1955-G | codeforces | 1955-G | GCD on a grid | https://codeforces.com/problemset/problem/1955/G | [
"brute force",
"dfs and similar",
"dp",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6207
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1955-F | codeforces | 1955-F | Unfair Game | https://codeforces.com/problemset/problem/1955/F | [
"dp",
"games",
"greedy",
"math",
"schedules"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8976
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1955-E | codeforces | 1955-E | Long Inversions | https://codeforces.com/problemset/problem/1955/E | [
"brute force",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11074
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1955-D | codeforces | 1955-D | Inaccurate Subsequence Search | https://codeforces.com/problemset/problem/1955/D | [
"data structures",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 19369
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1955-C | codeforces | 1955-C | Inhabitant of the Deep Sea | https://codeforces.com/problemset/problem/1955/C | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 25321
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1955-B | codeforces | 1955-B | Progressive Square | https://codeforces.com/problemset/problem/1955/B | [
"constructive algorithms",
"data structures",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 33105
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1955-A | codeforces | 1955-A | Yogurt Sale | https://codeforces.com/problemset/problem/1955/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 54624
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1954-F | codeforces | 1954-F | Unique Strings | https://codeforces.com/problemset/problem/1954/F | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 483
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1954-E | codeforces | 1954-E | Chain Reaction | https://codeforces.com/problemset/problem/1954/E | [
"binary search",
"data structures",
"dsu",
"greedy",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3188
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1954-D | codeforces | 1954-D | Colored Balls | https://codeforces.com/problemset/problem/1954/D | [
"combinatorics",
"dp",
"math",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8588
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1954-C | codeforces | 1954-C | Long Multiplication | https://codeforces.com/problemset/problem/1954/C | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 23629
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1954-B | codeforces | 1954-B | Make It Ugly | https://codeforces.com/problemset/problem/1954/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 22247
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1954-A | codeforces | 1954-A | Painting the Ribbon | https://codeforces.com/problemset/problem/1954/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 28283
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1953-A | codeforces | 1953-A | Accuracy-Preserving Summation Algorithm | https://codeforces.com/problemset/problem/1953/A | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 0
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1952-J | codeforces | 1952-J | Help, what does it mean to be "Based" | https://codeforces.com/problemset/problem/1952/J | [
"*special",
"brute force",
"constructive algorithms",
"expression parsing",
"implementation",
"sortings"
] | null | null | stdin_stdout | null | {
"solved_count": 916
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1952-I | codeforces | 1952-I | Dark Matter | https://codeforces.com/problemset/problem/1952/I | [
"*special",
"bitmasks",
"geometry"
] | null | null | stdin_stdout | null | {
"solved_count": 656
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1952-H | codeforces | 1952-H | Palindrome | https://codeforces.com/problemset/problem/1952/H | [
"*special",
"implementation",
"strings"
] | null | null | stdin_stdout | null | {
"solved_count": 820
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1952-G | codeforces | 1952-G | Mathematician Takeover | https://codeforces.com/problemset/problem/1952/G | [
"*special",
"binary search",
"dfs and similar",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 1239
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1952-F | codeforces | 1952-F | Grid | https://codeforces.com/problemset/problem/1952/F | [
"*special",
"brute force"
] | null | null | stdin_stdout | null | {
"solved_count": 1975
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1952-E | codeforces | 1952-E | Sweep Line | https://codeforces.com/problemset/problem/1952/E | [
"*special",
"combinatorics",
"games",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 349
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1952-D | codeforces | 1952-D | Are You a Procrastinator? | https://codeforces.com/problemset/problem/1952/D | [
"*special",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 5430
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1952-C | codeforces | 1952-C | They Have Fooled | https://codeforces.com/problemset/problem/1952/C | [
"*special",
"brute force",
"schedules"
] | null | null | stdin_stdout | null | {
"solved_count": 3292
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1952-B | codeforces | 1952-B | Is it stated? | https://codeforces.com/problemset/problem/1952/B | [
"*special",
"strings"
] | null | null | stdin_stdout | null | {
"solved_count": 12403
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1952-A | codeforces | 1952-A | Are You a Robot, Again? | https://codeforces.com/problemset/problem/1952/A | [
"*special",
"strings"
] | null | null | stdin_stdout | null | {
"solved_count": 14229
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1951-I | codeforces | 1951-I | Growing Trees | https://codeforces.com/problemset/problem/1951/I | [
"binary search",
"constructive algorithms",
"flows",
"graphs",
"greedy"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 120
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1951-H | codeforces | 1951-H | Thanos Snap | https://codeforces.com/problemset/problem/1951/H | [
"binary search",
"dp",
"games",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 404
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1951-G | codeforces | 1951-G | Clacking Balls | https://codeforces.com/problemset/problem/1951/G | [
"combinatorics",
"math",
"probabilities"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 569
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1951-F | codeforces | 1951-F | Inversion Composition | https://codeforces.com/problemset/problem/1951/F | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1027
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1951-E | codeforces | 1951-E | No Palindromes | https://codeforces.com/problemset/problem/1951/E | [
"brute force",
"constructive algorithms",
"divide and conquer",
"greedy",
"hashing",
"implementation",
"math",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4702
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1951-D | codeforces | 1951-D | Buying Jewels | https://codeforces.com/problemset/problem/1951/D | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6481
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1951-C | codeforces | 1951-C | Ticket Hoarding | https://codeforces.com/problemset/problem/1951/C | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14114
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1951-B | codeforces | 1951-B | Battle Cows | https://codeforces.com/problemset/problem/1951/B | [
"binary search",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17243
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1951-A | codeforces | 1951-A | Dual Trigger | https://codeforces.com/problemset/problem/1951/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 23013
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1950-G | codeforces | 1950-G | Shuffling Songs | https://codeforces.com/problemset/problem/1950/G | [
"bitmasks",
"dfs and similar",
"dp",
"graphs",
"hashing",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6604
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1950-F | codeforces | 1950-F | 0, 1, 2, Tree! | https://codeforces.com/problemset/problem/1950/F | [
"bitmasks",
"brute force",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11652
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1950-E | codeforces | 1950-E | Nearly Shortest Repeating Substring | https://codeforces.com/problemset/problem/1950/E | [
"brute force",
"implementation",
"number theory",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 18006
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1950-D | codeforces | 1950-D | Product of Binary Decimals | https://codeforces.com/problemset/problem/1950/D | [
"brute force",
"dp",
"implementation",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 27019
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1950-C | codeforces | 1950-C | Clock Conversion | https://codeforces.com/problemset/problem/1950/C | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 48126
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1950-B | codeforces | 1950-B | Upscaling | https://codeforces.com/problemset/problem/1950/B | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 45492
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1950-A | codeforces | 1950-A | Stair, Peak, or Neither? | https://codeforces.com/problemset/problem/1950/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 73317
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1949-K | codeforces | 1949-K | Make Triangle | https://codeforces.com/problemset/problem/1949/K | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 518
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1949-J | codeforces | 1949-J | Amanda the Amoeba | https://codeforces.com/problemset/problem/1949/J | [
"graphs",
"implementation",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 579
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1949-I | codeforces | 1949-I | Disks | https://codeforces.com/problemset/problem/1949/I | [
"dfs and similar",
"geometry",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2975
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1949-H | codeforces | 1949-H | Division Avoidance | https://codeforces.com/problemset/problem/1949/H | [
"greedy",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 172
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1949-G | codeforces | 1949-G | Scooter | https://codeforces.com/problemset/problem/1949/G | [
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1101
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1949-F | codeforces | 1949-F | Dating | https://codeforces.com/problemset/problem/1949/F | [
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1559
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1949-E | codeforces | 1949-E | Damage per Second | https://codeforces.com/problemset/problem/1949/E | [
"brute force",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 155
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1949-D | codeforces | 1949-D | Funny or Scary? | https://codeforces.com/problemset/problem/1949/D | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 626
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1949-C | codeforces | 1949-C | Annual Ants' Gathering | https://codeforces.com/problemset/problem/1949/C | [
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2649
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1949-B | codeforces | 1949-B | Charming Meals | https://codeforces.com/problemset/problem/1949/B | [
"binary search",
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5149
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1949-A | codeforces | 1949-A | Grove | https://codeforces.com/problemset/problem/1949/A | [
"brute force",
"dfs and similar",
"dp",
"geometry",
"probabilities"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 227
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1948-G | codeforces | 1948-G | MST with Matching | https://codeforces.com/problemset/problem/1948/G | [
"bitmasks",
"brute force",
"dsu",
"graph matchings",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 1026
} | 2026-11-02T05:37:07.883505+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.