本文共 1133 字,大约阅读时间需要 3 分钟。
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 13312 | Accepted: 9307 |
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
Source
1 #include2 #include 3 #include 4 #include 5 using namespace std; 6 int main() 7 { 8 char a[10005],b[10005]; 9 int c[10005];10 while(scanf("%s%s",&a,&b)!=EOF)11 {12 memset(c,0,sizeof(c));13 int s=0;14 int lena=strlen(a);15 int lenb=strlen(b);16 for(int i=0;i
转载地址:http://jgpja.baihongyu.com/