|
|
2761 |
codeforces#P1002B4 Distinguish four 2-qubit states - 2
|
0 / 0 |
5 |
|
|
2760 |
codeforces#P1002C1 Distinguish zero state and plus state with minimum error
|
0 / 0 |
5 |
|
|
2758 |
codeforces#P1002C2 Distinguish zero state and plus state without errors
|
0 / 0 |
6 |
|
|
2759 |
codeforces#P1002D1 Oracle for f(x) = b * x mod 2
|
0 / 0 |
4 |
|
|
2757 |
codeforces#P1002D2 Oracle for f(x) = b * x + (1 - b) * (1 - x) mod 2
|
0 / 0 |
4 |
|
|
2754 |
codeforces#P1002D3 Oracle for majority function
|
0 / 0 |
5 |
|
|
2755 |
codeforces#P1002E1 Bernstein-Vazirani algorithm
|
0 / 0 |
5 |
|
|
2756 |
codeforces#P1002E2 Another array reconstruction algorithm
|
0 / 0 |
6 |
|
|
2752 |
codeforces#P1003A Polycarp's Pockets
|
2 / 2 |
3 |
|
|
2751 |
codeforces#P1003B Binary String Constructing
|
0 / 0 |
4 |
|
|
2753 |
codeforces#P1003C Intense Heat
|
0 / 0 |
4 |
|
|
2750 |
codeforces#P1003D Coins and Queries
|
0 / 0 |
5 |
|
|
2749 |
codeforces#P1003E Tree Constructing
|
1 / 2 |
7 |
|
|
2748 |
codeforces#P1003F Abbreviation
|
0 / 0 |
8 |
|
|
2746 |
codeforces#P1004A Sonya and Hotels
|
0 / 1 |
3 |
|
|
2747 |
codeforces#P1004B Sonya and Exhibition
|
0 / 0 |
4 |
|
|
2745 |
codeforces#P1004C Sonya and Robots
|
0 / 0 |
4 |
|
|
2744 |
codeforces#P1004D Sonya and Matrix
|
0 / 0 |
8 |
|
|
2742 |
codeforces#P1004E Sonya and Ice Cream
|
0 / 0 |
9 |
|
|
2743 |
codeforces#P1004F Sonya and Bitwise OR
|
0 / 1 |
10 |
|
|
2741 |
codeforces#P1005A Tanya and Stairways
|
1 / 1 |
3 |
|
|
2739 |
codeforces#P1005B Delete from the Left
|
0 / 0 |
3 |
|
|
2740 |
codeforces#P1005C Summarize to the Power of Two
|
0 / 0 |
4 |
|
|
2738 |
codeforces#P1005D Polycarp and Div 3
|
0 / 0 |
5 |
|
|
2737 |
codeforces#P1005E1 Median on Segments (Permutations Edition)
|
0 / 0 |
6 |
|
|
2736 |
codeforces#P1005E2 Median on Segments (General Case Edition)
|
0 / 1 |
9 |
|
|
2735 |
codeforces#P1005F Berland and the Shortest Paths
|
0 / 0 |
7 |
|
|
2734 |
codeforces#P1006A Adjacent Replacements
|
1 / 1 |
3 |
|
|
2733 |
codeforces#P1006B Polycarp's Practice
|
0 / 0 |
4 |
|
|
2732 |
codeforces#P1006C Three Parts of the Array
|
0 / 0 |
4 |
|
|
2731 |
codeforces#P1006D Two Strings Swaps
|
1 / 1 |
5 |
|
|
2730 |
codeforces#P1006E Military Problem
|
0 / 0 |
5 |
|
|
2729 |
codeforces#P1006F Xor-Paths
|
1 / 1 |
7 |
|
|
2728 |
codeforces#P1007A Reorder the Array
|
0 / 0 |
4 |
|
|
2727 |
codeforces#P1007B Pave the Parallelepiped
|
0 / 0 |
9 |
|
|
2726 |
codeforces#P1007C Guess two numbers
|
0 / 0 |
10 |
|
|
2725 |
codeforces#P1007D Ants
|
0 / 0 |
10 |
|
|
2724 |
codeforces#P1007E Mini Metro
|
0 / 0 |
10 |
|
|
2723 |
codeforces#P1008A Romaji
|
0 / 0 |
3 |
|
|
2722 |
codeforces#P1008B Turn the Rectangles
|
0 / 2 |
3 |
|
|
2721 |
codeforces#P1009A Game Shopping
|
1 / 1 |
3 |
|
|
2720 |
codeforces#P1009B Minimum Ternary String
|
0 / 0 |
4 |
|
|
2719 |
codeforces#P1009C Annoying Present
|
0 / 0 |
5 |
|
|
2718 |
codeforces#P1009D Relatively Prime Graph
|
0 / 0 |
5 |
|
|
2717 |
codeforces#P1009E Intercity Travelling
|
0 / 0 |
7 |
|
|
2715 |
codeforces#P1009F Dominant Indices
|
3 / 7 |
8 |
|
|
2716 |
codeforces#P1009G Allowed Letters
|
0 / 0 |
9 |
|
|
2714 |
codeforces#P1010A Fly
|
0 / 1 |
5 |
|
|
2713 |
codeforces#P1010B Rocket
|
0 / 0 |
6 |
|
|
2712 |
codeforces#P1010C Border
|
0 / 0 |
6 |
