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:597-C | codeforces | 597-C | Subsequences | https://codeforces.com/problemset/problem/597/C | [
"data structures",
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7442
} | 2026-11-16T05:57:40.774385+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": 5985
} | 2026-11-16T05:57:40.774385+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": 5040
} | 2026-11-16T05:57:40.774385+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": 465
} | 2026-11-16T05:57:40.774385+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": 779
} | 2026-11-16T05:57:40.774385+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": 2357
} | 2026-11-16T05:57:40.774385+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": 11009
} | 2026-11-16T05:57:40.774385+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": 8162
} | 2026-11-16T05:57:40.774385+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": 3154
} | 2026-11-16T05:57:40.774385+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": 15688
} | 2026-11-16T05:57:40.774385+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": 179
} | 2026-11-16T05:57:40.774385+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": 2197
} | 2026-11-16T05:57:40.774385+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": 788
} | 2026-11-16T05:57:40.774385+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": 607
} | 2026-11-16T05:57:40.774385+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": 1919
} | 2026-11-16T05:57:40.774385+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": 731
} | 2026-11-16T05:57:40.774385+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": 1498
} | 2026-11-16T05:57:40.774385+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": 343
} | 2026-11-16T05:57:40.774385+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": 4248
} | 2026-11-16T05:57:40.774385+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": 6233
} | 2026-11-16T05:57:40.774385+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": 290
} | 2026-11-16T05:57:40.774385+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": 3113
} | 2026-11-16T05:57:40.774385+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": 3213
} | 2026-11-16T05:57:40.774385+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": 8910
} | 2026-11-16T05:57:40.774385+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": 6587
} | 2026-11-16T05:57:40.774385+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": 8742
} | 2026-11-16T05:57:40.774385+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": 17978
} | 2026-11-16T05:57:40.774385+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": 973
} | 2026-11-16T05:57:40.774385+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": 1463
} | 2026-11-16T05:57:40.774385+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": 3823
} | 2026-11-16T05:57:40.774385+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": 2084
} | 2026-11-16T05:57:40.774385+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": 4416
} | 2026-11-16T05:57:40.774385+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": 15240
} | 2026-11-16T05:57:40.774385+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": 24800
} | 2026-11-16T05:57:40.774385+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": 1618
} | 2026-11-16T05:57:40.774385+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": 1080
} | 2026-11-16T05:57:40.774385+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": 1047
} | 2026-11-16T05:57:40.774385+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": 5150
} | 2026-11-16T05:57:40.774385+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": 1527
} | 2026-11-16T05:57:40.774385+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": 8536
} | 2026-11-16T05:57:40.774385+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": 5275
} | 2026-11-16T05:57:40.774385+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": 10696
} | 2026-11-16T05:57:40.774385+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": 968
} | 2026-11-16T05:57:40.774385+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": 1309
} | 2026-11-16T05:57:40.774385+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": 2223
} | 2026-11-16T05:57:40.774385+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": 1098
} | 2026-11-16T05:57:40.774385+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": 3861
} | 2026-11-16T05:57:40.774385+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": 4493
} | 2026-11-16T05:57:40.774385+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": 1550
} | 2026-11-16T05:57:40.774385+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": 11572
} | 2026-11-16T05:57:40.774385+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": 6594
} | 2026-11-16T05:57:40.774385+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": 14263
} | 2026-11-16T05:57:40.774385+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": 54852
} | 2026-11-16T05:57:40.774385+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": 9040
} | 2026-11-16T05:57:40.774385+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": 11844
} | 2026-11-16T05:57:40.774385+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": 739
} | 2026-11-16T05:57:40.774385+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": 863
} | 2026-11-16T05:57:40.774385+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": 829
} | 2026-11-16T05:57:40.774385+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": 3732
} | 2026-11-16T05:57:40.774385+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": 8482
} | 2026-11-16T05:57:40.774385+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": 1105
} | 2026-11-16T05:57:40.774385+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": 267
} | 2026-11-16T05:57:40.774385+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": 5174
} | 2026-11-16T05:57:40.774385+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": 7701
} | 2026-11-16T05:57:40.774385+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": 13830
} | 2026-11-16T05:57:40.774385+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": 88977
} | 2026-11-16T05:57:40.774385+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": 2833
} | 2026-11-16T05:57:40.774385+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": 13199
} | 2026-11-16T05:57:40.774385+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": 61101
} | 2026-11-16T05:57:40.774385+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": 34307
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:580-A | codeforces | 580-A | Kefa and First Steps | https://codeforces.com/problemset/problem/580/A | [
"brute force",
"dp",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 113234
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:579-B | codeforces | 579-B | Finding Team Member | https://codeforces.com/problemset/problem/579/B | [
"brute force",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 5550
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:579-A | codeforces | 579-A | Raising Bacteria | https://codeforces.com/problemset/problem/579/A | [
"bitmasks"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 85063
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:578-F | codeforces | 578-F | Mirror Box | https://codeforces.com/problemset/problem/578/F | [
"matrices",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 671
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:578-E | codeforces | 578-E | Walking! | https://codeforces.com/problemset/problem/578/E | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 703
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:578-D | codeforces | 578-D | LCS Again | https://codeforces.com/problemset/problem/578/D | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1033
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:578-C | codeforces | 578-C | Weakness and Poorness | https://codeforces.com/problemset/problem/578/C | [
"ternary search"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5493
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:578-B | codeforces | 578-B | "Or" Game | https://codeforces.com/problemset/problem/578/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5564
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:578-A | codeforces | 578-A | A Problem about Polyline | https://codeforces.com/problemset/problem/578/A | [
"geometry",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5006
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:577-B | codeforces | 577-B | Modulo Sum | https://codeforces.com/problemset/problem/577/B | [
"combinatorics",
"data structures",
"dp",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 16282
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:577-A | codeforces | 577-A | Multiplication Table | https://codeforces.com/problemset/problem/577/A | [
"implementation",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 46843
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:576-E | codeforces | 576-E | Painting Edges | https://codeforces.com/problemset/problem/576/E | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 1643
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:576-D | codeforces | 576-D | Flights for Regular Customers | https://codeforces.com/problemset/problem/576/D | [
"dp",
"matrices"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1713
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:576-C | codeforces | 576-C | Points on Plane | https://codeforces.com/problemset/problem/576/C | [
"constructive algorithms",
"divide and conquer",
"geometry",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4536
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:576-B | codeforces | 576-B | Invariance of Tree | https://codeforces.com/problemset/problem/576/B | [
"constructive algorithms",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1962
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:576-A | codeforces | 576-A | Vasya and Petya's Game | https://codeforces.com/problemset/problem/576/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 16308
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:575-I | codeforces | 575-I | Robots protection | https://codeforces.com/problemset/problem/575/I | [
"data structures"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 615
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:575-H | codeforces | 575-H | Bots | https://codeforces.com/problemset/problem/575/H | [
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1929
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:575-G | codeforces | 575-G | Run for beer | https://codeforces.com/problemset/problem/575/G | [
"dfs and similar",
"shortest paths"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1059
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:575-F | codeforces | 575-F | Bulbo | https://codeforces.com/problemset/problem/575/F | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1143
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:575-E | codeforces | 575-E | Spectator Riots | https://codeforces.com/problemset/problem/575/E | [
"geometry"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 319
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:575-D | codeforces | 575-D | Tablecity | https://codeforces.com/problemset/problem/575/D | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2017
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:575-C | codeforces | 575-C | Party | https://codeforces.com/problemset/problem/575/C | [
"bitmasks",
"brute force",
"graph matchings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 246
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:575-B | codeforces | 575-B | Bribes | https://codeforces.com/problemset/problem/575/B | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1315
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:575-A | codeforces | 575-A | Fibonotci | https://codeforces.com/problemset/problem/575/A | [
"data structures",
"math",
"matrices"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 899
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:574-B | codeforces | 574-B | Bear and Three Musketeers | https://codeforces.com/problemset/problem/574/B | [
"brute force",
"dfs and similar",
"graphs",
"hashing"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8507
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:574-A | codeforces | 574-A | Bear and Elections | https://codeforces.com/problemset/problem/574/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9655
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:573-E | codeforces | 573-E | Bear and Bowling | https://codeforces.com/problemset/problem/573/E | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 2182
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:573-D | codeforces | 573-D | Bear and Cavalry | https://codeforces.com/problemset/problem/573/D | [
"data structures",
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 904
} | 2026-11-16T05:57:40.774385+00:00 |
codeforces:573-C | codeforces | 573-C | Bear and Drawing | https://codeforces.com/problemset/problem/573/C | [
"constructive algorithms",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1061
} | 2026-11-16T05:57:40.774385+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.