|
|
4784 |
P989E A Trance of Nightfall
|
0 / 0 |
10 |
|
|
4783 |
P990A Commentary Boxes
|
0 / 0 |
3 |
|
|
4782 |
P990B Micro-World
|
0 / 0 |
4 |
|
|
4781 |
P990C Bracket Sequences Concatenation Problem
|
0 / 0 |
5 |
|
|
4780 |
P990D Graph And Its Complement
|
0 / 0 |
5 |
|
|
4779 |
P990E Post Lamps
|
0 / 0 |
7 |
|
|
4778 |
P990F Flow Control
|
0 / 0 |
9 |
|
|
4777 |
P990G GCD Counting
|
0 / 0 |
9 |
|
|
4776 |
P991A If at first you don't succeed...
|
0 / 0 |
3 |
|
|
4775 |
P991B Getting an A
|
0 / 0 |
3 |
|
|
4774 |
P991C Candies
|
0 / 0 |
5 |
|
|
4773 |
P991D Bishwock
|
0 / 0 |
5 |
|
|
4772 |
P991E Bus Number
|
0 / 0 |
6 |
|
|
4771 |
P991F Concise and clear
|
0 / 0 |
10 |
|
|
4770 |
P992A Nastya and an Array
|
0 / 0 |
3 |
|
|
4769 |
P992B Nastya Studies Informatics
|
0 / 0 |
5 |
|
|
4768 |
P992C Nastya and a Wardrobe
|
0 / 0 |
5 |
|
|
4767 |
P992D Nastya and a Game
|
0 / 0 |
7 |
|
|
4766 |
P992E Nastya and King-Shamans
|
0 / 0 |
9 |
|
|
4765 |
P993A Two Squares
|
0 / 0 |
5 |
|
|
4764 |
P993B Open Communication
|
0 / 0 |
6 |
|
|
4763 |
P993C Careful Maneuvering
|
0 / 0 |
7 |
|
|
4762 |
P993D Compute Power
|
0 / 0 |
9 |
|
|
4761 |
P993E Nikita and Order Statistics
|
0 / 0 |
8 |
|
|
4760 |
P993F The Moral Dilemma
|
0 / 0 |
10 |
|
|
4759 |
P994A Fingerprints
|
0 / 0 |
3 |
|
|
4758 |
P994B Knights of a Polygonal Table
|
0 / 0 |
4 |
|
|
4757 |
P995A Tesla
|
0 / 0 |
7 |
|
|
4756 |
P995B Suit and Tie
|
0 / 0 |
4 |
|
|
4755 |
P995C Leaving the Bar
|
0 / 0 |
8 |
|
|
4754 |
P995D Game
|
0 / 0 |
9 |
|
|
4753 |
P995E Number Clicker
|
0 / 0 |
10 |
|
|
4752 |
P995F Cowmpany Cowmpensation
|
0 / 0 |
10 |
|
|
4751 |
P996A Hit the Lottery
|
0 / 0 |
3 |
|
|
4750 |
P996B World Cup
|
0 / 0 |
4 |
|
|
4749 |
P997A Convert to Ones
|
0 / 0 |
5 |
|
|
4748 |
P997B Roman Digits
|
0 / 0 |
7 |
|
|
4747 |
P997C Sky Full of Stars
|
0 / 0 |
9 |
|
|
4746 |
P997D Cycles in product
|
0 / 0 |
10 |
|
|
4745 |
P997E Good Subsegments
|
0 / 0 |
10 |
|
|
4744 |
P998A Balloons
|
0 / 0 |
3 |
|
|
4743 |
P998B Cutting
|
0 / 0 |
4 |
|
|
4742 |
P999A Mishka and Contest
|
0 / 0 |
3 |
|
|
4741 |
P999B Reversing Encryption
|
0 / 0 |
3 |
|
|
4740 |
P999C Alphabetic Removals
|
0 / 0 |
4 |
|
|
4739 |
P999D Equalize the Remainders
|
0 / 0 |
6 |
|
|
4738 |
P999E Reachability from the Capital
|
0 / 0 |
7 |
|
|
4737 |
P999F Cards and Joy
|
0 / 0 |
7 |
|
|
4736 |
P1000A Codehorses T-shirts
|
0 / 0 |
4 |
|
|
4735 |
P1000B Light It Up
|
0 / 0 |
5 |
|
|
4734 |
P1000C Covered Points Count
|
0 / 0 |
5 |
|
|
4733 |
P1000D Yet Another Problem On a Subsequence
|
0 / 0 |
6 |
|
|
4732 |
P1000E We Need More Bosses
|
0 / 0 |
7 |
|
|
4731 |
P1000F One Occurrence
|
0 / 0 |
9 |
|
|
4730 |
P1000G Two-Paths
|
0 / 0 |
10 |
|
|
4729 |
P1001A Generate plus state or minus state
|
0 / 0 |
3 |
|
|
4728 |
P1001B Generate Bell state
|
0 / 0 |
4 |
|
|
4727 |
P1001C Generate GHZ state
|
0 / 0 |
4 |
|
|
4726 |
P1001D Distinguish plus state and minus state
|
0 / 0 |
4 |
|
|
4725 |
P1001E Distinguish Bell states
|
0 / 0 |
5 |
|
|
4724 |
P1001F Distinguish multi-qubit basis states
|
0 / 0 |
4 |
|
|
4723 |
P1001G Oracle for f(x) = k-th element of x
|
0 / 0 |
4 |
|
|
4722 |
P1001H Oracle for f(x) = parity of the number of 1s in x
|
0 / 0 |
4 |
|
|
4721 |
P1001I Deutsch-Jozsa algorithm
|
0 / 0 |
5 |
|
|
4720 |
P1002A1 Generate superposition of all basis states
|
0 / 0 |
3 |
|
|
4719 |
P1002A2 Generate superposition of zero state and a basis state
|
0 / 0 |
4 |
|
|
4718 |
P1002A3 Generate superposition of two basis states
|
0 / 0 |
5 |
|
|
4717 |
P1002A4 Generate W state
|
0 / 0 |
6 |
|
|
4716 |
P1002B1 Distinguish zero state and W state
|
0 / 0 |
4 |
|
|
4715 |
P1002B2 Distinguish GHZ state and W state
|
0 / 0 |
5 |
|
|
4714 |
P1002B3 Distinguish four 2-qubit states
|
0 / 0 |
5 |
|
|
4713 |
P1002B4 Distinguish four 2-qubit states - 2
|
0 / 0 |
5 |
|
|
4712 |
P1002C1 Distinguish zero state and plus state with minimum error
|
0 / 0 |
5 |
|
|
4711 |
P1002C2 Distinguish zero state and plus state without errors
|
0 / 0 |
6 |
|
|
4710 |
P1002D1 Oracle for f(x) = b * x mod 2
|
0 / 0 |
4 |
|
|
4709 |
P1002D2 Oracle for f(x) = b * x + (1 - b) * (1 - x) mod 2
|
0 / 0 |
4 |
|
|
4708 |
P1002D3 Oracle for majority function
|
0 / 0 |
5 |
|
|
4707 |
P1002E1 Bernstein-Vazirani algorithm
|
0 / 0 |
5 |
|
|
4706 |
P1002E2 Another array reconstruction algorithm
|
0 / 0 |
6 |
|
|
4705 |
P1003A Polycarp's Pockets
|
0 / 0 |
3 |
|
|
4704 |
P1003B Binary String Constructing
|
0 / 0 |
4 |
|
|
4703 |
P1003C Intense Heat
|
0 / 0 |
4 |
|
|
4702 |
P1003D Coins and Queries
|
0 / 0 |
5 |
|
|
4701 |
P1003E Tree Constructing
|
0 / 0 |
7 |
|
|
4700 |
P1003F Abbreviation
|
0 / 0 |
8 |
|
|
4699 |
P1004A Sonya and Hotels
|
0 / 0 |
3 |
|
|
4698 |
P1004B Sonya and Exhibition
|
0 / 0 |
4 |
|
|
4697 |
P1004C Sonya and Robots
|
0 / 0 |
4 |
|
|
4696 |
P1004D Sonya and Matrix
|
0 / 0 |
8 |
|
|
4695 |
P1004E Sonya and Ice Cream
|
0 / 0 |
9 |
|
|
4694 |
P1004F Sonya and Bitwise OR
|
0 / 0 |
10 |
|
|
4693 |
P1005A Tanya and Stairways
|
0 / 0 |
3 |
|
|
4692 |
P1005B Delete from the Left
|
0 / 0 |
3 |
|
|
4691 |
P1005C Summarize to the Power of Two
|
0 / 0 |
4 |
|
|
4690 |
P1005D Polycarp and Div 3
|
0 / 0 |
5 |
|
|
4689 |
P1005E1 Median on Segments (Permutations Edition)
|
0 / 0 |
6 |
|
|
4688 |
P1005E2 Median on Segments (General Case Edition)
|
0 / 0 |
9 |
|
|
4687 |
P1005F Berland and the Shortest Paths
|
0 / 0 |
7 |
|
|
4686 |
P1006A Adjacent Replacements
|
0 / 0 |
3 |
|
|
4685 |
P1006B Polycarp's Practice
|
0 / 0 |
4 |
