|
|
5584 |
CF995D
Game
|
0 / 0 |
(None) |
|
|
5583 |
CF995E
Number Clicker
|
0 / 0 |
(None) |
|
|
5582 |
CF995F
Cowmpany Cowmpensation
|
0 / 0 |
(None) |
|
|
5581 |
CF996A
Hit the Lottery
|
0 / 0 |
(None) |
|
|
5580 |
CF996B
World Cup
|
0 / 0 |
(None) |
|
|
5578 |
CF997A
Convert to Ones
|
0 / 0 |
(None) |
|
|
5577 |
CF997B
Roman Digits
|
0 / 0 |
(None) |
|
|
5576 |
CF997C
Sky Full of Stars
|
0 / 0 |
(None) |
|
|
5575 |
CF997D
Cycles in product
|
0 / 0 |
(None) |
|
|
5574 |
CF997E
Good Subsegments
|
0 / 0 |
(None) |
|
|
5573 |
CF998A
Balloons
|
0 / 0 |
(None) |
|
|
5572 |
CF998B
Cutting
|
0 / 0 |
(None) |
|
|
5571 |
CF999A
Mishka and Contest
|
0 / 0 |
(None) |
|
|
5570 |
CF999B
Reversing Encryption
|
0 / 0 |
(None) |
|
|
5569 |
CF999C
Alphabetic Removals
|
0 / 0 |
(None) |
|
|
5567 |
CF999D
Equalize the Remainders
|
0 / 0 |
(None) |
|
|
5566 |
CF999E
Reachability from the Capital
|
0 / 0 |
(None) |
|
|
5565 |
CF999F
Cards and Joy
|
0 / 0 |
(None) |
|
|
5564 |
CF1000A
Codehorses T-shirts
|
0 / 0 |
(None) |
|
|
5563 |
CF1000B
Light It Up
|
0 / 0 |
(None) |
|
|
5562 |
CF1000C
Covered Points Count
|
0 / 0 |
(None) |
|
|
5561 |
CF1000D
Yet Another Problem On a Subsequence
|
0 / 0 |
(None) |
|
|
5560 |
CF1000E
We Need More Bosses
|
0 / 0 |
(None) |
|
|
5559 |
CF1000F
One Occurrence
|
0 / 0 |
(None) |
|
|
5558 |
CF1000G
Two-Paths
|
0 / 0 |
(None) |
|
|
5556 |
CF1001A
Generate plus state or minus state
|
0 / 0 |
(None) |
|
|
5555 |
CF1001B
Generate Bell state
|
0 / 0 |
(None) |
|
|
5554 |
CF1001C
Generate GHZ state
|
0 / 0 |
(None) |
|
|
5553 |
CF1001D
Distinguish plus state and minus state
|
0 / 0 |
(None) |
|
|
5552 |
CF1001E
Distinguish Bell states
|
0 / 0 |
(None) |
|
|
5551 |
CF1001F
Distinguish multi-qubit basis states
|
0 / 0 |
(None) |
|
|
5550 |
CF1001G
Oracle for f(x) = k-th element of x
|
0 / 0 |
(None) |
|
|
5549 |
CF1001H
Oracle for f(x) = parity of the number of 1s in x
|
0 / 0 |
(None) |
|
|
5548 |
CF1001I
Deutsch-Jozsa algorithm
|
0 / 0 |
(None) |
|
|
5547 |
CF1002A1
Generate superposition of all basis states
|
0 / 0 |
(None) |
|
|
5545 |
CF1002A2
Generate superposition of zero state and a basis state
|
0 / 0 |
(None) |
|
|
5544 |
CF1002A3
Generate superposition of two basis states
|
0 / 0 |
(None) |
|
|
5543 |
CF1002A4
Generate W state
|
0 / 0 |
(None) |
|
|
5542 |
CF1002B1
Distinguish zero state and W state
|
0 / 0 |
(None) |
|
|
5541 |
CF1002B2
Distinguish GHZ state and W state
|
0 / 0 |
(None) |
|
|
5540 |
CF1002B3
Distinguish four 2-qubit states
|
0 / 0 |
(None) |
|
|
5539 |
CF1002B4
Distinguish four 2-qubit states - 2
|
0 / 0 |
(None) |
|
|
5538 |
CF1002C1
Distinguish zero state and plus state with minimum error
|
0 / 0 |
(None) |
|
|
5537 |
CF1002C2
Distinguish zero state and plus state without errors
|
0 / 0 |
(None) |
|
|
5536 |
CF1002D1
Oracle for f(x) = b * x mod 2
|
0 / 0 |
(None) |
|
|
5534 |
CF1002D2
Oracle for f(x) = b * x + (1 - b) * (1 - x) mod 2
|
0 / 0 |
(None) |
|
|
5533 |
CF1002D3
Oracle for majority function
|
0 / 0 |
(None) |
|
|
5532 |
CF1002E1
Bernstein-Vazirani algorithm
|
0 / 0 |
(None) |
|
|
5531 |
CF1002E2
Another array reconstruction algorithm
|
0 / 0 |
(None) |
|
|
5530 |
CF1003A
Polycarp's Pockets
|
0 / 0 |
(None) |
|
|
5529 |
CF1003B
Binary String Constructing
|
0 / 0 |
(None) |
|
|
5528 |
CF1003C
Intense Heat
|
0 / 0 |
(None) |
|
|
5527 |
CF1003D
Coins and Queries
|
0 / 0 |
(None) |
|
|
5526 |
CF1003E
Tree Constructing
|
0 / 0 |
(None) |
|
|
5525 |
CF1003F
Abbreviation
|
0 / 0 |
(None) |
|
|
5522 |
CF1004A
Sonya and Hotels
|
0 / 0 |
(None) |
|
|
5521 |
CF1004B
Sonya and Exhibition
|
0 / 0 |
(None) |
|
|
5520 |
CF1004C
Sonya and Robots
|
0 / 0 |
(None) |
|
|
5519 |
CF1004D
Sonya and Matrix
|
0 / 0 |
(None) |
|
|
5518 |
CF1004E
Sonya and Ice Cream
|
0 / 0 |
(None) |
|
|
5517 |
CF1004F
Sonya and Bitwise OR
|
0 / 0 |
(None) |
|
|
5516 |
CF1005A
Tanya and Stairways
|
0 / 0 |
(None) |
|
|
5515 |
CF1005B
Delete from the Left
|
0 / 0 |
(None) |
|
|
5514 |
CF1005C
Summarize to the Power of Two
|
0 / 0 |
(None) |
|
|
5513 |
CF1005D
Polycarp and Div 3
|
0 / 0 |
(None) |
|
|
5511 |
CF1005E1
Median on Segments (Permutations Edition)
|
0 / 0 |
(None) |
|
|
5510 |
CF1005E2
Median on Segments (General Case Edition)
|
0 / 0 |
(None) |
|
|
5509 |
CF1005F
Berland and the Shortest Paths
|
0 / 0 |
(None) |
|
|
5508 |
CF1006A
Adjacent Replacements
|
0 / 0 |
(None) |
|
|
5507 |
CF1006B
Polycarp's Practice
|
0 / 0 |
(None) |
|
|
5506 |
CF1006C
Three Parts of the Array
|
0 / 0 |
(None) |
|
|
5505 |
CF1006D
Two Strings Swaps
|
0 / 0 |
(None) |
|
|
5504 |
CF1006E
Military Problem
|
0 / 0 |
(None) |
|
|
5503 |
CF1006F
Xor-Paths
|
0 / 0 |
(None) |
|
|
5502 |
CF1007A
Reorder the Array
|
0 / 0 |
(None) |
|
|
5500 |
CF1007B
Pave the Parallelepiped
|
0 / 0 |
(None) |
|
|
5499 |
CF1007C
Guess two numbers
|
0 / 0 |
(None) |
|
|
5498 |
CF1007D
Ants
|
0 / 0 |
(None) |
|
|
5497 |
CF1007E
Mini Metro
|
0 / 0 |
(None) |
|
|
5496 |
CF1008A
Romaji
|
0 / 0 |
(None) |
|
|
5495 |
CF1008B
Turn the Rectangles
|
0 / 0 |
(None) |
|
|
5494 |
CF1009A
Game Shopping
|
0 / 0 |
(None) |
|
|
5493 |
CF1009B
Minimum Ternary String
|
0 / 0 |
(None) |
|
|
5492 |
CF1009C
Annoying Present
|
0 / 0 |
(None) |
|
|
5491 |
CF1009D
Relatively Prime Graph
|
0 / 0 |
(None) |
|
|
5489 |
CF1009E
Intercity Travelling
|
0 / 0 |
(None) |
|
|
5488 |
CF1009F
Dominant Indices
|
0 / 0 |
(None) |
|
|
5487 |
CF1009G
Allowed Letters
|
0 / 0 |
(None) |
|
|
5486 |
CF1010A
Fly
|
0 / 0 |
(None) |
|
|
5485 |
CF1010B
Rocket
|
0 / 0 |
(None) |
|
|
5484 |
CF1010C
Border
|
0 / 0 |
(None) |
|
|
5483 |
CF1010D
Mars rover
|
0 / 0 |
(None) |
|
|
5482 |
CF1010E
Store
|
0 / 0 |
(None) |
|
|
5481 |
CF1010F
Tree
|
0 / 0 |
(None) |
|
|
5480 |
CF1011A
Stages
|
0 / 0 |
(None) |
|
|
5478 |
CF1011B
Planning The Expedition
|
0 / 0 |
(None) |
|
|
5477 |
CF1012A
Photo of The Sky
|
0 / 0 |
(None) |
|
|
5476 |
CF1012B
Chemical table
|
0 / 0 |
(None) |
|
|
5475 |
CF1012C
Hills
|
0 / 0 |
(None) |
|
|
5474 |
CF1012D
AB-Strings
|
0 / 0 |
(None) |
