|
5368 |
P989D A Shade of Moonlight
|
0 / 0 |
9 |
|
5367 |
P989E A Trance of Nightfall
|
0 / 0 |
10 |
|
5366 |
P990A Commentary Boxes
|
0 / 0 |
3 |
|
5365 |
P990B Micro-World
|
0 / 0 |
4 |
|
5364 |
P990C Bracket Sequences Concatenation Problem
|
0 / 0 |
5 |
|
5363 |
P990D Graph And Its Complement
|
0 / 0 |
5 |
|
5362 |
P990E Post Lamps
|
0 / 0 |
7 |
|
5361 |
P990F Flow Control
|
0 / 0 |
9 |
|
5360 |
P990G GCD Counting
|
0 / 0 |
9 |
|
5359 |
P991A If at first you don't succeed...
|
0 / 0 |
3 |
|
5358 |
P991B Getting an A
|
0 / 0 |
3 |
|
5357 |
P991C Candies
|
0 / 0 |
5 |
|
5356 |
P991D Bishwock
|
0 / 0 |
5 |
|
5355 |
P991E Bus Number
|
0 / 0 |
6 |
|
5354 |
P991F Concise and clear
|
0 / 0 |
10 |
|
5353 |
P992A Nastya and an Array
|
0 / 0 |
3 |
|
5352 |
P992B Nastya Studies Informatics
|
0 / 0 |
5 |
|
5351 |
P992C Nastya and a Wardrobe
|
0 / 0 |
5 |
|
5350 |
P992D Nastya and a Game
|
0 / 0 |
7 |
|
5349 |
P992E Nastya and King-Shamans
|
0 / 0 |
9 |
|
5348 |
P993A Two Squares
|
0 / 0 |
5 |
|
5347 |
P993B Open Communication
|
0 / 0 |
6 |
|
5346 |
P993C Careful Maneuvering
|
0 / 0 |
7 |
|
5345 |
P993D Compute Power
|
0 / 0 |
9 |
|
5344 |
P993E Nikita and Order Statistics
|
0 / 0 |
8 |
|
5343 |
P993F The Moral Dilemma
|
0 / 0 |
10 |
|
5342 |
P994A Fingerprints
|
0 / 0 |
3 |
|
5341 |
P994B Knights of a Polygonal Table
|
0 / 0 |
4 |
|
5340 |
P995A Tesla
|
0 / 0 |
7 |
|
5339 |
P995B Suit and Tie
|
0 / 0 |
4 |
|
5338 |
P995C Leaving the Bar
|
0 / 0 |
8 |
|
5337 |
P995D Game
|
0 / 0 |
9 |
|
5336 |
P995E Number Clicker
|
0 / 0 |
10 |
|
5335 |
P995F Cowmpany Cowmpensation
|
0 / 0 |
10 |
|
5334 |
P996A Hit the Lottery
|
0 / 0 |
3 |
|
5333 |
P996B World Cup
|
0 / 0 |
4 |
|
5332 |
P997A Convert to Ones
|
0 / 0 |
5 |
|
5331 |
P997B Roman Digits
|
0 / 0 |
7 |
|
5330 |
P997C Sky Full of Stars
|
0 / 0 |
9 |
|
5329 |
P997D Cycles in product
|
0 / 0 |
10 |
|
5328 |
P997E Good Subsegments
|
0 / 0 |
10 |
|
5327 |
P998A Balloons
|
0 / 0 |
3 |
|
5326 |
P998B Cutting
|
0 / 0 |
4 |
|
5325 |
P999A Mishka and Contest
|
0 / 0 |
3 |
|
5324 |
P999B Reversing Encryption
|
0 / 0 |
3 |
|
5323 |
P999C Alphabetic Removals
|
0 / 0 |
4 |
|
5322 |
P999D Equalize the Remainders
|
0 / 0 |
6 |
|
5321 |
P999E Reachability from the Capital
|
1 / 1 |
7 |
|
5320 |
P999F Cards and Joy
|
0 / 0 |
7 |
|
5319 |
P1000A Codehorses T-shirts
|
0 / 0 |
4 |
|
5318 |
P1000B Light It Up
|
0 / 0 |
5 |
|
5317 |
P1000C Covered Points Count
|
0 / 0 |
5 |
|
5316 |
P1000D Yet Another Problem On a Subsequence
|
0 / 0 |
6 |
|
5315 |
P1000E We Need More Bosses
|
1 / 1 |
7 |
|
5314 |
P1000F One Occurrence
|
0 / 0 |
9 |
|
5313 |
P1000G Two-Paths
|
0 / 0 |
10 |
|
5312 |
P1001A Generate plus state or minus state
|
0 / 0 |
3 |
|
5311 |
P1001B Generate Bell state
|
0 / 0 |
4 |
|
5310 |
P1001C Generate GHZ state
|
0 / 0 |
4 |
|
5309 |
P1001D Distinguish plus state and minus state
|
0 / 0 |
4 |
|
5308 |
P1001E Distinguish Bell states
|
0 / 0 |
5 |
|
5307 |
P1001F Distinguish multi-qubit basis states
|
0 / 0 |
4 |
|
5306 |
P1001G Oracle for f(x) = k-th element of x
|
0 / 0 |
4 |
|
5305 |
P1001H Oracle for f(x) = parity of the number of 1s in x
|
0 / 0 |
4 |
|
5304 |
P1001I Deutsch-Jozsa algorithm
|
0 / 0 |
5 |
|
5303 |
P1002A1 Generate superposition of all basis states
|
0 / 0 |
3 |
|
5302 |
P1002A2 Generate superposition of zero state and a basis state
|
0 / 0 |
4 |
|
5301 |
P1002A3 Generate superposition of two basis states
|
0 / 0 |
5 |
|
5300 |
P1002A4 Generate W state
|
0 / 0 |
6 |
|
5299 |
P1002B1 Distinguish zero state and W state
|
0 / 0 |
4 |
|
5298 |
P1002B2 Distinguish GHZ state and W state
|
0 / 0 |
5 |
|
5297 |
P1002B3 Distinguish four 2-qubit states
|
0 / 0 |
5 |
|
5296 |
P1002B4 Distinguish four 2-qubit states - 2
|
0 / 0 |
5 |
|
5295 |
P1002C1 Distinguish zero state and plus state with minimum error
|
0 / 0 |
5 |
|
5294 |
P1002C2 Distinguish zero state and plus state without errors
|
0 / 0 |
6 |
|
5293 |
P1002D1 Oracle for f(x) = b * x mod 2
|
0 / 0 |
4 |
|
5292 |
P1002D2 Oracle for f(x) = b * x + (1 - b) * (1 - x) mod 2
|
0 / 0 |
4 |
|
5291 |
P1002D3 Oracle for majority function
|
0 / 0 |
5 |
|
5290 |
P1002E1 Bernstein-Vazirani algorithm
|
0 / 0 |
5 |
|
5289 |
P1002E2 Another array reconstruction algorithm
|
0 / 0 |
6 |
|
5288 |
P1003A Polycarp's Pockets
|
0 / 0 |
3 |
|
5287 |
P1003B Binary String Constructing
|
0 / 0 |
4 |
|
5286 |
P1003C Intense Heat
|
0 / 0 |
4 |
|
5285 |
P1003D Coins and Queries
|
0 / 0 |
5 |
|
5284 |
P1003E Tree Constructing
|
1 / 2 |
7 |
|
5283 |
P1003F Abbreviation
|
0 / 0 |
8 |
|
5282 |
P1004A Sonya and Hotels
|
0 / 0 |
3 |
|
5281 |
P1004B Sonya and Exhibition
|
0 / 0 |
4 |
|
5280 |
P1004C Sonya and Robots
|
0 / 0 |
4 |
|
5279 |
P1004D Sonya and Matrix
|
0 / 0 |
8 |
|
5278 |
P1004E Sonya and Ice Cream
|
0 / 0 |
9 |
|
5277 |
P1004F Sonya and Bitwise OR
|
0 / 0 |
10 |
|
5276 |
P1005A Tanya and Stairways
|
0 / 0 |
3 |
|
5275 |
P1005B Delete from the Left
|
0 / 0 |
3 |
|
5274 |
P1005C Summarize to the Power of Two
|
0 / 0 |
4 |
|
5273 |
P1005D Polycarp and Div 3
|
0 / 0 |
5 |
|
5272 |
P1005E1 Median on Segments (Permutations Edition)
|
0 / 0 |
6 |
|
5271 |
P1005E2 Median on Segments (General Case Edition)
|
0 / 0 |
9 |
|
5270 |
P1005F Berland and the Shortest Paths
|
0 / 0 |
7 |
|
5269 |
P1006A Adjacent Replacements
|
0 / 0 |
3 |