NYOJ 121 另类乘法

最新推荐文章于 2020-12-21 18:53:59 发布

6个小石头

最新推荐文章于 2020-12-21 18:53:59 发布

阅读量427

点赞数

分类专栏：语言入门文章标签： C语言基础 ACM入门基础 NYOJ 121 另类乘法

本文链接：https://blog.csdn.net/LiuJiuXiaoShiTou/article/details/75804751

版权

语言入门专栏收录该内容

77 篇文章 0 订阅

订阅专栏

另类乘法

时间限制： 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

样例输出

来源

POJ

上传者

admin

/*
**类型：入门级题目
**题目来源：NYOJ  121
**时间：2017/7/22
**解决方案：A B < 10 0000 0000， 整数的表示范围为 -2147483648～21 4748 3647
**          故用字符串处理数据A,B 
*/
#include<stdio.h>
#include<string.h>
int main()
{
	int T;  //T组测试数据
	scanf("%d",&T);
	while(T--)
	{
		char m[20], n[20];
		scanf("%s%s",m,n);   
		int sum = 0;
		for(int i = 0; i < strlen(m); i++)
		{
			for(int j = 0; j < strlen(n); j++)
			{
				sum = sum + (m[i]-'0')*(n[j]-'0');
			}
		}
		printf("%d\n",sum);
	 } 
	return 0;
}
//思考什么时候需要将数组初始化为0