Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 2 KBi |
#2 |
Correcto
|
0.007 s | 2 KBi |
#3 |
Correcto
|
0.005 s | 2 KBi |
#4 |
Correcto
|
0.007 s | 2 KBi |
#5 |
Correcto
|
0.006 s | 1 KBi |
#6 |
Correcto
|
0.007 s | 1 KBi |
#7 |
Correcto
|
0.007 s | 2 KBi |
#8 |
Correcto
|
0.007 s | 1 KBi |
#9 |
Correcto
|
0.006 s | 2 KBi |
#10 |
Correcto
|
0.007 s | 2 KBi |
#11 |
Correcto
|
0.007 s | 2 KBi |
#12 |
Correcto
|
0.008 s | 2 KBi |
#13 |
Correcto
|
0.007 s | 2 KBi |
#14 |
Correcto
|
0.006 s | 1 KBi |
#15 |
Correcto
|
0.008 s | 1 KBi |
#16 |
Correcto
|
0.007 s | 2 KBi |
#17 |
Correcto
|
0.005 s | 2 KBi |
#18 |
Correcto
|
0.006 s | 2 KBi |
#19 |
Correcto
|
0.006 s | 1 KBi |
#20 |
Correcto
|
0.008 s | 2 KBi |
#21 |
Correcto
|
0.007 s | 1 KBi |
#22 |
Correcto
|
0.008 s | 1 KBi |
#23 |
Correcto
|
0.007 s | 1 KBi |
#24 |
Correcto
|
0.008 s | 2 KBi |
#25 |
Correcto
|
0.007 s | 2 KBi |
#26 |
Correcto
|
0.007 s | 1 KBi |
#27 |
Correcto
|
0.007 s | 2 KBi |
#28 |
Correcto
|
0.006 s | 2 KBi |
#29 |
Correcto
|
0.008 s | 1 KBi |
#30 |
Correcto
|
0.012 s | 2 KBi |
#31 |
Correcto
|
0.011 s | 2 KBi |
#32 |
Correcto
|
0.009 s | 2 KBi |
#33 |
Correcto
|
0.008 s | 2 KBi |
#34 |
Correcto
|
0.008 s | 1 KBi |
#35 |
Correcto
|
0.009 s | 2 KBi |
#36 |
Correcto
|
0.007 s | 1 KBi |
#37 |
Correcto
|
0.007 s | 1 KBi |
#38 |
Correcto
|
0.007 s | 2 KBi |
#include<bits/stdc++.h> using namespace std; int main(){ string num1,num2; cin >> num1 >> num2; reverse(num1.begin(),num1.end()); reverse(num2.begin(),num2.end()); string ans = ""; int car = 0; int upTo = max(num1.size(),num2.size()); for(int i = 0; i < upTo;++i){ int val = car; if(i < num1.size()) val += num1[i] -'0'; if(i < num2.size()) val += num2[i] -'0'; ans += (val%10)+'0'; car = val / 10; } if(car) ans += (car+'0'); reverse(ans.begin(),ans.end()); cout << ans << "\n"; }