贴个渣模板
CODE:
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define MAX 140010
#define PI 3.1415926535897932384626
using namespace std;
struct Complex{
double real,imag;
Complex(double _,double __):real(_),imag(__) {}
Complex() {}
Complex operator +(const Complex &a)const {
return Complex(real + a.real,imag + a.imag);
}
Complex operator -(const Complex &a)const {
return Complex(real - a.real,imag - a.imag);
}
Complex operator *(const Complex &a)const {
return Complex(real * a.real - imag * a.imag,real * a.imag + imag * a.real);
}
void operator *=(const Complex &a) {
*this = *this * a;
}
void Read() {
int temp;
scanf("%1d",&temp);
real = temp;
}
}a[MAX],b[MAX],ans[MAX];
int n;
int out[MAX];
void FFT(Complex x[],int n,int flag)
{
static Complex temp[MAX];
if(n == 1) return ;
for(int i = 0; i < n; i += 2)
temp[i >> 1] = x[i],temp[(i + n) >> 1] = x[i + 1];
memcpy(x,temp,sizeof(Complex) * n);
Complex *l = x,*r = x + (n >> 1);
FFT(l,n >> 1,flag),FFT(r,n >> 1,flag);
Complex unit(cos(flag * 2 * PI / n),sin(flag * 2 * PI / n)),w(1.0,.0);
for(int i = 0; i < (n >> 1); ++i,w *= unit)
temp[i] = l[i] + w * r[i],temp[i + (n >> 1)] = l[i] - w * r[i];
memcpy(x,temp,sizeof(Complex) * n);
}
int main()
{
cin >> n;
for(int i = n - 1; ~i; --i)
a[i].Read();
for(int i = n - 1; ~i; --i)
b[i].Read();
int l;
for(l = 1; l <= (n << 1); l <<= 1);
FFT(a,l,1),FFT(b,l,1);
for(int i = 0; i < l; ++i)
ans[i] = a[i] * b[i];
FFT(ans,l,-1);
for(int i = 0; i < l; ++i)
out[i] = int(ans[i].real / l + .5);
int temp = 0;
for(int i = 0; i < l; ++i) {
out[i] += temp;
temp = out[i] / 10;
out[i] %= 10;
}
while(temp) out[l++] = temp % 10,temp /= 10;
while(!out[l - 1]) --l;
for(int i = l - 1; ~i; --i)
printf("%d",out[i]);
return 0;
}