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: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": 108555
} | 2026-08-10T02:20:32.917453+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": 5518
} | 2026-08-10T02:20:32.917453+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": 81739
} | 2026-08-10T02:20:32.917453+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": 663
} | 2026-08-10T02:20:32.917453+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": 686
} | 2026-08-10T02:20:32.917453+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": 997
} | 2026-08-10T02:20:32.917453+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": 5333
} | 2026-08-10T02:20:32.917453+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": 5526
} | 2026-08-10T02:20:32.917453+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": 4978
} | 2026-08-10T02:20:32.917453+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": 15723
} | 2026-08-10T02:20:32.917453+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": 46259
} | 2026-08-10T02:20:32.917453+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": 1600
} | 2026-08-10T02:20:32.917453+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": 1679
} | 2026-08-10T02:20:32.917453+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": 4358
} | 2026-08-10T02:20:32.917453+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": 1947
} | 2026-08-10T02:20:32.917453+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": 16143
} | 2026-08-10T02:20:32.917453+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": 599
} | 2026-08-10T02:20:32.917453+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": 1897
} | 2026-08-10T02:20:32.917453+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": 1039
} | 2026-08-10T02:20:32.917453+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": 1133
} | 2026-08-10T02:20:32.917453+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": 315
} | 2026-08-10T02:20:32.917453+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": 2002
} | 2026-08-10T02:20:32.917453+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": 245
} | 2026-08-10T02:20:32.917453+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": 1296
} | 2026-08-10T02:20:32.917453+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": 895
} | 2026-08-10T02:20:32.917453+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": 8410
} | 2026-08-10T02:20:32.917453+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": 9616
} | 2026-08-10T02:20:32.917453+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": 2146
} | 2026-08-10T02:20:32.917453+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": 889
} | 2026-08-10T02:20:32.917453+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": 1056
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:573-B | codeforces | 573-B | Bear and Blocks | https://codeforces.com/problemset/problem/573/B | [
"binary search",
"data structures",
"dp",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6424
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:573-A | codeforces | 573-A | Bear and Poker | https://codeforces.com/problemset/problem/573/A | [
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18852
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:572-B | codeforces | 572-B | Order Book | https://codeforces.com/problemset/problem/572/B | [
"data structures",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9104
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:572-A | codeforces | 572-A | Arrays | https://codeforces.com/problemset/problem/572/A | [
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18656
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:571-E | codeforces | 571-E | Geometric Progressions | https://codeforces.com/problemset/problem/571/E | [
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 405
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:571-D | codeforces | 571-D | Campus | https://codeforces.com/problemset/problem/571/D | [
"binary search",
"data structures",
"dsu",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 1237
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:571-C | codeforces | 571-C | CNF 2 | https://codeforces.com/problemset/problem/571/C | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 759
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:571-B | codeforces | 571-B | Minimization | https://codeforces.com/problemset/problem/571/B | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2892
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:571-A | codeforces | 571-A | Lengthening Sticks | https://codeforces.com/problemset/problem/571/A | [
"combinatorics",
"implementation",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2737
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:570-E | codeforces | 570-E | Pig and Palindromes | https://codeforces.com/problemset/problem/570/E | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2161
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:570-D | codeforces | 570-D | Tree Requests | https://codeforces.com/problemset/problem/570/D | [
"binary search",
"bitmasks",
"constructive algorithms",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 9398
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:570-C | codeforces | 570-C | Replacement | https://codeforces.com/problemset/problem/570/C | [
"constructive algorithms",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9610
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:570-B | codeforces | 570-B | Simple Game | https://codeforces.com/problemset/problem/570/B | [
"constructive algorithms",
"games",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16978
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:570-A | codeforces | 570-A | Elections | https://codeforces.com/problemset/problem/570/A | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 14395
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:569-B | codeforces | 569-B | Inventory | https://codeforces.com/problemset/problem/569/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 7555
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:569-A | codeforces | 569-A | Music | https://codeforces.com/problemset/problem/569/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5085
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:568-E | codeforces | 568-E | Longest Increasing Subsequence | https://codeforces.com/problemset/problem/568/E | [
"data structures",
"dp"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 688
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:568-D | codeforces | 568-D | Sign Posts | https://codeforces.com/problemset/problem/568/D | [
"brute force",
"geometry",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 351
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:568-C | codeforces | 568-C | New Language | https://codeforces.com/problemset/problem/568/C | [
"2-sat",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 972
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:568-B | codeforces | 568-B | Symmetric and Transitive | https://codeforces.com/problemset/problem/568/B | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2401
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:568-A | codeforces | 568-A | Primes or Palindromes? | https://codeforces.com/problemset/problem/568/A | [
"brute force",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5430
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:567-F | codeforces | 567-F | Mausoleum | https://codeforces.com/problemset/problem/567/F | [
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 663
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:567-E | codeforces | 567-E | President and Roads | https://codeforces.com/problemset/problem/567/E | [
"dfs and similar",
"graphs",
"hashing",
"shortest paths"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2363
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:567-D | codeforces | 567-D | One-Dimensional Battle Ships | https://codeforces.com/problemset/problem/567/D | [
"binary search",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5319
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:567-C | codeforces | 567-C | Geometric Progression | https://codeforces.com/problemset/problem/567/C | [
"binary search",
"data structures",
"dp"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10591
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:567-B | codeforces | 567-B | Berland National Library | https://codeforces.com/problemset/problem/567/B | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 8905
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:567-A | codeforces | 567-A | Lineland Mail | https://codeforces.com/problemset/problem/567/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 36418
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:566-G | codeforces | 566-G | Max and Min | https://codeforces.com/problemset/problem/566/G | [
"geometry"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 428
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:566-F | codeforces | 566-F | Clique in the Divisibility Graph | https://codeforces.com/problemset/problem/566/F | [
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4362
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:566-E | codeforces | 566-E | Restoring Map | https://codeforces.com/problemset/problem/566/E | [
"bitmasks",
"constructive algorithms",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 723
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:566-D | codeforces | 566-D | Restructuring Company | https://codeforces.com/problemset/problem/566/D | [
"data structures",
"dsu"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4106
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:566-C | codeforces | 566-C | Logistical Questions | https://codeforces.com/problemset/problem/566/C | [
"dfs and similar",
"divide and conquer",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 990
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:566-B | codeforces | 566-B | Replicating Processes | https://codeforces.com/problemset/problem/566/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 412
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:566-A | codeforces | 566-A | Matching Names | https://codeforces.com/problemset/problem/566/A | [
"dfs and similar",
"strings",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1095
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:560-B | codeforces | 560-B | Gerald is into Art | https://codeforces.com/problemset/problem/560/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8299
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:560-A | codeforces | 560-A | Currency System in Geraldion | https://codeforces.com/problemset/problem/560/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 20069
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:559-E | codeforces | 559-E | Gerald and Path | https://codeforces.com/problemset/problem/559/E | [
"dp",
"sortings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1353
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:559-D | codeforces | 559-D | Randomizer | https://codeforces.com/problemset/problem/559/D | [
"combinatorics",
"geometry",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 505
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:559-C | codeforces | 559-C | Gerald and Giant Chess | https://codeforces.com/problemset/problem/559/C | [
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 8412
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:559-B | codeforces | 559-B | Equivalent Strings | https://codeforces.com/problemset/problem/559/B | [
"divide and conquer",
"hashing",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11843
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:559-A | codeforces | 559-A | Gerald's Hexagon | https://codeforces.com/problemset/problem/559/A | [
"brute force",
"geometry",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11113
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:558-E | codeforces | 558-E | A Simple Task | https://codeforces.com/problemset/problem/558/E | [
"data structures",
"sortings",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 7724
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:558-D | codeforces | 558-D | Guess Your Way Out! II | https://codeforces.com/problemset/problem/558/D | [
"data structures",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1236
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:558-C | codeforces | 558-C | Amr and Chemistry | https://codeforces.com/problemset/problem/558/C | [
"brute force",
"graphs",
"greedy",
"math",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4235
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:558-B | codeforces | 558-B | Amr and The Large Array | https://codeforces.com/problemset/problem/558/B | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 8398
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:558-A | codeforces | 558-A | Lala Land and Apple Trees | https://codeforces.com/problemset/problem/558/A | [
"brute force",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 11078
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:557-E | codeforces | 557-E | Ann and Half-Palindrome | https://codeforces.com/problemset/problem/557/E | [
"data structures",
"dp",
"graphs",
"string suffix structures",
"strings",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1255
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:557-D | codeforces | 557-D | Vitaly and Cycle | https://codeforces.com/problemset/problem/557/D | [
"combinatorics",
"dfs and similar",
"graphs",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2440
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:557-C | codeforces | 557-C | Arthur and Table | https://codeforces.com/problemset/problem/557/C | [
"brute force",
"data structures",
"dp",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4256
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:557-B | codeforces | 557-B | Pasha and Tea | https://codeforces.com/problemset/problem/557/B | [
"constructive algorithms",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7524
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:557-A | codeforces | 557-A | Ilya and Diplomas | https://codeforces.com/problemset/problem/557/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 8541
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:556-B | codeforces | 556-B | Case of Fake Numbers | https://codeforces.com/problemset/problem/556/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 8275
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:556-A | codeforces | 556-A | Case of the Zeros and Ones | https://codeforces.com/problemset/problem/556/A | [
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 47463
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:555-E | codeforces | 555-E | Case of Computer Network | https://codeforces.com/problemset/problem/555/E | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 3151
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:555-D | codeforces | 555-D | Case of a Top Secret | https://codeforces.com/problemset/problem/555/D | [
"binary search",
"implementation",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 961
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:555-C | codeforces | 555-C | Case of Chocolate | https://codeforces.com/problemset/problem/555/C | [
"data structures"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2104
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:555-B | codeforces | 555-B | Case of Fugitive | https://codeforces.com/problemset/problem/555/B | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4153
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:555-A | codeforces | 555-A | Case of Matryoshkas | https://codeforces.com/problemset/problem/555/A | [
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6713
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:554-B | codeforces | 554-B | Ohana Cleans Up | https://codeforces.com/problemset/problem/554/B | [
"brute force",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 11095
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:554-A | codeforces | 554-A | Kyoya and Photobooks | https://codeforces.com/problemset/problem/554/A | [
"brute force",
"math",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 14665
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:553-E | codeforces | 553-E | Kyoya and Train | https://codeforces.com/problemset/problem/553/E | [
"dp",
"fft",
"graphs",
"math",
"probabilities"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 735
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:553-D | codeforces | 553-D | Nudist Beach | https://codeforces.com/problemset/problem/553/D | [
"binary search",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1116
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:553-C | codeforces | 553-C | Love Triangles | https://codeforces.com/problemset/problem/553/C | [
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1992
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:553-B | codeforces | 553-B | Kyoya and Permutation | https://codeforces.com/problemset/problem/553/B | [
"binary search",
"combinatorics",
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2295
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:553-A | codeforces | 553-A | Kyoya and Colored Balls | https://codeforces.com/problemset/problem/553/A | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10129
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:552-E | codeforces | 552-E | Vanya and Brackets | https://codeforces.com/problemset/problem/552/E | [
"brute force",
"dp",
"expression parsing",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1769
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:552-D | codeforces | 552-D | Vanya and Triangles | https://codeforces.com/problemset/problem/552/D | [
"brute force",
"combinatorics",
"data structures",
"geometry",
"math",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4886
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:552-C | codeforces | 552-C | Vanya and Scales | https://codeforces.com/problemset/problem/552/C | [
"brute force",
"dp",
"greedy",
"math",
"meet-in-the-middle",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5898
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:552-B | codeforces | 552-B | Vanya and Books | https://codeforces.com/problemset/problem/552/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 16154
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:552-A | codeforces | 552-A | Vanya and Table | https://codeforces.com/problemset/problem/552/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 10274
} | 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.