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:1646-A | codeforces | 1646-A | Square Counting | https://codeforces.com/problemset/problem/1646/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25582
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1644-F | codeforces | 1644-F | Basis | https://codeforces.com/problemset/problem/1644/F | [
"combinatorics",
"fft",
"math",
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 534
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1644-E | codeforces | 1644-E | Expand the Path | https://codeforces.com/problemset/problem/1644/E | [
"brute force",
"combinatorics",
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3546
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1644-D | codeforces | 1644-D | Cross Coloring | https://codeforces.com/problemset/problem/1644/D | [
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8000
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1644-C | codeforces | 1644-C | Increase Subarray Sums | https://codeforces.com/problemset/problem/1644/C | [
"brute force",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15308
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1644-B | codeforces | 1644-B | Anti-Fibonacci Permutation | https://codeforces.com/problemset/problem/1644/B | [
"brute force",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21468
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1644-A | codeforces | 1644-A | Doors and Keys | https://codeforces.com/problemset/problem/1644/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28889
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1642-B | codeforces | 1642-B | Power Walking | https://codeforces.com/problemset/problem/1642/B | [
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18499
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1642-A | codeforces | 1642-A | Hard Way | https://codeforces.com/problemset/problem/1642/A | [
"geometry"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16850
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1641-F | codeforces | 1641-F | Covering Circle | https://codeforces.com/problemset/problem/1641/F | [
"geometry"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 125
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1641-E | codeforces | 1641-E | Special Positions | https://codeforces.com/problemset/problem/1641/E | [
"combinatorics",
"divide and conquer",
"fft",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 413
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1641-D | codeforces | 1641-D | Two Arrays | https://codeforces.com/problemset/problem/1641/D | [
"bitmasks",
"brute force",
"combinatorics",
"greedy",
"hashing",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1588
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1641-C | codeforces | 1641-C | Anonymity Is Important | https://codeforces.com/problemset/problem/1641/C | [
"binary search",
"brute force",
"data structures",
"dsu",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2927
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1641-B | codeforces | 1641-B | Repetitions Decoding | https://codeforces.com/problemset/problem/1641/B | [
"constructive algorithms",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4142
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1641-A | codeforces | 1641-A | Great Sequence | https://codeforces.com/problemset/problem/1641/A | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19128
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1639-K | codeforces | 1639-K | Treasure Hunt | https://codeforces.com/problemset/problem/1639/K | [
"graphs",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 0
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1639-J | codeforces | 1639-J | Treasure Hunt | https://codeforces.com/problemset/problem/1639/J | [
"graphs",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 0
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1639-I | codeforces | 1639-I | Treasure Hunt | https://codeforces.com/problemset/problem/1639/I | [
"graphs",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 0
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1639-H | codeforces | 1639-H | Treasure Hunt | https://codeforces.com/problemset/problem/1639/H | [
"graphs",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 0
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1639-G | codeforces | 1639-G | Treasure Hunt | https://codeforces.com/problemset/problem/1639/G | [
"graphs",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 0
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1639-F | codeforces | 1639-F | Treasure Hunt | https://codeforces.com/problemset/problem/1639/F | [
"graphs",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 0
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1639-E | codeforces | 1639-E | Treasure Hunt | https://codeforces.com/problemset/problem/1639/E | [
"graphs",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 0
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1639-D | codeforces | 1639-D | Treasure Hunt | https://codeforces.com/problemset/problem/1639/D | [
"graphs",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 0
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1639-C | codeforces | 1639-C | Treasure Hunt | https://codeforces.com/problemset/problem/1639/C | [
"graphs",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 0
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1639-B | codeforces | 1639-B | Treasure Hunt | https://codeforces.com/problemset/problem/1639/B | [
"graphs",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 0
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1639-A | codeforces | 1639-A | Treasure Hunt | https://codeforces.com/problemset/problem/1639/A | [
"graphs",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 0
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1638-F | codeforces | 1638-F | Two Posters | https://codeforces.com/problemset/problem/1638/F | [
"brute force",
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 286
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1638-E | codeforces | 1638-E | Colorful Operations | https://codeforces.com/problemset/problem/1638/E | [
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2544
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1638-D | codeforces | 1638-D | Big Brush | https://codeforces.com/problemset/problem/1638/D | [
"constructive algorithms",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4907
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1638-C | codeforces | 1638-C | Inversion Graph | https://codeforces.com/problemset/problem/1638/C | [
"data structures",
"dsu",
"graphs",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16226
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1638-B | codeforces | 1638-B | Odd Swap Sort | https://codeforces.com/problemset/problem/1638/B | [
"data structures",
"math",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22906
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1638-A | codeforces | 1638-A | Reverse | https://codeforces.com/problemset/problem/1638/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22270
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1637-H | codeforces | 1637-H | Minimize Inversions Number | https://codeforces.com/problemset/problem/1637/H | [
"data structures",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 645
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1637-G | codeforces | 1637-G | Birthday | https://codeforces.com/problemset/problem/1637/G | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 688
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1637-F | codeforces | 1637-F | Towers | https://codeforces.com/problemset/problem/1637/F | [
"constructive algorithms",
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2242
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1637-E | codeforces | 1637-E | Best Pair | https://codeforces.com/problemset/problem/1637/E | [
"binary search",
"brute force",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3963
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1637-D | codeforces | 1637-D | Yet Another Minimization Problem | https://codeforces.com/problemset/problem/1637/D | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9263
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1637-C | codeforces | 1637-C | Andrew and Stones | https://codeforces.com/problemset/problem/1637/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18883
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1637-B | codeforces | 1637-B | MEX and Array | https://codeforces.com/problemset/problem/1637/B | [
"brute force",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15547
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1637-A | codeforces | 1637-A | Sorting Parts | https://codeforces.com/problemset/problem/1637/A | [
"brute force",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24312
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1635-F | codeforces | 1635-F | Closest Pair | https://codeforces.com/problemset/problem/1635/F | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1539
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1635-E | codeforces | 1635-E | Cars | https://codeforces.com/problemset/problem/1635/E | [
"2-sat",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2922
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1635-D | codeforces | 1635-D | Infinite Set | https://codeforces.com/problemset/problem/1635/D | [
"bitmasks",
"dp",
"math",
"matrices",
"number theory",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7203
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1635-C | codeforces | 1635-C | Differential Sorting | https://codeforces.com/problemset/problem/1635/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 27775
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1635-B | codeforces | 1635-B | Avoid Local Maximums | https://codeforces.com/problemset/problem/1635/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18599
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1635-A | codeforces | 1635-A | Min Or Sum | https://codeforces.com/problemset/problem/1635/A | [
"bitmasks",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26866
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1634-F | codeforces | 1634-F | Fibonacci Additions | https://codeforces.com/problemset/problem/1634/F | [
"brute force",
"data structures",
"hashing",
"implementation",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 2028
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1634-E | codeforces | 1634-E | Fair Share | https://codeforces.com/problemset/problem/1634/E | [
"constructive algorithms",
"data structures",
"dfs and similar",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2350
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1634-D | codeforces | 1634-D | Finding Zero | https://codeforces.com/problemset/problem/1634/D | [
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4890
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1634-C | codeforces | 1634-C | OKEA | https://codeforces.com/problemset/problem/1634/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19219
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1634-B | codeforces | 1634-B | Fortune Telling | https://codeforces.com/problemset/problem/1634/B | [
"bitmasks",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 24126
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1634-A | codeforces | 1634-A | Reverse and Concatenate | https://codeforces.com/problemset/problem/1634/A | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24773
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1633-F | codeforces | 1633-F | Perfect Matching | https://codeforces.com/problemset/problem/1633/F | [
"data structures",
"divide and conquer",
"interactive",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 772
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1633-E | codeforces | 1633-E | Spanning Tree Queries | https://codeforces.com/problemset/problem/1633/E | [
"binary search",
"data structures",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"math",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1851
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1633-D | codeforces | 1633-D | Make Them Equal | https://codeforces.com/problemset/problem/1633/D | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 20382
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1633-C | codeforces | 1633-C | Kill the Monster | https://codeforces.com/problemset/problem/1633/C | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21551
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1633-B | codeforces | 1633-B | Minority | https://codeforces.com/problemset/problem/1633/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29693
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1633-A | codeforces | 1633-A | Div. 7 | https://codeforces.com/problemset/problem/1633/A | [
"brute force"
] | null | null | stdin_stdout | 800 | {
"solved_count": 36663
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1632-E2 | codeforces | 1632-E2 | Distance Tree (hard version) | https://codeforces.com/problemset/problem/1632/E2 | [
"binary search",
"dfs and similar",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1316
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1632-E1 | codeforces | 1632-E1 | Distance Tree (easy version) | https://codeforces.com/problemset/problem/1632/E1 | [
"binary search",
"data structures",
"dfs and similar",
"graphs",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1401
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1632-D | codeforces | 1632-D | New Year Concert | https://codeforces.com/problemset/problem/1632/D | [
"binary search",
"data structures",
"greedy",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5534
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1632-C | codeforces | 1632-C | Strange Test | https://codeforces.com/problemset/problem/1632/C | [
"binary search",
"bitmasks",
"brute force",
"dp",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14349
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1632-B | codeforces | 1632-B | Roof Construction | https://codeforces.com/problemset/problem/1632/B | [
"bitmasks",
"constructive algorithms"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 34780
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1632-A | codeforces | 1632-A | ABC | https://codeforces.com/problemset/problem/1632/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31424
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1631-B | codeforces | 1631-B | Fun with Even Subarrays | https://codeforces.com/problemset/problem/1631/B | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 29284
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1631-A | codeforces | 1631-A | Min Max Swap | https://codeforces.com/problemset/problem/1631/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31619
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1630-F | codeforces | 1630-F | Making It Bipartite | https://codeforces.com/problemset/problem/1630/F | [
"flows",
"graph matchings",
"graphs",
"number theory"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 1027
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1630-E | codeforces | 1630-E | Expected Components | https://codeforces.com/problemset/problem/1630/E | [
"combinatorics",
"math",
"number theory",
"probabilities"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 665
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1630-D | codeforces | 1630-D | Flipping Range | https://codeforces.com/problemset/problem/1630/D | [
"constructive algorithms",
"dp",
"greedy",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2139
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1630-C | codeforces | 1630-C | Paint the Middle | https://codeforces.com/problemset/problem/1630/C | [
"dp",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3426
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1630-B | codeforces | 1630-B | Range and Partition | https://codeforces.com/problemset/problem/1630/B | [
"binary search",
"constructive algorithms",
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6614
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1630-A | codeforces | 1630-A | And Matching | https://codeforces.com/problemset/problem/1630/A | [
"bitmasks",
"constructive algorithms"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 16466
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1629-B | codeforces | 1629-B | GCD Arrays | https://codeforces.com/problemset/problem/1629/B | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25694
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1629-A | codeforces | 1629-A | Download More RAM | https://codeforces.com/problemset/problem/1629/A | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31239
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1628-F | codeforces | 1628-F | Spaceship Crisis Management | https://codeforces.com/problemset/problem/1628/F | [
"binary search",
"data structures",
"geometry",
"sortings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 125
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1628-E | codeforces | 1628-E | Groceries in Meteor Town | https://codeforces.com/problemset/problem/1628/E | [
"binary search",
"data structures",
"dsu",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 1463
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1628-D2 | codeforces | 1628-D2 | Game on Sum (Hard Version) | https://codeforces.com/problemset/problem/1628/D2 | [
"combinatorics",
"dp",
"games",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2755
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1628-D1 | codeforces | 1628-D1 | Game on Sum (Easy Version) | https://codeforces.com/problemset/problem/1628/D1 | [
"combinatorics",
"dp",
"games",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3899
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1628-C | codeforces | 1628-C | Grid Xor | https://codeforces.com/problemset/problem/1628/C | [
"constructive algorithms",
"greedy",
"implementation",
"interactive",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3740
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1628-B | codeforces | 1628-B | Peculiar Movie Preferences | https://codeforces.com/problemset/problem/1628/B | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 12948
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1628-A | codeforces | 1628-A | Meximum Array | https://codeforces.com/problemset/problem/1628/A | [
"binary search",
"constructive algorithms",
"greedy",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17343
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1627-F | codeforces | 1627-F | Not Splitting | https://codeforces.com/problemset/problem/1627/F | [
"geometry",
"graphs",
"greedy",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 701
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1627-E | codeforces | 1627-E | Not Escaping | https://codeforces.com/problemset/problem/1627/E | [
"data structures",
"dp",
"implementation",
"shortest paths",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2958
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1627-D | codeforces | 1627-D | Not Adding | https://codeforces.com/problemset/problem/1627/D | [
"brute force",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 9729
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1627-C | codeforces | 1627-C | Not Assigning | https://codeforces.com/problemset/problem/1627/C | [
"constructive algorithms",
"dfs and similar",
"number theory",
"trees"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16670
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1627-B | codeforces | 1627-B | Not Sitting | https://codeforces.com/problemset/problem/1627/B | [
"games",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17794
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1627-A | codeforces | 1627-A | Not Shading | https://codeforces.com/problemset/problem/1627/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25067
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1626-F | codeforces | 1626-F | A Random Code Problem | https://codeforces.com/problemset/problem/1626/F | [
"combinatorics",
"dp",
"math",
"number theory",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 947
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1626-E | codeforces | 1626-E | Black and White Tree | https://codeforces.com/problemset/problem/1626/E | [
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1986
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1626-D | codeforces | 1626-D | Martial Arts Tournament | https://codeforces.com/problemset/problem/1626/D | [
"binary search",
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4474
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1626-C | codeforces | 1626-C | Monsters And Spells | https://codeforces.com/problemset/problem/1626/C | [
"binary search",
"data structures",
"dp",
"greedy",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 12111
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1626-B | codeforces | 1626-B | Minor Reduction | https://codeforces.com/problemset/problem/1626/B | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 24224
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1626-A | codeforces | 1626-A | Equidistant Letters | https://codeforces.com/problemset/problem/1626/A | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31237
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1625-E2 | codeforces | 1625-E2 | Cats on the Upgrade (hard version) | https://codeforces.com/problemset/problem/1625/E2 | [
"binary search",
"data structures",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 754
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1625-E1 | codeforces | 1625-E1 | Cats on the Upgrade (easy version) | https://codeforces.com/problemset/problem/1625/E1 | [
"brute force",
"data structures",
"dfs and similar",
"divide and conquer",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1219
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1625-D | codeforces | 1625-D | Binary Spiders | https://codeforces.com/problemset/problem/1625/D | [
"bitmasks",
"data structures",
"implementation",
"math",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2406
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1625-C | codeforces | 1625-C | Road Optimization | https://codeforces.com/problemset/problem/1625/C | [
"dp"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 14123
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1625-B | codeforces | 1625-B | Elementary Particles | https://codeforces.com/problemset/problem/1625/B | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17022
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1625-A | codeforces | 1625-A | Ancient Civilization | https://codeforces.com/problemset/problem/1625/A | [
"bitmasks",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18470
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1624-G | codeforces | 1624-G | MinOr Tree | https://codeforces.com/problemset/problem/1624/G | [
"bitmasks",
"dfs and similar",
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8100
} | 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.