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: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": 2180
} | 2026-11-02T05:37:07.883505+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": 4903
} | 2026-11-02T05:37:07.883505+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": 323
} | 2026-11-02T05:37:07.883505+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": 1380
} | 2026-11-02T05:37:07.883505+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": 1068
} | 2026-11-02T05:37:07.883505+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": 1139
} | 2026-11-02T05:37:07.883505+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": 4147
} | 2026-11-02T05:37:07.883505+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": 6561
} | 2026-11-02T05:37:07.883505+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": 9769
} | 2026-11-02T05:37:07.883505+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": 21808
} | 2026-11-02T05:37:07.883505+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": 365
} | 2026-11-02T05:37:07.883505+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": 1113
} | 2026-11-02T05:37:07.883505+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": 1335
} | 2026-11-02T05:37:07.883505+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": 5040
} | 2026-11-02T05:37:07.883505+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": 4044
} | 2026-11-02T05:37:07.883505+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": 10289
} | 2026-11-02T05:37:07.883505+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": 16180
} | 2026-11-02T05:37:07.883505+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": 1583
} | 2026-11-02T05:37:07.883505+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": 4113
} | 2026-11-02T05:37:07.883505+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": 7049
} | 2026-11-02T05:37:07.883505+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": 9136
} | 2026-11-02T05:37:07.883505+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": 21860
} | 2026-11-02T05:37:07.883505+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": 12559
} | 2026-11-02T05:37:07.883505+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": 22883
} | 2026-11-02T05:37:07.883505+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": 8436
} | 2026-11-02T05:37:07.883505+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": 11874
} | 2026-11-02T05:37:07.883505+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": 273
} | 2026-11-02T05:37:07.883505+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": 637
} | 2026-11-02T05:37:07.883505+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": 486
} | 2026-11-02T05:37:07.883505+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": 3966
} | 2026-11-02T05:37:07.883505+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": 4487
} | 2026-11-02T05:37:07.883505+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": 6747
} | 2026-11-02T05:37:07.883505+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": 11238
} | 2026-11-02T05:37:07.883505+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": 13474
} | 2026-11-02T05:37:07.883505+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": 575
} | 2026-11-02T05:37:07.883505+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": 444
} | 2026-11-02T05:37:07.883505+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": 2651
} | 2026-11-02T05:37:07.883505+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": 6120
} | 2026-11-02T05:37:07.883505+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": 6542
} | 2026-11-02T05:37:07.883505+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": 9132
} | 2026-11-02T05:37:07.883505+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": 1111
} | 2026-11-02T05:37:07.883505+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": 8585
} | 2026-11-02T05:37:07.883505+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": 3557
} | 2026-11-02T05:37:07.883505+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": 6778
} | 2026-11-02T05:37:07.883505+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": 5598
} | 2026-11-02T05:37:07.883505+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": 10863
} | 2026-11-02T05:37:07.883505+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": 12400
} | 2026-11-02T05:37:07.883505+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": 12866
} | 2026-11-02T05:37:07.883505+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": 16602
} | 2026-11-02T05:37:07.883505+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": 255
} | 2026-11-02T05:37:07.883505+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": 431
} | 2026-11-02T05:37:07.883505+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": 598
} | 2026-11-02T05:37:07.883505+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": 1068
} | 2026-11-02T05:37:07.883505+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": 13311
} | 2026-11-02T05:37:07.883505+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": 7620
} | 2026-11-02T05:37:07.883505+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": 12295
} | 2026-11-02T05:37:07.883505+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": 6562
} | 2026-11-02T05:37:07.883505+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": 27185
} | 2026-11-02T05:37:07.883505+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": 15005
} | 2026-11-02T05:37:07.883505+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": 23174
} | 2026-11-02T05:37:07.883505+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": 2279
} | 2026-11-02T05:37:07.883505+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": 1695
} | 2026-11-02T05:37:07.883505+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": 4489
} | 2026-11-02T05:37:07.883505+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": 11736
} | 2026-11-02T05:37:07.883505+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": 13387
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1005-B | codeforces | 1005-B | Delete from the Left | https://codeforces.com/problemset/problem/1005/B | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 28317
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1005-A | codeforces | 1005-A | Tanya and Stairways | https://codeforces.com/problemset/problem/1005/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28951
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1004-F | codeforces | 1004-F | Sonya and Bitwise OR | https://codeforces.com/problemset/problem/1004/F | [
"bitmasks",
"data structures",
"divide and conquer"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1035
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1004-E | codeforces | 1004-E | Sonya and Ice Cream | https://codeforces.com/problemset/problem/1004/E | [
"binary search",
"data structures",
"dp",
"greedy",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1344
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1004-D | codeforces | 1004-D | Sonya and Matrix | https://codeforces.com/problemset/problem/1004/D | [
"brute force",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1538
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1004-C | codeforces | 1004-C | Sonya and Robots | https://codeforces.com/problemset/problem/1004/C | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7950
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1004-B | codeforces | 1004-B | Sonya and Exhibition | https://codeforces.com/problemset/problem/1004/B | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 10132
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1004-A | codeforces | 1004-A | Sonya and Hotels | https://codeforces.com/problemset/problem/1004/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 12012
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1003-F | codeforces | 1003-F | Abbreviation | https://codeforces.com/problemset/problem/1003/F | [
"dp",
"hashing",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1676
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1003-E | codeforces | 1003-E | Tree Constructing | https://codeforces.com/problemset/problem/1003/E | [
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3235
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1003-D | codeforces | 1003-D | Coins and Queries | https://codeforces.com/problemset/problem/1003/D | [
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8781
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1003-C | codeforces | 1003-C | Intense Heat | https://codeforces.com/problemset/problem/1003/C | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11743
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1003-B | codeforces | 1003-B | Binary String Constructing | https://codeforces.com/problemset/problem/1003/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12430
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1003-A | codeforces | 1003-A | Polycarp's Pockets | https://codeforces.com/problemset/problem/1003/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30853
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1002-E2 | codeforces | 1002-E2 | Another array reconstruction algorithm | https://codeforces.com/problemset/problem/1002/E2 | [
"*special"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 212
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1002-E1 | codeforces | 1002-E1 | Bernstein-Vazirani algorithm | https://codeforces.com/problemset/problem/1002/E1 | [
"*special"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 329
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1002-D3 | codeforces | 1002-D3 | Oracle for majority function | https://codeforces.com/problemset/problem/1002/D3 | [
"*special"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 341
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1002-D2 | codeforces | 1002-D2 | Oracle for f(x) = b * x + (1 - b) * (1 - x) mod 2 | https://codeforces.com/problemset/problem/1002/D2 | [
"*special"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 395
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1002-D1 | codeforces | 1002-D1 | Oracle for f(x) = b * x mod 2 | https://codeforces.com/problemset/problem/1002/D1 | [
"*special"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 421
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1002-C2 | codeforces | 1002-C2 | Distinguish zero state and plus state without errors | https://codeforces.com/problemset/problem/1002/C2 | [
"*special"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 273
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1002-C1 | codeforces | 1002-C1 | Distinguish zero state and plus state with minimum error | https://codeforces.com/problemset/problem/1002/C1 | [
"*special"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 310
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1002-B4 | codeforces | 1002-B4 | Distinguish four 2-qubit states - 2 | https://codeforces.com/problemset/problem/1002/B4 | [
"*special"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 317
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1002-B3 | codeforces | 1002-B3 | Distinguish four 2-qubit states | https://codeforces.com/problemset/problem/1002/B3 | [
"*special"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 421
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1002-B2 | codeforces | 1002-B2 | Distinguish GHZ state and W state | https://codeforces.com/problemset/problem/1002/B2 | [
"*special"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 456
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1002-B1 | codeforces | 1002-B1 | Distinguish zero state and W state | https://codeforces.com/problemset/problem/1002/B1 | [
"*special"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 490
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1002-A4 | codeforces | 1002-A4 | Generate W state | https://codeforces.com/problemset/problem/1002/A4 | [
"*special"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 274
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1002-A3 | codeforces | 1002-A3 | Generate superposition of two basis states | https://codeforces.com/problemset/problem/1002/A3 | [
"*special"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 484
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1002-A2 | codeforces | 1002-A2 | Generate superposition of zero state and a basis state | https://codeforces.com/problemset/problem/1002/A2 | [
"*special"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 571
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1002-A1 | codeforces | 1002-A1 | Generate superposition of all basis states | https://codeforces.com/problemset/problem/1002/A1 | [
"*special"
] | null | null | stdin_stdout | 800 | {
"solved_count": 956
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1001-I | codeforces | 1001-I | Deutsch-Jozsa algorithm | https://codeforces.com/problemset/problem/1001/I | [
"*special"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 413
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1001-H | codeforces | 1001-H | Oracle for f(x) = parity of the number of 1s in x | https://codeforces.com/problemset/problem/1001/H | [
"*special"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 547
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1001-G | codeforces | 1001-G | Oracle for f(x) = k-th element of x | https://codeforces.com/problemset/problem/1001/G | [
"*special"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 553
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1001-F | codeforces | 1001-F | Distinguish multi-qubit basis states | https://codeforces.com/problemset/problem/1001/F | [
"*special"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 552
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1001-E | codeforces | 1001-E | Distinguish Bell states | https://codeforces.com/problemset/problem/1001/E | [
"*special"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 568
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1001-D | codeforces | 1001-D | Distinguish plus state and minus state | https://codeforces.com/problemset/problem/1001/D | [
"*special"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 701
} | 2026-11-02T05:37:07.883505+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.