2389.cpp

来自「pku解题」· C++ 代码 · 共 53 行

#include <iostream>
#include <string.h>
using namespace std;

int p[41], q[41], r[82];

int integer_product(int *a, int m, int *b, int n, int *c)
{
	int i, j, k, p, q;
	k = m + n;
	for (i = 0; i < k; i++)
		c[i] = 0;
	for (i = 0; i < n; i++)
	{
		p = 0;
		for (j = 0; j < m; j++)
		{
			q = c[i + j] + a[j] * b[i] + p;
			c[i + j] = q %10;
			p = q / 10;
		}
		c[i + m] = p;
	}
	if (c[m + n - 1] == 0)
	   return 1;
	else 
		return 0;
}

int main(void)
{
	int i, j, k, l;
	char str[42];

	gets(str);
	k = strlen(str);
	for (i = k - 1; i >= 0; i--)
		p[k - i - 1] = str[i] - 48;
	gets(str);
	l = strlen(str);
	for (i = 0; i < l; i++)
		q[i] = str[l - i - 1] - 48;
    j = integer_product(p, k, q, l, r);
    for (i = k + l - 1 - j; i >= 0; i--)
			cout << r[i];
	cout << endl;
	system("pause");
	return 0;
}