Submission #1094547

#	Time	Username	Problem	Language	Result	Execution time	Memory
1094547		raphaelp	Multiply (CEOI17_mul)	C++14	100 / 100	868 ms	1288 KiB

mul

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int N, M;
    cin >> N >> M;
    vector<int> A(N), B(M), ans(N + M + 1);
    string S1, S2;
    cin >> S1 >> S2;
    for (int i = 0; i < N; i++)
    {
        A[i] = S1[N - i - 1] - '0';
    }
    for (int i = 0; i < M; i++)
    {
        B[i] = S2[M - i - 1] - '0';
    }
    for (int i = 0; i < N; i++)
    {
        for (int j = 0; j < M; j++)
        {
            ans[i + j] += A[i] * B[j];
        }
    }
    for (int i = 0; i < N + M; i++)
    {
        ans[i + 1] += ans[i] / 10;
        ans[i] %= 10;
    }
    int buff = N + M;
    while (buff > 0 && ans[buff] == 0)
        buff--;
    while (buff >= 0)
    {
        cout << ans[buff--];
    }
}

• Subtask 1: 20 / 20
• Subtask 2: 20 / 20
• Subtask 3: 30 / 30
• Subtask 4: 30 / 30