pku 2389解题报告

 

Bull Math

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 7923		Accepted: 4094

Description

Bulls are so much better at math than the cows. They can multiply huge integers together and get perfectly precise answers ... or so they say. Farmer John wonders if their answers are correct. Help him check the bulls' answers. Read in two positive integers (no more than 40 digits each) and compute their product. Output it as a normal number (with no extra leading zeros). 

FJ asks that you do this yourself; don't use a special library function for the multiplication.

Input

* Lines 1..2: Each line contains a single decimal number.

Output

* Line 1: The exact product of the two input lines

Sample Input

11111111111111
1111111111

Sample Output

12345679011110987654321

水题，就是高精度乘法。

代码：

语言：c++

#include<iostream>
using namespace std;
#include<cstring>
using namespace std;
int main()
{
	char m1[1000],m2[1000];
	char *multiply(char *m1,char *m2);
	while(cin>>m1>>m2)
		cout<<multiply(m1,m2)<<endl;
	return 0;
}
char *multiply(char *m1,char *m2)
{
	int *str2int(char *str);
	char *int2str(int *a,int n);
	int check(int *a,int n);
	int len1=strlen(m1),len2=strlen(m2),len,*t1,*t2,*prod,i,j;
	len=len1+len2;
	t1=str2int(m1);
	t2=str2int(m2);
	prod=new int[(len+1)*sizeof(int)];
	for(i=0;i<=len;++i)
		prod[i]=0;
	for(i=0;i<len1;++i)
		for(j=0;j<len2;++j)
			prod[i+j]+=t1[i]*t2[j];
	len=check(prod,len);
	return int2str(prod,len);
}
int *str2int(char *str)
{
	int len=strlen(str);
	int *a=new int[(len+1)*sizeof(int)];
	for(int i=0;i<len;++i)
		a[i]=(int)str[len-1-i]-'0';
	return a;
}
char *int2str(int *a,int n)
{
	int len=n;
	char *str=new char[(len+1)*sizeof(char)];
	for(int i=0;i<len;++i)
		str[i]=(char)a[len-1-i]+'0';
	str[len]='/0';
	return str;
}
int check(int *a,int n)
{
	int len=n,i;
	while(len>1&&a[len-1]==0)
		--len;
	for(i=0;i<len;++i)
		if(a[i]>=10)
		{
			a[i+1]+=a[i]/10;
			a[i]%=10;
		}
	if(a[i]!=0)
		len=i+1;
	return len;
}