听完y总的高精度加减乘除后记录。
其中的乘法和除法只是有一方是大数,加减法是大数加减法。
- 高精度加法
#include <iostream>
#include <string>
#include <vector>
using namespace std;
string a, b;
vector<int> A, B;
vector<int> add(vector<int>& A, vector<int>& B)
{
int t = 0;
vector<int> C;
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()
{
cin >> a >> b;
for(int i = a.length() - 1; i >= 0; i -- ) A.push_back(a[i] - '0');
for(int i = b.length() - 1; i >= 0; i -- ) B.push_back(b[i] - '0');
vector<int> C = add(A, B);
for(int i = C.size() - 1; i >= 0; i -- ) cout << C[i];
return 0;
}
- 高精度减法
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
vector<int> A, B;
bool cmp(vector<int>& A, vector<int>& B)
{
if(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;
}
return A.size() > B.size();
}
vector<int> opadd(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);
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;
getline(cin, a), getline(cin, b);
for(int i = a.length() - 1; i >= 0; i -- ) A.push_back(a[i] - '0');
for(int i = b.length() - 1; i >= 0; i -- ) B.push_back(b[i] - '0');
if(cmp(A, B))
{
auto C = opadd(A, B);
for(int i = C.size() - 1; i >= 0; i -- ) cout << C[i];
}
else
{
auto C = opadd(B, A);
cout << "-";
for(int i = C.size() - 1; i >= 0; i -- ) cout << C[i];
}
return 0;
}
- 高精度乘法 (其中b < 10000)
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
// C = A * B
vector<int> A;
int b;
vector<int> xadd(vector<int>& A, int b)
{
vector<int> C;
int t = 0;
for(int i = 0; i < A.size(); i ++ )
{
t = A[i] * b + t;
C.push_back(t % 10);
t = t / 10;
}
if(t) C.push_back(t);
while(C.size() > 1 && C.back() == 0) C.pop_back();
return C;
}
int main()
{
string a;
getline(cin, a);
cin >> b;
for(int i = a.length() - 1; i >= 0; i -- ) A.push_back(a[i] - '0');
auto C = xadd(A, b);
for(int i = C.size() - 1; i >= 0; i -- ) cout << C[i];
return 0;
}
- 高精度除法 (其中b < 10000)
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
using namespace std;
vector<int> A;
int b, t;
vector<int> div(vector<int>& A, int b)
{
vector<int> C;
for(int i = A.size() - 1; i >= 0; i -- )
{
t = t * 10 + A[i];
C.push_back(t / b);
t = t % b;
}
reverse(C.begin(), C.end());
while(C.size() > 1 && C.back() == 0) C.pop_back();
return C;
}
int main()
{
string a;
getline(cin, a);
cin >> b;
for(int i = a.length() - 1; i >= 0; i -- ) A.push_back(a[i] - '0');
auto C = div(A, b);
for(int i = C.size() - 1; i >= 0; i -- ) cout << C[i];
cout << endl << t;
return 0;
}