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:1029-A | codeforces | 1029-A | Many Equal Substrings | https://codeforces.com/problemset/problem/1029/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13468
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1028-H | codeforces | 1028-H | Make Square | https://codeforces.com/problemset/problem/1028/H | [
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 564
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1028-G | codeforces | 1028-G | Guess the number | https://codeforces.com/problemset/problem/1028/G | [
"dp",
"interactive"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 652
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1028-F | codeforces | 1028-F | Make Symmetrical | https://codeforces.com/problemset/problem/1028/F | [
"brute force"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 583
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1028-E | codeforces | 1028-E | Restore Array | https://codeforces.com/problemset/problem/1028/E | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1204
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1028-D | codeforces | 1028-D | Order book | https://codeforces.com/problemset/problem/1028/D | [
"combinatorics",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1825
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1028-C | codeforces | 1028-C | Rectangles | https://codeforces.com/problemset/problem/1028/C | [
"geometry",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5070
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1028-B | codeforces | 1028-B | Unnatural Conditions | https://codeforces.com/problemset/problem/1028/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10271
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1028-A | codeforces | 1028-A | Find Square | https://codeforces.com/problemset/problem/1028/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 11545
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1027-G | codeforces | 1027-G | X-mouse in the Campus | https://codeforces.com/problemset/problem/1027/G | [
"bitmasks",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 361
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1027-F | codeforces | 1027-F | Session in BSU | https://codeforces.com/problemset/problem/1027/F | [
"binary search",
"dfs and similar",
"dsu",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1959
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1027-E | codeforces | 1027-E | Inverse Coloring | https://codeforces.com/problemset/problem/1027/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2366
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1027-D | codeforces | 1027-D | Mouse Hunt | https://codeforces.com/problemset/problem/1027/D | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8390
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1027-C | codeforces | 1027-C | Minimum Value Rectangle | https://codeforces.com/problemset/problem/1027/C | [
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7158
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1027-B | codeforces | 1027-B | Numbers on the Chessboard | https://codeforces.com/problemset/problem/1027/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8755
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1027-A | codeforces | 1027-A | Palindromic Twist | https://codeforces.com/problemset/problem/1027/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 18922
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1025-G | codeforces | 1025-G | Company Acquisitions | https://codeforces.com/problemset/problem/1025/G | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 867
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1025-F | codeforces | 1025-F | Disjoint Triangles | https://codeforces.com/problemset/problem/1025/F | [
"geometry"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 910
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1025-E | codeforces | 1025-E | Colored Cubes | https://codeforces.com/problemset/problem/1025/E | [
"constructive algorithms",
"implementation",
"matrices"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 620
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1025-D | codeforces | 1025-D | Recovering BST | https://codeforces.com/problemset/problem/1025/D | [
"brute force",
"dp",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4150
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1025-C | codeforces | 1025-C | Plasticine zebra | https://codeforces.com/problemset/problem/1025/C | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6502
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1025-B | codeforces | 1025-B | Weakened Common Divisor | https://codeforces.com/problemset/problem/1025/B | [
"brute force",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8526
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1025-A | codeforces | 1025-A | Doggo Recoloring | https://codeforces.com/problemset/problem/1025/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16574
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1023-G | codeforces | 1023-G | Pisces | https://codeforces.com/problemset/problem/1023/G | [
"data structures",
"flows",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 189
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1023-F | codeforces | 1023-F | Mobile Phone Network | https://codeforces.com/problemset/problem/1023/F | [
"dfs and similar",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1010
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1023-E | codeforces | 1023-E | Down or Right | https://codeforces.com/problemset/problem/1023/E | [
"constructive algorithms",
"interactive",
"matrices"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2225
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1023-D | codeforces | 1023-D | Array Restoration | https://codeforces.com/problemset/problem/1023/D | [
"constructive algorithms",
"data structures"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4294
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1023-C | codeforces | 1023-C | Bracket Subsequence | https://codeforces.com/problemset/problem/1023/C | [
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10926
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1023-B | codeforces | 1023-B | Pair of Toys | https://codeforces.com/problemset/problem/1023/B | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 11685
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1023-A | codeforces | 1023-A | Single Wildcard Pattern Matching | https://codeforces.com/problemset/problem/1023/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9279
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1020-B | codeforces | 1020-B | Badge | https://codeforces.com/problemset/problem/1020/B | [
"brute force",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 25408
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1020-A | codeforces | 1020-A | New Building for SIS | https://codeforces.com/problemset/problem/1020/A | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 9466
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1019-E | codeforces | 1019-E | Raining season | https://codeforces.com/problemset/problem/1019/E | [
"data structures",
"divide and conquer",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 407
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1019-D | codeforces | 1019-D | Large Triangle | https://codeforces.com/problemset/problem/1019/D | [
"binary search",
"geometry",
"sortings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 742
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1019-C | codeforces | 1019-C | Sergey's problem | https://codeforces.com/problemset/problem/1019/C | [
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1483
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1019-B | codeforces | 1019-B | The hat | https://codeforces.com/problemset/problem/1019/B | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2124
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1019-A | codeforces | 1019-A | Elections | https://codeforces.com/problemset/problem/1019/A | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4859
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1017-H | codeforces | 1017-H | The Films | https://codeforces.com/problemset/problem/1017/H | [
"brute force"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 184
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1017-G | codeforces | 1017-G | The Tree | https://codeforces.com/problemset/problem/1017/G | [
"data structures"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 1218
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1017-F | codeforces | 1017-F | The Neutral Zone | https://codeforces.com/problemset/problem/1017/F | [
"brute force",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 956
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1017-E | codeforces | 1017-E | The Supersonic Rocket | https://codeforces.com/problemset/problem/1017/E | [
"geometry",
"hashing",
"strings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1098
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1017-D | codeforces | 1017-D | The Wu | https://codeforces.com/problemset/problem/1017/D | [
"bitmasks",
"brute force",
"data structures"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3977
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1017-C | codeforces | 1017-C | The Phone Number | https://codeforces.com/problemset/problem/1017/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6499
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1017-B | codeforces | 1017-B | The Bits | https://codeforces.com/problemset/problem/1017/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9637
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1017-A | codeforces | 1017-A | The Rank | https://codeforces.com/problemset/problem/1017/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21615
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1016-G | codeforces | 1016-G | Appropriate Team | https://codeforces.com/problemset/problem/1016/G | [
"bitmasks",
"math",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 318
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1016-F | codeforces | 1016-F | Road Projects | https://codeforces.com/problemset/problem/1016/F | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1030
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1016-E | codeforces | 1016-E | Rest In The Shades | https://codeforces.com/problemset/problem/1016/E | [
"binary search",
"geometry"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1296
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1016-D | codeforces | 1016-D | Vasya And The Matrix | https://codeforces.com/problemset/problem/1016/D | [
"constructive algorithms",
"flows",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4990
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1016-C | codeforces | 1016-C | Vasya And The Mushrooms | https://codeforces.com/problemset/problem/1016/C | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3994
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1016-B | codeforces | 1016-B | Segment Occurrences | https://codeforces.com/problemset/problem/1016/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 10171
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1016-A | codeforces | 1016-A | Death Note | https://codeforces.com/problemset/problem/1016/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16002
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1015-F | codeforces | 1015-F | Bracket Substring | https://codeforces.com/problemset/problem/1015/F | [
"dp",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1486
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1015-E2 | codeforces | 1015-E2 | Stars Drawing (Hard Edition) | https://codeforces.com/problemset/problem/1015/E2 | [
"binary search",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4054
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1015-E1 | codeforces | 1015-E1 | Stars Drawing (Easy Edition) | https://codeforces.com/problemset/problem/1015/E1 | [
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6835
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1015-D | codeforces | 1015-D | Walking Between Houses | https://codeforces.com/problemset/problem/1015/D | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8990
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1015-C | codeforces | 1015-C | Songs Compression | https://codeforces.com/problemset/problem/1015/C | [
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21508
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1015-B | codeforces | 1015-B | Obtaining the String | https://codeforces.com/problemset/problem/1015/B | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12435
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1015-A | codeforces | 1015-A | Points in Segments | https://codeforces.com/problemset/problem/1015/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22467
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1013-B | codeforces | 1013-B | And | https://codeforces.com/problemset/problem/1013/B | [
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8320
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1013-A | codeforces | 1013-A | Piles With Stones | https://codeforces.com/problemset/problem/1013/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 11725
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1012-F | codeforces | 1012-F | Passports | https://codeforces.com/problemset/problem/1012/F | [
"dp",
"implementation"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 209
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1012-E | codeforces | 1012-E | Cycle sort | https://codeforces.com/problemset/problem/1012/E | [
"dsu",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 401
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1012-D | codeforces | 1012-D | AB-Strings | https://codeforces.com/problemset/problem/1012/D | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 427
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1012-C | codeforces | 1012-C | Hills | https://codeforces.com/problemset/problem/1012/C | [
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3838
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1012-B | codeforces | 1012-B | Chemical table | https://codeforces.com/problemset/problem/1012/B | [
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"matrices"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4396
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1012-A | codeforces | 1012-A | Photo of The Sky | https://codeforces.com/problemset/problem/1012/A | [
"brute force",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6698
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1011-B | codeforces | 1011-B | Planning The Expedition | https://codeforces.com/problemset/problem/1011/B | [
"binary search",
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 11043
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1011-A | codeforces | 1011-A | Stages | https://codeforces.com/problemset/problem/1011/A | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 13286
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1010-F | codeforces | 1010-F | Tree | https://codeforces.com/problemset/problem/1010/F | [
"fft",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 264
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1010-E | codeforces | 1010-E | Store | https://codeforces.com/problemset/problem/1010/E | [
"data structures"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 394
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1010-D | codeforces | 1010-D | Mars rover | https://codeforces.com/problemset/problem/1010/D | [
"dfs and similar",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2584
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1010-C | codeforces | 1010-C | Border | https://codeforces.com/problemset/problem/1010/C | [
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5972
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1010-B | codeforces | 1010-B | Rocket | https://codeforces.com/problemset/problem/1010/B | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6418
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1010-A | codeforces | 1010-A | Fly | https://codeforces.com/problemset/problem/1010/A | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9041
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1009-G | codeforces | 1009-G | Allowed Letters | https://codeforces.com/problemset/problem/1009/G | [
"bitmasks",
"flows",
"graph matchings",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1069
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1009-F | codeforces | 1009-F | Dominant Indices | https://codeforces.com/problemset/problem/1009/F | [
"data structures",
"dsu",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 7861
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1009-E | codeforces | 1009-E | Intercity Travelling | https://codeforces.com/problemset/problem/1009/E | [
"combinatorics",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3388
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1009-D | codeforces | 1009-D | Relatively Prime Graph | https://codeforces.com/problemset/problem/1009/D | [
"brute force",
"constructive algorithms",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6676
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1009-C | codeforces | 1009-C | Annoying Present | https://codeforces.com/problemset/problem/1009/C | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5564
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1009-B | codeforces | 1009-B | Minimum Ternary String | https://codeforces.com/problemset/problem/1009/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10742
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1009-A | codeforces | 1009-A | Game Shopping | https://codeforces.com/problemset/problem/1009/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12324
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1008-B | codeforces | 1008-B | Turn the Rectangles | https://codeforces.com/problemset/problem/1008/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 12590
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1008-A | codeforces | 1008-A | Romaji | https://codeforces.com/problemset/problem/1008/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16392
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1007-E | codeforces | 1007-E | Mini Metro | https://codeforces.com/problemset/problem/1007/E | [
"dp"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 249
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1007-D | codeforces | 1007-D | Ants | https://codeforces.com/problemset/problem/1007/D | [
"2-sat",
"data structures",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 323
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1007-C | codeforces | 1007-C | Guess two numbers | https://codeforces.com/problemset/problem/1007/C | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 531
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1007-B | codeforces | 1007-B | Pave the Parallelepiped | https://codeforces.com/problemset/problem/1007/B | [
"bitmasks",
"brute force",
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1039
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1007-A | codeforces | 1007-A | Reorder the Array | https://codeforces.com/problemset/problem/1007/A | [
"combinatorics",
"data structures",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13097
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1006-F | codeforces | 1006-F | Xor-Paths | https://codeforces.com/problemset/problem/1006/F | [
"bitmasks",
"brute force",
"dp",
"meet-in-the-middle"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 6979
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1006-E | codeforces | 1006-E | Military Problem | https://codeforces.com/problemset/problem/1006/E | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11708
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1006-D | codeforces | 1006-D | Two Strings Swaps | https://codeforces.com/problemset/problem/1006/D | [
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6485
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1006-C | codeforces | 1006-C | Three Parts of the Array | https://codeforces.com/problemset/problem/1006/C | [
"binary search",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 25544
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1006-B | codeforces | 1006-B | Polycarp's Practice | https://codeforces.com/problemset/problem/1006/B | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14695
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1006-A | codeforces | 1006-A | Adjacent Replacements | https://codeforces.com/problemset/problem/1006/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22909
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1005-F | codeforces | 1005-F | Berland and the Shortest Paths | https://codeforces.com/problemset/problem/1005/F | [
"brute force",
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2118
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1005-E2 | codeforces | 1005-E2 | Median on Segments (General Case Edition) | https://codeforces.com/problemset/problem/1005/E2 | [
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1541
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1005-E1 | codeforces | 1005-E1 | Median on Segments (Permutations Edition) | https://codeforces.com/problemset/problem/1005/E1 | [
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4353
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1005-D | codeforces | 1005-D | Polycarp and Div 3 | https://codeforces.com/problemset/problem/1005/D | [
"dp",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11383
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1005-C | codeforces | 1005-C | Summarize to the Power of Two | https://codeforces.com/problemset/problem/1005/C | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13104
} | 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.