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:1476-C | codeforces | 1476-C | Longest Simple Cycle | https://codeforces.com/problemset/problem/1476/C | [
"dp",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12499
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1476-B | codeforces | 1476-B | Inflation | https://codeforces.com/problemset/problem/1476/B | [
"binary search",
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 22021
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1476-A | codeforces | 1476-A | K-divisible Sum | https://codeforces.com/problemset/problem/1476/A | [
"binary search",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 46634
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1475-G | codeforces | 1475-G | Strange Beauty | https://codeforces.com/problemset/problem/1475/G | [
"dp",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8230
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1475-F | codeforces | 1475-F | Unusual Matrix | https://codeforces.com/problemset/problem/1475/F | [
"2-sat",
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6107
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1475-E | codeforces | 1475-E | Advertising Agency | https://codeforces.com/problemset/problem/1475/E | [
"combinatorics",
"math",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 19125
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1475-D | codeforces | 1475-D | Cleaning the Phone | https://codeforces.com/problemset/problem/1475/D | [
"binary search",
"dp",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 11480
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1475-C | codeforces | 1475-C | Ball in Berland | https://codeforces.com/problemset/problem/1475/C | [
"combinatorics",
"graphs",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 29290
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1475-B | codeforces | 1475-B | New Year's Number | https://codeforces.com/problemset/problem/1475/B | [
"brute force",
"dp",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 59734
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1475-A | codeforces | 1475-A | Odd Divisor | https://codeforces.com/problemset/problem/1475/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 95554
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1474-F | codeforces | 1474-F | 1 2 3 4 ... | https://codeforces.com/problemset/problem/1474/F | [
"dp",
"math",
"matrices"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 405
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1474-E | codeforces | 1474-E | What Is It? | https://codeforces.com/problemset/problem/1474/E | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1551
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1474-D | codeforces | 1474-D | Cleaning | https://codeforces.com/problemset/problem/1474/D | [
"data structures",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4393
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1474-C | codeforces | 1474-C | Array Destruction | https://codeforces.com/problemset/problem/1474/C | [
"brute force",
"constructive algorithms",
"data structures",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 14649
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1474-B | codeforces | 1474-B | Different Divisors | https://codeforces.com/problemset/problem/1474/B | [
"binary search",
"constructive algorithms",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 44473
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1474-A | codeforces | 1474-A | Puzzle From the Future | https://codeforces.com/problemset/problem/1474/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23661
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1473-G | codeforces | 1473-G | Tiles | https://codeforces.com/problemset/problem/1473/G | [
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 513
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1473-F | codeforces | 1473-F | Strange Set | https://codeforces.com/problemset/problem/1473/F | [
"flows",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1283
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1473-E | codeforces | 1473-E | Minimum Path | https://codeforces.com/problemset/problem/1473/E | [
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 5470
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1473-D | codeforces | 1473-D | Program | https://codeforces.com/problemset/problem/1473/D | [
"data structures",
"dp",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11449
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1473-C | codeforces | 1473-C | No More Inversions | https://codeforces.com/problemset/problem/1473/C | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13567
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1473-B | codeforces | 1473-B | String LCM | https://codeforces.com/problemset/problem/1473/B | [
"brute force",
"math",
"number theory",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 36000
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1473-A | codeforces | 1473-A | Replacing Elements | https://codeforces.com/problemset/problem/1473/A | [
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 38067
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1472-G | codeforces | 1472-G | Moving to the Capital | https://codeforces.com/problemset/problem/1472/G | [
"dfs and similar",
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 6106
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1472-F | codeforces | 1472-F | New Year's Puzzle | https://codeforces.com/problemset/problem/1472/F | [
"brute force",
"dp",
"graph matchings",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3381
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1472-E | codeforces | 1472-E | Correct Placement | https://codeforces.com/problemset/problem/1472/E | [
"binary search",
"data structures",
"dp",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9253
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1472-D | codeforces | 1472-D | Even-Odd Game | https://codeforces.com/problemset/problem/1472/D | [
"dp",
"games",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 31749
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1472-C | codeforces | 1472-C | Long Jumps | https://codeforces.com/problemset/problem/1472/C | [
"dp",
"graphs"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 36737
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1472-B | codeforces | 1472-B | Fair Division | https://codeforces.com/problemset/problem/1472/B | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 62095
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1472-A | codeforces | 1472-A | Cards for Friends | https://codeforces.com/problemset/problem/1472/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 46626
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1471-B | codeforces | 1471-B | Strange List | https://codeforces.com/problemset/problem/1471/B | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20095
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1471-A | codeforces | 1471-A | Strange Partition | https://codeforces.com/problemset/problem/1471/A | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 42532
} | 2026-11-02T05:37:07.883505+00:00 |
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": 174
} | 2026-11-02T05:37:07.883505+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": 999
} | 2026-11-02T05:37:07.883505+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": 4342
} | 2026-11-02T05:37:07.883505+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": 1488
} | 2026-11-02T05:37:07.883505+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": 6858
} | 2026-11-02T05:37:07.883505+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": 31881
} | 2026-11-02T05:37:07.883505+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": 1142
} | 2026-11-02T05:37:07.883505+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": 2274
} | 2026-11-02T05:37:07.883505+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": 10388
} | 2026-11-02T05:37:07.883505+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": 11873
} | 2026-11-02T05:37:07.883505+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": 31799
} | 2026-11-02T05:37:07.883505+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": 30602
} | 2026-11-02T05:37:07.883505+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": 9393
} | 2026-11-02T05:37:07.883505+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": 1206
} | 2026-11-02T05:37:07.883505+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": 392
} | 2026-11-02T05:37:07.883505+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": 5722
} | 2026-11-02T05:37:07.883505+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": 6916
} | 2026-11-02T05:37:07.883505+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": 663
} | 2026-11-02T05:37:07.883505+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": 2072
} | 2026-11-02T05:37:07.883505+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": 954
} | 2026-11-02T05:37:07.883505+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": 4352
} | 2026-11-02T05:37:07.883505+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": 9951
} | 2026-11-02T05:37:07.883505+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": 5479
} | 2026-11-02T05:37:07.883505+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": 12021
} | 2026-11-02T05:37:07.883505+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": 281
} | 2026-11-02T05:37:07.883505+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": 2048
} | 2026-11-02T05:37:07.883505+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": 1889
} | 2026-11-02T05:37:07.883505+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": 4141
} | 2026-11-02T05:37:07.883505+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": 6897
} | 2026-11-02T05:37:07.883505+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": 11668
} | 2026-11-02T05:37:07.883505+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": 25509
} | 2026-11-02T05:37:07.883505+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": 254
} | 2026-11-02T05:37:07.883505+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": 724
} | 2026-11-02T05:37:07.883505+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": 1108
} | 2026-11-02T05:37:07.883505+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": 3136
} | 2026-11-02T05:37:07.883505+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": 8756
} | 2026-11-02T05:37:07.883505+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": 15793
} | 2026-11-02T05:37:07.883505+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": 18989
} | 2026-11-02T05:37:07.883505+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": 23732
} | 2026-11-02T05:37:07.883505+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": 23341
} | 2026-11-02T05:37:07.883505+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": 452
} | 2026-11-02T05:37:07.883505+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": 905
} | 2026-11-02T05:37:07.883505+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": 1811
} | 2026-11-02T05:37:07.883505+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": 4992
} | 2026-11-02T05:37:07.883505+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": 6147
} | 2026-11-02T05:37:07.883505+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": 21563
} | 2026-11-02T05:37:07.883505+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": 28468
} | 2026-11-02T05:37:07.883505+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": 9027
} | 2026-11-02T05:37:07.883505+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": 11953
} | 2026-11-02T05:37:07.883505+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": 15864
} | 2026-11-02T05:37:07.883505+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": 18669
} | 2026-11-02T05:37:07.883505+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": 37503
} | 2026-11-02T05:37:07.883505+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": 29642
} | 2026-11-02T05:37:07.883505+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": 51176
} | 2026-11-02T05:37:07.883505+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": 692
} | 2026-11-02T05:37:07.883505+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": 2263
} | 2026-11-02T05:37:07.883505+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": 10588
} | 2026-11-02T05:37:07.883505+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": 12872
} | 2026-11-02T05:37:07.883505+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": 13463
} | 2026-11-02T05:37:07.883505+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": 19069
} | 2026-11-02T05:37:07.883505+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": 22928
} | 2026-11-02T05:37:07.883505+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": 18174
} | 2026-11-02T05:37:07.883505+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": 536
} | 2026-11-02T05:37:07.883505+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": 691
} | 2026-11-02T05:37:07.883505+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": 1822
} | 2026-11-02T05:37:07.883505+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": 1820
} | 2026-11-02T05:37:07.883505+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": 4314
} | 2026-11-02T05:37:07.883505+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": 27552
} | 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.