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:1466-G | codeforces | 1466-G | Song of the Sirens | https://codeforces.com/problemset/problem/1466/G | [
"combinatorics",
"divide and conquer",
"hashing",
"math",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1010
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1466-F | codeforces | 1466-F | Euclid's nightmare | https://codeforces.com/problemset/problem/1466/F | [
"bitmasks",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3063
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1466-E | codeforces | 1466-E | Apollo versus Pan | https://codeforces.com/problemset/problem/1466/E | [
"bitmasks",
"brute force",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8411
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1466-D | codeforces | 1466-D | 13th Labour of Heracles | https://codeforces.com/problemset/problem/1466/D | [
"data structures",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14805
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1466-C | codeforces | 1466-C | Canine poetry | https://codeforces.com/problemset/problem/1466/C | [
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18840
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1466-B | codeforces | 1466-B | Last minute enhancements | https://codeforces.com/problemset/problem/1466/B | [
"dp",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23622
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1466-A | codeforces | 1466-A | Bovine Dilemma | https://codeforces.com/problemset/problem/1466/A | [
"brute force",
"geometry",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23222
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1464-F | codeforces | 1464-F | My Beautiful Madness | https://codeforces.com/problemset/problem/1464/F | [
"data structures",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 444
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1463-F | codeforces | 1463-F | Max Correct Set | https://codeforces.com/problemset/problem/1463/F | [
"bitmasks",
"dp",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 742
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1463-E | codeforces | 1463-E | Plan of Lectures | https://codeforces.com/problemset/problem/1463/E | [
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"implementation",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1736
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1463-D | codeforces | 1463-D | Pairs | https://codeforces.com/problemset/problem/1463/D | [
"binary search",
"constructive algorithms",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4850
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1463-C | codeforces | 1463-C | Busy Robot | https://codeforces.com/problemset/problem/1463/C | [
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6064
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1463-B | codeforces | 1463-B | Find The Array | https://codeforces.com/problemset/problem/1463/B | [
"bitmasks",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 21205
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1463-A | codeforces | 1463-A | Dungeon | https://codeforces.com/problemset/problem/1463/A | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 27986
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1462-F | codeforces | 1462-F | The Treasure of The Segments | https://codeforces.com/problemset/problem/1462/F | [
"binary search",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8601
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1462-E2 | codeforces | 1462-E2 | Close Tuples (hard version) | https://codeforces.com/problemset/problem/1462/E2 | [
"binary search",
"combinatorics",
"implementation",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11427
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1462-E1 | codeforces | 1462-E1 | Close Tuples (easy version) | https://codeforces.com/problemset/problem/1462/E1 | [
"binary search",
"combinatorics",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15266
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1462-D | codeforces | 1462-D | Add to Neighbour and Remove | https://codeforces.com/problemset/problem/1462/D | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 18192
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1462-C | codeforces | 1462-C | Unique Number | https://codeforces.com/problemset/problem/1462/C | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 36600
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1462-B | codeforces | 1462-B | Last Year's Substring | https://codeforces.com/problemset/problem/1462/B | [
"dp",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29222
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1462-A | codeforces | 1462-A | Favorite Sequence | https://codeforces.com/problemset/problem/1462/A | [
"implementation",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 49268
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1461-F | codeforces | 1461-F | Mathematical Expression | https://codeforces.com/problemset/problem/1461/F | [
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 609
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1461-E | codeforces | 1461-E | Water Level | https://codeforces.com/problemset/problem/1461/E | [
"brute force",
"graphs",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2216
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1461-D | codeforces | 1461-D | Divide and Summarize | https://codeforces.com/problemset/problem/1461/D | [
"binary search",
"brute force",
"data structures",
"divide and conquer",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10310
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1461-C | codeforces | 1461-C | Random Events | https://codeforces.com/problemset/problem/1461/C | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12472
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1461-B | codeforces | 1461-B | Find the Spruce | https://codeforces.com/problemset/problem/1461/B | [
"brute force",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 13299
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1461-A | codeforces | 1461-A | String Generation | https://codeforces.com/problemset/problem/1461/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19004
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1459-B | codeforces | 1459-B | Move and Turn | https://codeforces.com/problemset/problem/1459/B | [
"dp",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 21159
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1459-A | codeforces | 1459-A | Red-Blue Shuffle | https://codeforces.com/problemset/problem/1459/A | [
"math",
"probabilities"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17729
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1458-F | codeforces | 1458-F | Range Diameter Sum | https://codeforces.com/problemset/problem/1458/F | [
"data structures",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 450
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1458-E | codeforces | 1458-E | Nim Shortcuts | https://codeforces.com/problemset/problem/1458/E | [
"data structures",
"games"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 558
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1458-D | codeforces | 1458-D | Flip and Reverse | https://codeforces.com/problemset/problem/1458/D | [
"data structures",
"graphs",
"greedy"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 1585
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1458-C | codeforces | 1458-C | Latin Square | https://codeforces.com/problemset/problem/1458/C | [
"math",
"matrices"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1707
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1458-B | codeforces | 1458-B | Glass Half Spilled | https://codeforces.com/problemset/problem/1458/B | [
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4113
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1458-A | codeforces | 1458-A | Row GCD | https://codeforces.com/problemset/problem/1458/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 25594
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1456-E | codeforces | 1456-E | XOR-ranges | https://codeforces.com/problemset/problem/1456/E | [
"dp",
"greedy"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 388
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1455-G | codeforces | 1455-G | Forbidden Value | https://codeforces.com/problemset/problem/1455/G | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 477
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1455-F | codeforces | 1455-F | String and Operations | https://codeforces.com/problemset/problem/1455/F | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 520
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1455-E | codeforces | 1455-E | Four Points | https://codeforces.com/problemset/problem/1455/E | [
"brute force",
"constructive algorithms",
"flows",
"geometry",
"greedy",
"implementation",
"math",
"ternary search"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1652
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1455-D | codeforces | 1455-D | Sequence and Swaps | https://codeforces.com/problemset/problem/1455/D | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13231
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1455-C | codeforces | 1455-C | Ping-pong | https://codeforces.com/problemset/problem/1455/C | [
"constructive algorithms",
"games",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20474
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1455-B | codeforces | 1455-B | Jumps | https://codeforces.com/problemset/problem/1455/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 23309
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1455-A | codeforces | 1455-A | Strange Functions | https://codeforces.com/problemset/problem/1455/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27449
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1454-F | codeforces | 1454-F | Array Partition | https://codeforces.com/problemset/problem/1454/F | [
"binary search",
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4691
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1454-E | codeforces | 1454-E | Number of Simple Paths | https://codeforces.com/problemset/problem/1454/E | [
"combinatorics",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6672
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1454-D | codeforces | 1454-D | Number into Sequence | https://codeforces.com/problemset/problem/1454/D | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 22367
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1454-C | codeforces | 1454-C | Sequence Transformation | https://codeforces.com/problemset/problem/1454/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 22535
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1454-B | codeforces | 1454-B | Unique Bid Auction | https://codeforces.com/problemset/problem/1454/B | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30084
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1454-A | codeforces | 1454-A | Special Permutation | https://codeforces.com/problemset/problem/1454/A | [
"constructive algorithms",
"probabilities"
] | null | null | stdin_stdout | 800 | {
"solved_count": 44194
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1453-F | codeforces | 1453-F | Even Harder | https://codeforces.com/problemset/problem/1453/F | [
"dp"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 998
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1453-E | codeforces | 1453-E | Dog Snacks | https://codeforces.com/problemset/problem/1453/E | [
"binary search",
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2230
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1453-D | codeforces | 1453-D | Checkpoints | https://codeforces.com/problemset/problem/1453/D | [
"brute force",
"constructive algorithms",
"greedy",
"math",
"probabilities"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4451
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1453-C | codeforces | 1453-C | Triangles | https://codeforces.com/problemset/problem/1453/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6262
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1453-B | codeforces | 1453-B | Suffix Operations | https://codeforces.com/problemset/problem/1453/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14093
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1453-A | codeforces | 1453-A | Cancel the Trains | https://codeforces.com/problemset/problem/1453/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25107
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1452-G | codeforces | 1452-G | Game On Tree | https://codeforces.com/problemset/problem/1452/G | [
"data structures",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 552
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1452-F | codeforces | 1452-F | Divide Powers | https://codeforces.com/problemset/problem/1452/F | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 369
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1452-E | codeforces | 1452-E | Two Editorials | https://codeforces.com/problemset/problem/1452/E | [
"brute force",
"dp",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1709
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1452-D | codeforces | 1452-D | Radio Towers | https://codeforces.com/problemset/problem/1452/D | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8704
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1452-C | codeforces | 1452-C | Two Brackets | https://codeforces.com/problemset/problem/1452/C | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21152
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1452-B | codeforces | 1452-B | Toy Blocks | https://codeforces.com/problemset/problem/1452/B | [
"binary search",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15515
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1452-A | codeforces | 1452-A | Robot Program | https://codeforces.com/problemset/problem/1452/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22957
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1451-F | codeforces | 1451-F | Nullify The Matrix | https://codeforces.com/problemset/problem/1451/F | [
"constructive algorithms",
"games"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1223
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1451-E2 | codeforces | 1451-E2 | Bitwise Queries (Hard Version) | https://codeforces.com/problemset/problem/1451/E2 | [
"bitmasks",
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3389
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1451-E1 | codeforces | 1451-E1 | Bitwise Queries (Easy Version) | https://codeforces.com/problemset/problem/1451/E1 | [
"bitmasks",
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4938
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1451-D | codeforces | 1451-D | Circle Game | https://codeforces.com/problemset/problem/1451/D | [
"games",
"geometry",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10169
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1451-C | codeforces | 1451-C | String Equality | https://codeforces.com/problemset/problem/1451/C | [
"dp",
"greedy",
"hashing",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17323
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1451-B | codeforces | 1451-B | Non-Substring Subsequence | https://codeforces.com/problemset/problem/1451/B | [
"dp",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 20239
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1451-A | codeforces | 1451-A | Subtract or Divide | https://codeforces.com/problemset/problem/1451/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25347
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1450-H2 | codeforces | 1450-H2 | Multithreading (Hard Version) | https://codeforces.com/problemset/problem/1450/H2 | [
"combinatorics",
"implementation",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 278
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1450-H1 | codeforces | 1450-H1 | Multithreading (Easy Version) | https://codeforces.com/problemset/problem/1450/H1 | [
"combinatorics",
"fft",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 515
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1450-G | codeforces | 1450-G | Communism | https://codeforces.com/problemset/problem/1450/G | [
"bitmasks",
"dp",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 351
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1450-F | codeforces | 1450-F | The Struggling Contestant | https://codeforces.com/problemset/problem/1450/F | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1469
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1450-E | codeforces | 1450-E | Capitalism | https://codeforces.com/problemset/problem/1450/E | [
"constructive algorithms",
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1453
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1450-D | codeforces | 1450-D | Rating Compression | https://codeforces.com/problemset/problem/1450/D | [
"binary search",
"data structures",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5817
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1450-C2 | codeforces | 1450-C2 | Errich-Tac-Toe (Hard Version) | https://codeforces.com/problemset/problem/1450/C2 | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 4206
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1450-C1 | codeforces | 1450-C1 | Errich-Tac-Toe (Easy Version) | https://codeforces.com/problemset/problem/1450/C1 | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5943
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1450-B | codeforces | 1450-B | Balls of Steel | https://codeforces.com/problemset/problem/1450/B | [
"brute force",
"geometry",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16060
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1450-A | codeforces | 1450-A | Avoid Trygub | https://codeforces.com/problemset/problem/1450/A | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18500
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1447-B | codeforces | 1447-B | Numbers Box | https://codeforces.com/problemset/problem/1447/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 26982
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1447-A | codeforces | 1447-A | Add Candies | https://codeforces.com/problemset/problem/1447/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14460
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1446-F | codeforces | 1446-F | Line Distance | https://codeforces.com/problemset/problem/1446/F | [
"binary search",
"data structures",
"geometry"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 377
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1446-E | codeforces | 1446-E | Long Recovery | https://codeforces.com/problemset/problem/1446/E | [
"constructive algorithms",
"dfs and similar"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 123
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1446-D2 | codeforces | 1446-D2 | Frequency Problem (Hard Version) | https://codeforces.com/problemset/problem/1446/D2 | [
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1733
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1446-D1 | codeforces | 1446-D1 | Frequency Problem (Easy Version) | https://codeforces.com/problemset/problem/1446/D1 | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 2112
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1446-C | codeforces | 1446-C | Xor Tree | https://codeforces.com/problemset/problem/1446/C | [
"binary search",
"bitmasks",
"data structures",
"divide and conquer",
"dp",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4101
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1446-B | codeforces | 1446-B | Catching Cheaters | https://codeforces.com/problemset/problem/1446/B | [
"dp",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9118
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1446-A | codeforces | 1446-A | Knapsack | https://codeforces.com/problemset/problem/1446/A | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17792
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1445-B | codeforces | 1445-B | Elimination | https://codeforces.com/problemset/problem/1445/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 15947
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1445-A | codeforces | 1445-A | Array Rearrangment | https://codeforces.com/problemset/problem/1445/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20383
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1444-E | codeforces | 1444-E | Finding the Vertex | https://codeforces.com/problemset/problem/1444/E | [
"brute force",
"dfs and similar",
"dp",
"interactive",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 169
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1444-D | codeforces | 1444-D | Rectangular Polyline | https://codeforces.com/problemset/problem/1444/D | [
"constructive algorithms",
"dp",
"geometry"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 646
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1444-C | codeforces | 1444-C | Team-Building | https://codeforces.com/problemset/problem/1444/C | [
"data structures",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1870
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1444-B | codeforces | 1444-B | Divide and Sum | https://codeforces.com/problemset/problem/1444/B | [
"combinatorics",
"math",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6790
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1444-A | codeforces | 1444-A | Division | https://codeforces.com/problemset/problem/1444/A | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14448
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1443-E | codeforces | 1443-E | Long Permutation | https://codeforces.com/problemset/problem/1443/E | [
"brute force",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1565
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1443-C | codeforces | 1443-C | The Delivery Dilemma | https://codeforces.com/problemset/problem/1443/C | [
"binary search",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16855
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1443-B | codeforces | 1443-B | Saving the City | https://codeforces.com/problemset/problem/1443/B | [
"dp",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16680
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1443-A | codeforces | 1443-A | Kids Seating | https://codeforces.com/problemset/problem/1443/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16699
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1442-F | codeforces | 1442-F | Differentiating Games | https://codeforces.com/problemset/problem/1442/F | [
"games",
"interactive"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 172
} | 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.