poj 3673 Cow Multiplication

Cow Multiplication

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 9215		Accepted: 6185

Description

Bessie is tired of multiplying pairs of numbers the usual way, so she invented her own style of multiplication. In her style, A*B is equal to the sum of all possible pairwise products between the digits of A and B. For example, the product 123*45 is equal to 1*4 + 1*5 + 2*4 + 2*5 + 3*4 + 3*5 = 54. Given two integers A and B (1 ≤ A, B ≤ 1,000,000,000), determine A*B in Bessie's style of multiplication.

Input

* Line 1: Two space-separated integers: A and B.

Output

* Line 1: A single line that is the A*B in Bessie's style of multiplication.

Sample Input

123 45

Sample Output

54

#include<iostream>
using namespace std;
int main()
{
char a[11];
char b[11];
int sum;
int i,j;
int lena,lenb;
    cin>>a>>b;
    sum=0;
    lena=strlen(a);
    lenb=strlen(b);
for(i=0;i<lena;i++)
    {
for(j=0;j<lenb;j++)
            sum+=(a[i]-'0')*(b[j]-'0');
    }
    cout<<sum<<endl;
return 0;
}

转载于:https://www.cnblogs.com/w0w0/archive/2011/11/23/2259869.html