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:1470-F | codeforces | 1470-F | Strange Covering | https://codeforces.com/problemset/problem/1470/F | [
"divide and conquer"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 172
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1470-E | codeforces | 1470-E | Strange Permutation | https://codeforces.com/problemset/problem/1470/E | [
"binary search",
"combinatorics",
"data structures",
"dp",
"graphs",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 995
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1470-D | codeforces | 1470-D | Strange Housing | https://codeforces.com/problemset/problem/1470/D | [
"constructive algorithms",
"dfs and similar",
"graph matchings",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4292
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1470-C | codeforces | 1470-C | Strange Shuffle | https://codeforces.com/problemset/problem/1470/C | [
"binary search",
"brute force",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1470
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1470-B | codeforces | 1470-B | Strange Definition | https://codeforces.com/problemset/problem/1470/B | [
"bitmasks",
"graphs",
"hashing",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6831
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1470-A | codeforces | 1470-A | Strange Birthday Party | https://codeforces.com/problemset/problem/1470/A | [
"binary search",
"dp",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 30848
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1469-F | codeforces | 1469-F | Power Sockets | https://codeforces.com/problemset/problem/1469/F | [
"binary search",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1129
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1469-E | codeforces | 1469-E | A Bit Similar | https://codeforces.com/problemset/problem/1469/E | [
"bitmasks",
"brute force",
"hashing",
"string suffix structures",
"strings",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2249
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1469-D | codeforces | 1469-D | Ceil Divisions | https://codeforces.com/problemset/problem/1469/D | [
"brute force",
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10298
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1469-C | codeforces | 1469-C | Building a Fence | https://codeforces.com/problemset/problem/1469/C | [
"dp",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11762
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1469-B | codeforces | 1469-B | Red and Blue | https://codeforces.com/problemset/problem/1469/B | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 31481
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1469-A | codeforces | 1469-A | Regular Bracket Sequence | https://codeforces.com/problemset/problem/1469/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 30320
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1468-N | codeforces | 1468-N | Waste Sorting | https://codeforces.com/problemset/problem/1468/N | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 9256
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1468-M | codeforces | 1468-M | Similar Sets | https://codeforces.com/problemset/problem/1468/M | [
"data structures",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1173
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1468-L | codeforces | 1468-L | Prime Divisors Selection | https://codeforces.com/problemset/problem/1468/L | [
"binary search",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 384
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1468-K | codeforces | 1468-K | The Robot | https://codeforces.com/problemset/problem/1468/K | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5651
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1468-J | codeforces | 1468-J | Road Reform | https://codeforces.com/problemset/problem/1468/J | [
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6359
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1468-I | codeforces | 1468-I | Plane Tiling | https://codeforces.com/problemset/problem/1468/I | [
"geometry",
"implementation",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 653
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1468-H | codeforces | 1468-H | K and Medians | https://codeforces.com/problemset/problem/1468/H | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2040
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1468-G | codeforces | 1468-G | Hobbits | https://codeforces.com/problemset/problem/1468/G | [
"binary search",
"geometry"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 940
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1468-F | codeforces | 1468-F | Full Turn | https://codeforces.com/problemset/problem/1468/F | [
"geometry",
"hashing",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4257
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1468-E | codeforces | 1468-E | Four Segments | https://codeforces.com/problemset/problem/1468/E | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 9866
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1468-D | codeforces | 1468-D | Firecrackers | https://codeforces.com/problemset/problem/1468/D | [
"binary search",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5379
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1468-C | codeforces | 1468-C | Berpizza | https://codeforces.com/problemset/problem/1468/C | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11515
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1468-B | codeforces | 1468-B | Bakery | https://codeforces.com/problemset/problem/1468/B | [
"data structures",
"dsu"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 262
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1468-A | codeforces | 1468-A | LaIS | https://codeforces.com/problemset/problem/1468/A | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2008
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1467-E | codeforces | 1467-E | Distinctive Roots in a Tree | https://codeforces.com/problemset/problem/1467/E | [
"data structures",
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1848
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1467-D | codeforces | 1467-D | Sum of Paths | https://codeforces.com/problemset/problem/1467/D | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4093
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1467-C | codeforces | 1467-C | Three Bags | https://codeforces.com/problemset/problem/1467/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6851
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1467-B | codeforces | 1467-B | Hills And Valleys | https://codeforces.com/problemset/problem/1467/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11616
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1467-A | codeforces | 1467-A | Wizard of Orz | https://codeforces.com/problemset/problem/1467/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 25420
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1466-I | codeforces | 1466-I | The Riddle of the Sphinx | https://codeforces.com/problemset/problem/1466/I | [
"binary search",
"data structures",
"interactive"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 247
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1466-H | codeforces | 1466-H | Finding satisfactory solutions | https://codeforces.com/problemset/problem/1466/H | [
"combinatorics",
"dp",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 713
} | 2026-08-10T02:20:32.917453+00:00 |
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": 1056
} | 2026-08-10T02:20:32.917453+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": 3090
} | 2026-08-10T02:20:32.917453+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": 8559
} | 2026-08-10T02:20:32.917453+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": 15305
} | 2026-08-10T02:20:32.917453+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": 18927
} | 2026-08-10T02:20:32.917453+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": 23674
} | 2026-08-10T02:20:32.917453+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": 23278
} | 2026-08-10T02:20:32.917453+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": 447
} | 2026-08-10T02:20:32.917453+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": 883
} | 2026-08-10T02:20:32.917453+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": 1783
} | 2026-08-10T02:20:32.917453+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": 4914
} | 2026-08-10T02:20:32.917453+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": 6086
} | 2026-08-10T02:20:32.917453+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": 21370
} | 2026-08-10T02:20:32.917453+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": 28238
} | 2026-08-10T02:20:32.917453+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": 8800
} | 2026-08-10T02:20:32.917453+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": 11673
} | 2026-08-10T02:20:32.917453+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": 15586
} | 2026-08-10T02:20:32.917453+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": 18429
} | 2026-08-10T02:20:32.917453+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": 36992
} | 2026-08-10T02:20:32.917453+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": 29415
} | 2026-08-10T02:20:32.917453+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": 50067
} | 2026-08-10T02:20:32.917453+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": 679
} | 2026-08-10T02:20:32.917453+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": 2246
} | 2026-08-10T02:20:32.917453+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": 10383
} | 2026-08-10T02:20:32.917453+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": 12656
} | 2026-08-10T02:20:32.917453+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": 13387
} | 2026-08-10T02:20:32.917453+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": 19034
} | 2026-08-10T02:20:32.917453+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": 22091
} | 2026-08-10T02:20:32.917453+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": 18055
} | 2026-08-10T02:20:32.917453+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": 498
} | 2026-08-10T02:20:32.917453+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": 689
} | 2026-08-10T02:20:32.917453+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": 1758
} | 2026-08-10T02:20:32.917453+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": 1791
} | 2026-08-10T02:20:32.917453+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": 4178
} | 2026-08-10T02:20:32.917453+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": 26566
} | 2026-08-10T02:20:32.917453+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": 396
} | 2026-08-10T02:20:32.917453+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": 529
} | 2026-08-10T02:20:32.917453+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": 525
} | 2026-08-10T02:20:32.917453+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": 1681
} | 2026-08-10T02:20:32.917453+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": 13303
} | 2026-08-10T02:20:32.917453+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": 20572
} | 2026-08-10T02:20:32.917453+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": 23443
} | 2026-08-10T02:20:32.917453+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": 27521
} | 2026-08-10T02:20:32.917453+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": 4951
} | 2026-08-10T02:20:32.917453+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": 6828
} | 2026-08-10T02:20:32.917453+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": 22584
} | 2026-08-10T02:20:32.917453+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": 22662
} | 2026-08-10T02:20:32.917453+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": 30217
} | 2026-08-10T02:20:32.917453+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": 44648
} | 2026-08-10T02:20:32.917453+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": 1075
} | 2026-08-10T02:20:32.917453+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": 2259
} | 2026-08-10T02:20:32.917453+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": 4474
} | 2026-08-10T02:20:32.917453+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": 6276
} | 2026-08-10T02:20:32.917453+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": 14168
} | 2026-08-10T02:20:32.917453+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": 25206
} | 2026-08-10T02:20:32.917453+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": 579
} | 2026-08-10T02:20:32.917453+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": 398
} | 2026-08-10T02:20:32.917453+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": 1762
} | 2026-08-10T02:20:32.917453+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": 8793
} | 2026-08-10T02:20:32.917453+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": 21284
} | 2026-08-10T02:20:32.917453+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": 15585
} | 2026-08-10T02:20:32.917453+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": 23030
} | 2026-08-10T02:20:32.917453+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": 1260
} | 2026-08-10T02:20:32.917453+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": 3965
} | 2026-08-10T02:20:32.917453+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": 5592
} | 2026-08-10T02:20:32.917453+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": 10348
} | 2026-08-10T02:20:32.917453+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": 17456
} | 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.