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:1527-B2 | codeforces | 1527-B2 | Palindrome Game (hard version) | https://codeforces.com/problemset/problem/1527/B2 | [
"constructive algorithms",
"games"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8838
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1527-B1 | codeforces | 1527-B1 | Palindrome Game (easy version) | https://codeforces.com/problemset/problem/1527/B1 | [
"constructive algorithms",
"games"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 36245
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1527-A | codeforces | 1527-A | And Then There Were K | https://codeforces.com/problemset/problem/1527/A | [
"bitmasks"
] | null | null | stdin_stdout | 800 | {
"solved_count": 42844
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1526-F | codeforces | 1526-F | Median Queries | https://codeforces.com/problemset/problem/1526/F | [
"constructive algorithms",
"interactive",
"probabilities"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 403
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1526-E | codeforces | 1526-E | Oolimry and Suffix Array | https://codeforces.com/problemset/problem/1526/E | [
"combinatorics",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1582
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1526-D | codeforces | 1526-D | Kill Anton | https://codeforces.com/problemset/problem/1526/D | [
"brute force",
"constructive algorithms",
"data structures",
"math",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2851
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1526-C2 | codeforces | 1526-C2 | Potions (Hard Version) | https://codeforces.com/problemset/problem/1526/C2 | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 31835
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1526-C1 | codeforces | 1526-C1 | Potions (Easy Version) | https://codeforces.com/problemset/problem/1526/C1 | [
"brute force",
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 27991
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1526-B | codeforces | 1526-B | I Hate 1111 | https://codeforces.com/problemset/problem/1526/B | [
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 37706
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1526-A | codeforces | 1526-A | Mean Inequality | https://codeforces.com/problemset/problem/1526/A | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25118
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1525-F | codeforces | 1525-F | Goblins And Gnomes | https://codeforces.com/problemset/problem/1525/F | [
"brute force",
"dp",
"flows",
"graph matchings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 498
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1525-E | codeforces | 1525-E | Assimilation IV | https://codeforces.com/problemset/problem/1525/E | [
"combinatorics",
"dp",
"math",
"probabilities",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2541
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1525-D | codeforces | 1525-D | Armchairs | https://codeforces.com/problemset/problem/1525/D | [
"dp",
"flows",
"graph matchings",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 11038
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1525-C | codeforces | 1525-C | Robot Collisions | https://codeforces.com/problemset/problem/1525/C | [
"data structures",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5063
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1525-B | codeforces | 1525-B | Permutation Sort | https://codeforces.com/problemset/problem/1525/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 26807
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1525-A | codeforces | 1525-A | Potion-making | https://codeforces.com/problemset/problem/1525/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27123
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1523-H | codeforces | 1523-H | Hopping Around the Array | https://codeforces.com/problemset/problem/1523/H | [
"data structures",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 465
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1523-G | codeforces | 1523-G | Try Booking | https://codeforces.com/problemset/problem/1523/G | [
"data structures",
"divide and conquer"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 594
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1523-F | codeforces | 1523-F | Favorite Game | https://codeforces.com/problemset/problem/1523/F | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 553
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1523-E | codeforces | 1523-E | Crypto Lights | https://codeforces.com/problemset/problem/1523/E | [
"combinatorics",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 2012
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1523-D | codeforces | 1523-D | Love-Hate | https://codeforces.com/problemset/problem/1523/D | [
"bitmasks",
"brute force",
"dp",
"probabilities"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2542
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1523-C | codeforces | 1523-C | Compression and Expansion | https://codeforces.com/problemset/problem/1523/C | [
"brute force",
"data structures",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9219
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1523-B | codeforces | 1523-B | Lord of the Values | https://codeforces.com/problemset/problem/1523/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12546
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1523-A | codeforces | 1523-A | Game of Life | https://codeforces.com/problemset/problem/1523/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14089
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1521-E | codeforces | 1521-E | Nastia and a Beautiful Matrix | https://codeforces.com/problemset/problem/1521/E | [
"binary search",
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 768
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1521-D | codeforces | 1521-D | Nastia Plays with a Tree | https://codeforces.com/problemset/problem/1521/D | [
"constructive algorithms",
"data structures",
"dfs and similar",
"dp",
"dsu",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2386
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1521-C | codeforces | 1521-C | Nastia and a Hidden Permutation | https://codeforces.com/problemset/problem/1521/C | [
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4677
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1521-B | codeforces | 1521-B | Nastia and a Good Array | https://codeforces.com/problemset/problem/1521/B | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 23163
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1521-A | codeforces | 1521-A | Nastia and Nearly Good Numbers | https://codeforces.com/problemset/problem/1521/A | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 42634
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1520-G | codeforces | 1520-G | To Go Or Not To Go? | https://codeforces.com/problemset/problem/1520/G | [
"brute force",
"dfs and similar",
"graphs",
"greedy",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4380
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1520-F2 | codeforces | 1520-F2 | Guess the K-th Zero (Hard version) | https://codeforces.com/problemset/problem/1520/F2 | [
"binary search",
"constructive algorithms",
"data structures",
"interactive"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3418
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1520-F1 | codeforces | 1520-F1 | Guess the K-th Zero (Easy version) | https://codeforces.com/problemset/problem/1520/F1 | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14802
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1520-E | codeforces | 1520-E | Arranging The Sheep | https://codeforces.com/problemset/problem/1520/E | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 30044
} | 2026-08-10T02:20:32.917453+00:00 |
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": 68487
} | 2026-08-10T02:20:32.917453+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": 34915
} | 2026-08-10T02:20:32.917453+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": 50468
} | 2026-08-10T02:20:32.917453+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": 59392
} | 2026-08-10T02:20:32.917453+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": 875
} | 2026-08-10T02:20:32.917453+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": 948
} | 2026-08-10T02:20:32.917453+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": 17908
} | 2026-08-10T02:20:32.917453+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": 23552
} | 2026-08-10T02:20:32.917453+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": 33652
} | 2026-08-10T02:20:32.917453+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": 30765
} | 2026-08-10T02:20:32.917453+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": 92
} | 2026-08-10T02:20:32.917453+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": 762
} | 2026-08-10T02:20:32.917453+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": 720
} | 2026-08-10T02:20:32.917453+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": 1066
} | 2026-08-10T02:20:32.917453+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": 9487
} | 2026-08-10T02:20:32.917453+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": 14263
} | 2026-08-10T02:20:32.917453+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": 13906
} | 2026-08-10T02:20:32.917453+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": 27034
} | 2026-08-10T02:20:32.917453+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": 1078
} | 2026-08-10T02:20:32.917453+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": 5341
} | 2026-08-10T02:20:32.917453+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": 14494
} | 2026-08-10T02:20:32.917453+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": 26742
} | 2026-08-10T02:20:32.917453+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": 24855
} | 2026-08-10T02:20:32.917453+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": 441
} | 2026-08-10T02:20:32.917453+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": 359
} | 2026-08-10T02:20:32.917453+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": 1418
} | 2026-08-10T02:20:32.917453+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": 2203
} | 2026-08-10T02:20:32.917453+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": 4658
} | 2026-08-10T02:20:32.917453+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": 12922
} | 2026-08-10T02:20:32.917453+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": 19021
} | 2026-08-10T02:20:32.917453+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": 27279
} | 2026-08-10T02:20:32.917453+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": 21379
} | 2026-08-10T02:20:32.917453+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": 714
} | 2026-08-10T02:20:32.917453+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": 5083
} | 2026-08-10T02:20:32.917453+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": 18845
} | 2026-08-10T02:20:32.917453+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": 36890
} | 2026-08-10T02:20:32.917453+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": 25477
} | 2026-08-10T02:20:32.917453+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": 1488
} | 2026-08-10T02:20:32.917453+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": 1768
} | 2026-08-10T02:20:32.917453+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": 6774
} | 2026-08-10T02:20:32.917453+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": 16928
} | 2026-08-10T02:20:32.917453+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": 21076
} | 2026-08-10T02:20:32.917453+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": 20084
} | 2026-08-10T02:20:32.917453+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": 9644
} | 2026-08-10T02:20:32.917453+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": 6889
} | 2026-08-10T02:20:32.917453+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": 11488
} | 2026-08-10T02:20:32.917453+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": 24940
} | 2026-08-10T02:20:32.917453+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": 22029
} | 2026-08-10T02:20:32.917453+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": 26717
} | 2026-08-10T02:20:32.917453+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": 82687
} | 2026-08-10T02:20:32.917453+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": 989
} | 2026-08-10T02:20:32.917453+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": 603
} | 2026-08-10T02:20:32.917453+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": 2946
} | 2026-08-10T02:20:32.917453+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": 12565
} | 2026-08-10T02:20:32.917453+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": 34629
} | 2026-08-10T02:20:32.917453+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": 24947
} | 2026-08-10T02:20:32.917453+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": 28983
} | 2026-08-10T02:20:32.917453+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": 6068
} | 2026-08-10T02:20:32.917453+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": 565
} | 2026-08-10T02:20:32.917453+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": 599
} | 2026-08-10T02:20:32.917453+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": 140
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1510-G | codeforces | 1510-G | Guide | https://codeforces.com/problemset/problem/1510/G | [] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1390
} | 2026-08-10T02:20:32.917453+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-08-10T02:20:32.917453+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-08-10T02:20:32.917453+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": 2139
} | 2026-08-10T02:20:32.917453+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": 247
} | 2026-08-10T02:20:32.917453+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": 982
} | 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.