| Task: | Greater Integers |
| Sender: | IOI_EJOI_2021 |
| Submission time: | 2021-01-31 18:02:29 +0200 |
| Language: | C++ (C++11) |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | WRONG ANSWER | 0.01 s | 1, 2 | details |
| #2 | WRONG ANSWER | 0.01 s | 2 | details |
Code
#include<bits/stdc++.h>
using namespace std;
int lst(int n)
{
while(n)
{
if(n<10)
return n%10;
n/=10;
}
return n;
}
int calc(int di,int n)
{
int nc(0),sm(0);
while(n)
{
++nc;
n/=10;
}
for(int i=0; i<nc; ++i)
sm+=pow(10,i)*di;
return sm;
}
int main()
{
int t;
cin>>t;
while(t--)
{
long long int n;
cin>>n;
if(n<9)
cout<<n+1<<"\n";
else
{
int nm=calc(lst(n),n);
if(n<nm)
cout<<nm<<"\n";
else
{
int an=lst(n)+1;
if(n==9)
an=11;
while(n)
{
cout<<an;
n/=10;
}
cout<<"\n";
}
}
}
}
Test details
Test 1
Group: 1, 2
Verdict: WRONG ANSWER
| input |
|---|
| 1000 1 2 3 4 ... |
| correct output |
|---|
| 2 3 4 5 6 ... |
| user output |
|---|
| 2 3 4 5 6 ... Truncated |
Test 2
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 1000 735425311146082632 756615631808964686 466489470801941584 100417544394053220 ... |
| correct output |
|---|
| 777777777777777777 777777777777777777 555555555555555555 111111111111111111 555555555555555555 ... |
| user output |
|---|
| -1-1-1-1-1-1-1-1-1-1-1-1-1-1-1... Truncated |