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: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": 1230
} | 2026-06-01T05:00:40.145500+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": 1967
} | 2026-06-01T05:00:40.145500+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": 345
} | 2026-06-01T05:00:40.145500+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": 5387
} | 2026-06-01T05:00:40.145500+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": 3270
} | 2026-06-01T05:00:40.145500+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": 12358
} | 2026-06-01T05:00:40.145500+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": 14136
} | 2026-06-01T05:00:40.145500+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": 106
} | 2026-06-01T05:00:40.145500+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": 364
} | 2026-06-01T05:00:40.145500+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": 426
} | 2026-06-01T05:00:40.145500+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": 967
} | 2026-06-01T05:00:40.145500+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": 4495
} | 2026-06-01T05:00:40.145500+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": 6326
} | 2026-06-01T05:00:40.145500+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": 13809
} | 2026-06-01T05:00:40.145500+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": 16898
} | 2026-06-01T05:00:40.145500+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": 22630
} | 2026-06-01T05:00:40.145500+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": 6150
} | 2026-06-01T05:00:40.145500+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": 11354
} | 2026-06-01T05:00:40.145500+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": 17498
} | 2026-06-01T05:00:40.145500+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": 26559
} | 2026-06-01T05:00:40.145500+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": 47082
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1950-B | codeforces | 1950-B | Upscaling | https://codeforces.com/problemset/problem/1950/B | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 44362
} | 2026-06-01T05:00:40.145500+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": 69946
} | 2026-06-01T05:00:40.145500+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": 453
} | 2026-06-01T05:00:40.145500+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": 541
} | 2026-06-01T05:00:40.145500+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": 2775
} | 2026-06-01T05:00:40.145500+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": 165
} | 2026-06-01T05:00:40.145500+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": 1053
} | 2026-06-01T05:00:40.145500+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": 1421
} | 2026-06-01T05:00:40.145500+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": 146
} | 2026-06-01T05:00:40.145500+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": 556
} | 2026-06-01T05:00:40.145500+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": 2551
} | 2026-06-01T05:00:40.145500+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": 4945
} | 2026-06-01T05:00:40.145500+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": 203
} | 2026-06-01T05:00:40.145500+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": 874
} | 2026-06-01T05:00:40.145500+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": 1654
} | 2026-06-01T05:00:40.145500+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": 3530
} | 2026-06-01T05:00:40.145500+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": 12440
} | 2026-06-01T05:00:40.145500+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": 21232
} | 2026-06-01T05:00:40.145500+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": 26331
} | 2026-06-01T05:00:40.145500+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": 31083
} | 2026-06-01T05:00:40.145500+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": 1247
} | 2026-06-01T05:00:40.145500+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": 3184
} | 2026-06-01T05:00:40.145500+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": 5627
} | 2026-06-01T05:00:40.145500+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": 13818
} | 2026-06-01T05:00:40.145500+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": 23630
} | 2026-06-01T05:00:40.145500+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": 28619
} | 2026-06-01T05:00:40.145500+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": 867
} | 2026-06-01T05:00:40.145500+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": 914
} | 2026-06-01T05:00:40.145500+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": 5123
} | 2026-06-01T05:00:40.145500+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": 9751
} | 2026-06-01T05:00:40.145500+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": 17247
} | 2026-06-01T05:00:40.145500+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": 17463
} | 2026-06-01T05:00:40.145500+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": 26285
} | 2026-06-01T05:00:40.145500+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": 30410
} | 2026-06-01T05:00:40.145500+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": 18219
} | 2026-06-01T05:00:40.145500+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": 28871
} | 2026-06-01T05:00:40.145500+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": 141
} | 2026-06-01T05:00:40.145500+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": 372
} | 2026-06-01T05:00:40.145500+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": 540
} | 2026-06-01T05:00:40.145500+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": 1133
} | 2026-06-01T05:00:40.145500+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": 1962
} | 2026-06-01T05:00:40.145500+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": 2632
} | 2026-06-01T05:00:40.145500+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": 4572
} | 2026-06-01T05:00:40.145500+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": 21608
} | 2026-06-01T05:00:40.145500+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": 218
} | 2026-06-01T05:00:40.145500+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": 761
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1942-F | codeforces | 1942-F | Farmer John's Favorite Function | https://codeforces.com/problemset/problem/1942/F | [
"brute force",
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 977
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1942-E | codeforces | 1942-E | Farm Game | https://codeforces.com/problemset/problem/1942/E | [
"combinatorics",
"games"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1972
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1942-D | codeforces | 1942-D | Learning to Paint | https://codeforces.com/problemset/problem/1942/D | [
"binary search",
"data structures",
"dfs and similar",
"dp",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3356
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1942-C2 | codeforces | 1942-C2 | Bessie's Birthday Cake (Hard Version) | https://codeforces.com/problemset/problem/1942/C2 | [
"geometry",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6917
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1942-C1 | codeforces | 1942-C1 | Bessie's Birthday Cake (Easy Version) | https://codeforces.com/problemset/problem/1942/C1 | [
"geometry",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12471
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1942-B | codeforces | 1942-B | Bessie and MEX | https://codeforces.com/problemset/problem/1942/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15543
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1942-A | codeforces | 1942-A | Farmer John's Challenge | https://codeforces.com/problemset/problem/1942/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18530
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1941-G | codeforces | 1941-G | Rudolf and Subway | https://codeforces.com/problemset/problem/1941/G | [
"constructive algorithms",
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4717
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1941-F | codeforces | 1941-F | Rudolf and Imbalance | https://codeforces.com/problemset/problem/1941/F | [
"binary search",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7445
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1941-E | codeforces | 1941-E | Rudolf and k Bridges | https://codeforces.com/problemset/problem/1941/E | [
"binary search",
"data structures",
"dp",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12016
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1941-D | codeforces | 1941-D | Rudolf and the Ball Game | https://codeforces.com/problemset/problem/1941/D | [
"dfs and similar",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 21025
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1941-C | codeforces | 1941-C | Rudolf and the Ugly String | https://codeforces.com/problemset/problem/1941/C | [
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 39367
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1941-B | codeforces | 1941-B | Rudolf and 121 | https://codeforces.com/problemset/problem/1941/B | [
"brute force",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 34908
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1941-A | codeforces | 1941-A | Rudolf and the Ticket | https://codeforces.com/problemset/problem/1941/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 47830
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1940-D | codeforces | 1940-D | Almost Certainly | https://codeforces.com/problemset/problem/1940/D | [
"*special",
"constructive algorithms",
"data structures",
"sortings"
] | null | null | stdin_stdout | null | {
"solved_count": 176
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1940-C | codeforces | 1940-C | Burenka and Pether | https://codeforces.com/problemset/problem/1940/C | [
"*special",
"data structures",
"dfs and similar",
"divide and conquer",
"dsu",
"graphs",
"sortings",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 43
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1940-B | codeforces | 1940-B | Three Arrays | https://codeforces.com/problemset/problem/1940/B | [
"*special",
"constructive algorithms",
"implementation",
"sortings"
] | null | null | stdin_stdout | null | {
"solved_count": 272
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1940-A | codeforces | 1940-A | Parallel Universes | https://codeforces.com/problemset/problem/1940/A | [
"*special",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | null | {
"solved_count": 105
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1939-D | codeforces | 1939-D | Big Persimmon | https://codeforces.com/problemset/problem/1939/D | [
"*special",
"dp",
"games"
] | null | null | stdin_stdout | null | {
"solved_count": 111
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1939-C | codeforces | 1939-C | More Gifts | https://codeforces.com/problemset/problem/1939/C | [
"*special",
"dfs and similar",
"two pointers"
] | null | null | stdin_stdout | null | {
"solved_count": 415
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1939-B | codeforces | 1939-B | Evidence Board | https://codeforces.com/problemset/problem/1939/B | [
"*special",
"constructive algorithms",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 307
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1939-A | codeforces | 1939-A | Draw Polygon Lines | https://codeforces.com/problemset/problem/1939/A | [
"*special",
"constructive algorithms",
"dp",
"geometry",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 30
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1938-M | codeforces | 1938-M | Zig-zag | https://codeforces.com/problemset/problem/1938/M | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 98
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1938-L | codeforces | 1938-L | XOR Operations | https://codeforces.com/problemset/problem/1938/L | [] | null | null | stdin_stdout | 2,800 | {
"solved_count": 352
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1938-K | codeforces | 1938-K | Tree Quiz | https://codeforces.com/problemset/problem/1938/K | [] | null | null | stdin_stdout | 2,400 | {
"solved_count": 790
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1938-J | codeforces | 1938-J | There and Back Again | https://codeforces.com/problemset/problem/1938/J | [] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1601
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1938-I | codeforces | 1938-I | Symmetric Boundary | https://codeforces.com/problemset/problem/1938/I | [] | null | null | stdin_stdout | 2,800 | {
"solved_count": 89
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1938-H | codeforces | 1938-H | Pho Restaurant | https://codeforces.com/problemset/problem/1938/H | [] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2684
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1938-G | codeforces | 1938-G | Personality Test | https://codeforces.com/problemset/problem/1938/G | [] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1295
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1938-F | codeforces | 1938-F | Forming Groups | https://codeforces.com/problemset/problem/1938/F | [] | null | null | stdin_stdout | 2,400 | {
"solved_count": 933
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1938-E | codeforces | 1938-E | Duplicates | https://codeforces.com/problemset/problem/1938/E | [] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1277
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1938-D | codeforces | 1938-D | Bánh Bò | https://codeforces.com/problemset/problem/1938/D | [] | null | null | stdin_stdout | 3,300 | {
"solved_count": 113
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1938-C | codeforces | 1938-C | Bit Counting Sequence | https://codeforces.com/problemset/problem/1938/C | [] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1837
} | 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.