码迷,mamicode.com
首页 > 其他好文 > 详细

ACM-另类乘法

时间:2015-05-26 14:29:34      阅读:145      评论:0      收藏:0      [点我收藏+]

标签:

描述

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


代码:

01.//字符串转化成整形数组不能进行强制转化!!!
02.#include<iostream>
03.#include<string>
04.#include<stdio.h>
05.using namespace std;
06.int main()
07.{
08.int t;
09.cin>>t;
10.while(t--)
11.{
12.int sum2=0,sum1=0,i,j;
13.string a ,b;;
14.cin>>a;
15.cin>>b;
16. 
17.for(i = 0;i < a.length();i++)
18.sum1 += a[i] - ‘0‘;
19.for(j = 0;j < b.length();j++)
20.sum2 += b[j] -‘0‘;
21.cout<<sum1*sum2<<endl;
22.}
23.return 0;
24.}


ACM-另类乘法

标签:

原文地址:http://blog.csdn.net/u012701023/article/details/46006219

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!