另类乘法 nyist121

本文主要是介绍另类乘法 nyist121，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

描述

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 <iostream>
#include <string>
#include <algorithm>using namespace std;void input()
{int t;string a, b;cin >> t;while (t--){int sum = 0;cin >> a >> b;for (int i = 0; i < a.length(); i++){for (int j = 0; j < b.length(); j++){sum += (a[i] - '0') * (b[j] - '0');}}cout << sum << endl;}
}int main()
{std::ios::sync_with_stdio(false);input();return 0;
}

这篇关于另类乘法 nyist121的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---