高精度——乘法(大数乘小数)
#include <iostream>
#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(); //删除前导0
return C;
}
int main()
{
string a;
int b;
vector<int> 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;
}
高精度——除法(大数除以小数)
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> div(vector<int> &A,int b,int &r) //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;
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 -- )
printf("%d",C[i]);
cout<<endl;
cout<<r<<endl;
return 0;
}