A*B problem（FFT）

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#define pi acos(-1)
#define rep(i,x,y) for(register int i = x; i <= y;++i)
using namespace std;
const int N = 3e5;
struct cpx
{
    double r,i;
    cpx(){ }
    cpx(double x, double y) { r = x;i = y; }
    inline cpx operator *(const cpx&x)const{
        return cpx(r*x.r - i*x.i,r*x.i + i*x.r );
    }
    inline cpx operator *=(const cpx&x){
        *this = *this * x;
    }
    inline cpx operator +(const cpx&x)const{
        return cpx(r + x.r,i + x.i);
    }
    inline cpx operator -(const cpx&x)const{
        return cpx(r - x.r,i - x.i);
    }
}a[N],b[N];
int n,L,R[N],c[N];
char ch[N];
inline int read()
{
    int x = ; char c;int sign = ;
    do { c = getchar();if(c == '-') sign = -; }while(c < '' || c > '');
    do { x = x* + c - '';c = getchar(); }while(c <= '' && c >= '');
    x *= sign;
    return x;
}
inline void fft(cpx*a,int f)
{
    rep(i,,n-) if(i < R[i]) swap(a[i],a[R[i]]);
    for(register int i = ;i < n;i <<= ) {
        cpx wn(cos(pi/i),f*sin(pi/i));
        for(register int j = ;j < n;j += (i<<)) {
            cpx w(,);
            for(register int k = ;k < i;++k,w *= wn) {
                cpx x = a[j + k],y = w * a[j + k + i];
                a[j + k] = x + y; a[j + k + i] = x - y;
            }
        }
    }
    if(f == -) rep(i,,n - ) a[i].r /= n;
}
int main()
{
    n = read();n--;
    scanf("%s",ch);
    rep(i,,n) a[i].r = ch[n-i] - '';
    scanf("%s",ch);
    rep(i,,n) b[i].r = ch[n-i] - '';
    int m = *n; for(n = ;n <= m ;n <<= ) ++L;
    rep(i,,n-) R[i] = (R[i>>]>>)|((i&)<<(L-));
    fft(a,);fft(b,);
    rep(i,,n) a[i] *= b[i];
    fft(a,-);
    rep(i,,m) c[i] = (int)(a[i].r + 0.1);
    rep(i,,m)
        if(c[i] >= )
        {
            c[i+] += c[i] / ,c[i] %= ;
            if(i == m) m++;
        }
    while(m) if(c[m]) break; else m--;
    while(~m) printf("%d",c[m--]);
    return ;
}