提交记录 3181
| 提交时间 |
评测时间 |
| 2018-07-10 13:12:14 |
2020-07-31 21:12:16 |
#include <stdio.h>
#include <string.h>
const int MAXN = 10005;
int a[MAXN], b[MAXN];
int c[MAXN * 2];
int read(int *a) {
static char buf[MAXN];
scanf("%s", buf);
int n = strlen(buf);
for (int i = 0; i < n; i++) {
a[n - 1 - i] = buf[i] - 48;
}
return n;
}
int main() {
int n_a = read(a), n_b = read(b);
for (int i = 0; i < n_a; i++) {
for (int j = 0; j < n_b; j++) {
c[i + j] += a[i] * b[j];
}
}
for (int i = 0; i < n_a + n_b; i++) {
c[i + 1] += c[i] / 10;
c[i] = c[i] % 10;
}
int i;
for (i = n_a + n_b; i; i--) {
if (c[i]) break;
}
for (; i >= 0; i--) {
putchar(c[i] + 48);
}
}
| Compilation | N/A | N/A | Compile OK | Score: N/A | 显示更多 |
| Testcase #1 | 55.867 ms | 196 KB | Accepted | Score: 100 | 显示更多 |
Judge Duck Online | 评测鸭在线
Server Time: 2026-04-19 02:37:15 | Loaded in 1 ms | Server Status
个人娱乐项目,仅供学习交流使用 | 捐赠