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:1520-D | codeforces | 1520-D | Same Differences | https://codeforces.com/problemset/problem/1520/D | [
"data structures",
"hashing",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 65395
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1520-C | codeforces | 1520-C | Not Adjacent Matrix | https://codeforces.com/problemset/problem/1520/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 34626
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1520-B | codeforces | 1520-B | Ordinary Numbers | https://codeforces.com/problemset/problem/1520/B | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 49864
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1520-A | codeforces | 1520-A | Do Not Be Distracted! | https://codeforces.com/problemset/problem/1520/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 58694
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1519-F | codeforces | 1519-F | Chests and Keys | https://codeforces.com/problemset/problem/1519/F | [
"bitmasks",
"brute force",
"dfs and similar",
"dp",
"flows"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 683
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1519-E | codeforces | 1519-E | Off by One | https://codeforces.com/problemset/problem/1519/E | [
"constructive algorithms",
"dfs and similar",
"geometry",
"graphs",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 907
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1519-D | codeforces | 1519-D | Maximum Sum of Products | https://codeforces.com/problemset/problem/1519/D | [
"brute force",
"dp",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 17686
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1519-C | codeforces | 1519-C | Berland Regional | https://codeforces.com/problemset/problem/1519/C | [
"brute force",
"data structures",
"greedy",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 22745
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1519-B | codeforces | 1519-B | The Cake Is a Lie | https://codeforces.com/problemset/problem/1519/B | [
"dp",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33460
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1519-A | codeforces | 1519-A | Red and Blue Beans | https://codeforces.com/problemset/problem/1519/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30614
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1517-H | codeforces | 1517-H | Fly Around the World | https://codeforces.com/problemset/problem/1517/H | [
"dp",
"geometry"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 89
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1517-G | codeforces | 1517-G | Starry Night Camping | https://codeforces.com/problemset/problem/1517/G | [
"constructive algorithms",
"flows",
"graphs"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 715
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1517-F | codeforces | 1517-F | Reunion | https://codeforces.com/problemset/problem/1517/F | [
"combinatorics",
"dp",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 603
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1517-E | codeforces | 1517-E | Group Photo | https://codeforces.com/problemset/problem/1517/E | [
"binary search",
"data structures",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1033
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1517-D | codeforces | 1517-D | Explorer Space | https://codeforces.com/problemset/problem/1517/D | [
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9292
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1517-C | codeforces | 1517-C | Fillomino 2 | https://codeforces.com/problemset/problem/1517/C | [
"constructive algorithms",
"dfs and similar",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14190
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1517-B | codeforces | 1517-B | Morning Jogging | https://codeforces.com/problemset/problem/1517/B | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 13846
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1517-A | codeforces | 1517-A | Sum of 2050 | https://codeforces.com/problemset/problem/1517/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26909
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1516-E | codeforces | 1516-E | Baby Ehab Plays with Permutations | https://codeforces.com/problemset/problem/1516/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1012
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1516-D | codeforces | 1516-D | Cut | https://codeforces.com/problemset/problem/1516/D | [
"binary search",
"data structures",
"dp",
"graphs",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5223
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1516-C | codeforces | 1516-C | Baby Ehab Partitions Again | https://codeforces.com/problemset/problem/1516/C | [
"bitmasks",
"constructive algorithms",
"dp",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 14198
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1516-B | codeforces | 1516-B | AGAGA XOOORRR | https://codeforces.com/problemset/problem/1516/B | [
"bitmasks",
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 25847
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1516-A | codeforces | 1516-A | Tit for Tat | https://codeforces.com/problemset/problem/1516/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24731
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1515-I | codeforces | 1515-I | Phoenix and Diamonds | https://codeforces.com/problemset/problem/1515/I | [
"binary search",
"data structures",
"sortings"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 431
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1515-H | codeforces | 1515-H | Phoenix and Bits | https://codeforces.com/problemset/problem/1515/H | [
"bitmasks",
"brute force",
"data structures",
"sortings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 351
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1515-G | codeforces | 1515-G | Phoenix and Odometers | https://codeforces.com/problemset/problem/1515/G | [
"dfs and similar",
"graphs",
"math",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1365
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1515-F | codeforces | 1515-F | Phoenix and Earthquake | https://codeforces.com/problemset/problem/1515/F | [
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 2085
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1515-E | codeforces | 1515-E | Phoenix and Computers | https://codeforces.com/problemset/problem/1515/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4512
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1515-D | codeforces | 1515-D | Phoenix and Socks | https://codeforces.com/problemset/problem/1515/D | [
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12844
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1515-C | codeforces | 1515-C | Phoenix and Towers | https://codeforces.com/problemset/problem/1515/C | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 18809
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1515-B | codeforces | 1515-B | Phoenix and Puzzle | https://codeforces.com/problemset/problem/1515/B | [
"brute force",
"geometry",
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 27141
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1515-A | codeforces | 1515-A | Phoenix and Gold | https://codeforces.com/problemset/problem/1515/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21245
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1514-E | codeforces | 1514-E | Baby Ehab's Hyper Apartment | https://codeforces.com/problemset/problem/1514/E | [
"binary search",
"graphs",
"interactive",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 706
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1514-D | codeforces | 1514-D | Cut and Stick | https://codeforces.com/problemset/problem/1514/D | [
"binary search",
"data structures",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4829
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1514-C | codeforces | 1514-C | Product 1 Modulo N | https://codeforces.com/problemset/problem/1514/C | [
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 18420
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1514-B | codeforces | 1514-B | AND 0, Sum Big | https://codeforces.com/problemset/problem/1514/B | [
"bitmasks",
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 35427
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1514-A | codeforces | 1514-A | Perfectly Imperfect Array | https://codeforces.com/problemset/problem/1514/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25392
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1513-F | codeforces | 1513-F | Swapping Problem | https://codeforces.com/problemset/problem/1513/F | [
"brute force",
"constructive algorithms",
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1434
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1513-E | codeforces | 1513-E | Cost Equilibrium | https://codeforces.com/problemset/problem/1513/E | [
"combinatorics",
"constructive algorithms",
"math",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1736
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1513-D | codeforces | 1513-D | GCD and MST | https://codeforces.com/problemset/problem/1513/D | [
"constructive algorithms",
"dsu",
"graphs",
"greedy",
"number theory",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6523
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1513-C | codeforces | 1513-C | Add One | https://codeforces.com/problemset/problem/1513/C | [
"dp",
"matrices"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 16615
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1513-B | codeforces | 1513-B | AND Sequences | https://codeforces.com/problemset/problem/1513/B | [
"bitmasks",
"combinatorics",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 20363
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1513-A | codeforces | 1513-A | Array and Peaks | https://codeforces.com/problemset/problem/1513/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20042
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1512-G | codeforces | 1512-G | Short Task | https://codeforces.com/problemset/problem/1512/G | [
"brute force",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9553
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1512-F | codeforces | 1512-F | Education | https://codeforces.com/problemset/problem/1512/F | [
"brute force",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6829
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1512-E | codeforces | 1512-E | Permutation by Sum | https://codeforces.com/problemset/problem/1512/E | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11412
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1512-D | codeforces | 1512-D | Corrupted Array | https://codeforces.com/problemset/problem/1512/D | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 24599
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1512-C | codeforces | 1512-C | A-B Palindrome | https://codeforces.com/problemset/problem/1512/C | [
"constructive algorithms",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 21798
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1512-B | codeforces | 1512-B | Almost Rectangle | https://codeforces.com/problemset/problem/1512/B | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26600
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1512-A | codeforces | 1512-A | Spy Detected! | https://codeforces.com/problemset/problem/1512/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 80763
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1511-G | codeforces | 1511-G | Chips on a Board | https://codeforces.com/problemset/problem/1511/G | [
"bitmasks",
"brute force",
"data structures",
"dp",
"games",
"two pointers"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 940
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1511-F | codeforces | 1511-F | Chainword | https://codeforces.com/problemset/problem/1511/F | [
"brute force",
"data structures",
"dp",
"matrices",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 546
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1511-E | codeforces | 1511-E | Colorings and Dominoes | https://codeforces.com/problemset/problem/1511/E | [
"combinatorics",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2903
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1511-D | codeforces | 1511-D | Min Cost String | https://codeforces.com/problemset/problem/1511/D | [
"brute force",
"constructive algorithms",
"graphs",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12484
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1511-C | codeforces | 1511-C | Yet Another Card Deck | https://codeforces.com/problemset/problem/1511/C | [
"brute force",
"data structures",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 33276
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1511-B | codeforces | 1511-B | GCD Length | https://codeforces.com/problemset/problem/1511/B | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 24741
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1511-A | codeforces | 1511-A | Review Site | https://codeforces.com/problemset/problem/1511/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28875
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1510-K | codeforces | 1510-K | King's Task | https://codeforces.com/problemset/problem/1510/K | [
"brute force",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 5993
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1510-J | codeforces | 1510-J | Japanese Game | https://codeforces.com/problemset/problem/1510/J | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 563
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1510-I | codeforces | 1510-I | Is It Rated? | https://codeforces.com/problemset/problem/1510/I | [
"greedy",
"interactive",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 587
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1510-H | codeforces | 1510-H | Hard Optimization | https://codeforces.com/problemset/problem/1510/H | [
"dp"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 139
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1510-G | codeforces | 1510-G | Guide | https://codeforces.com/problemset/problem/1510/G | [] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1384
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1510-F | codeforces | 1510-F | Fiber Shape | https://codeforces.com/problemset/problem/1510/F | [] | null | null | stdin_stdout | 2,800 | {
"solved_count": 64
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1510-E | codeforces | 1510-E | Equilibrium Point /\textbackslash/\textbackslash | https://codeforces.com/problemset/problem/1510/E | [] | null | null | stdin_stdout | 2,700 | {
"solved_count": 271
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1510-D | codeforces | 1510-D | Digits | https://codeforces.com/problemset/problem/1510/D | [
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2121
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1510-C | codeforces | 1510-C | Cactus Not Enough | https://codeforces.com/problemset/problem/1510/C | [
"dfs and similar",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 240
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1510-B | codeforces | 1510-B | Button Lock | https://codeforces.com/problemset/problem/1510/B | [
"flows",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 979
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1510-A | codeforces | 1510-A | ASCII Automata Art | https://codeforces.com/problemset/problem/1510/A | [] | null | null | stdin_stdout | 3,100 | {
"solved_count": 168
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1509-C | codeforces | 1509-C | The Sports Festival | https://codeforces.com/problemset/problem/1509/C | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 15430
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1509-B | codeforces | 1509-B | TMT Document | https://codeforces.com/problemset/problem/1509/B | [
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 23111
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1509-A | codeforces | 1509-A | Average Height | https://codeforces.com/problemset/problem/1509/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27297
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1508-F | codeforces | 1508-F | Optimal Encoding | https://codeforces.com/problemset/problem/1508/F | [
"brute force",
"data structures"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 155
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1508-E | codeforces | 1508-E | Tree Calendar | https://codeforces.com/problemset/problem/1508/E | [
"brute force",
"constructive algorithms",
"data structures",
"dfs and similar",
"sortings",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 392
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1508-D | codeforces | 1508-D | Swap Pass | https://codeforces.com/problemset/problem/1508/D | [
"constructive algorithms",
"geometry",
"sortings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 732
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1508-C | codeforces | 1508-C | Complete the MST | https://codeforces.com/problemset/problem/1508/C | [
"bitmasks",
"brute force",
"data structures",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1735
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1508-B | codeforces | 1508-B | Almost Sorted | https://codeforces.com/problemset/problem/1508/B | [
"binary search",
"combinatorics",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4462
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1508-A | codeforces | 1508-A | Binary Literature | https://codeforces.com/problemset/problem/1508/A | [
"constructive algorithms",
"greedy",
"implementation",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6691
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1506-G | codeforces | 1506-G | Maximize the Remaining String | https://codeforces.com/problemset/problem/1506/G | [
"brute force",
"data structures",
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4842
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1506-F | codeforces | 1506-F | Triangular Paths | https://codeforces.com/problemset/problem/1506/F | [
"constructive algorithms",
"graphs",
"math",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3712
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1506-E | codeforces | 1506-E | Restoring the Permutation | https://codeforces.com/problemset/problem/1506/E | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14226
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1506-D | codeforces | 1506-D | Epic Transformation | https://codeforces.com/problemset/problem/1506/D | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 25676
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1506-C | codeforces | 1506-C | Double-ended Strings | https://codeforces.com/problemset/problem/1506/C | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 36118
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1506-B | codeforces | 1506-B | Partial Replacement | https://codeforces.com/problemset/problem/1506/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21183
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1506-A | codeforces | 1506-A | Strange Table | https://codeforces.com/problemset/problem/1506/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32565
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1505-I | codeforces | 1505-I | Mysterious language again, seriously? | https://codeforces.com/problemset/problem/1505/I | [
"*special"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 610
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1505-H | codeforces | 1505-H | L BREAK into program | https://codeforces.com/problemset/problem/1505/H | [
"*special"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 564
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1505-G | codeforces | 1505-G | Encoded message | https://codeforces.com/problemset/problem/1505/G | [
"*special",
"implementation"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 352
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1505-F | codeforces | 1505-F | Math | https://codeforces.com/problemset/problem/1505/F | [
"*special",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1592
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1505-E | codeforces | 1505-E | Cakewalk | https://codeforces.com/problemset/problem/1505/E | [
"*special",
"greedy",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1925
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1505-D | codeforces | 1505-D | Xenolith? Hippodrome? | https://codeforces.com/problemset/problem/1505/D | [
"*special",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 888
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1505-C | codeforces | 1505-C | Fibonacci Words | https://codeforces.com/problemset/problem/1505/C | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 6711
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1505-B | codeforces | 1505-B | DMCA | https://codeforces.com/problemset/problem/1505/B | [
"*special",
"implementation",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6534
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1505-A | codeforces | 1505-A | Is it rated - 2 | https://codeforces.com/problemset/problem/1505/A | [
"*special",
"implementation",
"interactive"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16134
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1504-B | codeforces | 1504-B | Flip the Bits | https://codeforces.com/problemset/problem/1504/B | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 26098
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1504-A | codeforces | 1504-A | Déjà Vu | https://codeforces.com/problemset/problem/1504/A | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22837
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1503-F | codeforces | 1503-F | Balance the Cards | https://codeforces.com/problemset/problem/1503/F | [
"constructive algorithms",
"data structures",
"divide and conquer",
"geometry",
"graphs",
"implementation"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 230
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1503-E | codeforces | 1503-E | 2-Coloring | https://codeforces.com/problemset/problem/1503/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 892
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1503-D | codeforces | 1503-D | Flip the Cards | https://codeforces.com/problemset/problem/1503/D | [
"2-sat",
"constructive algorithms",
"data structures",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1266
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1503-C | codeforces | 1503-C | Travelling Salesman Problem | https://codeforces.com/problemset/problem/1503/C | [
"binary search",
"data structures",
"dp",
"greedy",
"shortest paths",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3860
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1503-B | codeforces | 1503-B | 3-Coloring | https://codeforces.com/problemset/problem/1503/B | [
"constructive algorithms",
"games",
"interactive"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7698
} | 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.