炸掉的fft，改天再调

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>

#define cal(...)(Vec){__VA_ARGS__}
const int BUF = ;
char Buf[BUF], *buf = Buf;

inline void read (int &now)
{
    for (now = ; !isdigit (*buf); ++ buf);
    for (; isdigit (*buf); now = now *  + *buf - '', ++ buf);
}
#define Max 150000

const double PI = acos (-.);
struct Vec
{
    double x, y;
};

inline Vec operator + (Vec A, Vec B)
{
    return cal (A.x + B.x, A.y + B.y);
}
inline Vec operator - (Vec A, Vec B)
{
    return cal (A.x - B.x, A.y - B.y);
}
inline Vec operator * (Vec A, Vec B)
{
    return cal (A.x * B.x - A.y * B.y, A.x * B.y + A.y * B.x);
}
inline Vec conj (Vec now)
{
    return cal (now.x, -now.y);
}

Vec *Get_w (int N)
{
    static Vec w[Max / ];
       w[].x = ;
    w[] = cal (cos( * PI / N), sin ( * PI / N));
    for (int i = ; i < N / ; ++ i)
        w[i] = w[i - ] * w[];
    return w;
}

void FFT (Vec *a, int N)
{
    register int i, j, k;
       for (i = , j = ; i < N; ++ i)
    {
        if (i < j)
            std :: swap (a[i], a[j]);
        for (k = N >> ; ; k >>= )
            if ((j ^= k) >= k)
                break;
    }
    for (i = ; i < N; i <<= )
    {
        Vec *w = Get_w (i << );
        for (j = ; j < N; j += i << )
        {
            Vec *b = a + j, *c = b + i;
            for (k = ; k < i; ++ k)
            {
                Vec v = w[k] * c[k];
                c[k] = b[k] - v;
                b[k] = b[k] + v;
            }
        }
    }
}

void Mul (int *s, int *t, int N)
{
    static Vec a[Max], b[Max], c[Max];
    register int i, j;
    for (i = ; i < N; ++ i)
    {
        a[i] = cal (s[i << ], s[i <<  | ]);
        b[i] = cal (s[i << ], t[i <<  | ]);
    }
    FFT (a, N), FFT (b, N);
    Vec *w = Get_w (N);
    for (i = ; i < N; ++ i)
    {
        j = N - i & N - ;
        c[j] = (conj (a[j] * b[j]) * cal() - (conj (a[j]) - a[i]) * (conj (b[j]) - b[i]) * ((i < N /  ? w[i] : w[i - N / ] * cal(-)) + cal())) * cal(,.);
    }
    FFT (c, N);
    for (i = ; i < N; ++ i)
    {
        s[i << ] = c[i].y / N + .;
        s[i <<  | ] = c[i].x / N + .;
    }
}

int Main ()
{
    freopen ("yukari.wife", "r", stdin);
    fread (buf, , BUF, stdin);

    static int a[Max << ], b[Max << ];
    int N, M;
    read (N);
    read (M);

    register int i;
    for (i = ; i <= N; ++ i)
        read (a[i]);
    for (i = ; i <= M; ++ i)
        read (b[i]);
    int l =  << std :: __lg (N + M + );
    Mul (a, b, l >> );
    for (i = , N += M; i <= N; ++ i)
       printf ("%d ", a[i]);
    return ;
}
int ZlycerQan = Main ();
int main (int argc, char *argv[]) {;}