# POJ 3673：Cow Multiplication

Cow Multiplication
 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 12210 Accepted: 8509

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 andB. 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>
#include <cmath>
#include <algorithm>
#include <string>
#include <cstring>
using namespace std;

int main()
{
string m,n;
cin>>m>>n;

int i,j,result=0;
for(i=0;i<m.length();i++)
{
for(j=0;j<n.length();j++)
{
result += (m[i]-'0')*(n[j]-'0');
}
}
cout<<result<<endl;
return 0;
}

• 本文已收录于以下专栏：

## poj Matrix Chain Multiplication

Language: Default Matrix Chain Multiplication Time Limit: 1000MS   Memory Limit: 6553...

## poj Matrix Chain Multiplication

Matrix Chain Multiplication Time Limit:1000MS  Memory Limit:65536K Total Submit:12 Accepted:6 De...

## Multiplication Puzzle POJ 1651

Description The multiplication puzzle is played with a row of cards, each containing a single p...

## poj 1651 Multiplication Puzzle

举报原因： 您举报文章：深度学习：神经网络中的前向传播和反向传播算法推导 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)