1.高精度加法
题目:洛谷 P1601 A+B Problem(高精)
#include <iostream>
#include<cstring>
using namespace std;
int main()
{
char a[505], b[505];
int num1[505] = { 0 }, num2[505] = { 0 };
int sum[505] = { 0 };
cin >> a >> b;
int lena = strlen(a); //计算长度
int lenb = strlen(b);
int len = lena > lenb ? lena : lenb;
//倒序储存数据
for (int i = lena-1,j=0; i >= 0; i--,j++)
num1[j] = a[i] - '0';
for (int i = lenb - 1, j = 0; i >= 0; i--, j++)
num2[j] = b[i] - '0';
for (int i = 0; i < lena || i < lenb; i++) {
sum[i] = num1[i] + num2[i] + sum[i];
if (sum[i] >= 10) {
sum[i + 1] += sum[i] / 10;
sum[i] %= 10;
}
}
//如果最后一位进位,总长加一
if (sum[len] > 0)
len++;
for (int j = len-1; j >= 0; j--) {
cout << sum[j];
}
return 0;
}
2.高精度减法
题目:洛谷 P2142 高精度减法
#include <iostream>
#include<cstring>
using namespace std;
char a[10087], b[10087];
int num1[10087] = { 0 }, num2[10087] = { 0 };
int result[10087] = { 0 };
int lena, lenb;
int symbol()
{
//结果为正返回1,为负返回0,结果为0返回2
if (lena > lenb)
return 1;
else if (lena == lenb) {
int i = lena;
while (num1[i] == num2[i])
{
if (i == 0)
return 2;
i--;
}
if (num1[i] > num2[i])
return 1;
else
return 0;
}
else
return 0;
}
int main()
{
cin >> a >> b;
lena = strlen(a); //计算长度
lenb = strlen(b);
//倒序储存数据
for (int i = lena - 1, j = 0; i >= 0; i--, j++)
num1[j] = a[i] - '0';
for (int i = lenb - 1, j = 0; i >= 0; i--, j++)
num2[j] = b[i] - '0';
int flag = symbol();
if (flag == 2)
cout << 0;
else
{
if (flag == 0) {
//交换数字
for (int i = 0; i < lenb; i++) {
int x = num1[i];
num1[i] = num2[i];
num2[i] = x;
}
lena ^= lenb ^= lena ^= lenb;
}
//计算
for (int i = 0; i < lena || i < lenb; i++) {
result[i] = num1[i] - num2[i] + result[i];
if (result[i] < 0) {
result[i] += 10;
result[i + 1]--;
}
}
//消掉前面多余的0
while (result[lena - 1] == 0 && lena > 1)
lena--;
if (flag == 0)
cout << "-";
for (int i = lena-1; i >= 0; i--)
{
cout << result[i];
}
}
return 0;
}
3.高精度乘法
题目:洛谷 P1303 A*B Problem
核心代码(乘法运算部分)是由模拟乘法竖式算出来的:
(1) 数1的倒数第i位与数2的倒数第j位相乘所得到的值应存在结果的倒数第i+j-1位上。
(2) 如果结果的i+j-1位大于9,则进位到i+j位。
#include <iostream>
#include<cstring>
using namespace std;
int i, j, len = 0;
int lena, lenb;
char a[2005], b[2005];
int num1[2005] = { 0 }, num2[2005] = { 0 };
int result[2005] = { 0 };
int main()
{
cin >> a >> b;
lena = strlen(a); //计算长度
lenb = strlen(b);
for (i = 1; i <= lena; i++)
num1[i] = a[lena - i] - '0';
for (i = 1; i <= lenb; i++)
num2[i] = b[lenb - i] - '0';
for (i = 1; i <= lena; i++)
{
for (j = 1; j <= lenb; j++)
{
result[i + j - 1] += num1[i] * num2[j];
result[i + j] += result[i + j - 1] / 10;
result[i + j - 1] %= 10;
}
}
len = i + j;
if (result[len + 1] != 0)
len++;
while (result[len] == 0 && len > 1)
len--;
for (i = len; i > 0; i--)
cout << result[i];
return 0;
}