题目大意:
给出
N
N
个数,求出它们的乘积。
每个数的位数不超过,
1≤N≤100
1
≤
N
≤
100
分析:
直接上高精度乘法
代码:
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#define N 1005
using namespace std;
int c[3][N*N], d[3], rp, k, n, y;
char x[N];
int main() {
scanf("%d", &n);
scanf("%s", x);
if (n == 1) {
printf("%s\n", x);
return 0;
}
int k = 0;
d[0] = strlen(x);
for (int i = 0; i < d[0]; i++) c[0][d[0]-i] = x[i] - '0';
for (int op = 2; op <= n; op++) {
scanf("%s", x);
int l = k + 1;
if (l == 3) l = 0;
d[l] = strlen(x);
for (int i = 0; i < d[l]; i++) c[l][d[l]-i] = x[i] - '0';
int m = l + 1;
if (m == 3) m = 0;
for (int i = 1; i <= d[k] + d[l]; i++) c[m][i] = 0;
for (int i = 1; i <= d[k]; i++) {
rp = 0;
for (int j = 1; j <= d[l]; j++) {
c[m][i+j-1] = c[m][i+j-1] + c[k][i]*c[l][j] + rp;
rp = c[m][i+j-1] / 10;
c[m][i+j-1] %= 10;
}
c[m][i+d[l]] = rp;
}
d[m] = d[k] + d[l];
while (c[m][d[m]] == 0 && d[m] > 1) d[m]--;
k = m;
}
for (int i = d[k]; i >= 1; i--) printf("%d", c[k][i]);
return 0;
}