UVa 10106 Product

最新推荐文章于 2019-02-16 22:41:02 发布

原创最新推荐文章于 2019-02-16 22:41:02 发布 · 1.3k 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#up #2010

UVa 专栏收录该内容

92 篇文章

订阅专栏

本文提供了一段用于解决UVa10106问题的大数乘法C++代码实现。该算法通过字符串反转和逐位相乘的方式实现了任意精度整数的乘法运算，适用于在线评测系统。

/* coder: ACboy date: 2010-2-22 result: AC description: UVa 10106 Product */ #include <iostream> #include <stdio.h> #include <string.h> using namespace std; char a[260], b[260]; int result[550]; void reverse(char a[]) { int len = strlen(a); for (int i = 0; i < len / 2; i++) { char temp = a[i]; a[i] = a[len - 1 - i]; a[len - 1 - i] = temp; } } void multiply(char a[], char b[]) { int i, j; int alen = strlen(a); int blen = strlen(b); memset(result, 0, sizeof(result)); reverse(a); reverse(b); int len = 0; int up; for (i = 0; i < alen; i++) { up = 0; for (j = 0; j < blen; j++) { int temp = result[i + j] + (a[i] - '0') * (b[j] - '0') + up; up = temp / 10; result[i + j] = temp % 10; } if (up > 0) result[i + j] = up; } if (up > 0) len = alen + blen; else len = alen + blen - 1; if (strcmp(a, "0") == 0 || strcmp(b, "0") == 0) len = 1; for (int t = len - 1; t >= 0; --t) cout << result[t]; cout << endl; } int main() { #ifndef ONLINE_JUDGE freopen("10106.txt", "r", stdin); #endif while (scanf("%s%s", a, b) != EOF) { memset(result, 0, sizeof(result)); multiply(a, b); } return 0; }