一,高精度加法
1.1模板
vector<int> add(vector<int> &A, vector<int> &B) // C = A + B, A >= 0, B >= 0
{
if (A.size() < B.size()) return add(B, A);
vector<int> C;
int t = 0;
for (int i = 0; i < A.size(); i ++ )
{
t += A[i];
if (i < B.size()) t += B[i];
C.push_back(t % 10);
t /= 10;
}
if (t) C.push_back(1);
return C;
}
1.2题目:高精度加法
给定两个正整数(不含前导 0),计算它们的和。
输入格式
共两行,每行包含一个整数。
输出格式
共一行,包含所求的和。
数据范围
1≤整数长度≤100000
输入样例:
12
23
输出样例:
35
AC代码:
#include <iostream>
#include <string>
#include <vector>
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(1);
return C;
}
int main() {
string a, b;
vector<int> A;
vector<int> B;
cin >> a >> b;
for (int i = a.size() - 1; i >= 0; i--)
A.push_back(a[i] - '0');//注意这里是ascii码存入数字必须-'0'
for (int i = a.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;
}
二,高精度减法
1.1模板
bool cmp(vector<int> &A,vector<int> &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<int> sub(vector<int> &A, vector<int> &B) // C = A - B, 满足A >= B, A >= 0, B >= 0
{
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();//去掉前导0
return C;
}
1.2题目:高精度减法
给定两个正整数(不含前导 0),计算它们的差,计算结果可能为负数。
输入格式
共两行,每行包含一个整数。
输出格式
共一行,包含所求的差。
数据范围
1≤整数长度≤105
输入样例:
32
11
输出样例:
21
AC代码:
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
bool cmp(vector<int> &A,vector<int> &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<int> sub(vector<int> &A, vector<int> &B) // C = A - B, 满足A >= B, A >= 0, B >= 0
{
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;
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);
cout << "-";
for (int i = C.size()-1; i >=0; i -- )cout<<C[i];
}
return 0;
}
三,高精度乘法
1.1模板
高精度*低精度
#include <iostream>
#include <vector>
using namespace std;
vector<int> mul(vector<int> &a,int b){
int t=0;
vector<int> c;
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;
int b;
string 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;
}
我的lj高精度*高精度做法
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> vA, vB;
int bsize;
vector<int> mul(vector<int> &a, int b) {
int t = 0;
vector<int> c;
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;
}
vector<int> big_mul(vector<int> &a, vector<int> &b, int k) {
vector<int> c;
if (k == 0) {
vector<int> d;
d = mul(a, vB[k]);
vector<int> e = mul(vA, vB[k + 1]);
return big_mul(d, e, k + 1);
}
int t = 0;
reverse(b.begin(), b.end());
for (int i = 0; i < k; i++) {
b.push_back(0);
}
reverse(b.begin(), b.end());
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(1);
auto res = mul(vA, vB[k + 1] );
if (k >= bsize - 1 ) {
return c;
}
return big_mul(c, res, k + 1);
}
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');
vA = a, vB = b;
bsize = vB.size();
auto c = big_mul(a, b, 0);
for (int i = c.size() - 1; i >= 0; i--)
printf("%d", c[i]);
return 0;
}
神仙高精度*高精度
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
char a1[10001], b1[10001];
int a[10001], b[10001], i, x, len, j, c[10001];
int main () {
cin >> a1 >> b1;
int lena = strlen(a1);
int lenb = strlen(b1);
for (i = 1; i <= lena; i++)
a[i] = a1[lena - i] - '0';
for (i = 1; i <= lenb; i++)
b[i] = b1[lenb - i] - '0';
for (i = 1; i <= lenb; i++)
for (j = 1; j <= lena; j++)
c[i + j - 1] += a[j] * b[i];
for (i = 1; i < lena + lenb; i++)
if (c[i] > 9) {
c[i + 1] += c[i] / 10;
c[i] %= 10;
}
len = lena + lenb;
while (c[len] == 0 && len > 1)
len--;
for (i = len; i >= 1; i--)
cout << c[i];
return 0;
}
1.2题目:高精度乘法
给定两个非负整数(不含前导 0) A 和 B,请你计算 A×B 的值。
输入格式
共两行,第一行包含整数 A,第二行包含整数 B。
输出格式
共一行,包含 A×B 的值。
数据范围
1≤A的长度≤100000,
0≤B≤10000
输入样例:
2
3
输出样例:
6
AC代码:
#include <iostream>
#include <vector>
using namespace std;
vector<int> mul(vector<int> &a,int b){
int t=0;
vector<int> c;
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;
int b;
string 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;
}
四、高精度除法
1.1模板
高精度/低精度
#include <iostream>
#include <vector>
#include <algorithm>
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;
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<<r;
return 0;
}
高精度/高精度
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
//判断A>=B
bool cmp(vector<int> &A, vector<int> &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<int> sub(vector<int> A, vector<int> B) {
vector<int> C;
int t = 0;
for (int i = 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;
}
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(1);
return C;
}
pair<int, vector<int>> addcnt(vector<int> A, vector<int> B, vector<int> R, int r) {
vector<int> sum = B, tB = B;
r = 0;
int b = 1;
if (A.size() < B.size()) {
R = A;
return pair<int, vector<int>> {0, R};
}
if (A.size() == B.size()) {
for (int i = 0; i < A.size(); i++)
if (A[i] == B[i])
b = 0;
}
if (!b )
R.push_back(0);
if (A.size() >= B.size()) {
do {
sum = add(sum, tB);
r++;
} while (cmp(A, sum));
}
sum = sub(sum, tB);
if (!cmp(A, B))
r = 0;
R.clear();
if (cmp(A, sum))
A = sub(A, sum);
for (int i = 0; i < A.size(); i++) {
R.push_back(A[i]);
}
return pair<int, vector<int>> {r, R};
}
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;
}
vector<int> big_div(vector<int> &A, vector<int> &B, vector<int> &R) {
vector<int> C, Rk;
Rk.clear();
R.push_back(0);
for (int i = A.size() - 1; i >= 0; i--) {
string n;
for (int i = 0; i < R.size(); i++) {
n += (char)(R[i] + '0');
}
if ( n == "0") {
R[0] = A[i];
} else {
R.push_back(A[i]);
reverse(R.begin(), R.end() - 1);
reverse(R.begin(), R.end());
}
pair<int, vector<int>> p = addcnt(R, B, Rk, 0);
C.push_back(p.first);
R = p.second;
}
reverse(C.begin(), C.end());
while (C.size() > 1 && C.back() == 0)
C.pop_back();
return C;
}
int main() {
vector<int> A, B, R;
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');
if (B.size() < 9) {
int k = 0, r;
for (int i = B.size() - 1; i >= 0 ; i--) {
k = k * 10 + B[i] ;
}
auto C = div(A, k, r);
for (int i = C.size() - 1; i >= 0; i--)
printf("%d", C[i]);
cout << endl;
printf("%d", r);
return 0;
}
auto C = big_div(A, B, R);
for (int i = C.size() - 1; i >= 0; i--)
printf("%d", C[i]);
cout << endl;
for (int i = R.size() - 1; i >= 0 ; i--)
printf("%d", R[i]);
return 0;
}
1.2题目:高精度除法
给定两个非负整数(不含前导 0) A,B,请你计算 A/B 的商和余数。
输入格式
共两行,第一行包含整数 A,第二行包含整数 B。
输出格式
共两行,第一行输出所求的商,第二行输出所求余数。
数据范围
1≤A的长度≤100000
1≤B≤10000
B 一定不为 0
输入样例:
7
2
输出样例:
3
1
AC代码:
#include <iostream>
#include <vector>
#include <algorithm>
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;
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<<r;
return 0;
}