Task: | Kyselyt |
Sender: | b10011 |
Submission time: | 2017-10-03 19:39:44 +0300 |
Language: | Python3 |
Status: | READY |
Result: | 37 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 12 |
#2 | ACCEPTED | 25 |
#3 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.08 s | 1 | details |
#2 | ACCEPTED | 0.08 s | 2 | details |
#3 | WRONG ANSWER | 0.12 s | 3 | details |
Code
import math def calculate(position): subposition = position numbers = 1 while subposition > 9*(10**(numbers-1))*numbers: subposition -= 9*(10**(numbers-1))*numbers numbers += 1 subposition = float(subposition)/numbers subrounded = math.ceil(subposition) index = numbers-round((subrounded-subposition) * numbers)-1 for i in range(0, numbers-1): subrounded += 9*(10**i) return str(subrounded)[index] list = [] count = int(input()) for i in range(0, count): list.append(calculate(int(input()))) for i in range(0, count): print(str(list[i]))
Test details
Test 1
Group: 1
Verdict: ACCEPTED
input |
---|
1000 582 214 723 273 ... |
correct output |
---|
0 1 7 7 6 ... |
user output |
---|
0 1 7 7 6 ... Truncated |
Test 2
Group: 2
Verdict: ACCEPTED
input |
---|
1000 615664 916441 627600 279508 ... |
correct output |
---|
1 2 3 2 2 ... |
user output |
---|
1 2 3 2 2 ... Truncated |
Test 3
Group: 3
Verdict: WRONG ANSWER
input |
---|
1000 672274832941907421 260504693279721732 646999966092970935 100853063389774434 ... |
correct output |
---|
7 2 2 0 9 ... |
user output |
---|
7 4 1 6 7 ... Truncated |