另类乘法 nyist121

最新推荐文章于 2017-09-26 11:43:30 发布

Fate_O

最新推荐文章于 2017-09-26 11:43:30 发布

阅读量649

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM->简单题

本文链接：https://blog.youkuaiyun.com/u011676717/article/details/11677573

ACM->简单题专栏收录该内容

15 篇文章

订阅专栏

本文介绍了一种新颖的乘法运算方式——Bessie风格乘法，该方法通过求两个数各位置上的数字两两组合之和来计算乘积。提供了一个C++实现示例，用于快速解决特定范围内的整数乘法问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

样例输出

#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;
}