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:572-A | codeforces | 572-A | Arrays | https://codeforces.com/problemset/problem/572/A | [
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18499
} | 2026-06-01T05:00:40.145500+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": 295
} | 2026-06-01T05:00:40.145500+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": 808
} | 2026-06-01T05:00:40.145500+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": 718
} | 2026-06-01T05:00:40.145500+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": 2833
} | 2026-06-01T05:00:40.145500+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": 2702
} | 2026-06-01T05:00:40.145500+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": 2113
} | 2026-06-01T05:00:40.145500+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": 9140
} | 2026-06-01T05:00:40.145500+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": 9581
} | 2026-06-01T05:00:40.145500+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": 16902
} | 2026-06-01T05:00:40.145500+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": 14341
} | 2026-06-01T05:00:40.145500+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": 7519
} | 2026-06-01T05:00:40.145500+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": 5067
} | 2026-06-01T05:00:40.145500+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": 633
} | 2026-06-01T05:00:40.145500+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": 319
} | 2026-06-01T05:00:40.145500+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": 947
} | 2026-06-01T05:00:40.145500+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": 2386
} | 2026-06-01T05:00:40.145500+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": 5409
} | 2026-06-01T05:00:40.145500+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": 638
} | 2026-06-01T05:00:40.145500+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": 2266
} | 2026-06-01T05:00:40.145500+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": 5256
} | 2026-06-01T05:00:40.145500+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": 10474
} | 2026-06-01T05:00:40.145500+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": 8709
} | 2026-06-01T05:00:40.145500+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": 36076
} | 2026-06-01T05:00:40.145500+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": 386
} | 2026-06-01T05:00:40.145500+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": 4312
} | 2026-06-01T05:00:40.145500+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": 710
} | 2026-06-01T05:00:40.145500+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": 3971
} | 2026-06-01T05:00:40.145500+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": 885
} | 2026-06-01T05:00:40.145500+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": 371
} | 2026-06-01T05:00:40.145500+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": 1066
} | 2026-06-01T05:00:40.145500+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": 8266
} | 2026-06-01T05:00:40.145500+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": 19948
} | 2026-06-01T05:00:40.145500+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": 1166
} | 2026-06-01T05:00:40.145500+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": 475
} | 2026-06-01T05:00:40.145500+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": 8163
} | 2026-06-01T05:00:40.145500+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": 11704
} | 2026-06-01T05:00:40.145500+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": 10926
} | 2026-06-01T05:00:40.145500+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": 7469
} | 2026-06-01T05:00:40.145500+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": 1210
} | 2026-06-01T05:00:40.145500+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": 4212
} | 2026-06-01T05:00:40.145500+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": 8370
} | 2026-06-01T05:00:40.145500+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": 11019
} | 2026-06-01T05:00:40.145500+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": 1220
} | 2026-06-01T05:00:40.145500+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": 2388
} | 2026-06-01T05:00:40.145500+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": 4222
} | 2026-06-01T05:00:40.145500+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": 7491
} | 2026-06-01T05:00:40.145500+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": 8517
} | 2026-06-01T05:00:40.145500+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": 8202
} | 2026-06-01T05:00:40.145500+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": 46617
} | 2026-06-01T05:00:40.145500+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": 2996
} | 2026-06-01T05:00:40.145500+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": 932
} | 2026-06-01T05:00:40.145500+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": 2066
} | 2026-06-01T05:00:40.145500+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": 4089
} | 2026-06-01T05:00:40.145500+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": 6688
} | 2026-06-01T05:00:40.145500+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": 10962
} | 2026-06-01T05:00:40.145500+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": 14524
} | 2026-06-01T05:00:40.145500+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": 624
} | 2026-06-01T05:00:40.145500+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": 1085
} | 2026-06-01T05:00:40.145500+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": 1966
} | 2026-06-01T05:00:40.145500+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": 2272
} | 2026-06-01T05:00:40.145500+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": 9929
} | 2026-06-01T05:00:40.145500+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": 1740
} | 2026-06-01T05:00:40.145500+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": 4862
} | 2026-06-01T05:00:40.145500+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": 5881
} | 2026-06-01T05:00:40.145500+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": 16087
} | 2026-06-01T05:00:40.145500+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": 10166
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:551-E | codeforces | 551-E | GukiZ and GukiZiana | https://codeforces.com/problemset/problem/551/E | [
"binary search",
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2151
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:551-D | codeforces | 551-D | GukiZ and Binary Operations | https://codeforces.com/problemset/problem/551/D | [
"combinatorics",
"implementation",
"math",
"matrices",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2114
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:551-C | codeforces | 551-C | GukiZ hates Boxes | https://codeforces.com/problemset/problem/551/C | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3997
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:551-B | codeforces | 551-B | ZgukistringZ | https://codeforces.com/problemset/problem/551/B | [
"brute force",
"constructive algorithms",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4066
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:551-A | codeforces | 551-A | GukiZ and Contest | https://codeforces.com/problemset/problem/551/A | [
"brute force",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17884
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:550-E | codeforces | 550-E | Brackets in Implications | https://codeforces.com/problemset/problem/550/E | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1500
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:550-D | codeforces | 550-D | Regular Bridge | https://codeforces.com/problemset/problem/550/D | [
"constructive algorithms",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3785
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:550-C | codeforces | 550-C | Divisibility by Eight | https://codeforces.com/problemset/problem/550/C | [
"brute force",
"dp",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 32352
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:550-B | codeforces | 550-B | Preparing Olympiad | https://codeforces.com/problemset/problem/550/B | [
"bitmasks",
"brute force"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 27787
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:550-A | codeforces | 550-A | Two Substrings | https://codeforces.com/problemset/problem/550/A | [
"brute force",
"dp",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 43854
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:549-H | codeforces | 549-H | Degenerate Matrix | https://codeforces.com/problemset/problem/549/H | [
"binary search",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2094
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:549-G | codeforces | 549-G | Happy Line | https://codeforces.com/problemset/problem/549/G | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2658
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:549-F | codeforces | 549-F | Yura and Developers | https://codeforces.com/problemset/problem/549/F | [
"data structures",
"divide and conquer"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1038
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:549-E | codeforces | 549-E | Sasha Circle | https://codeforces.com/problemset/problem/549/E | [
"geometry",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 175
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:549-D | codeforces | 549-D | Haar Features | https://codeforces.com/problemset/problem/549/D | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2256
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:549-C | codeforces | 549-C | The Game Of Parity | https://codeforces.com/problemset/problem/549/C | [
"games"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1830
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:549-B | codeforces | 549-B | Looksery Party | https://codeforces.com/problemset/problem/549/B | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1588
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:549-A | codeforces | 549-A | Face Detection | https://codeforces.com/problemset/problem/549/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 10175
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:548-B | codeforces | 548-B | Mike and Fun | https://codeforces.com/problemset/problem/548/B | [
"brute force",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9007
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:548-A | codeforces | 548-A | Mike and Fax | https://codeforces.com/problemset/problem/548/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10338
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:547-E | codeforces | 547-E | Mike and Friends | https://codeforces.com/problemset/problem/547/E | [
"data structures",
"string suffix structures",
"strings",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 2622
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:547-D | codeforces | 547-D | Mike and Fish | https://codeforces.com/problemset/problem/547/D | [
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 3150
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:547-C | codeforces | 547-C | Mike and Foam | https://codeforces.com/problemset/problem/547/C | [
"bitmasks",
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3428
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:547-B | codeforces | 547-B | Mike and Feet | https://codeforces.com/problemset/problem/547/B | [
"binary search",
"data structures",
"dp",
"dsu"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 11046
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:547-A | codeforces | 547-A | Mike and Frog | https://codeforces.com/problemset/problem/547/A | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2751
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:546-E | codeforces | 546-E | Soldier and Traveling | https://codeforces.com/problemset/problem/546/E | [
"flows",
"graphs",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4337
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:546-D | codeforces | 546-D | Soldier and Number Game | https://codeforces.com/problemset/problem/546/D | [
"constructive algorithms",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 13838
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:546-C | codeforces | 546-C | Soldier and Cards | https://codeforces.com/problemset/problem/546/C | [
"brute force",
"dfs and similar",
"games"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 19494
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:546-B | codeforces | 546-B | Soldier and Badges | https://codeforces.com/problemset/problem/546/B | [
"brute force",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18669
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:546-A | codeforces | 546-A | Soldier and Bananas | https://codeforces.com/problemset/problem/546/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 237171
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:545-E | codeforces | 545-E | Paths and Trees | https://codeforces.com/problemset/problem/545/E | [
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5611
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:545-D | codeforces | 545-D | Queue | https://codeforces.com/problemset/problem/545/D | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 29701
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:545-C | codeforces | 545-C | Woodcutters | https://codeforces.com/problemset/problem/545/C | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 33264
} | 2026-06-01T05:00:40.145500+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.