Task: | Greater Integers |
Sender: | ScarletS |
Submission time: | 2021-01-30 18:02:05 +0200 |
Language: | C++ (C++17) |
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> #define ll long long #define sz(x) (int)(x).size() using namespace std; ll n; set<int> s; bool allSame(ll k) { s.clear(); while (k) { s.insert(k%10); k/=10; } if (sz(s)==1) return 1; return 0; } int findLen(ll k) { int r=0; while (k) { ++r; k/=10; } return r; } int firstDigit(ll k) { while (k>9) k/=10; return k; } void solve() { cin>>n; int l = findLen(n), f = firstDigit(n); if (!allSame(n)&&f==*(--s.end())) { while (l--) cout<<f; cout<<"\n"; return; } if (f==9) { f=0; ++l; } while (l--) cout<<(f+1); cout<<"\n"; return; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int tc; cin>>tc; while (tc--) solve(); return 0; }
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 |
---|
888888888888888888 888888888888888888 555555555555555555 222222222222222222 55555555555555 ... Truncated |