Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.002 s | 0 KBi |
#2 |
Correcto
|
0.006 s | 4 KBi |
#3 |
Correcto
|
0.001 s | 0 KBi |
#4 |
Correcto
|
0.002 s | 0 KBi |
#5 |
Correcto
|
0.002 s | 0 KBi |
#6 |
Correcto
|
0.004 s | 2 KBi |
#7 |
Correcto
|
0.009 s | 2 KBi |
#8 |
Correcto
|
0.002 s | 0 KBi |
#9 |
Correcto
|
0.002 s | 0 KBi |
#10 |
Correcto
|
0.005 s | 7 KBi |
#11 |
Correcto
|
0.002 s | 0 KBi |
#12 |
Correcto
|
0.004 s | 2 KBi |
#13 |
Correcto
|
0.005 s | 2 KBi |
#14 |
Correcto
|
0.005 s | 8 KBi |
#15 |
Correcto
|
0.002 s | 0 KBi |
#16 |
Correcto
|
0.004 s | 2 KBi |
#17 |
Correcto
|
0.002 s | 0 KBi |
#18 |
Correcto
|
0.002 s | 0 KBi |
#19 |
Correcto
|
0.001 s | 0 KBi |
#20 |
Correcto
|
0.002 s | 0 KBi |
#21 |
Correcto
|
0.005 s | 4 KBi |
#22 |
Correcto
|
0.006 s | 7 KBi |
#23 |
Correcto
|
0.002 s | 0 KBi |
#24 |
Correcto
|
0.001 s | 0 KBi |
#25 |
Correcto
|
0.004 s | 12 KBi |
#26 |
Correcto
|
0.002 s | 0 KBi |
#27 |
Correcto
|
0.002 s | 0 KBi |
#28 |
Correcto
|
0.006 s | 15 KBi |
#29 |
Correcto
|
0.006 s | 3 KBi |
#30 |
Correcto
|
0.003 s | 0 KBi |
#31 |
Correcto
|
0.002 s | 0 KBi |
#32 |
Correcto
|
0.002 s | 0 KBi |
#33 |
Correcto
|
0.004 s | 2 KBi |
#34 |
Correcto
|
0.006 s | 2 KBi |
#35 |
Correcto
|
0.002 s | 0 KBi |
#36 |
Correcto
|
0.006 s | 6 KBi |
#37 |
Correcto
|
0.009 s | 1 KBi |
#38 |
Correcto
|
0.001 s | 0 KBi |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); // your code goes here string X, Y; cin >> X; cin >> Y; if(X.size() > Y.size()) swap(X, Y); int i = X.size(), j = Y.size(), c = 0; char arr[j]; char ch; while(i-- && j--){ ch = X[i] + Y[j] + c - 48; if(ch > 57){ ch = 47 + (ch - 57); c = 1; }else{ c = 0; } arr[j] = ch; } while(j--){ ch = Y[j] + c; if(ch > 57){ ch = 47 + (ch - 57); c = 1; }else{ c = 0; } arr[j] = ch; } if(c) cout << '1'; for(i=0; i<Y.size(); i++) cout << arr[i]; cout << "\n"; return 0; }