#include<bits/stdc++.h> using namespace std; int main(){ string a,b,tmp; cin>>a>>b; if(b.size()>a.size() || (a.size()==b.size() && b>a)){ tmp=a; a=b; b=tmp; cout<<'-'; } int az=a.size(); int bz=b.size(); int abz=max(az,bz); int ar[abz]; ar[abz-1]=0; for(int i=0;i<abz;i++) { int aa=0,bb=0; if(i<az) aa=a[az-i-1] - '0'; if(i<bz) bb=b[bz-i-1] - '0'; ar[i]=aa-bb; } for(int i=0;i<abz;i++) { if(ar[i]>=10) { ar[i+1]+=ar[i]/10; ar[i]+=10; } } bool ok = false; for(int i=abz-1; i>=0; i--) { if(not ok && ar[i] != 0) ok = true; if(ok) cout << ar[i]; } }

//vector高精减 #include<bits/stdc++.h> using namespace std; string x,y; vector<int>a,b,c; int len,lenx,leny; void sub(){ for(int i=0;i<lenx;i++){ int l=a[i]; if(i<leny){ l-=b[i]; } if(l<0){ a[i+1]--; l+=10; } } int main() { cin>>x>>y; lenx=x.size(); leny=y.size(); if(lenx==leny&&x<y||lenx<leny){ cout<<"-"; swap(x,y); swap(lenx,leny); } for(int i=lenx-1;i>=0;i--){ a.push_back(x[i]-48); } for(int i=leny-1;i>=0;i--){ b.push_back(y[i]-48); } sub(); int i=c.size()-1; while(!c[i]&&i)i--; for(;i>=0;i--) cout<<c[i]; return 0; }

#include <bits/stdc++.h> using namespace std; int a[100005],b[100005],c[100005]; int main(){ string a1,b1; cin>>a1>>b1; int l1=a1.length(); int l2=b1.length(); int l=max(l1,l2); int f=0; if(l2>l1||l1==l2&&b1>a1){ f=1; for(int i=0;i<l1;i++) b[l1-i]=a1[i]-'0'; for(int i=0;i<l2;i++) a[l2-i]=b1[i]-'0'; }else{ for(int i=0;i<l1;i++) a[l1-i]=a1[i]-'0'; for(int i=0;i<l2;i++) b[l2-i]=b1[i]-'0'; } //借位 for(int i=1;i<=l;i++){ if(a[i]<b[i]){ a[i]+=10; a[i+1]--; } c[i]=a[i]-b[i]; } if(f) cout<<"-";//负号 int t=l;//处理前导0 while(t>0&&c[t]==0){ t--; } for(int i=t;i>=1;i--) cout<<c[i]; return 0; }

a=int(input()) b=int(input()) print(a-b)

#include <bits/stdc++.h> using namespace std; string s1,s2; int a[2500000],b[2500000],c[2500000]; int len,p; int main(){ cin >> s1 >> s2; if(s1.size() < s2.size() || s1.size()==s2.size()&& s1<s2){ cout << "-"; swap(s1,s2); } for(int i = 0; i < s1.size(); i++){ //逆序 a[s1.size()-1-i] =s1[i]-'0'; } for(int i = 0; i < s2.size(); i++){ //逆序 b[s2.size()-1-i] =s2[i]-'0'; } len = s1.size(); if(len < s2.size()){ len = s2.size(); } for(int i = 0; i < len; i++){ c[i] = a[i] - b[i]; } for(int i = 0; i < len; i++){ if(c[i]< 0){ c[i+1] = c[i+1] - 1; c[i] += 10; } } for(int i = len - 1; i >= 0; i--){ if(c[i] != 0){ p = i; break; } } for(int i = p; i >=0; i--){ cout << c[i]; } return 0; }

把声音开最大，再打开

#include <bits/stdc++.h> using namespace std; int a[100005],b[100005],c[100005]; string add(string as,string bs){ memset(a,0,sizeof a); memset(b,0,sizeof b); memset(c,0,sizeof c); string cs; if((as.size()<bs.size())||((as.size()==bs.size()))&&as<bs){ swap(as,bs); cs+='-'; } int al=as.size(),bl=bs.size(); int cl=max(al,bl); for(int i=1;i<=al;i++){ a[i]=as[al-i]-'0'; } for(int i=1;i<=bl;i++){ b[i]=bs[bl-i]-'0'; } for(int i=1;i<=cl;i++){ if(a[i]<b[i]){ a[i]+=10; a[i+1]--; } c[i]=a[i]-b[i]; } while(c[cl]==0&&cl>1){ cl--; } for(int i=cl;i>=1;i--){ cs+=c[i]+'0'; } return cs; } int main(){ string as,bs; cin>>as>>bs; cout<<add(as,bs); return 0; }