Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.006 s | 2 KBi |
#2 |
Correcto
|
0.007 s | 2 KBi |
#3 |
Correcto
|
0.006 s | 2 KBi |
#4 |
Correcto
|
0.007 s | 2 KBi |
#5 |
Correcto
|
0.008 s | 1 KBi |
#6 |
Correcto
|
0.007 s | 2 KBi |
#7 |
Correcto
|
0.007 s | 2 KBi |
#8 |
Correcto
|
0.006 s | 1 KBi |
#9 |
Correcto
|
0.006 s | 2 KBi |
#10 |
Correcto
|
0.006 s | 3 KBi |
#11 |
Correcto
|
0.005 s | 2 KBi |
#12 |
Correcto
|
0.005 s | 2 KBi |
#13 |
Correcto
|
0.009 s | 2 KBi |
#14 |
Correcto
|
0.006 s | 1 KBi |
#15 |
Correcto
|
0.009 s | 2 KBi |
#16 |
Correcto
|
0.008 s | 2 KBi |
#17 |
Correcto
|
0.006 s | 1 KBi |
#18 |
Correcto
|
0.007 s | 1 KBi |
#19 |
Correcto
|
0.007 s | 1 KBi |
#20 |
Correcto
|
0.007 s | 1 KBi |
#21 |
Correcto
|
0.006 s | 2 KBi |
#22 |
Correcto
|
0.006 s | 1 KBi |
#23 |
Correcto
|
0.007 s | 2 KBi |
#24 |
Correcto
|
0.005 s | 1 KBi |
#25 |
Correcto
|
0.006 s | 1 KBi |
#26 |
Correcto
|
0.016 s | 1 KBi |
#27 |
Correcto
|
0.015 s | 2 KBi |
#28 |
Correcto
|
0.015 s | 2 KBi |
#29 |
Correcto
|
0.018 s | 2 KBi |
#30 |
Correcto
|
0.013 s | 2 KBi |
#31 |
Correcto
|
0.013 s | 2 KBi |
#32 |
Correcto
|
0.016 s | 1 KBi |
#33 |
Correcto
|
0.014 s | 2 KBi |
#34 |
Correcto
|
0.012 s | 1 KBi |
#include<bits/stdc++.h> using namespace std; #define optimizar_io ios_base::sync_with_stdio(0); cin.tie(0); int main() { string num; cin >> num; int carry = 1; vector <int> number; for(int i=num.size()-1;i>=0;i--){ int aux = 0; aux = num[i] - '0'; aux += carry; carry = aux/10; number.insert(number.begin(),aux%10); } if (carry != 0) number.insert(number.begin(),carry); for(int i=0;i<number.size();i++){ cout<<number[i]; } return 0; }