高精度之乘法模板

#include<cstdio>
#include<string>
#include<iostream>
#include<algorithm>
using namespace std;
string s1,s2;
int a[520],b[520],c[1314],l1,l2,l;
inline void chuli() {
    l1=s1.size();l2=s2.size();
    reverse(s1.begin(),s1.end());
    for(int i=0;i<l1;i++)
      a[i+1]=s1[i]-'0';
    reverse(s2.begin(),s2.end());
    for(int i=0;i<l2;i++)
      b[i+1]=s2[i]-'0';
}
inline void cheng() {
    l=l1+l2;
    for(int i=1;i<=l1;i++)
      for(int j=1;j<=l2;j++)
        c[i+j-1]+=a[i]*b[j];
    for(int i=1;i<=l;i++)
      c[i+1]+=c[i]/10,c[i]%=10;
    while((c[l]==0)&&l>1) l--;
    return;
}
inline void print() {
    for(int i=l;i>0;i--)
      printf("%d",c[i]);
    printf("\n");
    return;
}
int hh() {
    cin>>s1>>s2;
    chuli();
    cheng();
    print();
    return 0;
}
int hhh=hh();
int main() {;}