1 , 4 , 5WA 求助
  • 板块P1303 A*B Problem
  • 楼主lnwwr
  • 当前回复3
  • 已保存回复3
  • 发布时间2020/8/9 12:10
  • 上次更新2023/11/6 20:51:47
查看原帖
1 , 4 , 5WA 求助
347174
lnwwr楼主2020/8/9 12:10
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
string num1, num2;
int a1[105], a2[105], len1, len2, a[205], len;
int main() {
    cin >> num1 >> num2;
    len1 = num1.size();
    for (int i = 0; i < len1; i++) {
        a1[i] = num1[len1 - 1 - i] - '0';
    }
    len2 = num2.size();
    for (int i = 0; i < len2; i++) {
        a2[i] = num2[len2 - 1 - i] - '0';
    }
    for(int i=0;i<len1;i++)
    {
        for(int j=0;j<len2;j++)
        {
            a[i+j]+=a1[i]*a2[j];
        }
    }
    len=len1+len2-1;
    for (int i = 0; i < len; i++) {
        a[i + 1] += a[i] / 10;
        a[i] %= 10;
    }
    while (a[len]) {
        a[len + 1] += a[len] / 10;
        a[len] %= 10;
        len++;
    }
    for (int i = len - 1; i >= 0; i--) {
        cout << a[i];
    }
    cout << endl;
    return 0;
}
2020/8/9 12:10
加载中...