Task: | Bittijono |
Sender: | JeHugawa |
Submission time: | 2016-10-07 00:27:11 +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.05 s | 1 | details |
#2 | ACCEPTED | 0.38 s | 2 | details |
#3 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
i = raw_input() x = [] bit = "01" for n in range(0,int(i)): d = raw_input() x.append(int(d)) for z in x: while(len(bit) < int(z)): for y in bit: if y == "0": bit = bit + "1" else: bit = bit + "0" print bit[z-1]
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) |