7-10 B题 POJ 3673 字符串处理

B - Cow Multiplication
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
Submit

Status

Practice

POJ 3673
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

字符串处理，主要是讲数字字符串转化为int型的数字（- 48即可）

<pre name="code" class="cpp">#include<iostream>
using namespace std;
int main()
{
   string s1, s2;
   cin >> s1 >> s2;
   int s1l = s1.size();
   int s2l = s2.size();
   int ans = 0;
   for(int i = 0; i < s1l; i++)
   {
       for(int j = 0; j < s2l; j++)
       {
           ans += ((int)(s1[i]) -48) * ((int)(s2[j]) - 48);
       }
   }
   cout << ans << endl;
   return 0;
}