高精度模板小总结( 字符串数组 || vector )
高精度加高精度:P1601 A+B Problem(高精)
#include<iostream>
#include<cstring>
using namespace std;
string A, B;
int a[10000], b[10000], sum[10000];
int main(){
cin >> A >> B;
int la = A.size(), lb = B.size();
for (int i = 0; i < la; i++)
a[i] = A[la - i - 1] - '0';
for (int i = 0; i < lb; i++)
b[i] = B[lb - i - 1] - '0';
int jw = 0;
for (int i = 0; i < (la > lb ? la : lb) + 1; i++) {
sum[i] = a[i] + b[i] + jw;
jw = sum[i] / 10;
sum[i] %= 10;
}
int flag = 0;
for (int i = (la > lb ? la : lb); i >= 0; i--) {
if (sum[i] != 0)
flag = 1;
if (flag)
cout << sum[i];
}
if (flag == 0)
cout << "0";
cout << endl;
return 0;
}
#include<iostream>
#include<cstring>
using namespace std;
string A, B;
int a[10000], b[10000];
int la, lb;
void qiuhe(int* a) {
int jw = 0;
for (int i = 0; i < (la > lb ? la : lb) + 1; i++) {
b[i] = a[i] + b[i] + jw;
jw = b[i] / 10;
b[i] %= 10;
}
}
int main(){
cin >> A >> B;
la = A.size(), lb = B.size();
for (int i = 0; i < la; i++)
a[i] = A[la - i - 1] - '0';
for (int i = 0; i < lb; i++)
b[i] = B[lb - i - 1] - '0';
qiuhe(a);
int flag = 0;
for (int i = (la > lb ? la : lb); i >= 0; i--) {
if (b[i] != 0)
flag = 1;
if (flag)
cout << b[i];
}
if (flag == 0)
cout << "0";
cout << endl;
return 0;
}
#include<iostream>
#include<vector>
using namespace std;
string A, B;
vector<int>a, b, c;
vector<int>add(vector<int>& a, vector<int>& b) {
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() {
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--)
cout << c[i];
return 0;
}
高精度减高精度:P2142 高精度减法
#include<iostream>
#include<cstring>
using namespace std;
string A, B;
int a[100000], b[100000],sub[100000];
int la, lb;
int main(){
cin >> A >> B;
la = A.size(), lb = B.size();
int key = 0;
if (la < lb) {
cout << "-";
key = 1;
}
else if (la == lb) {
for (int j = la; j >= 0; j--) {
if (a[j] < b[j]) {
cout << "-";
key = 1;
break;
}
else if (a[j] == b[j])
continue;
else
break;
}
}
else {
key = 0;
}
for (int i = 0; i < la; i++)
a[i] = A[la - i - 1] - '0';
for (int i = 0; i < lb; i++)
b[i] = B[lb - i - 1] - '0';
if (key) {
for (int i = 0; i < lb; i++) {
int x = b[i];
b[i] = a[i];
a[i] = x;
}
}
for (int i = 0; i < (la > lb ? la : lb); i++) {
if (a[i] < b[i]) {
a[i + 1] -= 1;
a[i] += 10;
}
sub[i] = a[i] - b[i];
}
int flag = 0;
for (int i = (la > lb ? la : lb) - 1; i >= 0; i--) {
if (sub[i] != 0)
flag = 1;
if (flag)
cout << sub[i];
}
if (flag == 0)
cout << "0";
cout << endl;
return 0;
}
#include<iostream>
#include<vector>
using namespace std;
string A, B;
vector<int>a, b, c;
bool cmp(vector<int>& a, vector<int>& b) {
if (a.size() != b.size())
return a.size() > b.size();
else {
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) {
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;
}
int main() {
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;
}
高精度乘低精度
#include<iostream>
#include<cstring>
using namespace std;
string A;
int a[10000], b, la;
void chengfa(int* a, int x) {
int jw = 0;
for (int i = 0; i < 10000; i++) {
long long s = a[i] * x + jw;
jw = s / 10;
a[i] = s % 10;
}
}
int main(){
cin >> A >> b;
int la = A.size();
for (int i = 0; i < la; i++)
a[i] = A[la - i - 1] - '0';
chengfa(a, b);
int flag = 0;
for (int i = 9999; i >= 0; i--) {
if (a[i] != 0)
flag = 1;
if (flag)
cout << a[i];
}
if (flag == 0)
cout << "0";
cout << endl;
return 0;
}
#include<iostream>
#include<vector>
using namespace std;
string A; int b;
vector<int>a, c;
vector<int>mul(vector<int>& a,int b){
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() {
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--)
cout << c[i];
return 0;
}
高精度乘高精度:P1303 A*B Problem
#include<iostream>
#include<cstring>
using namespace std;
string A, B;
int a[100000], b[100000],mul[100000];
int la, lb;
int main(){
cin >> A >> B;
la = A.size(), lb = B.size();
for (int i = 0; i < la; i++)
a[i] = A[la - i - 1] - '0';
for (int i = 0; i < lb; i++)
b[i] = B[lb - i - 1] - '0';
for (int i = 0; i < la; i++)
for (int j = 0; j < lb; j++)
mul[i + j] += a[i] * b[j];
for (int i = 0; i < la + lb; i++) {
if (mul[i] > 9) {
mul[i + 1] += mul[i] / 10;
mul[i] %= 10;
}
}
int flag = 0, i = 0;
for (i = la + lb - 1; i >= 0; i--) {
if (mul[i] != 0) {
flag = 1;
break;
}
}
if (flag) {
for (i; i >= 0; i--)
cout << mul[i];
}
else
cout << "0";
cout << endl;
return 0;
}
#include<iostream>
#include<vector>
using namespace std;
string A, B;
vector<int>a, b;
vector<int>mul(vector<int>& a, vector<int>& b) {
vector<int>c(a.size() + b.size() + 5, 0);
for (int i = 0; i < a.size(); i++)
for (int j = 0; j < b.size(); j++)
c[i + j] += a[i] * b[j];
int t = 0;
for (int i = 0; i < c.size(); i++) {
t += c[i];
c[i] = t % 10;
t /= 10;
}
while (c.size() > 1 && c.back() == 0)
c.pop_back();
return c;
}
int main() {
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 = mul(a, b);
for (int i = c.size() - 1; i >= 0; i--)
cout << c[i];
return 0;
}
阶乘之和:P1009 [NOIP1998 普及组] 阶乘之和
#include<iostream>
using namespace std;
const int value = 1e5;
void jiecheng(int* a, int n) {
a[0] = 1;
for (int k = 1; k < value; k++)
a[k] = 0;
int i, j;
for (i = 2; i <= n; i++) {
int jw = 0;
for (j = 0; j < value; j++) {
int s = a[j] * i + jw;
jw = s / 10;
a[j] = s % 10;
}
}
}
int sum[value];
void qiuhe(int* a) {
int jw = 0;
for (int i = 0; i < value; i++) {
sum[i] = sum[i] + a[i] + jw;
jw = sum[i] / 10;
sum[i] %= 10;
}
}
int main() {
int n, m; cin >> n;
int a[value] = { 0 };
for (int i = 1; i <= n; i++) {
jiecheng(a, i);
qiuhe(a);
}
int i;
for (i = value - 1; i >= 0; i--) {
if (sum[i] == 0)
continue;
break;
}
for (i; i >= 0; i--)
cout << sum[i];
return 0;
}
高精度除低精度:P1480 A/b Problem
#include<iostream>
#include<cstring>
using namespace std;
string A;
int a[100000], divide[100000];
long long b, r;
int la;
int main(){
cin >> A >> b;
la = A.size();
for (int i = 0; i < la; i++)
a[i] = A[i] - '0';
for (int i = 0; i < la; i++) {
r = r * 10 + a[i];
divide[i] = r / b;
r %= b;
}
int flag = 0, i = 0;
for (i ; i < la; i++) {
if (divide[i] != 0) {
flag = 1;
break;
}
}
if (flag) {
for (i; i < la; i++)
cout << divide[i];
}
else
cout << "0";
cout << endl;
return 0;
}
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
string A; int b, r;
vector<int>a, c;
vector<int>div(vector<int>& a, int b, int& r) {
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() {
cin >> A >> b;
for (int i = A.size() - 1; i >= 0; i--)
a.push_back(A[i] - '0');
auto c = div(a, b, r);
for (int i = c.size() - 1; i >= 0; i--)
cout << c[i];
cout << endl << r << endl;
return 0;
}