305224 | CF993C. Careful Maneuvering | 0 | 0 | 0.000% |
305225 | CF993D. Compute Power | 0 | 0 | 0.000% |
305226 | CF993E. Nikita and Order Statistics | 0 | 0 | 0.000% |
305227 | CF993F. The Moral Dilemma | 0 | 0 | 0.000% |
305228 | CF994A. Fingerprints | 0 | 0 | 0.000% |
305229 | CF994B. Knights of a Polygonal Table | 0 | 0 | 0.000% |
305230 | CF994C. Two Squares | 0 | 0 | 0.000% |
305231 | CF994D. Open Communication | 0 | 0 | 0.000% |
305232 | CF994E. Careful Maneuvering | 0 | 0 | 0.000% |
305233 | CF994F. Compute Power | 0 | 0 | 0.000% |
305234 | CF995A. Tesla | 0 | 0 | 0.000% |
305235 | CF995B. Suit and Tie | 0 | 0 | 0.000% |
305236 | CF995C. Leaving the Bar | 0 | 0 | 0.000% |
305237 | CF995D. Game | 0 | 0 | 0.000% |
305238 | CF995E. Number Clicker | 0 | 0 | 0.000% |
305239 | CF995F. Cowmpany Cowmpensation | 0 | 0 | 0.000% |
305240 | CF996A. Hit the Lottery | 0 | 0 | 0.000% |
305241 | CF996B. World Cup | 0 | 0 | 0.000% |
305242 | CF996C. Tesla | 0 | 0 | 0.000% |
305243 | CF996D. Suit and Tie | 0 | 0 | 0.000% |
305244 | CF996E. Leaving the Bar | 0 | 0 | 0.000% |
305245 | CF996F. Game | 0 | 0 | 0.000% |
305246 | CF997A. Convert to Ones | 0 | 0 | 0.000% |
305247 | CF997B. Roman Digits | 0 | 0 | 0.000% |
305248 | CF997C. Sky Full of Stars | 0 | 0 | 0.000% |
305249 | CF997D. Cycles in product | 0 | 0 | 0.000% |
305250 | CF997E. Good Subsegments | 0 | 0 | 0.000% |
305251 | CF998A. Balloons | 0 | 0 | 0.000% |
305252 | CF998B. Cutting | 0 | 0 | 0.000% |
305253 | CF998C. Convert to Ones | 0 | 0 | 0.000% |
305254 | CF998D. Roman Digits | 0 | 0 | 0.000% |
305255 | CF998E. Sky Full of Stars | 0 | 0 | 0.000% |
305256 | CF999A. Mishka and Contest | 0 | 25 | 0.000% |
305257 | CF999B. Reversing Encryption | 0 | 16 | 0.000% |
305258 | CF999C. Alphabetic Removals | 0 | 26 | 0.000% |
305259 | CF999D. Equalize the Remainders | 0 | 28 | 0.000% |
305260 | CF999E. Reachability from the Capital | 0 | 39 | 0.000% |
305261 | CF999F. Cards and Joy | 0 | 5 | 0.000% |
305262 | CF1000A. Codehorses T-shirts | 0 | 0 | 0.000% |
305263 | CF1000B. Light It Up | 0 | 0 | 0.000% |
305264 | CF1000C. Covered Points Count | 0 | 0 | 0.000% |
305265 | CF1000D. Yet Another Problem On a Subsequence | 0 | 0 | 0.000% |
305266 | CF1000E. We Need More Bosses | 0 | 0 | 0.000% |
305267 | CF1000F. One Occurrence | 0 | 0 | 0.000% |
305268 | CF1000G. Two-Paths | 0 | 0 | 0.000% |
305269 | CF1001A. Generate plus state or minus state | 0 | 0 | 0.000% |
305270 | CF1001B. Generate Bell state | 0 | 0 | 0.000% |
305271 | CF1001C. Generate GHZ state | 0 | 0 | 0.000% |
305272 | CF1001D. Distinguish plus state and minus state | 0 | 0 | 0.000% |
305273 | CF1001E. Distinguish Bell states | 0 | 0 | 0.000% |
305274 | CF1001F. Distinguish multi-qubit basis states | 0 | 0 | 0.000% |
305275 | CF1001G. Oracle for f(x) = k-th element of x | 0 | 0 | 0.000% |
305276 | CF1001H. Oracle for f(x) = parity of the number of 1s in x | 0 | 0 | 0.000% |
305277 | CF1001I. Deutsch-Jozsa algorithm | 0 | 0 | 0.000% |
305278 | CF1002A1. Generate superposition of all basis states | 0 | 0 | 0.000% |
305279 | CF1002A2. Generate superposition of zero state and a basis state | 0 | 0 | 0.000% |
305280 | CF1002A3. Generate superposition of two basis states | 0 | 0 | 0.000% |
305281 | CF1002A4. Generate W state | 0 | 0 | 0.000% |
305282 | CF1002B1. Distinguish zero state and W state | 0 | 0 | 0.000% |
305283 | CF1002B2. Distinguish GHZ state and W state | 0 | 0 | 0.000% |
305284 | CF1002B3. Distinguish four 2-qubit states | 0 | 0 | 0.000% |
305285 | CF1002B4. Distinguish four 2-qubit states - 2 | 0 | 0 | 0.000% |
305286 | CF1002C1. Distinguish zero state and plus state with minimum error | 0 | 0 | 0.000% |
305287 | CF1002C2. Distinguish zero state and plus state without errors | 0 | 0 | 0.000% |
305288 | CF1002D1. Oracle for f(x) = b * x mod 2 | 0 | 0 | 0.000% |
305289 | CF1002D2. Oracle for f(x) = b * x + (1 - b) * (1 - x) mod 2 | 0 | 0 | 0.000% |
305290 | CF1002D3. Oracle for majority function | 0 | 0 | 0.000% |
305291 | CF1002E1. Bernstein-Vazirani algorithm | 0 | 0 | 0.000% |
305292 | CF1002E2. Another array reconstruction algorithm | 0 | 0 | 0.000% |
305293 | CF1003A. Polycarp's Pockets | 0 | 1 | 0.000% |
305294 | CF1003B. Binary String Constructing | 0 | 0 | 0.000% |
305295 | CF1003C. Intense Heat | 0 | 0 | 0.000% |
305296 | CF1003D. Coins and Queries | 0 | 0 | 0.000% |
305297 | CF1003E. Tree Constructing | 0 | 0 | 0.000% |
305298 | CF1003F. Abbreviation | 0 | 0 | 0.000% |
305299 | CF1004A. Sonya and Hotels | 0 | 0 | 0.000% |
305300 | CF1004B. Sonya and Exhibition | 0 | 0 | 0.000% |
305301 | CF1004C. Sonya and Robots | 0 | 0 | 0.000% |
305302 | CF1004D. Sonya and Matrix | 0 | 0 | 0.000% |
305303 | CF1004E. Sonya and Ice Cream | 0 | 0 | 0.000% |
305304 | CF1004F. Sonya and Bitwise OR | 0 | 0 | 0.000% |
305305 | CF1005A. Tanya and Stairways | 0 | 0 | 0.000% |
305306 | CF1005B. Delete from the Left | 0 | 0 | 0.000% |
305307 | CF1005C. Summarize to the Power of Two | 0 | 0 | 0.000% |
305308 | CF1005D. Polycarp and Div 3 | 0 | 0 | 0.000% |
305309 | CF1005E1. Median on Segments (Permutations Edition) | 0 | 0 | 0.000% |
305310 | CF1005E2. Median on Segments (General Case Edition) | 0 | 1 | 0.000% |
305311 | CF1005F. Berland and the Shortest Paths | 0 | 0 | 0.000% |
305312 | CF1006A. Adjacent Replacements | 0 | 0 | 0.000% |
305313 | CF1006B. Polycarp's Practice | 0 | 0 | 0.000% |
305314 | CF1006C. Three Parts of the Array | 0 | 0 | 0.000% |
305315 | CF1006D. Two Strings Swaps | 0 | 0 | 0.000% |
305316 | CF1006E. Military Problem | 0 | 0 | 0.000% |
305317 | CF1006F. Xor-Paths | 0 | 0 | 0.000% |
305318 | CF1007A. Reorder the Array | 0 | 0 | 0.000% |
305319 | CF1007B. Pave the Parallelepiped | 0 | 0 | 0.000% |
305320 | CF1007C. Guess two numbers | 0 | 0 | 0.000% |
305321 | CF1007D. Ants | 0 | 0 | 0.000% |
305322 | CF1007E. Mini Metro | 0 | 0 | 0.000% |
305323 | CF1008A. Romaji | 0 | 0 | 0.000% |