分析:
首先axb的计算步骤应该是如下
实际上依据题意转为+后就变成了
改为相加后,如下图所示
可以发现,100,20,3,400,50,6都分别被加上了3次
所以123被加上了3次,456被加上了3次
可以得出一个性质 答案=A*B的位数+B*A的位数
由于题目可能有10^6位数,所以需要高精度
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const long long mod = 998244353;
typedef long long ll;
vector<int> mul(vector<int>& A, int b)
{
vector<int> C;
int t = 0;
for (int i = 0;i < A.size() || t;i++)
{
if (i < A.size())
t += A[i] * b;
C.push_back(t % 10);
t /= 10;
}
while (C.size() > 1 && C.back() == 0)
C.pop_back();
return C;
}
vector<int> add(vector<int>& A, vector<int> B)
{
if (A.size() < B.size())
return add(B, A);
int t = 0;
vector<int> C;
for (int i = 0;i < A.size();i++)
{
t += A[i];
if (i < B.size())
t += B[i];
C.push_back(t % 10);
t /= 10;
}
if (t)
C.push_back(t);
return C;
}
vector<int> div1(vector<int>& A, ll b, ll& r)
{
reverse(A.begin(), A.end());
vector<int> C;
for (int i = 0;i < A.size();i++)
{
r = r * 10 + A[i];
C.push_back(r / b);
r %= b;
}
reverse(C.begin(), C.end());
while (C.size() > 1 && C.back() == 0)
C.pop_back();
return C;
}
int main()
{
int t;
cin >> t;
while (t--)
{
string a, b;
cin >> a >> b;
vector<int> A, B;
for (int i = a.size() - 1;i >= 0;i--)
A.push_back(a[i] - '0');
for (int j = b.size() - 1;j >= 0;j--)
B.push_back(b[j] - '0');
A = mul(A, b.size());
B = mul(B, a.size());
long long r = 0;
auto D = add(A, B);
auto C = div1(D, mod, r);
cout << r << '\n';
}
}