Task: | Kyselyt |
Sender: | 10GOTO10 |
Submission time: | 2017-10-05 16:51:14 +0300 |
Language: | C++ |
Status: | READY |
Result: | 37 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 12 |
#2 | ACCEPTED | 25 |
#3 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.05 s | 1 | details |
#2 | ACCEPTED | 0.05 s | 2 | details |
#3 | WRONG ANSWER | 0.05 s | 3 | details |
Code
#include <iostream> #include <math.h> using namespace std; typedef unsigned long long ull; ull divCeiling(ull x, ull y) { ull q = x / y; if (q * y < x) ++q; return q; } ull power(ull b, ull e) { ull result = 1; for (ull i = 0; i < e; ++i) { result *= b; } return (result); } int main() { ull in[1001]; ull digitSum[19]; ull inputLen; ull inputDigits = 1; ull numWithAns; ull index; digitSum[0] = 0; cin>>inputLen; for(ull i = 1; i < 19; i++) { digitSum[i] = digitSum[i-1] + (i*9*power(10, i-1)); } for(ull i = 0; i < inputLen; i++) { cin>>in[i]; for(ull j = 1; j < 19; j++) { if(in[i]<=digitSum[j] && in[i]>digitSum[j-1]) { inputDigits = j; break; } } numWithAns = divCeiling((in[i]-digitSum[inputDigits-1]),inputDigits)+pow(10, inputDigits-1)-1; index = (digitSum[inputDigits]-in[i])%inputDigits; cout<<numWithAns%power(10,index+1)/power(10,index)<<"\n"; } 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: WRONG ANSWER
input |
---|
1000 672274832941907421 260504693279721732 646999966092970935 100853063389774434 ... |
correct output |
---|
7 2 2 0 9 ... |
user output |
---|
7 2 2 0 9 ... Truncated |