另类乘法

另类乘法

时间限制： 3000 ms  |  内存限制： 65535 KB

难度： 1

描述

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.

输入

The first Line of the input is a positive integer T,indicates the number of the test cases;
In every case,the input is in one line,contains two positive interger A,B

输出

For every case,output the multiplication in Bessie's style.

样例输入

1
123 45

样例输出

54

原创代码：

#include<stdio.h>
#include<string.h>
int main()
{
	int n,sum,i,j,l,k;
	char a[25];
	scanf("%d",&n);
	getchar();
	while(n--)
	{
		gets(a);
		sum=0;
		l=strlen(a);
		for(i=0;a[i]!=' ';i++);
		for(j=0;j<i;j++)
			for(k=i+1;k<l;k++)
				sum=sum+(a[k]-'0')*(a[j]-'0');
			printf("%d\n",sum);
	}
	return 0;
}

最优代码：