The following languages are only available languages for the problems from the contest

Microsoft Q# Coding Contest - Summer 2018:

- Microsoft Q#

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

E2. Another array reconstruction algorithm

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou are given a quantum oracle - an operation on *N* + 1 qubits which implements a function . You are guaranteed that the function *f* implemented by the oracle can be represented in the following form (oracle from problem D2):

Here (a vector of *N* integers, each of which can be 0 or 1), and is a vector of *N* 1s.

Your task is to reconstruct the array which could produce the given oracle. Your code is allowed to call the given oracle only once.

You have to implement an operation which takes the following inputs:

- an integer
*N*- the number of qubits in the oracle input (1 ≤*N*≤ 8), - an oracle
*Uf*, implemented as an operation with signature ((Qubit[], Qubit) => ()), i.e., an operation which takes as input an array of qubits and an output qubit and has no output.

The return of your operation is an array of integers of length *N*, each of them 0 or 1.

Note that in this problem we're comparing the oracle generated by your return to the oracle *Uf*, instead of comparing your return to the (hidden) value of used to generate *Uf*. This means that any kind of incorrect return results in "Runtime Error" verdict, as well as actual runtime errors like releasing qubits in non-zero state.

Your code should have the following signature:

namespace Solution {

open Microsoft.Quantum.Primitive;

open Microsoft.Quantum.Canon;

operation Solve (N : Int, Uf : ((Qubit[], Qubit) => ())) : Int[]

{

body

{

// your code here

}

}

}

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/16/2019 20:59:01 (e2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|