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: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": 2614
} | 2026-08-10T02:20:32.917453+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": 661
} | 2026-08-10T02:20:32.917453+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": 710
} | 2026-08-10T02:20:32.917453+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": 1682
} | 2026-08-10T02:20:32.917453+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": 6002
} | 2026-08-10T02:20:32.917453+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": 12200
} | 2026-08-10T02:20:32.917453+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": 20768
} | 2026-08-10T02:20:32.917453+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": 25838
} | 2026-08-10T02:20:32.917453+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": 759
} | 2026-08-10T02:20:32.917453+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": 1143
} | 2026-08-10T02:20:32.917453+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": 1696
} | 2026-08-10T02:20:32.917453+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": 4871
} | 2026-08-10T02:20:32.917453+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": 15382
} | 2026-08-10T02:20:32.917453+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": 23064
} | 2026-08-10T02:20:32.917453+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": 24585
} | 2026-08-10T02:20:32.917453+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": 1559
} | 2026-08-10T02:20:32.917453+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": 6080
} | 2026-08-10T02:20:32.917453+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": 8880
} | 2026-08-10T02:20:32.917453+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": 10803
} | 2026-08-10T02:20:32.917453+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": 18995
} | 2026-08-10T02:20:32.917453+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": 25058
} | 2026-08-10T02:20:32.917453+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": 32818
} | 2026-08-10T02:20:32.917453+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": 53732
} | 2026-08-10T02:20:32.917453+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": 463
} | 2026-08-10T02:20:32.917453+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": 3056
} | 2026-08-10T02:20:32.917453+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": 8373
} | 2026-08-10T02:20:32.917453+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": 23205
} | 2026-08-10T02:20:32.917453+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": 21939
} | 2026-08-10T02:20:32.917453+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": 28061
} | 2026-08-10T02:20:32.917453+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-08-10T02:20:32.917453+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": 910
} | 2026-08-10T02:20:32.917453+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": 653
} | 2026-08-10T02:20:32.917453+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": 814
} | 2026-08-10T02:20:32.917453+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": 1236
} | 2026-08-10T02:20:32.917453+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": 1971
} | 2026-08-10T02:20:32.917453+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": 346
} | 2026-08-10T02:20:32.917453+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": 5403
} | 2026-08-10T02:20:32.917453+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": 3280
} | 2026-08-10T02:20:32.917453+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": 12379
} | 2026-08-10T02:20:32.917453+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": 14183
} | 2026-08-10T02:20:32.917453+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": 119
} | 2026-08-10T02:20:32.917453+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": 381
} | 2026-08-10T02:20:32.917453+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": 560
} | 2026-08-10T02:20:32.917453+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": 1014
} | 2026-08-10T02:20:32.917453+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": 4609
} | 2026-08-10T02:20:32.917453+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": 6392
} | 2026-08-10T02:20:32.917453+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": 13967
} | 2026-08-10T02:20:32.917453+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": 17083
} | 2026-08-10T02:20:32.917453+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": 22869
} | 2026-08-10T02:20:32.917453+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": 6357
} | 2026-08-10T02:20:32.917453+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": 11492
} | 2026-08-10T02:20:32.917453+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": 17772
} | 2026-08-10T02:20:32.917453+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": 26792
} | 2026-08-10T02:20:32.917453+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": 47573
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1950-B | codeforces | 1950-B | Upscaling | https://codeforces.com/problemset/problem/1950/B | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 44855
} | 2026-08-10T02:20:32.917453+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": 71287
} | 2026-08-10T02:20:32.917453+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": 510
} | 2026-08-10T02:20:32.917453+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": 550
} | 2026-08-10T02:20:32.917453+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": 2833
} | 2026-08-10T02:20:32.917453+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": 170
} | 2026-08-10T02:20:32.917453+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": 1068
} | 2026-08-10T02:20:32.917453+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": 1511
} | 2026-08-10T02:20:32.917453+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": 154
} | 2026-08-10T02:20:32.917453+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": 574
} | 2026-08-10T02:20:32.917453+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": 2592
} | 2026-08-10T02:20:32.917453+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": 5045
} | 2026-08-10T02:20:32.917453+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": 225
} | 2026-08-10T02:20:32.917453+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": 1007
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1948-F | codeforces | 1948-F | Rare Coins | https://codeforces.com/problemset/problem/1948/F | [
"combinatorics",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1732
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1948-E | codeforces | 1948-E | Clique Partition | https://codeforces.com/problemset/problem/1948/E | [
"brute force",
"constructive algorithms",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3595
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1948-D | codeforces | 1948-D | Tandem Repeats? | https://codeforces.com/problemset/problem/1948/D | [
"brute force",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 12846
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1948-C | codeforces | 1948-C | Arrow Path | https://codeforces.com/problemset/problem/1948/C | [
"brute force",
"constructive algorithms",
"dfs and similar",
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 21581
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1948-B | codeforces | 1948-B | Array Fix | https://codeforces.com/problemset/problem/1948/B | [
"brute force",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 26575
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1948-A | codeforces | 1948-A | Special Characters | https://codeforces.com/problemset/problem/1948/A | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31350
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1946-F | codeforces | 1946-F | Nobody is needed | https://codeforces.com/problemset/problem/1946/F | [
"2-sat",
"data structures",
"dfs and similar",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1296
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1946-E | codeforces | 1946-E | Girl Permutation | https://codeforces.com/problemset/problem/1946/E | [
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3243
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1946-D | codeforces | 1946-D | Birthday Gift | https://codeforces.com/problemset/problem/1946/D | [
"bitmasks",
"brute force",
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5693
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1946-C | codeforces | 1946-C | Tree Cutting | https://codeforces.com/problemset/problem/1946/C | [
"binary search",
"dp",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14145
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1946-B | codeforces | 1946-B | Maximum Sum | https://codeforces.com/problemset/problem/1946/B | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 23924
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1946-A | codeforces | 1946-A | Median of an Array | https://codeforces.com/problemset/problem/1946/A | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28853
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1945-H | codeforces | 1945-H | GCD is Greater | https://codeforces.com/problemset/problem/1945/H | [
"brute force",
"data structures",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 976
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1945-G | codeforces | 1945-G | Cook and Porridge | https://codeforces.com/problemset/problem/1945/G | [
"binary search",
"constructive algorithms",
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 947
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1945-F | codeforces | 1945-F | Kirill and Mushrooms | https://codeforces.com/problemset/problem/1945/F | [
"data structures",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5201
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1945-E | codeforces | 1945-E | Binary Search | https://codeforces.com/problemset/problem/1945/E | [
"binary search",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9874
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1945-D | codeforces | 1945-D | Seraphim the Owl | https://codeforces.com/problemset/problem/1945/D | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17494
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1945-C | codeforces | 1945-C | Left and Right Houses | https://codeforces.com/problemset/problem/1945/C | [
"brute force"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17662
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1945-B | codeforces | 1945-B | Fireworks | https://codeforces.com/problemset/problem/1945/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 26509
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1945-A | codeforces | 1945-A | Setting up Camp | https://codeforces.com/problemset/problem/1945/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30621
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1944-B | codeforces | 1944-B | Equal XOR | https://codeforces.com/problemset/problem/1944/B | [
"bitmasks",
"constructive algorithms"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 18398
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1944-A | codeforces | 1944-A | Destroying Bridges | https://codeforces.com/problemset/problem/1944/A | [
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29376
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1943-F | codeforces | 1943-F | Minimum Hamming Distance | https://codeforces.com/problemset/problem/1943/F | [
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 144
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1943-E2 | codeforces | 1943-E2 | MEX Game 2 (Hard Version) | https://codeforces.com/problemset/problem/1943/E2 | [
"binary search",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 381
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1943-E1 | codeforces | 1943-E1 | MEX Game 2 (Easy Version) | https://codeforces.com/problemset/problem/1943/E1 | [
"binary search",
"brute force",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 553
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1943-D2 | codeforces | 1943-D2 | Counting Is Fun (Hard Version) | https://codeforces.com/problemset/problem/1943/D2 | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1187
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1943-D1 | codeforces | 1943-D1 | Counting Is Fun (Easy Version) | https://codeforces.com/problemset/problem/1943/D1 | [
"brute force",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2016
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1943-C | codeforces | 1943-C | Tree Compass | https://codeforces.com/problemset/problem/1943/C | [
"constructive algorithms",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2724
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1943-B | codeforces | 1943-B | Non-Palindromic Substring | https://codeforces.com/problemset/problem/1943/B | [
"hashing",
"implementation",
"math",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4677
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1943-A | codeforces | 1943-A | MEX Game 1 | https://codeforces.com/problemset/problem/1943/A | [
"games",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 22012
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1942-H | codeforces | 1942-H | Farmer John's Favorite Intern | https://codeforces.com/problemset/problem/1942/H | [
"data structures",
"dp",
"flows",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 267
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1942-G | codeforces | 1942-G | Bessie and Cards | https://codeforces.com/problemset/problem/1942/G | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 869
} | 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.