提交记录 28653
| 提交时间 |
评测时间 |
| 2025-10-27 13:21:02 |
2025-10-27 13:21:08 |
#include<iostream>
#include<string>
#define maxn 1000005
using namespace std;
int a[maxn], b[maxn], c[maxn];
int main()
{
string A, B;
cin >> A >> B;
int lena = A.length(), lenb = B.length();
for(int i = lena - 1; i >= 0; i --) a[lena - i] = A[i] - '0';
for(int i = lenb - 1; i >= 0; i --) b[lenb - i] = B[i] - '0';
for(int i = 1; i <= lena; i ++)
for(int j = 1; j <= lenb; j ++)
c[i + j - 1] += a[i] * b[j];
int len = lena + lenb;
for(int i = 1; i <= len; i ++) {
c[i + 1] += c[i] / 10;
c[i] %= 10;
}
for(;!c[len];)
len --;
for(int i = max(1, len); i >= 1; i --) {
cout << c[i];
}
return 0;
}
| Compilation | N/A | N/A | Compile OK | Score: N/A | 显示更多 |
| Testcase #1 | 3 s | 15 MB + 272 KB | Time Limit Exceeded | Score: 0 | 显示更多 |
Judge Duck Online | 评测鸭在线
Server Time: 2025-11-01 22:57:50 | Loaded in 0 ms | Server Status
个人娱乐项目,仅供学习交流使用 | 捐赠