| Task: | Kyselyt |
| Sender: | 10GOTO10 |
| Submission time: | 2017-10-05 05:18:42 +0300 |
| Language: | C++ |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| #3 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | WRONG ANSWER | 0.04 s | 1 | details |
| #2 | WRONG ANSWER | 0.04 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 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] = (ull)0;
cin>>inputLen;
for(ull i = (ull)1; i < (ull)19; i++) {
digitSum[i] = digitSum[i-(ull)1] + (i*9*power((ull)10, i-(ull)1));
}
for(ull i = (ull)0; i < inputLen; i++) {
cin>>in[i];
for(ull j = (ull)1; j < (ull)19; j++) {
if(in[i]<=digitSum[j] && in[i]>digitSum[j-(ull)1]) {
inputDigits = j;
break;
}
}
numWithAns = ((in[i]-digitSum[inputDigits-(ull)1])/inputDigits+pow((ull)10, inputDigits-(ull)1)-(ull)1);
index = (digitSum[inputDigits]-in[i])%inputDigits;
cout<<numWithAns%power((ull)10,index+(ull)1)/power((ull)10,index)<<"\n";
}
return 0;
}Test details
Test 1
Group: 1
Verdict: WRONG ANSWER
| 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: WRONG ANSWER
| 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 |
