提交时间:2024-08-20 12:51:00

运行 ID: 168656

#include<bits/stdc++.h> using namespace std; const int N = 10001; const int INF = 0x3f3f3f3f; #define LL long long #define quick_cin_cout ios::sync_with_stdio(false);cin.tie(0);cout.tie(0); #define endl '\n' #define I return #define AK 0 #define IOI ; char a1[N],b1[N]; int a[N],b[N],i,x,len,j,c[N]; int main(){ cin >> a1 >> b1; int lena = strlen(a1); int lenb = strlen(b1); for(int i = 1;i <= lena;i++) a[i] = a1[lena - i] - '0'; for(int i = 1;i <= lenb;i++) b[i] = b1[lenb - i] - '0'; for(int i = 1;i <= lenb;i++) for(int j = 1;j <= lena;j++) c[i + j - 1] += a[j] * b[i]; for(i = 1;i < lena + lenb;i++){ if(c[i]>9){ c[i + 1] += c[i] / 10; c[i] %= 10; } } len = lena + lenb; while(c[len] == 0 && len > 1) len--; for(i = len;i>= 1;i--) cout << c[i]; I AK IOI } /*Note:*********************** *****************************/ //coder:Mino_XIE1212