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