高精度加减乘除模板 c++
高精度加法
#include
#include
using namespace std;
vector add(vector &A,vector &B){
vector C;
int t=0;
for(int i=0;i 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');
vector C=add(A,B);
for(int i=C.size()-1;i>=0;i--) cout< 高精度减法
#include
#include
using namespace std;
//A>=B?
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; //equal
}
//if A>=B do sub
vector sub(vector &A,vector &B){
vector C;
for(int i=0,t=0;i=B
t=A[i]-t;
if(i0,和<=0情况合并
if(t<0) t=1;
else t=0;
}
//去除首部0
while(C.size()>1 && C.back()==0) C.pop_back();
return C;
}
int main(){
string a,b;
cin>>a>>b;
vector 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');
// cout<=0;i--) cout<=0;i--) cout< 高精度乘
#include
#include
using namespace std;
vector mul(vector &A, int b)
{
vector 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()
{
string a;
int b;
cin >> a >> b;
vector A;
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;
}
高精度除
#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;
vector A;
int B;
cin >> a >> B;
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 -- ) cout << C[i];
cout << endl << r << endl;
return 0;
}