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:1369-A | codeforces | 1369-A | FashionabLee | https://codeforces.com/problemset/problem/1369/A | [
"geometry",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 39390
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1368-H2 | codeforces | 1368-H2 | Breadboard Capacity (hard version) | https://codeforces.com/problemset/problem/1368/H2 | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 287
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1368-H1 | codeforces | 1368-H1 | Breadboard Capacity (easy version) | https://codeforces.com/problemset/problem/1368/H1 | [
"dp",
"flows",
"greedy"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 471
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1368-G | codeforces | 1368-G | Shifting Dominoes | https://codeforces.com/problemset/problem/1368/G | [
"data structures",
"geometry",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 808
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1368-F | codeforces | 1368-F | Lamps on a Circle | https://codeforces.com/problemset/problem/1368/F | [
"games",
"implementation",
"interactive",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1134
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1368-E | codeforces | 1368-E | Ski Accidents | https://codeforces.com/problemset/problem/1368/E | [
"constructive algorithms",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2430
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1368-D | codeforces | 1368-D | AND, OR and square sum | https://codeforces.com/problemset/problem/1368/D | [
"bitmasks",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 14251
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1368-C | codeforces | 1368-C | Even Picture | https://codeforces.com/problemset/problem/1368/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14100
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1368-B | codeforces | 1368-B | Codeforces Subsequences | https://codeforces.com/problemset/problem/1368/B | [
"brute force",
"constructive algorithms",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 21785
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1368-A | codeforces | 1368-A | C+= | https://codeforces.com/problemset/problem/1368/A | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 47265
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1367-F2 | codeforces | 1367-F2 | Flying Sort (Hard Version) | https://codeforces.com/problemset/problem/1367/F2 | [
"binary search",
"data structures",
"dp",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2021
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1367-F1 | codeforces | 1367-F1 | Flying Sort (Easy Version) | https://codeforces.com/problemset/problem/1367/F1 | [
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3718
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1367-E | codeforces | 1367-E | Necklace Assembly | https://codeforces.com/problemset/problem/1367/E | [
"brute force",
"dfs and similar",
"dp",
"graphs",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5940
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1367-D | codeforces | 1367-D | Task On The Board | https://codeforces.com/problemset/problem/1367/D | [
"constructive algorithms",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8927
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1367-C | codeforces | 1367-C | Social Distance | https://codeforces.com/problemset/problem/1367/C | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 25594
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1367-B | codeforces | 1367-B | Even Array | https://codeforces.com/problemset/problem/1367/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 65908
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1367-A | codeforces | 1367-A | Short Substrings | https://codeforces.com/problemset/problem/1367/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 69105
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1366-G | codeforces | 1366-G | Construct the String | https://codeforces.com/problemset/problem/1366/G | [
"data structures",
"dp",
"strings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 650
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1366-F | codeforces | 1366-F | Jog Around The Graph | https://codeforces.com/problemset/problem/1366/F | [
"binary search",
"dp",
"geometry",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 945
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1366-E | codeforces | 1366-E | Two Arrays | https://codeforces.com/problemset/problem/1366/E | [
"binary search",
"brute force",
"combinatorics",
"constructive algorithms",
"dp",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4686
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1366-D | codeforces | 1366-D | Two Divisors | https://codeforces.com/problemset/problem/1366/D | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 12687
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1366-C | codeforces | 1366-C | Palindromic Paths | https://codeforces.com/problemset/problem/1366/C | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14329
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1366-B | codeforces | 1366-B | Shuffle | https://codeforces.com/problemset/problem/1366/B | [
"math",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 29541
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1366-A | codeforces | 1366-A | Shovels and Swords | https://codeforces.com/problemset/problem/1366/A | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 33372
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1365-G | codeforces | 1365-G | Secure Password | https://codeforces.com/problemset/problem/1365/G | [
"bitmasks",
"combinatorics",
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1558
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1365-F | codeforces | 1365-F | Swaps Again | https://codeforces.com/problemset/problem/1365/F | [
"constructive algorithms",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4844
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1365-E | codeforces | 1365-E | Maximum Subsequence Value | https://codeforces.com/problemset/problem/1365/E | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8476
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1365-D | codeforces | 1365-D | Solve The Maze | https://codeforces.com/problemset/problem/1365/D | [
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 21457
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1365-C | codeforces | 1365-C | Rotation Matching | https://codeforces.com/problemset/problem/1365/C | [
"constructive algorithms",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 25275
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1365-B | codeforces | 1365-B | Trouble Sort | https://codeforces.com/problemset/problem/1365/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 29156
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1365-A | codeforces | 1365-A | Matrix Game | https://codeforces.com/problemset/problem/1365/A | [
"games",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 25222
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1364-E | codeforces | 1364-E | X-OR | https://codeforces.com/problemset/problem/1364/E | [
"bitmasks",
"constructive algorithms",
"divide and conquer",
"interactive",
"probabilities"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1684
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1364-D | codeforces | 1364-D | Ehab's Last Corollary | https://codeforces.com/problemset/problem/1364/D | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5151
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1364-C | codeforces | 1364-C | Ehab and Prefix MEXs | https://codeforces.com/problemset/problem/1364/C | [
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14548
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1364-B | codeforces | 1364-B | Most socially-distanced subsequence | https://codeforces.com/problemset/problem/1364/B | [
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 27636
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1364-A | codeforces | 1364-A | XXXXX | https://codeforces.com/problemset/problem/1364/A | [
"brute force",
"data structures",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 31982
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1363-F | codeforces | 1363-F | Rotating Substrings | https://codeforces.com/problemset/problem/1363/F | [
"dp",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1775
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1363-E | codeforces | 1363-E | Tree Shuffling | https://codeforces.com/problemset/problem/1363/E | [
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 7610
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1363-D | codeforces | 1363-D | Guess The Maximums | https://codeforces.com/problemset/problem/1363/D | [
"binary search",
"implementation",
"interactive",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4477
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1363-C | codeforces | 1363-C | Game On Leaves | https://codeforces.com/problemset/problem/1363/C | [
"games",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 21585
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1363-B | codeforces | 1363-B | Subsequence Hate | https://codeforces.com/problemset/problem/1363/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 26613
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1363-A | codeforces | 1363-A | Odd Selection | https://codeforces.com/problemset/problem/1363/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 41335
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1362-C | codeforces | 1362-C | Johnny and Another Rating Drop | https://codeforces.com/problemset/problem/1362/C | [
"bitmasks",
"greedy",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 24944
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1362-B | codeforces | 1362-B | Johnny and His Hobbies | https://codeforces.com/problemset/problem/1362/B | [
"bitmasks",
"brute force"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 21389
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1362-A | codeforces | 1362-A | Johnny and Ancient Computer | https://codeforces.com/problemset/problem/1362/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 36517
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1361-F | codeforces | 1361-F | Johnny and New Toy | https://codeforces.com/problemset/problem/1361/F | [
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 263
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1361-E | codeforces | 1361-E | James and the Chase | https://codeforces.com/problemset/problem/1361/E | [
"dfs and similar",
"graphs",
"probabilities",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1058
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1361-D | codeforces | 1361-D | Johnny and James | https://codeforces.com/problemset/problem/1361/D | [
"greedy",
"implementation",
"math",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 445
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1361-C | codeforces | 1361-C | Johnny and Megan's Necklace | https://codeforces.com/problemset/problem/1361/C | [
"binary search",
"bitmasks",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2164
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1361-B | codeforces | 1361-B | Johnny and Grandmaster | https://codeforces.com/problemset/problem/1361/B | [
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3893
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1361-A | codeforces | 1361-A | Johnny and Contribution | https://codeforces.com/problemset/problem/1361/A | [
"constructive algorithms",
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8894
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1360-H | codeforces | 1360-H | Binary Median | https://codeforces.com/problemset/problem/1360/H | [
"binary search",
"bitmasks",
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4935
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1360-G | codeforces | 1360-G | A/B Matrix | https://codeforces.com/problemset/problem/1360/G | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8410
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1360-F | codeforces | 1360-F | Spy-string | https://codeforces.com/problemset/problem/1360/F | [
"bitmasks",
"brute force",
"constructive algorithms",
"dp",
"hashing",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 13723
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1360-E | codeforces | 1360-E | Polygon | https://codeforces.com/problemset/problem/1360/E | [
"dp",
"graphs",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 28501
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1360-D | codeforces | 1360-D | Buying Shovels | https://codeforces.com/problemset/problem/1360/D | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 45216
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1360-C | codeforces | 1360-C | Similar Pairs | https://codeforces.com/problemset/problem/1360/C | [
"constructive algorithms",
"graph matchings",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 37357
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1360-B | codeforces | 1360-B | Honest Coach | https://codeforces.com/problemset/problem/1360/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 54685
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1360-A | codeforces | 1360-A | Minimal Square | https://codeforces.com/problemset/problem/1360/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 57952
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1359-F | codeforces | 1359-F | RC Kaboom Show | https://codeforces.com/problemset/problem/1359/F | [
"binary search",
"brute force",
"data structures",
"geometry",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 627
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1359-E | codeforces | 1359-E | Modular Stability | https://codeforces.com/problemset/problem/1359/E | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6867
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1359-D | codeforces | 1359-D | Yet Another Yet Another Task | https://codeforces.com/problemset/problem/1359/D | [
"data structures",
"dp",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 10950
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1359-C | codeforces | 1359-C | Mixing Water | https://codeforces.com/problemset/problem/1359/C | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 15564
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1359-B | codeforces | 1359-B | New Theatre Square | https://codeforces.com/problemset/problem/1359/B | [
"brute force",
"dp",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 29605
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1359-A | codeforces | 1359-A | Berland Poker | https://codeforces.com/problemset/problem/1359/A | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 32046
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1358-F | codeforces | 1358-F | Tasty Cookie | https://codeforces.com/problemset/problem/1358/F | [
"binary search",
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 563
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1358-E | codeforces | 1358-E | Are You Fired? | https://codeforces.com/problemset/problem/1358/E | [
"constructive algorithms",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2484
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1358-D | codeforces | 1358-D | The Best Vacation | https://codeforces.com/problemset/problem/1358/D | [
"binary search",
"brute force",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8816
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1358-C | codeforces | 1358-C | Celex Update | https://codeforces.com/problemset/problem/1358/C | [
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 18502
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1358-B | codeforces | 1358-B | Maria Breaks the Self-isolation | https://codeforces.com/problemset/problem/1358/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 26042
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1358-A | codeforces | 1358-A | Park Lighting | https://codeforces.com/problemset/problem/1358/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 43911
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1357-E2 | codeforces | 1357-E2 | Root of quantum Fourier transform | https://codeforces.com/problemset/problem/1357/E2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 54
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1357-E1 | codeforces | 1357-E1 | Power of quantum Fourier transform | https://codeforces.com/problemset/problem/1357/E1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 196
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1357-D5 | codeforces | 1357-D5 | Quantum Classification - Dataset 7 | https://codeforces.com/problemset/problem/1357/D5 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 84
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1357-D4 | codeforces | 1357-D4 | Quantum Classification - Dataset 6 | https://codeforces.com/problemset/problem/1357/D4 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 87
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1357-D3 | codeforces | 1357-D3 | Quantum Classification - Dataset 5 | https://codeforces.com/problemset/problem/1357/D3 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 107
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1357-D2 | codeforces | 1357-D2 | Quantum Classification - Dataset 4 | https://codeforces.com/problemset/problem/1357/D2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 114
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1357-D1 | codeforces | 1357-D1 | Quantum Classification - Dataset 3 | https://codeforces.com/problemset/problem/1357/D1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 127
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1357-C2 | codeforces | 1357-C2 | Prepare superposition of basis states with the same parity | https://codeforces.com/problemset/problem/1357/C2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 308
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1357-C1 | codeforces | 1357-C1 | Prepare superposition of basis states with 0s | https://codeforces.com/problemset/problem/1357/C1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 351
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1357-B2 | codeforces | 1357-B2 | "Is the number divisible by 3?" oracle | https://codeforces.com/problemset/problem/1357/B2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 217
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1357-B1 | codeforces | 1357-B1 | "Is the bit string balanced?" oracle | https://codeforces.com/problemset/problem/1357/B1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 217
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1357-A7 | codeforces | 1357-A7 | Distinguish Y, XZ, -Y and -XZ | https://codeforces.com/problemset/problem/1357/A7 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 186
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1357-A6 | codeforces | 1357-A6 | Distinguish four Pauli gates | https://codeforces.com/problemset/problem/1357/A6 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 171
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1357-A5 | codeforces | 1357-A5 | Distinguish Rz(θ) from Ry(θ) | https://codeforces.com/problemset/problem/1357/A5 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 244
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1357-A4 | codeforces | 1357-A4 | Distinguish Rz from R1 | https://codeforces.com/problemset/problem/1357/A4 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 355
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1357-A3 | codeforces | 1357-A3 | Distinguish H from X | https://codeforces.com/problemset/problem/1357/A3 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 482
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1357-A2 | codeforces | 1357-A2 | Distinguish I, CNOTs and SWAP | https://codeforces.com/problemset/problem/1357/A2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 514
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1357-A1 | codeforces | 1357-A1 | Figure out direction of CNOT | https://codeforces.com/problemset/problem/1357/A1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 635
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1356-D2 | codeforces | 1356-D2 | Quantum Classification - 2 | https://codeforces.com/problemset/problem/1356/D2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 130
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1356-D1 | codeforces | 1356-D1 | Quantum Classification - 1 | https://codeforces.com/problemset/problem/1356/D1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 139
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1356-C | codeforces | 1356-C | Prepare state |01⟩ + |10⟩ + |11⟩ | https://codeforces.com/problemset/problem/1356/C | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 306
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1356-B2 | codeforces | 1356-B2 | Decrement | https://codeforces.com/problemset/problem/1356/B2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 288
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1356-B1 | codeforces | 1356-B1 | Increment | https://codeforces.com/problemset/problem/1356/B1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 287
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1356-A5 | codeforces | 1356-A5 | Distinguish Z from -Z | https://codeforces.com/problemset/problem/1356/A5 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 335
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1356-A4 | codeforces | 1356-A4 | Distinguish I ⊗ X from CNOT | https://codeforces.com/problemset/problem/1356/A4 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 462
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1356-A3 | codeforces | 1356-A3 | Distinguish Z from S | https://codeforces.com/problemset/problem/1356/A3 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 464
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1356-A2 | codeforces | 1356-A2 | Distinguish I from Z | https://codeforces.com/problemset/problem/1356/A2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 491
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1356-A1 | codeforces | 1356-A1 | Distinguish I from X | https://codeforces.com/problemset/problem/1356/A1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 607
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1355-F | codeforces | 1355-F | Guess Divisors Count | https://codeforces.com/problemset/problem/1355/F | [
"constructive algorithms",
"interactive",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 985
} | 2026-08-17T01:43:56.191071+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.