Microsoft Q# Coding Contest - Summer 2018 - Warmup

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
1001 Microsoft Q# Coding Contest - Summer 2018 - Warmup FINISHED False 259200 201535199 June 29, 2018, 4 p.m.

Problems

Solved$
Index
Name
Type
Tags
Community Tag
Rating
( 533 ) H Oracle for f(x) = parity of the number of 1s in x PROGRAMMING *special 2500

B'Implement a quantum oracle on N qubits which implements the following function: , i.e., the value of the function is 1 if x has odd number of 1s, and 0 otherwise. You have to implement an operation which takes the following inputs: The operation doesn 't have an output; the "output" of your solution is the state in which it left the qubits. Your code should have the following signature: '...

Tutorials

Full editorial

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
39798117 Lion. H June 30, 2018, 12:47 p.m. OK Q# TESTS 8 265 2969600 2500
39782022 adsz H June 29, 2018, 8:50 p.m. OK Q# TESTS 8 265 2969600 2500
39781888 killer_god H June 29, 2018, 8:43 p.m. OK Q# TESTS 8 265 2969600 2500
39800306 aryaman H June 30, 2018, 2:12 p.m. OK Q# TESTS 8 280 2764800 2500
39872969 tourist H July 2, 2018, 3:48 p.m. OK Q# TESTS 8 280 2867200 2500
39864531 snehalgupta H July 2, 2018, 10:12 a.m. OK Q# TESTS 8 280 2867200 2500
39855610 mingi H July 2, 2018, 3:07 a.m. OK Q# TESTS 8 280 2867200 2500
39852023 fishy15 H July 1, 2018, 10 p.m. OK Q# TESTS 8 280 2867200 2500
39845098 Victor_chen H July 1, 2018, 4:26 p.m. OK Q# TESTS 8 280 2867200 2500
39810787 ekzhang H July 1, 2018, 2:22 a.m. OK Q# TESTS 8 280 2867200 2500

remove filters

Back to search problems