Task: | Kyselyt |
Sender: | niklash |
Submission time: | 2017-10-10 20:26:35 +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.07 s | 1 | details |
#2 | WRONG ANSWER | 0.06 s | 2 | details |
#3 | WRONG ANSWER | 0.05 s | 3 | details |
Code
#include <iostream>#include <cmath>typedef unsigned long long int huge;// max value ~ 1.8e19using namespace std;huge startpos(int n){if (n==1) return 10;return startpos(n-1)+n*(9*pow(10,n-1));}int unelegant(huge n){if (n<10) return (int)n;int N=-1;unsigned int stage=log10(n)+1;unsigned int s=startpos(stage-1);for (unsigned int i=0;i<stage;++i){if ((n-s)%stage==i){N=((n-s-i)/(stage*(unsigned int)pow(10,stage-1-i))+(unsigned int)(i==0))%10;}}return N;}int main(int argc, char** argv){int maara; cin>>maara;huge values[maara];for (int i=0;i<maara;++i) cin>>values[i];for (int i=0;i<maara;++i) cout<<unelegant(values[i])<<endl;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 0 1 ... Truncated |
Test 3
Group: 3
Verdict: WRONG ANSWER
input |
---|
1000 672274832941907421 260504693279721732 646999966092970935 100853063389774434 ... |
correct output |
---|
7 2 2 0 9 ... |
user output |
---|
3 2 3 5 2 ... Truncated |