Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 1 KBi |
#2 |
Correcto
|
0.007 s | 0 KBi |
#3 |
Correcto
|
0.005 s | 1 KBi |
#4 |
Correcto
|
0.004 s | 0 KBi |
#5 |
Correcto
|
0.004 s | 0 KBi |
#6 |
Correcto
|
0.004 s | 7 KBi |
#7 |
Correcto
|
0.004 s | 0 KBi |
#8 |
Correcto
|
0.004 s | 0 KBi |
#9 |
Correcto
|
0.005 s | 0 KBi |
#10 |
Correcto
|
0.005 s | 0 KBi |
#11 |
Correcto
|
0.006 s | 1 KBi |
#12 |
Correcto
|
0.005 s | 1 KBi |
#13 |
Correcto
|
0.005 s | 1 KBi |
#14 |
Correcto
|
0.004 s | 0 KBi |
#15 |
Correcto
|
0.004 s | 1 KBi |
#16 |
Correcto
|
0.006 s | 0 KBi |
#17 |
Correcto
|
0.004 s | 0 KBi |
#18 |
Correcto
|
0.004 s | 1 KBi |
#19 |
Correcto
|
0.004 s | 0 KBi |
#20 |
Correcto
|
0.005 s | 0 KBi |
#21 |
Correcto
|
0.004 s | 0 KBi |
#22 |
Correcto
|
0.005 s | 0 KBi |
#23 |
Correcto
|
0.004 s | 0 KBi |
#24 |
Correcto
|
0.005 s | 0 KBi |
#25 |
Correcto
|
0.005 s | 0 KBi |
#26 |
Correcto
|
0.005 s | 0 KBi |
#27 |
Correcto
|
0.006 s | 0 KBi |
#28 |
Correcto
|
0.005 s | 1 KBi |
#29 |
Correcto
|
0.005 s | 0 KBi |
#30 |
Correcto
|
0.005 s | 0 KBi |
#31 |
Correcto
|
0.005 s | 0 KBi |
#32 |
Correcto
|
0.004 s | 0 KBi |
#33 |
Correcto
|
0.005 s | 1 KBi |
#34 |
Correcto
|
0.006 s | 0 KBi |
/// Write by Daniel Perez .PERAPRO #include<bits/stdc++.h> using namespace std; #define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define pb push_back #define ff first #define ss second typedef long long ll; typedef unsigned long long ull; typedef long double ld; using vi=vector<int>; using vl=vector<ll>; using pii=pair<int,int>; char el = '\n'; char esp = ' '; template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } ostream& operator<<(ostream& os, const vector<int> &v){ for(auto const &i: v){ os<<i<<" "; } os<<'\n'; return os; } string yes="YES"; string no="NO"; int main(){ fast_io; /* freopen("input.txt","r",stdin); freopen("output.txt","w",stdout); */ string s1, s2 ="1"; cin>>s1; if(s2.size() > s1.size()) swap(s1,s2); s2 = string(s1.size() - s2.size(), '0') + s2; string ans(s1.size(),'0'); int carry = 0; reverse(s1.begin(), s1.end()); reverse(s2.begin(), s2.end()); for(int i=0;i<s1.size();i++){ int res = (s1[i] - '0') + (s2[i] - '0') + carry; ans[i] = '0' + res % 10; carry = res/10; } if(carry) ans.pb('0' + carry); reverse(ans.begin(), ans.end()); cout<<ans<<el; } /* */