CSES - Datatähti 2017 alku - Results
Submission details
Task:Bittijono
Sender:lutrarutra
Submission time:2016-10-03 19:31:51 +0300
Language:Python3
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.06 s1details
#20.40 s2details
#30.78 s3details

Code

sA = [0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0]


count = int(input())

n = 0
kList = []
bArr = sA

while(n < count):
    kList.append(int(input()))
    n += 1

for k in kList:
    tempMod = k % 16
    if(sA[tempMod] == 0):
        tempArr = sA
    else:
        tempArr = reversed(sA)

    while(bArr.__len__() < (k - tempMod) / 16):
        bArr += reversed(bArr)


    if(k < 16):
        print(bArr[k-1])
    else:
        print(bArr[int((k-tempMod)/16)])

Test details

Test 1

Group: 1

Verdict:

input
100
62
9
12
73
...

correct output
1
1
1
0
1
...

user output
0
1
1
1
1
...

Test 2

Group: 2

Verdict:

input
100000
565433
141881
120108
825392
...

correct output
1
1
0
0
1
...

user output
1
0
1
0
0
...

Test 3

Group: 3

Verdict:

input
100000
374768524402011755
937067109466254318
389256426086302899
932585725667010169
...

correct output
0
1
1
1
1
...

user output
(empty)