Task: | Kyselyt |
Sender: | paavoee |
Submission time: | 2017-10-08 00:27:40 +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.06 s | 1 | details |
#2 | ACCEPTED | 0.06 s | 2 | details |
#3 | ACCEPTED | 0.05 s | 3 | details |
Code
#include <iostream> #include <vector> using namespace std; inline unsigned long long int pow(unsigned int base, unsigned long int exponent) { unsigned long long int r = 1; while (exponent--) r *= base; return r; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); unsigned short int q; vector<unsigned long long int> kt; cin >> q; for (int i = 0; i < q; i++) { unsigned long long int tmp; cin >> tmp; kt.push_back(tmp); } for (unsigned int ki = 0; ki < kt.size(); ki++) { unsigned long long int k = kt[ki]; if (k < 10) { cout << k << endl; continue; } k -= 10; unsigned long long int numbers = 90; for (unsigned long int n = 2; true; n++, numbers *= 10) { unsigned long long int uplimit = n * numbers; if (k < uplimit) { int j = k % n; if (j) cout << (k / (n * pow(10, n-1-j))) % 10 << endl; else cout << k / (n * pow(10, n-1)) + 1 << endl; break; } k -= uplimit; } } return 0; }
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 |