Task: | Greater Integers |
Sender: | eggag32 |
Submission time: | 2021-01-30 16:38:25 +0200 |
Language: | C++ (C++17) |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 35 |
#2 | ACCEPTED | 65 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.01 s | 1, 2 | details |
#2 | ACCEPTED | 0.01 s | 2 | details |
Code
#pragma GCC optimize ("O3")#pragma GCC target ("sse4")#include <bits/stdc++.h>using namespace std;typedef long long ll;typedef long double ld;typedef vector<int> vi;typedef pair<int, int> pi;#define debug(x) cerr << #x << ": " << x << endl#define debug2(x, y) debug(x), debug(y)#define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++)#define rep(i, a) for(int i = 0; i < (int)(a); i++)#define all(v) v.begin(), v.end()#define mp make_pair#define pb push_back#define lb lower_bound#define ub upper_bound#define fi first#define se second#define sq(x) ((x) * (x))template<class T> T gcd(T a, T b){ return ((b == 0) ? a : gcd(b, a % b)); }void solve(){string s;cin >> s;int n = s.size();repn(sz, n, n + 2){repn(i, 1, 10){string cmp = "";rep(k, sz) cmp += (char)('0' + i);if(sz > n || cmp > s){cout << cmp << '\n';return;}}}}int main(){ios_base::sync_with_stdio(false);cin.tie(0);//freopen("input.in", "r", stdin);//freopen("output.out", "w", stdout);int t;cin >> t;while(t--) solve();return 0;}/*Things to look out for:- Integer overflows- Make sure that max is large enough (2e9, 4e18)- Special casesBe careful!*/
Test details
Test 1
Group: 1, 2
Verdict: ACCEPTED
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: ACCEPTED
input |
---|
1000 735425311146082632 756615631808964686 466489470801941584 100417544394053220 ... |
correct output |
---|
777777777777777777 777777777777777777 555555555555555555 111111111111111111 555555555555555555 ... |
user output |
---|
777777777777777777 777777777777777777 555555555555555555 111111111111111111 55555555555555 ... Truncated |