Task: | Greater Integers |
Sender: | b23v |
Submission time: | 2021-01-30 16:33:15 +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
#include <iostream>#include <vector>#include <algorithm>#include <set>#include <map>#include <climits>#include <cstring>using namespace std;using ll = long long;using ull = unsigned long long;using vi = vector<int>;using ii = pair<int,int>;using vii = vector<pair<int,int>>;using vb = vector<bool>;template<typename T>using Graph = vector<vector<T>>;void solve(){ll n; cin >> n;ll mn = LONG_MAX;for(int i = 1; i <= 9; ++i){ll tn = 0;while(tn <= n){tn = tn * 10LL + i;}mn = min(mn, tn);}cout << mn << '\n';}int main (){#ifdef LOCALfreopen("input.txt", "rt", stdin);freopen("output.txt", "wt", stdout);#endifios_base::sync_with_stdio(false);cin.tie(0);int tc = 1;cin >> tc;while(tc--) solve();}
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 |