|
|
3963 |
P989E
A Trance of Nightfall
|
0 / 0 |
10 |
|
|
3962 |
P990A
Commentary Boxes
|
0 / 0 |
3 |
|
|
3961 |
P990B
Micro-World
|
0 / 0 |
4 |
|
|
3960 |
P990C
Bracket Sequences Concatenation Problem
|
0 / 0 |
5 |
|
|
3959 |
P990D
Graph And Its Complement
|
0 / 0 |
5 |
|
|
3958 |
P990E
Post Lamps
|
0 / 0 |
7 |
|
|
3957 |
P990F
Flow Control
|
0 / 0 |
9 |
|
|
3956 |
P990G
GCD Counting
|
0 / 0 |
9 |
|
|
3955 |
P991A
If at first you don't succeed...
|
0 / 0 |
3 |
|
|
3954 |
P991B
Getting an A
|
0 / 0 |
3 |
|
|
3953 |
P991C
Candies
|
0 / 0 |
5 |
|
|
3952 |
P991D
Bishwock
|
0 / 0 |
5 |
|
|
3951 |
P991E
Bus Number
|
0 / 0 |
6 |
|
|
3950 |
P991F
Concise and clear
|
0 / 0 |
10 |
|
|
3949 |
P992A
Nastya and an Array
|
0 / 0 |
3 |
|
|
3948 |
P992B
Nastya Studies Informatics
|
0 / 0 |
5 |
|
|
3947 |
P992C
Nastya and a Wardrobe
|
0 / 0 |
5 |
|
|
3946 |
P992D
Nastya and a Game
|
0 / 0 |
7 |
|
|
3945 |
P992E
Nastya and King-Shamans
|
0 / 0 |
9 |
|
|
3944 |
P993A
Two Squares
|
0 / 0 |
5 |
|
|
3943 |
P993B
Open Communication
|
0 / 0 |
6 |
|
|
3942 |
P993C
Careful Maneuvering
|
0 / 0 |
7 |
|
|
3941 |
P993D
Compute Power
|
0 / 0 |
9 |
|
|
3940 |
P993E
Nikita and Order Statistics
|
0 / 0 |
8 |
|
|
3939 |
P993F
The Moral Dilemma
|
0 / 0 |
10 |
|
|
3938 |
P994A
Fingerprints
|
0 / 0 |
3 |
|
|
3937 |
P994B
Knights of a Polygonal Table
|
0 / 0 |
4 |
|
|
3936 |
P995A
Tesla
|
0 / 0 |
7 |
|
|
3935 |
P995B
Suit and Tie
|
0 / 0 |
4 |
|
|
3934 |
P995C
Leaving the Bar
|
0 / 0 |
8 |
|
|
3933 |
P995D
Game
|
0 / 0 |
9 |
|
|
3932 |
P995E
Number Clicker
|
0 / 0 |
10 |
|
|
3931 |
P995F
Cowmpany Cowmpensation
|
0 / 0 |
10 |
|
|
3930 |
P996A
Hit the Lottery
|
0 / 0 |
3 |
|
|
3929 |
P996B
World Cup
|
0 / 0 |
4 |
|
|
3928 |
P997A
Convert to Ones
|
0 / 0 |
5 |
|
|
3927 |
P997B
Roman Digits
|
0 / 0 |
7 |
|
|
3926 |
P997C
Sky Full of Stars
|
0 / 0 |
9 |
|
|
3925 |
P997D
Cycles in product
|
0 / 0 |
10 |
|
|
3924 |
P997E
Good Subsegments
|
0 / 0 |
10 |
|
|
3923 |
P998A
Balloons
|
0 / 0 |
3 |
|
|
3922 |
P998B
Cutting
|
0 / 0 |
4 |
|
|
3921 |
P999A
Mishka and Contest
|
0 / 0 |
3 |
|
|
3920 |
P999B
Reversing Encryption
|
0 / 0 |
3 |
|
|
3919 |
P999C
Alphabetic Removals
|
0 / 0 |
4 |
|
|
3918 |
P999D
Equalize the Remainders
|
0 / 0 |
6 |
|
|
3917 |
P999E
Reachability from the Capital
|
0 / 0 |
7 |
|
|
3916 |
P999F
Cards and Joy
|
0 / 0 |
7 |
|
|
3915 |
P1000A
Codehorses T-shirts
|
0 / 0 |
4 |
|
|
3914 |
P1000B
Light It Up
|
0 / 0 |
5 |
|
|
3913 |
P1000C
Covered Points Count
|
0 / 0 |
5 |
|
|
3912 |
P1000D
Yet Another Problem On a Subsequence
|
0 / 0 |
6 |
|
|
3911 |
P1000E
We Need More Bosses
|
0 / 0 |
7 |
|
|
3910 |
P1000F
One Occurrence
|
0 / 0 |
9 |
|
|
3909 |
P1000G
Two-Paths
|
0 / 0 |
10 |
|
|
3908 |
P1001A
Generate plus state or minus state
|
0 / 0 |
3 |
|
|
3907 |
P1001B
Generate Bell state
|
0 / 0 |
4 |
|
|
3906 |
P1001C
Generate GHZ state
|
0 / 0 |
4 |
|
|
3905 |
P1001D
Distinguish plus state and minus state
|
0 / 0 |
4 |
|
|
3904 |
P1001E
Distinguish Bell states
|
0 / 0 |
5 |
|
|
3903 |
P1001F
Distinguish multi-qubit basis states
|
0 / 0 |
4 |
|
|
3902 |
P1001G
Oracle for f(x) = k-th element of x
|
0 / 0 |
4 |
|
|
3901 |
P1001H
Oracle for f(x) = parity of the number of 1s in x
|
0 / 0 |
4 |
|
|
3900 |
P1001I
Deutsch-Jozsa algorithm
|
0 / 0 |
5 |
|
|
3899 |
P1002A1
Generate superposition of all basis states
|
0 / 0 |
3 |
|
|
3898 |
P1002A2
Generate superposition of zero state and a basis state
|
0 / 0 |
4 |
|
|
3897 |
P1002A3
Generate superposition of two basis states
|
0 / 0 |
5 |
|
|
3896 |
P1002A4
Generate W state
|
0 / 0 |
6 |
|
|
3895 |
P1002B1
Distinguish zero state and W state
|
0 / 0 |
4 |
|
|
3894 |
P1002B2
Distinguish GHZ state and W state
|
0 / 0 |
5 |
|
|
3893 |
P1002B3
Distinguish four 2-qubit states
|
0 / 0 |
5 |
|
|
3892 |
P1002B4
Distinguish four 2-qubit states - 2
|
0 / 0 |
5 |
|
|
3891 |
P1002C1
Distinguish zero state and plus state with minimum error
|
0 / 0 |
5 |
|
|
3890 |
P1002C2
Distinguish zero state and plus state without errors
|
0 / 0 |
6 |
|
|
3889 |
P1002D1
Oracle for f(x) = b * x mod 2
|
0 / 0 |
4 |
|
|
3888 |
P1002D2
Oracle for f(x) = b * x + (1 - b) * (1 - x) mod 2
|
0 / 0 |
4 |
|
|
3887 |
P1002D3
Oracle for majority function
|
0 / 0 |
5 |
|
|
3886 |
P1002E1
Bernstein-Vazirani algorithm
|
0 / 0 |
5 |
|
|
3885 |
P1002E2
Another array reconstruction algorithm
|
0 / 0 |
6 |
|
|
3884 |
P1003A
Polycarp's Pockets
|
0 / 0 |
3 |
|
|
3883 |
P1003B
Binary String Constructing
|
0 / 0 |
4 |
|
|
3882 |
P1003C
Intense Heat
|
0 / 0 |
4 |
|
|
3881 |
P1003D
Coins and Queries
|
0 / 0 |
5 |
|
|
3880 |
P1003E
Tree Constructing
|
0 / 0 |
7 |
|
|
3879 |
P1003F
Abbreviation
|
0 / 0 |
8 |
|
|
3878 |
P1004A
Sonya and Hotels
|
0 / 0 |
3 |
|
|
3877 |
P1004B
Sonya and Exhibition
|
0 / 0 |
4 |
|
|
3876 |
P1004C
Sonya and Robots
|
0 / 0 |
4 |
|
|
3875 |
P1004D
Sonya and Matrix
|
0 / 0 |
8 |
|
|
3874 |
P1004E
Sonya and Ice Cream
|
0 / 0 |
9 |
|
|
3873 |
P1004F
Sonya and Bitwise OR
|
0 / 0 |
10 |
|
|
3872 |
P1005A
Tanya and Stairways
|
0 / 0 |
3 |
|
|
3871 |
P1005B
Delete from the Left
|
0 / 0 |
3 |
|
|
3870 |
P1005C
Summarize to the Power of Two
|
0 / 0 |
4 |
|
|
3869 |
P1005D
Polycarp and Div 3
|
0 / 0 |
5 |
|
|
3868 |
P1005E1
Median on Segments (Permutations Edition)
|
0 / 0 |
6 |
|
|
3867 |
P1005E2
Median on Segments (General Case Edition)
|
0 / 0 |
9 |
|
|
3866 |
P1005F
Berland and the Shortest Paths
|
0 / 0 |
7 |
|
|
3865 |
P1006A
Adjacent Replacements
|
0 / 0 |
3 |
|
|
3864 |
P1006B
Polycarp's Practice
|
0 / 0 |
4 |
