Microsoft Q# Coding Contest - Summer 2018

Solutions are presented as using the least memory and the fastest execution time. It also takes the top 10 most recent solutions from each language. If you want to limit to a specific index, click the "Solved" button and go to that problem.

ContestId
Name
Phase
Frozen
Duration (Seconds)
Relative Time
Start Time
1002 Microsoft Q# Coding Contest - Summer 2018 FINISHED False 259200 200930399 July 6, 2018, 4 p.m.

Problems

Solved$
Index
Name
Type
Tags
Community Tag
Rating
( 267 ) A4 Generate W state PROGRAMMING 2400

B'You are given N xe2 x80 x89= xe2 x80 x892k qubits (0 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89k xe2 x80 x89 xe2 x89 xa4 xe2 x80 x894) in zero state . Your task is to create a generalized W state on them. Generalized W state is an equal superposition of all basis states on N qubits that have Hamming weight equal to 1: For example, for N xe2 x80 x89= xe2 x80 x891, . You have to implement an operation which takes an array of N qubits as an input and has no output. The "output" of the operation is the state in which it leaves the qubits. Your code should have the following signature: '...

Tutorials

Editorial

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
40047646 alex20030190 A4 July 7, 2018, 1:02 a.m. OK Q# TESTS 5 233 0 2400
40053584 ryucc A4 July 7, 2018, 7:06 a.m. OK Q# TESTS 5 248 0 2400
40046212 panda42 A4 July 6, 2018, 10:58 p.m. OK Q# TESTS 5 248 0 2400
40043004 Gnay_Oahnauhz A4 July 6, 2018, 7:53 p.m. OK Q# TESTS 5 248 4710400 2400
40099025 IanCastro A4 July 9, 2018, 3 a.m. OK Q# TESTS 5 249 0 2400
40097342 eatmore A4 July 9, 2018, 1:07 a.m. OK Q# TESTS 5 249 0 2400
40072075 atablash A4 July 8, 2018, midnight OK Q# TESTS 5 249 0 2400
40059711 Electric-tric A4 July 7, 2018, 11:40 a.m. OK Q# TESTS 5 249 0 2400
40051282 AkshajK A4 July 7, 2018, 4:56 a.m. OK Q# TESTS 5 249 0 2400
40048215 sblazes A4 July 7, 2018, 1:47 a.m. OK Q# TESTS 5 249 0 2400

remove filters

Back to search problems