Task: | Bittijono |
Sender: | ruotsalaineno |
Submission time: | 2016-10-04 14:21:26 +0300 |
Language: | Python2 |
Status: | READY |
Result: | 29 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 10 |
#2 | ACCEPTED | 19 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.07 s | 1 | details |
#2 | ACCEPTED | 1.65 s | 2 | details |
#3 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
import math inputs = list() length = int(input()) for x in range(length): inputs.append(int(input())) def decrease( n ): base = math.floor(math.log(n,2)); power = pow(2,base) if ( power == n): power = power / 2 return n - power def solve( n ): tries = 0 while (n != 1): n = decrease(n) tries += 1 return tries % 2 for x in range(length): print(solve(inputs[x]))
Test details
Test 1
Group: 1
Verdict: ACCEPTED
input |
---|
100 62 9 12 73 ... |
correct output |
---|
1 1 1 0 1 ... |
user output |
---|
1 1 1 0 1 ... |
Test 2
Group: 2
Verdict: ACCEPTED
input |
---|
100000 565433 141881 120108 825392 ... |
correct output |
---|
1 1 0 0 1 ... |
user output |
---|
1 1 0 0 1 ... |
Test 3
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 374768524402011755 937067109466254318 389256426086302899 932585725667010169 ... |
correct output |
---|
0 1 1 1 1 ... |
user output |
---|
(empty) |