Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 2 KBi |
#2 |
Correcto
|
0.006 s | 1 KBi |
#3 |
Correcto
|
0.006 s | 11 KBi |
#4 |
Incorrecto
|
0.006 s | 2 KBi |
#5 |
Correcto
|
0.005 s | 1 KBi |
#6 |
Correcto
|
0.006 s | 2 KBi |
#7 |
Correcto
|
0.004 s | 1 KBi |
#8 |
Correcto
|
0.009 s | 2 KBi |
#9 |
Correcto
|
0.005 s | 2 KBi |
#10 |
Correcto
|
0.005 s | 2 KBi |
#11 |
Incorrecto
|
0.005 s | 1 KBi |
#12 |
Correcto
|
0.006 s | 2 KBi |
#13 |
Incorrecto
|
0.006 s | 2 KBi |
#14 |
Incorrecto
|
0.007 s | 1 KBi |
#15 |
Incorrecto
|
0.005 s | 2 KBi |
#16 |
Incorrecto
|
0.008 s | 1 KBi |
#17 |
Incorrecto
|
0.005 s | 2 KBi |
#18 |
Incorrecto
|
0.005 s | 2 KBi |
#19 |
Incorrecto
|
0.007 s | 15 KBi |
#20 |
Incorrecto
|
0.005 s | 1 KBi |
#21 |
Correcto
|
0.005 s | 2 KBi |
#22 |
Correcto
|
0.005 s | 1 KBi |
#23 |
Correcto
|
0.006 s | 1 KBi |
#24 |
Correcto
|
0.006 s | 1 KBi |
#25 |
Correcto
|
0.007 s | 16 KBi |
#26 |
Correcto
|
0.005 s | 1 KBi |
#27 |
Correcto
|
0.005 s | 1 KBi |
#28 |
Correcto
|
0.005 s | 2 KBi |
#29 |
Correcto
|
0.007 s | 1 KBi |
#30 |
Correcto
|
0.005 s | 2 KBi |
#31 |
Correcto
|
0.006 s | 2 KBi |
#32 |
Correcto
|
0.005 s | 1 KBi |
#33 |
Correcto
|
0.004 s | 1 KBi |
#34 |
Correcto
|
0.008 s | 15 KBi |
#35 |
Correcto
|
0.004 s | 2 KBi |
#36 |
Correcto
|
0.006 s | 1 KBi |
#37 |
Correcto
|
0.008 s | 1 KBi |
#38 |
Correcto
|
0.006 s | 2 KBi |
#39 |
Correcto
|
0.005 s | 1 KBi |
#40 |
Correcto
|
0.005 s | 1 KBi |
#41 |
Correcto
|
0.006 s | 2 KBi |
#42 |
Correcto
|
0.006 s | 1 KBi |
#include <iostream> using namespace std; int main(void) { string x; int k; cin >> x; cin >> k; int length = x.length() - 1, i = length, carry = 0; while (i >= 0) { if (i == length) x[i] += k; x[i] += carry; if (x[i] > 57) { int sum = (int)x[i] - 48; int unit = sum % 10; x[i] = unit + 48; carry = 1; } else break; if (i >= 0) --i; } if (x[0] == '0') { string res = '1' + x; cout << res << endl; } else cout << x << endl; return (0); }