2 solutions
-
-2
#include<bits/stdc++.h> using namespace std; const int N=210; int a[N],b[N],c[N]; string s1,s2; int main() { cin>>s1>>s2; int lena,lenb,lenc; lena=s1.size(); lenb=s2.size(); lenc=lena; for(int i=0,j=lena-1;j>=0;i++,j--) { a[i]=s1[j]-'0'; } for(int i=0,j=lenb-1;j>=0;i++,j--) { b[i]=s2[j]-'0'; } int t=0; for(int i=0;i<lenc;i++) { c[i]=a[i]-b[i]+t; if(c[i]<0) { c[i]+=10; t=-1; } else { t=0; } } while(lenc>0&&c[lenc]==0) lenc--; for(int i=lenc;i>=0;i--) { cout<<c[i]; } return 0; }
Information
- ID
- 143
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 3
- Tags
- (None)
- # Submissions
- 84
- Accepted
- 28
- Uploaded By