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