Task: | Kyselyt |
Sender: | JAHugawa |
Submission time: | 2017-10-10 16:22:12 +0300 |
Language: | C++ |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 12 |
#2 | ACCEPTED | 25 |
#3 | ACCEPTED | 63 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.05 s | 1 | details |
#2 | ACCEPTED | 0.08 s | 2 | details |
#3 | ACCEPTED | 0.05 s | 3 | details |
Code
#include <iostream>using namespace std;int main() {int q;cin >> q;for(int i=0; i!=q; ++i) {unsigned long long k;cin >> k;unsigned long long l = 1; // smallest number in partial seriesunsigned long long n = 9; // numbers in partial seriesunsigned long long dc = 9; // digits in this and past partial seriesunsigned long long dn = 1; // digit per number in partial serieswhile (k > dc) {l*=10;n*=10;dn+=1;dc+=dn*n;}unsigned long long kps = k-dc+dn*n; // k in partial seriesunsigned long long number = l+(kps-1)/dn; // number matching kunsigned long long digitIndex = dn - 1 - ( (kps-1)%dn ); // index of matched digitunsigned long long digitModulo = 10;for (unsigned long long i=0; i!=digitIndex; ++i) {digitModulo*=10;}unsigned long long digitDivider = digitModulo/10;if (digitDivider==0) digitDivider=1;unsigned long long digit = (number%digitModulo)/digitDivider;cout << digit << endl;}}
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: ACCEPTED
input |
---|
1000 672274832941907421 260504693279721732 646999966092970935 100853063389774434 ... |
correct output |
---|
7 2 2 0 9 ... |
user output |
---|
7 2 2 0 9 ... Truncated |