Language: C++

#include<bits/stdc++.h>
using namespace std;
#define maxn 400010
#define ll long long
const double pi=acos(-1);
typedef complex<double> cp;
struct FFT
{
        int n,rev[maxn];
        cp omega[maxn],iomega[maxn];
        void init(int N)
        {
                n=N;
                for(int i=0;i<n;i++)
                {
                        omega[i]=cp(cos(2*pi/n*i),sin(2*pi/n*i));
                        iomega[i]=conj(omega[i]);
                }
                int k=log2(n);
                for(int i=0;i<n;i++)
                {
                        int t=0;
                        for(int j=0;j<k;j++)if(i&(1<<j))t|=(1<<(k-j-1));
                        rev[i]=t;
                }
        }
        void transform(vector<cp>& a,cp* omega)
        {
                for(int i=0;i<n;i++)if(i<rev[i])swap(a[i],a[rev[i]]);
                for(int len=2;len<=n;len<<=1)
                {
                        int mid=len>>1;
                        for(int j=0;j<n;j+=len)for(int i=0;i<mid;i++)
                        {
                                cp t=omega[n/len*i]*a[j+mid+i];
                                a[j+mid+i]=a[j+i]-t;
                                a[j+i]+=t;
                        }
                }
        }
        void fft(vector<cp>& a)
        {
                transform(a,omega);
        }
        void ifft(vector<cp>& a)
        {
                transform(a,iomega);
                for(int i=0;i<n;i++)a[i]/=n;
        }
};
vector<ll> mul(vector<ll> a,vector<ll> b)
{
        int n=1;
        int n1=(int)a.size(),n2=(int)b.size();
        while(n<n1+n2)n<<=1;
        vector<cp> tmp_a(n),tmp_b(n);
        for(int i=0;i<n1;i++)tmp_a[i]=cp(a[i],0);
        for(int i=0;i<n2;i++)tmp_b[i]=cp(b[i],0);
        init(n);
        fft(tmp_a);
        fft(tmp_b);
        for(int i=0;i<n;i++)tmp_a[i]*=tmp_b[i];
        ifft(tmp_a);
        vector<ll> ans(n);
        for(int i=0;i<n;i++)ans[i]=round(tmp_a[i].real());
        while((int)ans.size()>1 && ans.back()==0)ans.pop_back();
        return ans;
}
vector<ll> a,b;
int main()
{
        char c[maxn];
        bool flag=0;
        scanf("%s",c);
        int n=strlen(c);
        if(c[0]=='-')flag^=1;
        for(int i=0;i<n;i++)
        {
                if(c[i]!='-')a.push_back(c[i]-'0');
        }
        reverse(a.begin(),a.end());
        scanf("%s",c);
        if(c[0]=='-')flag^=1;
        n=strlen(c);
        for(int i=0;i<n;i++)
        {
                if(c[i]!='-')b.push_back(c[i]-'0');
        }
        reverse(b.begin(),b.end());
        vector<ll> s;
        vector<int> ans;
        s=mul(a,b);
        n=(int)s.size();
        int cur=0;
        for(int i=0;i<n;i++)
        {
                cur=cur/10+s[i];
                ans.push_back(cur%10);
        }
        cur/=10;
        if(cur)ans.push_back(cur);
        reverse(ans.begin(),ans.end());
        if(!flag || ((int)ans.size()==1 && ans[0]==0))
        {
                for(int i=0;i<(int)ans.size();i++)printf("%d",ans[i]);puts("");
        }
        else
        {
                putchar('-');
                for(int i=0;i<(int)ans.size();i++)printf("%d",ans[i]);puts("");
        }


        return 0;
}



Compiler output:
a.cc: In function 'std::vector<long long int> mul(std::vector<long long int>, std::vector<long long int>)':
a.cc:59:9: error: 'init' was not declared in this scope; did you mean 'int'?
   59 |         init(n);
      |         ^~~~
      |         int
a.cc:60:9: error: 'fft' was not declared in this scope; did you mean 'ffs'?
   60 |         fft(tmp_a);
      |         ^~~
      |         ffs
a.cc:63:9: error: 'ifft' was not declared in this scope
   63 |         ifft(tmp_a);
      |         ^~~~