模板来自与y总
题目链接:https://www.acwing.com/activity/content/problem/content/825/1/
加法:
#include<iostream>
#include<vector>
#include<string>
using namespace std;
vector<int> add(vector<int>&A, vector<int>&B){
vector<int>C;
int t=0;
for(int i=0;i<A.size()||i<B.size();i++){
if(i<A.size())t+=A[i];
if(i<B.size())t+=B[i];
C.push_back(t%10);
t/=10;
}
if(t)C.push_back(t);
return C;
}
int main(){
vector<int> A,B;
string a,b;
cin>>a>>b;
for(int i=a.size()-1;i>=0;i--) A.push_back(a[i]-'0');
for(int i=b.size()-1;i>=0;i--) B.push_back(b[i]-'0');
auto C=add(A,B);
for(int i=C.size()-1;i>=0;i--)cout<<C[i];
return 0;
}
减法,乘法,除法 都要注意 去前导0
减法:https://www.acwing.com/activity/content/problem/content/826/1/
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
using namespace std;
bool cmp(string &a, string &b){
if(a.size()!=b.size()) return a.size()>b.size();
return a>=b;
}
vector<int> sub(vector<int>&A,vector<int>&B){
vector<int> C;
for(int i=0,t=0;i<A.size();i++){
t=A[i]-t;
if(i<B.size()) t-=B[i];
C.push_back((t+10)%10); //A有多少位 C就有多少位
if(t<0)t=1;
else t=0;
}
while(C.size()>1&&C.back()==0) C.pop_back();
return C;
}
int main(){
string a,b;
vector<int> A,B;
cin>>a>>b;
for(int i=a.size()-1;i>=0;i--)A.push_back(a[i]-'0');
for(int i=b.size()-1;i>=0;i--)B.push_back(b[i]-'0');
if(cmp(a,b)){
auto C=sub(A,B);
for(int i=C.size()-1;i>=0;i--)cout<<C[i];
}
else{
auto C=sub(B,A);
printf("-");
for(int i=C.size()-1;i>=0;i--)cout<<C[i];
}
return 0;
}
乘法:https://www.acwing.com/activity/content/punch_the_clock/11/
#include<iostream>
#include<cstdio>
#include<string>
#include<vector>
using namespace std;
vector<int> mul(vector<int>&A,int b){
vector<int>C;
int t=0;
for(int i=0;i<A.size()||t;i++){
if(i<A.size()) t+=A[i]*b;
C.push_back(t%10);
t/=10;
}
while(C.size()>1&&C.back()==0)C.pop_back();
return C;
}
int main(){
vector<int> A;
string a; int b;
cin>>a>>b;
for(int i=a.size()-1;i>=0;i--) A.push_back(a[i]-'0');
auto C=mul(A,b);
for(int i=C.size()-1;i>=0;i--)cout<<C[i];
return 0;
}
除法:https://www.acwing.com/problem/content/796/
#include<algorithm>
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
using namespace std;
//这里从高位开始除的,所以后面要逆序-->为了混合运算的格式统一
vector<int> div(vector<int> A, int b, int &r){
vector<int> C;
r=0;
for(int i=A.size()-1;i>=0;i--){
r=r*10+A[i];
C.push_back(r/b);
r%=b;
}
reverse(C.begin(),C.end());
while(C.size()>1&&C.back()==0)C.pop_back();
return C;
}
int main(){
vector<int>A;
string a; int b,r;
cin>>a>>b;
for(int i=a.size()-1;i>=0;i--) A.push_back(a[i]-'0');
auto C=div(A,b,r);
for(int i=C.size()-1;i>=0;i--)cout<<C[i];
cout<<endl<<r;
}