写在前面:
这两道题我采用了C++和java两种不同的方法去写,个人觉得还是Java写高精度模拟又快又好,当然对于一个打算搞acm的蒟蒻,两种方法还是要学会,才能干!有时候出题人,故意为难,用java会卡时,这篇只是记录,大家要是想知道具体的方法可以参照这篇博客:
大整数的操作—阶乘,加法,乘法-----比对C++与java
题目链接:
洛谷P1601 A+B problem
洛谷P1303 A*B problem
首先先写A+B
java:
import java.util.*;
import java.math.*;
public class Main {
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
BigInteger a, b;
a = cin.nextBigInteger();
b = cin.nextBigInteger();
System.out.println(a.add(b));
cin.close();
}
}
C++模拟竖式运算:
#include <bits/stdc++.h>
using namespace std;
const int maximum = 10e3;
int sum[maximum];
char a[maximum], b[maximum];
int main()
{
memset(sum, 0, sizeof(sum));
memset(a, '0', sizeof(a));
memset(b, '0', sizeof(b));
scanf("%s%s", a, b);
char transposedA[maximum];
char transposedB[maximum];
memset(transposedA, '0', sizeof(transposedA));
memset(transposedB, '0', sizeof(transposedB));
for (int i = strlen(a) - 1, j = 0; i >= 0; --i, ++j)
transposedA[j] = a[i]; // 将a数组转置过来
for (int i = strlen(b) - 1, j = 0; i >= 0; --i, ++j)
transposedB[j] = b[i]; // 将b数组转置过来
int len = max(strlen(a), strlen(b));
for (int i = 0; i < len; i++)
sum[i] = transposedA[i] - '0' + transposedB[i] - '0'; // 模拟竖式加法
int up = 0;
int k = 0;
while (k < len) // 模拟进位
{
sum[k] += up;
up = sum[k] / 10;
sum[k] %= 10;
k++;
}
while (up)
{
sum[k++] = up % 10;
up /= 10;
}
for (int i = k - 1; i >= 0; --i)
printf("%d", sum[i]);
cout << endl;
return 0;
}
A*B problem
java
import java.util.*;
import java.math.*;
public class BigInter {
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
BigInteger a, b;
a = cin.nextBigInteger();
b = cin.nextBigInteger();
System.out.println(a.multiply(b));
cin.close();
}
}
C++模拟竖式乘法:
#include <bits/stdc++.h>
using namespace std;
const int maximum = 10e4;
int sum[maximum];
char a[maximum], b[maximum];
int main()
{
memset(sum, 0, sizeof(sum));
memset(a, '\0', sizeof(a));
memset(b, '\0', sizeof(b));
scanf("%s%s", a, b);
char transposedA[maximum];
char transposedB[maximum];
memset(transposedA, '\0', sizeof(transposedA));
memset(transposedB, '\0', sizeof(transposedB));
for (int i = strlen(a) - 1, j = 0; i >= 0; --i, ++j)
transposedA[j] = a[i]; // 将a数组转置过来
for (int i = strlen(b) - 1, j = 0; i >= 0; --i, ++j)
transposedB[j] = b[i]; // 将b数组转置过来
for (int i = 0; i < strlen(transposedA); ++i)
{
for (int j = 0; j < strlen(transposedB); ++j)
sum[i + j] += (transposedA[i] - '0') * (transposedB[j] - '0'); // 模拟竖式乘法
}
int len = strlen(transposedA) + strlen(transposedB) - 1;
int up = 0;
int k = 0;
while (k < len) // 模拟进位
{
sum[k] += up;
up = sum[k] / 10;
sum[k] %= 10;
k++;
}
while (up)
{
sum[k++] = up % 10;
up /= 10;
}
if (a[0]=='0'||b[0]=='0') // 判断有无为0的乘数
{
cout << "0" << endl;
}
else
{
for (int i = k - 1; i >= 0; --i)
printf("%d", sum[i]);
cout << endl;
}
return 0;
}