Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.004 s | 1 KBi |
#2 |
Correcto
|
0.007 s | 2 KBi |
#3 |
Correcto
|
0.003 s | 2 KBi |
#4 |
Correcto
|
0.005 s | 2 KBi |
#5 |
Correcto
|
0.005 s | 1 KBi |
#6 |
Correcto
|
0.008 s | 1 KBi |
#7 |
Correcto
|
0.006 s | 2 KBi |
#8 |
Correcto
|
0.004 s | 2 KBi |
#9 |
Correcto
|
0.004 s | 2 KBi |
#10 |
Correcto
|
0.005 s | 2 KBi |
#11 |
Correcto
|
0.006 s | 1 KBi |
#12 |
Correcto
|
0.002 s | 2 KBi |
#13 |
Correcto
|
0.003 s | 2 KBi |
#14 |
Correcto
|
0.006 s | 1 KBi |
#15 |
Correcto
|
0.007 s | 1 KBi |
#16 |
Correcto
|
0.004 s | 1 KBi |
#17 |
Correcto
|
0.005 s | 1 KBi |
#18 |
Correcto
|
0.003 s | 2 KBi |
#19 |
Correcto
|
0.006 s | 1 KBi |
#20 |
Correcto
|
0.006 s | 2 KBi |
#21 |
Correcto
|
0.002 s | 2 KBi |
#22 |
Correcto
|
0.004 s | 2 KBi |
#23 |
Correcto
|
0.004 s | 2 KBi |
#24 |
Correcto
|
0.004 s | 1 KBi |
#25 |
Correcto
|
0.006 s | 3 KBi |
#26 |
Correcto
|
0.006 s | 2 KBi |
#27 |
Correcto
|
0.007 s | 1 KBi |
#28 |
Correcto
|
0.004 s | 2 KBi |
#29 |
Correcto
|
0.004 s | 2 KBi |
#30 |
Correcto
|
0.004 s | 2 KBi |
#31 |
Correcto
|
0.009 s | 1 KBi |
#32 |
Correcto
|
0.006 s | 2 KBi |
#33 |
Correcto
|
0.008 s | 1 KBi |
#34 |
Correcto
|
0.006 s | 2 KBi |
#include <iostream> #include <cstring> #include <cstdio> #include <cmath> #include <queue> #include <set> #include <map> #include <vector> #include <stack> #include <algorithm> using namespace std; const int N = 6e5+20; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); //leer el número string s; int nums [10000]; cin>>s; for(int i = 0; i < s.size(); i++) { nums[i] = s[i] - '0'; } for(int i = s.size()-1; i >= 0; i--) { if(nums[i] != 9) { nums[i]++; break; } else if (i==0) { cout<<1; nums[i] = 0; } else { nums[i] = 0; } } for(int i = 0; i < s.size(); i++) { cout<<nums[i]; } cout<<endl; }