标签:algo ++ 基础 pop i++ || amp main name
高精度加法
// C = A + B, A >= 0, B >= 0
#include
#include
using namespace std;
vector add(vector &A, vector &B) {
vector C;
int t=0;
for(int i=0; i 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--) printf("%d",C[i]);
return 0;
}
高精度减法
// C = A - B, 满足A >= B, A >= 0, B >= 0
#include
#include
using namespace std;
bool cmp(vector &A, vector &B) {
if(A.size()!=B.size()) return A.size()>B.size();
for(int i=A.size()-1; i>=0; i--)
if(A[i]!=B[i])
return A[i]>B[i];
return true;
}
vector sub(vector &A,vector &B) {
vector C;
int t=0;
for(int i=0; i1&&C.back()==0) C.pop_back();
return C;
}
int main() {
string a,b;
vector 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--) printf("%d",C[i]);
} else {
auto C = sub(B,A);
printf("-");
for(int i=C.size()-1; i>=0; i--) printf("%d",C[i]);
}
return 0;
}
高精度乘低精度
// C = A * b, A >= 0, b > 0
// A / b = C ... r, A >= 0, b > 0
#include
#include
using namespace std;
vector mul(vector &A, int b){
vector C;
int t=0;
for(int i=0;i A;
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--) printf("%d",C[i]);
return 0;
}
高精度除以低精度
// A / b = C ... r, A >= 0, b > 0
#include
#include
#include
using namespace std;
vector div(vector &A, int b,int &r) {
vector 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() {
string a;
int b;
cin>>a>>b;
vector A;
for(int i=a.size()-1; i>=0; i--) A.push_back(a[i]-‘0‘);
int r;
auto C =div(A,b,r);
for(int i=C.size()-1; i>=0; i--) printf("%d",C[i]);
cout
ACwing(基础)--- 高精度
标签:algo ++ 基础 pop i++ || amp main name
原文地址:https://www.cnblogs.com/bingers/p/13223936.html