公牛和母牛

公牛和母牛

Language:
Bull Math
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 16656 Accepted: 8491
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
Source

USACO 2004 November

---

代码：

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;
const int MAXLEN = 300;

char * multiply(char *m1,char *m2)
{
	int len1=strlen(m1);
	int len2=strlen(m2);
	int len=len1+len2;
	char *prod=new char[len*sizeof(char)];
	int a[MAXLEN];
	int b[MAXLEN];
	int c[MAXLEN];
	memset(a,0,sizeof(a));
	memset(b,0,sizeof(b));
	memset(c,0,sizeof(c));
	for(int i=0;i<len1;i++)
	{
		a[i]=m1[len1-i-1]-'0';
	}
	for(int i=0;i<len2;i++)
	{
		b[i]=m2[len2-i-1]-'0';
	}
	for(int i=0;i<len1;i++)
	{
		for(int j=0;j<len2;j++)
		{
			c[i+j]=c[i+j]+a[i]*b[j];
		}
	}
	for(int i=0;i<len;i++)
	{
		if(c[i]>=10)
		{
			c[i+1]+=c[i]/10;
			c[i]=c[i]%10;
		}
	}
	
	while(c[len-1]==0&&len>=1) len--;
	for(int i=0;i<len;i++)
		prod[i]=c[len-i-1]+'0';
	prod[len]='\0';
		
	return prod;
}

int main()
{
	char s1[MAXLEN], s2[MAXLEN];
	while(cin>>s1>>s2)
	{
		cout<<multiply(s1,s2)<<endl;
	}
	
	return 0;
}