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:604-A | codeforces | 604-A | Uncowed Forces | https://codeforces.com/problemset/problem/604/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 9468
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:603-E | codeforces | 603-E | Pastoral Oddities | https://codeforces.com/problemset/problem/603/E | [
"data structures",
"divide and conquer",
"dsu",
"math",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1605
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:603-D | codeforces | 603-D | Ruminations on Ruminants | https://codeforces.com/problemset/problem/603/D | [
"geometry",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 499
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:603-C | codeforces | 603-C | Lieges of Legendre | https://codeforces.com/problemset/problem/603/C | [
"games",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2121
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:603-B | codeforces | 603-B | Moodular Arithmetic | https://codeforces.com/problemset/problem/603/B | [
"combinatorics",
"dfs and similar",
"dsu",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2747
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:603-A | codeforces | 603-A | Alternative Thinking | https://codeforces.com/problemset/problem/603/A | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8313
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:602-B | codeforces | 602-B | Approximating a Constant Range | https://codeforces.com/problemset/problem/602/B | [
"dp",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12401
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:602-A | codeforces | 602-A | Two Bases | https://codeforces.com/problemset/problem/602/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 8825
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:601-E | codeforces | 601-E | A Museum Robbery | https://codeforces.com/problemset/problem/601/E | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1273
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:601-D | codeforces | 601-D | Acyclic Organic Compounds | https://codeforces.com/problemset/problem/601/D | [
"data structures",
"dfs and similar",
"dsu",
"hashing",
"strings",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1281
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:601-C | codeforces | 601-C | Kleofáš and the n-thlon | https://codeforces.com/problemset/problem/601/C | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1471
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:601-B | codeforces | 601-B | Lipshitz Sequence | https://codeforces.com/problemset/problem/601/B | [
"data structures",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2468
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:601-A | codeforces | 601-A | The Two Routes | https://codeforces.com/problemset/problem/601/A | [
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14254
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:600-F | codeforces | 600-F | Edge coloring of bipartite graph | https://codeforces.com/problemset/problem/600/F | [
"graphs"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1236
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:600-E | codeforces | 600-E | Lomsat gelral | https://codeforces.com/problemset/problem/600/E | [
"data structures",
"dfs and similar",
"dsu",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 19473
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:600-D | codeforces | 600-D | Area of Two Circles' Intersection | https://codeforces.com/problemset/problem/600/D | [
"geometry"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2788
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:600-C | codeforces | 600-C | Make Palindrome | https://codeforces.com/problemset/problem/600/C | [
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7222
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:600-B | codeforces | 600-B | Queries about less or equal elements | https://codeforces.com/problemset/problem/600/B | [
"binary search",
"data structures",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 41217
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:600-A | codeforces | 600-A | Extract Numbers | https://codeforces.com/problemset/problem/600/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5876
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:599-E | codeforces | 599-E | Sandy and Nuts | https://codeforces.com/problemset/problem/599/E | [
"bitmasks",
"dp",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 821
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:599-D | codeforces | 599-D | Spongebob and Squares | https://codeforces.com/problemset/problem/599/D | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2741
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:599-C | codeforces | 599-C | Day at the Beach | https://codeforces.com/problemset/problem/599/C | [
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5151
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:599-B | codeforces | 599-B | Spongebob and Joke | https://codeforces.com/problemset/problem/599/B | [
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4598
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:599-A | codeforces | 599-A | Patrick and Shopping | https://codeforces.com/problemset/problem/599/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31802
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:598-F | codeforces | 598-F | Cut Length | https://codeforces.com/problemset/problem/598/F | [
"geometry"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 511
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:598-E | codeforces | 598-E | Chocolate Bar | https://codeforces.com/problemset/problem/598/E | [
"brute force",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6292
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:598-D | codeforces | 598-D | Igor In the Museum | https://codeforces.com/problemset/problem/598/D | [
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 13833
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:598-C | codeforces | 598-C | Nearest vectors | https://codeforces.com/problemset/problem/598/C | [
"geometry",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 5607
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:598-B | codeforces | 598-B | Queries on a String | https://codeforces.com/problemset/problem/598/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12400
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:598-A | codeforces | 598-A | Tricky Sum | https://codeforces.com/problemset/problem/598/A | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 33177
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:597-C | codeforces | 597-C | Subsequences | https://codeforces.com/problemset/problem/597/C | [
"data structures",
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7013
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:597-B | codeforces | 597-B | Restaurant | https://codeforces.com/problemset/problem/597/B | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5787
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:597-A | codeforces | 597-A | Divisibility | https://codeforces.com/problemset/problem/597/A | [
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4982
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:596-E | codeforces | 596-E | Wilbur and Strings | https://codeforces.com/problemset/problem/596/E | [
"dfs and similar",
"dp",
"graphs",
"strings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 458
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:596-D | codeforces | 596-D | Wilbur and Trees | https://codeforces.com/problemset/problem/596/D | [
"dp",
"math",
"probabilities",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 772
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:596-C | codeforces | 596-C | Wilbur and Points | https://codeforces.com/problemset/problem/596/C | [
"combinatorics",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2338
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:596-B | codeforces | 596-B | Wilbur and Array | https://codeforces.com/problemset/problem/596/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10966
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:596-A | codeforces | 596-A | Wilbur and Swimming Pool | https://codeforces.com/problemset/problem/596/A | [
"geometry",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 8133
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:595-B | codeforces | 595-B | Pasha and Phone | https://codeforces.com/problemset/problem/595/B | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 3128
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:595-A | codeforces | 595-A | Vitaly and Night | https://codeforces.com/problemset/problem/595/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15590
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:594-E | codeforces | 594-E | Cutting the Line | https://codeforces.com/problemset/problem/594/E | [
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 176
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:594-D | codeforces | 594-D | REQ | https://codeforces.com/problemset/problem/594/D | [
"data structures",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2134
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:594-C | codeforces | 594-C | Edo and Magnets | https://codeforces.com/problemset/problem/594/C | [
"brute force",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 785
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:594-B | codeforces | 594-B | Max and Bike | https://codeforces.com/problemset/problem/594/B | [
"binary search",
"geometry"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 605
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:594-A | codeforces | 594-A | Warrior and Archer | https://codeforces.com/problemset/problem/594/A | [
"games"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1908
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:593-E | codeforces | 593-E | Strange Calculation and Cats | https://codeforces.com/problemset/problem/593/E | [
"dp",
"matrices"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 727
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:593-D | codeforces | 593-D | Happy Tree Party | https://codeforces.com/problemset/problem/593/D | [
"data structures",
"dfs and similar",
"graphs",
"math",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1474
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:593-C | codeforces | 593-C | Beautiful Function | https://codeforces.com/problemset/problem/593/C | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 340
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:593-B | codeforces | 593-B | Anton and Lines | https://codeforces.com/problemset/problem/593/B | [
"geometry",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4223
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:593-A | codeforces | 593-A | 2Char | https://codeforces.com/problemset/problem/593/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 6208
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:592-E | codeforces | 592-E | BCPC | https://codeforces.com/problemset/problem/592/E | [
"binary search",
"geometry",
"two pointers"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 286
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:592-D | codeforces | 592-D | Super M | https://codeforces.com/problemset/problem/592/D | [
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3027
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:592-C | codeforces | 592-C | The Big Race | https://codeforces.com/problemset/problem/592/C | [
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3205
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:592-B | codeforces | 592-B | The Monster and the Squirrel | https://codeforces.com/problemset/problem/592/B | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 8874
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:592-A | codeforces | 592-A | PawnChess | https://codeforces.com/problemset/problem/592/A | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 6568
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:591-B | codeforces | 591-B | Rebranding | https://codeforces.com/problemset/problem/591/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8697
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:591-A | codeforces | 591-A | Wizards' Duel | https://codeforces.com/problemset/problem/591/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 17461
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:590-E | codeforces | 590-E | Birthday | https://codeforces.com/problemset/problem/590/E | [
"graph matchings",
"strings"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 950
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:590-D | codeforces | 590-D | Top Secret Task | https://codeforces.com/problemset/problem/590/D | [
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1430
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:590-C | codeforces | 590-C | Three States | https://codeforces.com/problemset/problem/590/C | [
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3711
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:590-B | codeforces | 590-B | Chip 'n Dale Rescue Rangers | https://codeforces.com/problemset/problem/590/B | [
"binary search",
"geometry",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2070
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:590-A | codeforces | 590-A | Median Smoothing | https://codeforces.com/problemset/problem/590/A | [
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4398
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:588-B | codeforces | 588-B | Duff in Love | https://codeforces.com/problemset/problem/588/B | [
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15129
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:588-A | codeforces | 588-A | Duff and Meat | https://codeforces.com/problemset/problem/588/A | [
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 24666
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:587-F | codeforces | 587-F | Duff is Mad | https://codeforces.com/problemset/problem/587/F | [
"data structures",
"strings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1545
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:587-E | codeforces | 587-E | Duff as a Queen | https://codeforces.com/problemset/problem/587/E | [
"data structures"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1066
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:587-D | codeforces | 587-D | Duff in Mafia | https://codeforces.com/problemset/problem/587/D | [
"2-sat",
"binary search"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 1022
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:587-C | codeforces | 587-C | Duff in the Army | https://codeforces.com/problemset/problem/587/C | [
"data structures",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 5008
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:587-B | codeforces | 587-B | Duff in Beach | https://codeforces.com/problemset/problem/587/B | [
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1523
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:587-A | codeforces | 587-A | Duff and Weight Lifting | https://codeforces.com/problemset/problem/587/A | [
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8445
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:586-B | codeforces | 586-B | Laurenty and Shop | https://codeforces.com/problemset/problem/586/B | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 5257
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:586-A | codeforces | 586-A | Alena's Schedule | https://codeforces.com/problemset/problem/586/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 10652
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:585-F | codeforces | 585-F | Digits of Number Pi | https://codeforces.com/problemset/problem/585/F | [
"dp",
"implementation",
"strings"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 950
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:585-E | codeforces | 585-E | Present for Vitalik the Philatelist | https://codeforces.com/problemset/problem/585/E | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1294
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:585-D | codeforces | 585-D | Lizard Era: Beginning | https://codeforces.com/problemset/problem/585/D | [
"meet-in-the-middle"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2146
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:585-C | codeforces | 585-C | Alice, Bob, Oranges and Apples | https://codeforces.com/problemset/problem/585/C | [
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1089
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:585-B | codeforces | 585-B | Phillip and Trains | https://codeforces.com/problemset/problem/585/B | [
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3838
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:585-A | codeforces | 585-A | Gennady the Dentist | https://codeforces.com/problemset/problem/585/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4483
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:584-E | codeforces | 584-E | Anton and Ira | https://codeforces.com/problemset/problem/584/E | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1535
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:584-D | codeforces | 584-D | Dima and Lisa | https://codeforces.com/problemset/problem/584/D | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 11396
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:584-C | codeforces | 584-C | Marina and Vasya | https://codeforces.com/problemset/problem/584/C | [
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6571
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:584-B | codeforces | 584-B | Kolya and Tanya | https://codeforces.com/problemset/problem/584/B | [
"combinatorics"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14001
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:584-A | codeforces | 584-A | Olesya and Rodion | https://codeforces.com/problemset/problem/584/A | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 53810
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:583-B | codeforces | 583-B | Robot's Task | https://codeforces.com/problemset/problem/583/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9017
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:583-A | codeforces | 583-A | Asphalting Roads | https://codeforces.com/problemset/problem/583/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 11816
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:582-E | codeforces | 582-E | Boolean Function | https://codeforces.com/problemset/problem/582/E | [
"bitmasks",
"dp",
"expression parsing"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 727
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:582-D | codeforces | 582-D | Number of Binominal Coefficients | https://codeforces.com/problemset/problem/582/D | [
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 844
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:582-C | codeforces | 582-C | Superior Periodic Subarrays | https://codeforces.com/problemset/problem/582/C | [
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 821
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:582-B | codeforces | 582-B | Once Again... | https://codeforces.com/problemset/problem/582/B | [
"constructive algorithms",
"dp",
"matrices"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3698
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:582-A | codeforces | 582-A | GCD Table | https://codeforces.com/problemset/problem/582/A | [
"constructive algorithms",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8410
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:581-F | codeforces | 581-F | Zublicanes and Mumocrates | https://codeforces.com/problemset/problem/581/F | [
"dp",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1081
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:581-E | codeforces | 581-E | Kojiro and Furrari | https://codeforces.com/problemset/problem/581/E | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 263
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:581-D | codeforces | 581-D | Three Logos | https://codeforces.com/problemset/problem/581/D | [
"bitmasks",
"brute force",
"constructive algorithms",
"geometry",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4975
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:581-C | codeforces | 581-C | Developing Skills | https://codeforces.com/problemset/problem/581/C | [
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7662
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:581-B | codeforces | 581-B | Luxurious Houses | https://codeforces.com/problemset/problem/581/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 13746
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:581-A | codeforces | 581-A | Vasya the Hipster | https://codeforces.com/problemset/problem/581/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 86913
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:580-E | codeforces | 580-E | Kefa and Watch | https://codeforces.com/problemset/problem/580/E | [
"data structures",
"hashing",
"strings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2716
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:580-D | codeforces | 580-D | Kefa and Dishes | https://codeforces.com/problemset/problem/580/D | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 12551
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:580-C | codeforces | 580-C | Kefa and Park | https://codeforces.com/problemset/problem/580/C | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 58824
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:580-B | codeforces | 580-B | Kefa and Company | https://codeforces.com/problemset/problem/580/B | [
"binary search",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 33255
} | 2026-08-17T01:43:56.191071+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.