|
|
5204 |
P989E
A Trance of Nightfall
|
0 / 0 |
10 |
|
|
5203 |
P990A
Commentary Boxes
|
0 / 0 |
3 |
|
|
5202 |
P990B
Micro-World
|
0 / 0 |
4 |
|
|
5201 |
P990C
Bracket Sequences Concatenation Problem
|
0 / 0 |
5 |
|
|
5200 |
P990D
Graph And Its Complement
|
0 / 0 |
5 |
|
|
5199 |
P990E
Post Lamps
|
0 / 0 |
7 |
|
|
5198 |
P990F
Flow Control
|
0 / 0 |
9 |
|
|
5197 |
P990G
GCD Counting
|
0 / 0 |
9 |
|
|
5196 |
P991A
If at first you don't succeed...
|
0 / 0 |
3 |
|
|
5195 |
P991B
Getting an A
|
0 / 0 |
3 |
|
|
5194 |
P991C
Candies
|
0 / 0 |
5 |
|
|
5193 |
P991D
Bishwock
|
0 / 0 |
5 |
|
|
5192 |
P991E
Bus Number
|
0 / 0 |
6 |
|
|
5191 |
P991F
Concise and clear
|
0 / 0 |
10 |
|
|
5190 |
P992A
Nastya and an Array
|
0 / 0 |
3 |
|
|
5189 |
P992B
Nastya Studies Informatics
|
0 / 0 |
5 |
|
|
5188 |
P992C
Nastya and a Wardrobe
|
0 / 0 |
5 |
|
|
5187 |
P992D
Nastya and a Game
|
0 / 0 |
7 |
|
|
5186 |
P992E
Nastya and King-Shamans
|
0 / 0 |
9 |
|
|
5185 |
P993A
Two Squares
|
0 / 0 |
5 |
|
|
5184 |
P993B
Open Communication
|
0 / 0 |
6 |
|
|
5183 |
P993C
Careful Maneuvering
|
0 / 0 |
7 |
|
|
5182 |
P993D
Compute Power
|
0 / 0 |
9 |
|
|
5181 |
P993E
Nikita and Order Statistics
|
0 / 0 |
8 |
|
|
5180 |
P993F
The Moral Dilemma
|
0 / 0 |
10 |
|
|
5179 |
P994A
Fingerprints
|
0 / 0 |
3 |
|
|
5178 |
P994B
Knights of a Polygonal Table
|
0 / 0 |
4 |
|
|
5177 |
P995A
Tesla
|
0 / 0 |
7 |
|
|
5176 |
P995B
Suit and Tie
|
0 / 0 |
4 |
|
|
5175 |
P995C
Leaving the Bar
|
0 / 0 |
8 |
|
|
5174 |
P995D
Game
|
0 / 0 |
9 |
|
|
5173 |
P995E
Number Clicker
|
0 / 0 |
10 |
|
|
5172 |
P995F
Cowmpany Cowmpensation
|
0 / 0 |
10 |
|
|
5171 |
P996A
Hit the Lottery
|
0 / 0 |
3 |
|
|
5170 |
P996B
World Cup
|
0 / 0 |
4 |
|
|
5169 |
P997A
Convert to Ones
|
0 / 0 |
5 |
|
|
5168 |
P997B
Roman Digits
|
0 / 0 |
7 |
|
|
5167 |
P997C
Sky Full of Stars
|
0 / 0 |
9 |
|
|
5166 |
P997D
Cycles in product
|
0 / 0 |
10 |
|
|
5165 |
P997E
Good Subsegments
|
0 / 0 |
10 |
|
|
5164 |
P998A
Balloons
|
0 / 0 |
3 |
|
|
5163 |
P998B
Cutting
|
0 / 0 |
4 |
|
|
5162 |
P999A
Mishka and Contest
|
0 / 0 |
3 |
|
|
5161 |
P999B
Reversing Encryption
|
0 / 0 |
3 |
|
|
5160 |
P999C
Alphabetic Removals
|
0 / 0 |
4 |
|
|
5159 |
P999D
Equalize the Remainders
|
0 / 0 |
6 |
|
|
5158 |
P999E
Reachability from the Capital
|
0 / 0 |
7 |
|
|
5157 |
P999F
Cards and Joy
|
0 / 0 |
7 |
|
|
5156 |
P1000A
Codehorses T-shirts
|
0 / 0 |
4 |
|
|
5155 |
P1000B
Light It Up
|
0 / 0 |
5 |
|
|
5154 |
P1000C
Covered Points Count
|
0 / 0 |
5 |
|
|
5153 |
P1000D
Yet Another Problem On a Subsequence
|
0 / 0 |
6 |
|
|
5152 |
P1000E
We Need More Bosses
|
0 / 0 |
7 |
|
|
5151 |
P1000F
One Occurrence
|
0 / 0 |
9 |
|
|
5150 |
P1000G
Two-Paths
|
0 / 0 |
10 |
|
|
5149 |
P1001A
Generate plus state or minus state
|
0 / 0 |
3 |
|
|
5148 |
P1001B
Generate Bell state
|
0 / 0 |
4 |
|
|
5147 |
P1001C
Generate GHZ state
|
0 / 0 |
4 |
|
|
5146 |
P1001D
Distinguish plus state and minus state
|
0 / 0 |
4 |
|
|
5145 |
P1001E
Distinguish Bell states
|
0 / 0 |
5 |
|
|
5144 |
P1001F
Distinguish multi-qubit basis states
|
0 / 0 |
4 |
|
|
5143 |
P1001G
Oracle for f(x) = k-th element of x
|
0 / 0 |
4 |
|
|
5142 |
P1001H
Oracle for f(x) = parity of the number of 1s in x
|
0 / 0 |
4 |
|
|
5141 |
P1001I
Deutsch-Jozsa algorithm
|
0 / 0 |
5 |
|
|
5140 |
P1002A1
Generate superposition of all basis states
|
0 / 0 |
3 |
|
|
5139 |
P1002A2
Generate superposition of zero state and a basis state
|
0 / 0 |
4 |
|
|
5138 |
P1002A3
Generate superposition of two basis states
|
0 / 0 |
5 |
|
|
5137 |
P1002A4
Generate W state
|
0 / 0 |
6 |
|
|
5136 |
P1002B1
Distinguish zero state and W state
|
0 / 0 |
4 |
|
|
5135 |
P1002B2
Distinguish GHZ state and W state
|
0 / 0 |
5 |
|
|
5134 |
P1002B3
Distinguish four 2-qubit states
|
0 / 0 |
5 |
|
|
5133 |
P1002B4
Distinguish four 2-qubit states - 2
|
0 / 0 |
5 |
|
|
5132 |
P1002C1
Distinguish zero state and plus state with minimum error
|
0 / 0 |
5 |
|
|
5131 |
P1002C2
Distinguish zero state and plus state without errors
|
0 / 0 |
6 |
|
|
5130 |
P1002D1
Oracle for f(x) = b * x mod 2
|
0 / 0 |
4 |
|
|
5129 |
P1002D2
Oracle for f(x) = b * x + (1 - b) * (1 - x) mod 2
|
0 / 0 |
4 |
|
|
5128 |
P1002D3
Oracle for majority function
|
0 / 0 |
5 |
|
|
5127 |
P1002E1
Bernstein-Vazirani algorithm
|
0 / 0 |
5 |
|
|
5126 |
P1002E2
Another array reconstruction algorithm
|
0 / 0 |
6 |
|
|
5125 |
P1003A
Polycarp's Pockets
|
0 / 0 |
3 |
|
|
5124 |
P1003B
Binary String Constructing
|
0 / 0 |
4 |
|
|
5123 |
P1003C
Intense Heat
|
0 / 0 |
4 |
|
|
5122 |
P1003D
Coins and Queries
|
0 / 0 |
5 |
|
|
5121 |
P1003E
Tree Constructing
|
0 / 0 |
7 |
|
|
5120 |
P1003F
Abbreviation
|
0 / 0 |
8 |
|
|
5119 |
P1004A
Sonya and Hotels
|
0 / 0 |
3 |
|
|
5118 |
P1004B
Sonya and Exhibition
|
0 / 0 |
4 |
|
|
5117 |
P1004C
Sonya and Robots
|
0 / 0 |
4 |
|
|
5116 |
P1004D
Sonya and Matrix
|
0 / 0 |
8 |
|
|
5115 |
P1004E
Sonya and Ice Cream
|
0 / 0 |
9 |
|
|
5114 |
P1004F
Sonya and Bitwise OR
|
0 / 0 |
10 |
|
|
5113 |
P1005A
Tanya and Stairways
|
0 / 0 |
3 |
|
|
5112 |
P1005B
Delete from the Left
|
0 / 0 |
3 |
|
|
5111 |
P1005C
Summarize to the Power of Two
|
0 / 0 |
4 |
|
|
5110 |
P1005D
Polycarp and Div 3
|
0 / 0 |
5 |
|
|
5109 |
P1005E1
Median on Segments (Permutations Edition)
|
0 / 0 |
6 |
|
|
5108 |
P1005E2
Median on Segments (General Case Edition)
|
0 / 0 |
9 |
|
|
5107 |
P1005F
Berland and the Shortest Paths
|
0 / 0 |
7 |
|
|
5106 |
P1006A
Adjacent Replacements
|
0 / 0 |
3 |
|
|
5105 |
P1006B
Polycarp's Practice
|
0 / 0 |
4 |
