智商变成负数
记得 除n 加0.5
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
struct C
{
double real,i;
C(double a=0,double b=0){real=a,i=b;}
C operator + (C a){return C(real+a.real,i+a.i);}
C operator - (C a){return C(real-a.real,i-a.i);}
C operator * (C a){return C(real*a.real-i*a.i,i*a.real+real*a.i);}
};
const int MAXN=600000+10;
const double PI=acos(-1);
C a[MAXN],b[MAXN];
int n,rev[MAXN];
char s[MAXN];
void FFT(C x[],int k)
{
for(int i=0;i<n;i++) if(rev[i]<i) swap(x[i],x[rev[i]]);
for(int i=2;i<=n;i<<=1)
{
C wn(cos(2*PI/i),k*sin(2*PI/i));
for(int j=0;j<n;j+=i)
{
C t,tmp,w(1,0);
for(int p=0;p<i/2;p++)
{
tmp=x[j+p];
t=x[j+i/2+p]*w;
x[j+p]=tmp+t;
x[j+i/2+p]=tmp-t;
w=w*wn;
}
}
}
}
int out[MAXN*10],tot;
int main()
{
cin >>n;
scanf("%s",s);for(int i=0;i<n;i++) a[i].real=s[n-i-1]-'0';
scanf("%s",s);for(int i=0;i<n;i++) b[i].real=s[n-i-1]-'0';
int tmp=n+n;n=1;
while(n<tmp) n<<=1;
for(int i=0;i<n;i++) rev[i]=(rev[i>>1]>>1)|((i&1)?n>>1:0);
FFT(a,1);
FFT(b,1);
for(int i=0;i<n;i++) a[i]=a[i]*b[i];
FFT(a,-1);
int i=n-1;
while((int)(a[i].real/(double)n+0.5)==0) i--;
for(int j=0;j<=i;j++)
out[++tot]=(int)(a[j].real/(double)n+0.5);
for(int j=1;j<=tot;j++)
{
if(out[j]>9)
{
out[j+1]+=out[j]/10;
out[j]%=10;
tot=max(tot,j+1);
}
}
for(int j=tot;j>=1;j--) printf("%d",out[j]);
return 0;
}