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:476-A | codeforces | 476-A | Dreamoon and Stairs | https://codeforces.com/problemset/problem/476/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 52784
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:475-F | codeforces | 475-F | Meta-universe | https://codeforces.com/problemset/problem/475/F | [
"data structures"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 284
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:475-E | codeforces | 475-E | Strongly Connected City 2 | https://codeforces.com/problemset/problem/475/E | [
"dfs and similar"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 718
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:475-D | codeforces | 475-D | CGCDSSQ | https://codeforces.com/problemset/problem/475/D | [
"brute force",
"data structures",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6936
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:475-C | codeforces | 475-C | Kamal-ol-molk's Painting | https://codeforces.com/problemset/problem/475/C | [
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 859
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:475-B | codeforces | 475-B | Strongly Connected City | https://codeforces.com/problemset/problem/475/B | [
"brute force",
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9389
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:475-A | codeforces | 475-A | Bayan Bus | https://codeforces.com/problemset/problem/475/A | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 4983
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:474-F | codeforces | 474-F | Ant colony | https://codeforces.com/problemset/problem/474/F | [
"data structures",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 12348
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:474-E | codeforces | 474-E | Pillars | https://codeforces.com/problemset/problem/474/E | [
"binary search",
"data structures",
"dp",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4403
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:474-D | codeforces | 474-D | Flowers | https://codeforces.com/problemset/problem/474/D | [
"dp"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 31978
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:474-C | codeforces | 474-C | Captain Marmot | https://codeforces.com/problemset/problem/474/C | [
"brute force",
"geometry"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3432
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:474-B | codeforces | 474-B | Worms | https://codeforces.com/problemset/problem/474/B | [
"binary search",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 65982
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:474-A | codeforces | 474-A | Keyboard | https://codeforces.com/problemset/problem/474/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 57020
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:472-G | codeforces | 472-G | Design Tutorial: Increase the Constraints | https://codeforces.com/problemset/problem/472/G | [
"bitmasks",
"data structures",
"fft"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 508
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:472-F | codeforces | 472-F | Design Tutorial: Change the Goal | https://codeforces.com/problemset/problem/472/F | [
"constructive algorithms",
"math",
"matrices"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 318
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:472-E | codeforces | 472-E | Design Tutorial: Learn from a Game | https://codeforces.com/problemset/problem/472/E | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 153
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:472-D | codeforces | 472-D | Design Tutorial: Inverse the Problem | https://codeforces.com/problemset/problem/472/D | [
"dfs and similar",
"dsu",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6752
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:472-C | codeforces | 472-C | Design Tutorial: Make It Nondeterministic | https://codeforces.com/problemset/problem/472/C | [
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 6543
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:472-B | codeforces | 472-B | Design Tutorial: Learn from Life | https://codeforces.com/problemset/problem/472/B | [] | null | null | stdin_stdout | 1,300 | {
"solved_count": 7673
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:472-A | codeforces | 472-A | Design Tutorial: Learn from Math | https://codeforces.com/problemset/problem/472/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 72165
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:471-E | codeforces | 471-E | MUH and Lots and Lots of Segments | https://codeforces.com/problemset/problem/471/E | [
"data structures",
"dsu"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 131
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:471-D | codeforces | 471-D | MUH and Cube Walls | https://codeforces.com/problemset/problem/471/D | [
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 10902
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:471-C | codeforces | 471-C | MUH and House of Cards | https://codeforces.com/problemset/problem/471/C | [
"binary search",
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3756
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:471-B | codeforces | 471-B | MUH and Important Things | https://codeforces.com/problemset/problem/471/B | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6235
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:471-A | codeforces | 471-A | MUH and Sticks | https://codeforces.com/problemset/problem/471/A | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 13830
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:470-H | codeforces | 470-H | Array Sorting | https://codeforces.com/problemset/problem/470/H | [
"*special"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 195
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:470-G | codeforces | 470-G | Hamming Distance | https://codeforces.com/problemset/problem/470/G | [
"*special"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 132
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:470-F | codeforces | 470-F | Pairwise Sums | https://codeforces.com/problemset/problem/470/F | [
"*special"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 115
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:470-E | codeforces | 470-E | Chessboard | https://codeforces.com/problemset/problem/470/E | [
"*special"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 206
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:470-D | codeforces | 470-D | Caesar Cipher | https://codeforces.com/problemset/problem/470/D | [
"*special"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 158
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:470-C | codeforces | 470-C | Eval | https://codeforces.com/problemset/problem/470/C | [
"*special"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 263
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:470-B | codeforces | 470-B | Hexakosioihexekontahexaphobia | https://codeforces.com/problemset/problem/470/B | [
"*special"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 272
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:470-A | codeforces | 470-A | Crystal Ball Sequence | https://codeforces.com/problemset/problem/470/A | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 697
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:469-B | codeforces | 469-B | Chat Online | https://codeforces.com/problemset/problem/469/B | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13443
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:469-A | codeforces | 469-A | I Wanna Be the Guy | https://codeforces.com/problemset/problem/469/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 124816
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:468-E | codeforces | 468-E | Permanent | https://codeforces.com/problemset/problem/468/E | [
"dp",
"graph matchings",
"math",
"meet-in-the-middle"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 529
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:468-D | codeforces | 468-D | Tree | https://codeforces.com/problemset/problem/468/D | [
"graph matchings"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 672
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:468-C | codeforces | 468-C | Hack it! | https://codeforces.com/problemset/problem/468/C | [
"binary search",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2816
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:468-B | codeforces | 468-B | Two Sets | https://codeforces.com/problemset/problem/468/B | [
"2-sat",
"dfs and similar",
"dsu",
"graph matchings",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5499
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:468-A | codeforces | 468-A | 24 Game | https://codeforces.com/problemset/problem/468/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8609
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:467-E | codeforces | 467-E | Alex and Complicated Task | https://codeforces.com/problemset/problem/467/E | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 879
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:467-D | codeforces | 467-D | Fedor and Essay | https://codeforces.com/problemset/problem/467/D | [
"dfs and similar",
"dp",
"graphs",
"hashing",
"strings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2089
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:467-C | codeforces | 467-C | George and Job | https://codeforces.com/problemset/problem/467/C | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 17019
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:467-B | codeforces | 467-B | Fedor and New Game | https://codeforces.com/problemset/problem/467/B | [
"bitmasks",
"brute force",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 43797
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:467-A | codeforces | 467-A | George and Accommodation | https://codeforces.com/problemset/problem/467/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 160956
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:466-E | codeforces | 466-E | Information Graph | https://codeforces.com/problemset/problem/466/E | [
"dfs and similar",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2711
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:466-D | codeforces | 466-D | Increase Sequence | https://codeforces.com/problemset/problem/466/D | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3925
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:466-C | codeforces | 466-C | Number of Ways | https://codeforces.com/problemset/problem/466/C | [
"binary search",
"brute force",
"data structures",
"dp",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 42958
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:466-B | codeforces | 466-B | Wonder Room | https://codeforces.com/problemset/problem/466/B | [
"brute force",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5346
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:466-A | codeforces | 466-A | Cheap Travel | https://codeforces.com/problemset/problem/466/A | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 79148
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:465-B | codeforces | 465-B | Inbox (100500) | https://codeforces.com/problemset/problem/465/B | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 10929
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:465-A | codeforces | 465-A | inc ARG | https://codeforces.com/problemset/problem/465/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 10496
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:464-E | codeforces | 464-E | The Classic Problem | https://codeforces.com/problemset/problem/464/E | [
"data structures",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 2007
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:464-D | codeforces | 464-D | World of Darkraft - 2 | https://codeforces.com/problemset/problem/464/D | [
"dp",
"probabilities"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 800
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:464-C | codeforces | 464-C | Substitutes in Number | https://codeforces.com/problemset/problem/464/C | [
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1980
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:464-B | codeforces | 464-B | Restore Cube | https://codeforces.com/problemset/problem/464/B | [
"brute force",
"geometry"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1802
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:464-A | codeforces | 464-A | No to Palindromes! | https://codeforces.com/problemset/problem/464/A | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6272
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:463-E | codeforces | 463-E | Caisa and Tree | https://codeforces.com/problemset/problem/463/E | [
"brute force",
"dfs and similar",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1787
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:463-D | codeforces | 463-D | Gargari and Permutations | https://codeforces.com/problemset/problem/463/D | [
"dfs and similar",
"dp",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7454
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:463-C | codeforces | 463-C | Gargari and Bishops | https://codeforces.com/problemset/problem/463/C | [
"greedy",
"hashing",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 9270
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:463-B | codeforces | 463-B | Caisa and Pylons | https://codeforces.com/problemset/problem/463/B | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 30331
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:463-A | codeforces | 463-A | Caisa and Sugar | https://codeforces.com/problemset/problem/463/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9616
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:462-B | codeforces | 462-B | Appleman and Card Game | https://codeforces.com/problemset/problem/462/B | [
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15718
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:462-A | codeforces | 462-A | Appleman and Easy Task | https://codeforces.com/problemset/problem/462/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17974
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:461-E | codeforces | 461-E | Appleman and a Game | https://codeforces.com/problemset/problem/461/E | [
"binary search",
"shortest paths",
"strings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 742
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:461-D | codeforces | 461-D | Appleman and Complicated Task | https://codeforces.com/problemset/problem/461/D | [
"dsu",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 486
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:461-C | codeforces | 461-C | Appleman and a Sheet of Paper | https://codeforces.com/problemset/problem/461/C | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1423
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:461-B | codeforces | 461-B | Appleman and Tree | https://codeforces.com/problemset/problem/461/B | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 7345
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:461-A | codeforces | 461-A | Appleman and Toastman | https://codeforces.com/problemset/problem/461/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 16532
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:460-E | codeforces | 460-E | Roland and Rose | https://codeforces.com/problemset/problem/460/E | [
"brute force",
"geometry",
"math",
"sortings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 415
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:460-D | codeforces | 460-D | Little Victor and Set | https://codeforces.com/problemset/problem/460/D | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1058
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:460-C | codeforces | 460-C | Present | https://codeforces.com/problemset/problem/460/C | [
"binary search",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6897
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:460-B | codeforces | 460-B | Little Dima and Equation | https://codeforces.com/problemset/problem/460/B | [
"brute force",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13533
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:460-A | codeforces | 460-A | Vasya and Socks | https://codeforces.com/problemset/problem/460/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 52891
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:459-E | codeforces | 459-E | Pashmak and Graph | https://codeforces.com/problemset/problem/459/E | [
"dp",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6032
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:459-D | codeforces | 459-D | Pashmak and Parmida's problem | https://codeforces.com/problemset/problem/459/D | [
"data structures",
"divide and conquer",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 13361
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:459-C | codeforces | 459-C | Pashmak and Buses | https://codeforces.com/problemset/problem/459/C | [
"combinatorics",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6519
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:459-B | codeforces | 459-B | Pashmak and Flowers | https://codeforces.com/problemset/problem/459/B | [
"combinatorics",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 48691
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:459-A | codeforces | 459-A | Pashmak and Garden | https://codeforces.com/problemset/problem/459/A | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 36905
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:457-F | codeforces | 457-F | An easy problem about trees | https://codeforces.com/problemset/problem/457/F | [
"dp",
"games",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 128
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:457-E | codeforces | 457-E | Flow Optimality | https://codeforces.com/problemset/problem/457/E | [
"constructive algorithms",
"flows",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 134
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:457-D | codeforces | 457-D | Bingo! | https://codeforces.com/problemset/problem/457/D | [
"combinatorics",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 430
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:457-C | codeforces | 457-C | Elections | https://codeforces.com/problemset/problem/457/C | [
"brute force"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 977
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:457-B | codeforces | 457-B | Distributed Join | https://codeforces.com/problemset/problem/457/B | [
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1216
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:457-A | codeforces | 457-A | Golden System | https://codeforces.com/problemset/problem/457/A | [
"math",
"meet-in-the-middle"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1419
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:456-B | codeforces | 456-B | Fedya and Maths | https://codeforces.com/problemset/problem/456/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18924
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:456-A | codeforces | 456-A | Laptops | https://codeforces.com/problemset/problem/456/A | [
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 58490
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:455-E | codeforces | 455-E | Function | https://codeforces.com/problemset/problem/455/E | [
"data structures"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 839
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:455-D | codeforces | 455-D | Serega and Fun | https://codeforces.com/problemset/problem/455/D | [
"data structures"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 3867
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:455-C | codeforces | 455-C | Civilization | https://codeforces.com/problemset/problem/455/C | [
"dfs and similar",
"dp",
"dsu",
"ternary search",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 6629
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:455-B | codeforces | 455-B | A Lot of Games | https://codeforces.com/problemset/problem/455/B | [
"dfs and similar",
"dp",
"games",
"implementation",
"strings",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7133
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:455-A | codeforces | 455-A | Boredom | https://codeforces.com/problemset/problem/455/A | [
"dp"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 74900
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:454-B | codeforces | 454-B | Little Pony and Sort by Shift | https://codeforces.com/problemset/problem/454/B | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19271
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:454-A | codeforces | 454-A | Little Pony and Crystal Mine | https://codeforces.com/problemset/problem/454/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16257
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:453-E | codeforces | 453-E | Little Pony and Lord Tirek | https://codeforces.com/problemset/problem/453/E | [
"data structures"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 1038
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:453-D | codeforces | 453-D | Little Pony and Elements of Harmony | https://codeforces.com/problemset/problem/453/D | [
"dp",
"matrices"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 685
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:453-C | codeforces | 453-C | Little Pony and Summer Sun Celebration | https://codeforces.com/problemset/problem/453/C | [
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1831
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:453-B | codeforces | 453-B | Little Pony and Harmony Chest | https://codeforces.com/problemset/problem/453/B | [
"bitmasks",
"brute force",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5602
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:453-A | codeforces | 453-A | Little Pony and Expected Maximum | https://codeforces.com/problemset/problem/453/A | [
"probabilities"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12897
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:452-F | codeforces | 452-F | Permutation | https://codeforces.com/problemset/problem/452/F | [
"data structures",
"divide and conquer",
"hashing"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1857
} | 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.