Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.006 s | 0 KBi |
#2 |
Correcto
|
0.004 s | 1 KBi |
#3 |
Correcto
|
0.007 s | 1 KBi |
#4 |
Correcto
|
0.004 s | 1 KBi |
#5 |
Correcto
|
0.008 s | 2 KBi |
#6 |
Correcto
|
0.005 s | 13 KBi |
#7 |
Correcto
|
0.004 s | 0 KBi |
#8 |
Correcto
|
0.004 s | 0 KBi |
#9 |
Correcto
|
0.006 s | 6 KBi |
#10 |
Correcto
|
0.003 s | 0 KBi |
#11 |
Correcto
|
0.005 s | 2 KBi |
#12 |
Correcto
|
0.012 s | 22 KBi |
#13 |
Correcto
|
0.005 s | 0 KBi |
#14 |
Correcto
|
0.005 s | 0 KBi |
#15 |
Correcto
|
0.004 s | 0 KBi |
#16 |
Correcto
|
0.004 s | 0 KBi |
#17 |
Correcto
|
0.004 s | 1 KBi |
#18 |
Correcto
|
0.001 s | 0 KBi |
#19 |
Correcto
|
0.001 s | 0 KBi |
#20 |
Correcto
|
0.003 s | 8 KBi |
#21 |
Correcto
|
0.003 s | 1 KBi |
#22 |
Correcto
|
0.004 s | 1 KBi |
#23 |
Correcto
|
0.005 s | 0 KBi |
#24 |
Correcto
|
0.001 s | 0 KBi |
#25 |
Correcto
|
0.005 s | 6 KBi |
#26 |
Correcto
|
0.008 s | 3 KBi |
#27 |
Correcto
|
0.005 s | 18 KBi |
#28 |
Correcto
|
0.004 s | 11 KBi |
#29 |
Correcto
|
0.004 s | 1 KBi |
#30 |
Correcto
|
0.003 s | 0 KBi |
#31 |
Correcto
|
0.001 s | 0 KBi |
#32 |
Correcto
|
0.006 s | 6 KBi |
#33 |
Correcto
|
0.002 s | 0 KBi |
#34 |
Correcto
|
0.007 s | 27 KBi |
#35 |
Correcto
|
0.005 s | 0 KBi |
#36 |
Correcto
|
0.006 s | 0 KBi |
#37 |
Correcto
|
0.004 s | 2 KBi |
#38 |
Correcto
|
0.002 s | 0 KBi |
#39 |
Correcto
|
0.005 s | 1 KBi |
#40 |
Correcto
|
0.006 s | 0 KBi |
#41 |
Correcto
|
0.005 s | 1 KBi |
#42 |
Correcto
|
0.005 s | 1 KBi |
#include <bits/stdc++.h> #define REP(i,n) for(int i=0; i<n;i++) #define pb push_back #define ff first #define ss second #define ii pair<int,int> #define vi vector<int> #define vii vector<ii> #define lli long long int #define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); using namespace std; ostream& operator<<(ostream& os, const vector<int> &v){ for(auto const &i: v){ os<<i<<" "; } os<<endl; return os; } const lli mod=(1e9)+7; const int N = 1e4+1; int main(){ fast_io; string n;cin>>n; deque<char> ans; int llevo = 0; cin>>llevo; for(int i=n.size()-1; i>=0; i--){ int curr = n[i]-'0'; char s = char((curr+llevo)%10)+'0'; ans.pb(s); if((curr+llevo)>=10)llevo = 1; else llevo = 0; } if(llevo)cout<<'1'; while(!ans.empty()){ cout<<ans.back(); ans.pop_back(); } cout<<endl; return 0; }