Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.004 s | 1 KBi |
#2 |
Correcto
|
0.004 s | 1 KBi |
#3 |
Correcto
|
0.004 s | 1 KBi |
#4 |
Correcto
|
0.005 s | 1 KBi |
#5 |
Correcto
|
0.004 s | 1 KBi |
#6 |
Correcto
|
0.008 s | 1 KBi |
#7 |
Correcto
|
0.006 s | 1 KBi |
#8 |
Correcto
|
0.006 s | 1 KBi |
#9 |
Correcto
|
0.005 s | 1 KBi |
#10 |
Correcto
|
0.003 s | 1 KBi |
#11 |
Correcto
|
0.005 s | 1 KBi |
#12 |
Correcto
|
0.004 s | 1 KBi |
#13 |
Correcto
|
0.004 s | 1 KBi |
#14 |
Correcto
|
0.004 s | 1 KBi |
#15 |
Correcto
|
0.005 s | 1 KBi |
#16 |
Correcto
|
0.005 s | 1 KBi |
#17 |
Correcto
|
0.007 s | 1 KBi |
#18 |
Correcto
|
0.007 s | 1 KBi |
#19 |
Correcto
|
0.004 s | 1 KBi |
#20 |
Correcto
|
0.004 s | 1 KBi |
#21 |
Correcto
|
0.004 s | 1 KBi |
#22 |
Correcto
|
0.006 s | 1 KBi |
#23 |
Correcto
|
0.006 s | 1 KBi |
#24 |
Correcto
|
0.005 s | 1 KBi |
#25 |
Correcto
|
0.006 s | 1 KBi |
#26 |
Correcto
|
0.005 s | 1 KBi |
#27 |
Correcto
|
0.006 s | 1 KBi |
#28 |
Correcto
|
0.005 s | 1 KBi |
#29 |
Correcto
|
0.004 s | 1 KBi |
#30 |
Correcto
|
0.006 s | 1 KBi |
#31 |
Correcto
|
0.004 s | 1 KBi |
#32 |
Correcto
|
0.004 s | 1 KBi |
#33 |
Correcto
|
0.004 s | 1 KBi |
#34 |
Correcto
|
0.005 s | 1 KBi |
// Made by Daniel Diaz (@Danidiaztech) #include <bits/stdc++.h> using namespace std; #define endl '\n' #define fastInp cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0); #define forn(i, n) for (int i = 0; i < n; i++) // for in range in python #define FOR(i, a, b) for (int i = a; i < b; i++) // for in range in python #define int long long int #define double long double #define pb push_back #define ff first #define ss second #define mk make_pair typedef pair<int, int> pii; const int MAX = 1e6; const int MIN = -MAX; const int INF = LLONG_MAX; const int MINF = LLONG_MIN; const int MOD = 1e9 + 7; // int arr[MAX]; void solve(){ string s; cin >> s; int i = s.size() - 1; int zeroes = 0; while (i >= 0){ if (s[i] == '9'){ s[i] = '0'; zeroes++; } else{ int x = s[i] -'0'; char c = (x + 1) + '0'; s[i] = c; break; } i--; } if (zeroes == (int)s.size()){ cout << '1' << s; } else cout << s; } int32_t main() { fastInp; #if LOCAL freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif int tc = 1; // cin >> tc; for (int t = 1; t <= tc; t++){ // cout << "Case #" << t << ": "; solve(); } return 0; }