criyle/codenet-compile-errors huggingface dataset:
Language: C++

#include <atcoder/mincostflow>
#include <bits/stdc++.h>
using namespace atcoder;
using namespace std;

typedef long long ll;

const ll MAX = 1000000000;

int main()
{
	int n, k;
	ll a;
	scanf("%d%d", &n, &k);
	mcf_graph<int, ll> graph(n*2+2);
	int s = n*2, t = n*2+1;
	for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) {
		scanf("%lld", &a);
		graph.add_edge(i, n+j, 1, MAX-a);
	}
	graph.add_edge(s, t, n*k, MAX);
	for (int i = 0; i < n; ++i) {
		graph.add_edge(s, i, k, 0);
		graph.add_edge(n+i, t, k, 0);
	}
	auto ans = graph.flow(s, t, n*k);
	printf("%lld\n", MAX*n*k-ans.second);
	char grid[n][n+5];
	memset(grid, '.', sizeof grid);
	auto edges = graph.edges();
	for (auto e : edges) {
		if (e.from != s && e.to != t && e.flow) {
			grid[e.from][e.to-n] = 'X';
		}
	}
	for (int i = 0; i < n; ++i) {
		grid[i][n] = '\0';
		printf("%s\n", grid[i]);
	}
}

Compiler output:
a.cc:1:10: fatal error: atcoder/mincostflow: No such file or directory
    1 | #include <atcoder/mincostflow>
      |          ^~~~~~~~~~~~~~~~~~~~~
compilation terminated.
Language: C++

#define _DEBUG
#include "bits/stdc++.h"
#include <atcoder/all>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define debug_4(x1,x2,x3,x4) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<endl
#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<", "#x5<<": "<<x5<<endl
#ifdef _DEBUG
#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)
#else
#define debug(...)
#endif
#define rep(index,num) for(int index=0;index<(int)num;index++)
#define rep1(index,num) for(int index=1;index<=(int)num;index++)
#define brep(index,num) for(int index=(int)num-1;index>=0;index--)
#define brep1(index,num) for(int index=(int)num;index>0;index--)
#define scan(argument) cin>>argument
#define prin(argument) cout<<argument<<endl
#define kaigyo cout<<endl
#define eps 1e-7
#define mp(a1,a2) make_pair(a1,a2)
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
typedef long long ll;
typedef long double ld;
using namespace std;
using namespace atcoder;
typedef pair<ll,ll> pll;
typedef pair<int,int> pint;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<pint> vpint;
typedef vector<pll> vpll;
ll INFl=(ll)1e+18+1;
int INF=1e+9+1;
int main(){
	int N,K;
	ll A[51][51];
	scan(N>>K);
	mcf_graph<int,ll> g(2*N+2);
	g.add_edge(2*N,2*N+1,N*K,INF);//流せるだけ流せばよいとは限らないので、sからtへ利益0の逃げ道を作る
	rep(i,N) g.add_edge(2*N,i,K,0);//sから行へ
	rep(i,N) g.add_edge(N+i,2*N+1,K,0);//列からtへ
	rep(i,N){
		rep(j,N){
			scan(A[i][j]);
			g.add_edge(i,N+j,1,INF-A[i][j]);//行から列へ、それぞれ1つしか選択できない
		}
	}
	char s[51][51]={};
	rep(i,N) rep(j,N) s[i][j]='.';
	pll capcost=g.flow(2*N,2*N+1,N*K);//流せる最大量はN*K
	ll ans=(ll)N*K*INF-capcost.second;//全体を通して必ずN*Kだけ流れている
	for(const auto& e:g.edges()){
		//debug(e.from,e.to,e.flow,e.cost);
		if(e.cap==1&&e.flow==1){
			s[e.from][e.to-N]='X';
		}
	}
	prin(ans);
	rep(i,N) prin(s[i]);
	return 0;
}


Compiler output:
a.cc:3:10: fatal error: atcoder/all: No such file or directory
    3 | #include <atcoder/all>
      |          ^~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;

#include <atcoder/all>
using namespace atcoder;


ll a[60][60];

int main(){
    int n,k;
    cin >> n >> k;
    rep(i,n)rep(j,n) cin >> a[i][j];
    int s = 2*n,t = 2*n+1;

    mcf_graph<int,ll> G(2*n+2);

    G.add_edge(s,t,n*k,LINF);

    rep(i,n){
        G.add_edge(s,i,k,0);
        G.add_edge(i+n,t,k,0);
    }

    rep(i,n)rep(j,n){
        G.add_edge(i,j+n,1,LINF-a[i][j]);
    }

    pair<int,ll> ans = G.flow(s,t,n*k);

    cout << (ll)ans.first * LINF - ans.second << endl;

    vector<vector<char>> maze(n,vector<char>(n,'.'));

    auto edges = G.edges();
    for(auto e:edges){
        if(e.from == s || e.to == t || e.flow == 0) continue;

        maze[e.from][e.to-n] = 'X';
    }

    rep(i,n){
        rep(j,n){
            cout << maze[i][j];
        }
        cout << endl;
    }

    return 0;
}

Compiler output:
a.cc:12:10: fatal error: atcoder/all: No such file or directory
   12 | #include <atcoder/all>
      |          ^~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <atcoder/mincostflow>
#include <iostream>

int main() {
    const long long inf = 1001001001;
    
    int n, k;
    std::cin >> n >> k;
    std::vector<std::vector<int>> a(n, std::vector<int>(n));
    for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) std::cin >> a[i][j];
    
    atcoder::mcf_graph<int, long long> g(2 * n + 2);
    int s = 2 * n, t = 2 * n + 1;
    g.add_edge(s, t, n * k, inf);
    for (int i = 0; i < n; ++i) {
        g.add_edge(s, i, k, 0);
        g.add_edge(i + n, t, k, 0);
    }
    for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) g.add_edge(i, j + n, 1, inf - a[i][j]);
    
    auto ans = g.flow(s, t, n * k);
    std::cout << inf * n * k - ans.second << "\n";
    std::vector<std::vector<char>> grid(n, std::vector<char>(n, '.'));
    auto edges = g.edges();
    for (auto e : edges) {
        if (e.from == s || e.to == t || e.flow == 0) continue;
        grid[e.from][e.to - n] = 'X';
    }
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) std::cout << grid[i][j];
        std::cout << "\n";
    }
}


Compiler output:
a.cc:1:10: fatal error: atcoder/mincostflow: No such file or directory
    1 | #include <atcoder/mincostflow>
      |          ^~~~~~~~~~~~~~~~~~~~~
compilation terminated.
Language: C++

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <atcoder/all>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))

using namespace std;

using namespace atcoder;

const ll INF=1e15;

int main(){
    int n,k;
    cin >> n >> k;
    vector<vector<int>> num(n,vector<int>(n));
    mcf_graph<int,ll> mcf(2*n+2);
    int S=2*n,T=2*n+1;
    rep(i,n){
        rep(j,n){
            cin >> num[i][j];
            mcf.add_edge(i,n+j,1,INF-num[i][j]);
        }
        mcf.add_edge(S,i,k,0);
        mcf.add_edge(n+i,T,k,0);
    }
    auto mcf2=mcf;
    ll flow = 0, cost = 0;
    for(auto p:mcf2.slope(S, T)){
        Int tmp = p.first * INF - p.second;
        if(tmp > cost){
            cost = tmp;
            flow = p.first;
        }
    }
    mcf.flow(S, T, flow);
    
    vector<string> field(n, string(n,'.'));
    
    
    for(auto e:mcf.edges())
        if(e.from != S && e.to != T && e.flow == 1)
            field[e.from][e.to - n] = 'X';
    
    cout << cost << endl;
    for(auto row:field)cout << row << endl;
    
    return 0;
}

Compiler output:
a.cc:3:10: fatal error: atcoder/all: No such file or directory
    3 | #include <atcoder/all>
      |          ^~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;

const long long INF = 1001001001;

int main(){
    int n, k; cin >> n >> k;
    mcf_graph<int, long long> ans(2 * n + 2);
    int s = 2 * n, t = s + 1;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            long long a; cin >> a; a = INF - a;
            ans.add_edge(i, n + j, 1, a);
        }
    }
    for (int i = 0; i < n; i++) {
        ans.add_edge(s, i, k, 0ll);
        ans.add_edge(n + i, t, k, 0ll);
    }
    ans.add_edge(s, t, n * k, INF);

    cout << INF * n * k - ans.flow(s, t).second << "\n";

    vector<string> res(n, vector<char>(n, '.'));
    for (auto p : ans.edges()) {
        if (p.from == s || p.to == t || p.flow == 0) continue;
        res[p.from][p.to - n] = 'X';
    }

    for (int i = 0; i < n; i++)  cout << res[i] << "\n";
    return 0;
}

Compiler output:
a.cc:2:10: fatal error: atcoder/all: No such file or directory
    2 | #include <atcoder/all>
      |          ^~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;

#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (ll i = (l); i < (r); i++)
#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)
#define repa(i,n) for (auto& i: n)

template<class T> inline bool chmax(T &a, const T &b) {if (a<b) { a=b; return 1;} return 0;}
template<class T> inline bool chmin(T &a, const T &b) {if (b<a) { a=b; return 1;} return 0;}
struct init{init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}init_;

#ifdef DEBUG
template <class T, class N> void verr(const T& a, const N& n) { rep(i, n) cerr << a[i] << " "; cerr << "\n" << flush; }
ll dbgt = 1; void err() { cerr << "passed " << dbgt++ << "\n" << flush; }
template<class H, class... T> void err(H&& h,T&&... t){ cerr<< h << (sizeof...(t)?" ":"\n") << flush; if(sizeof...(t)>0) err(forward<T>(t)...); }
#endif

const ll INF = 4e18;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
//--------------------------------------------------------------------------------//

// ACL template
int main() {
    ll N, M;
    cin >> N >> M;
    vl A(N), B(M);
    rep(i, N) cin >> A[i];
    rep(i, M) cin >> B[i];

    vl C = convolution(A, B);

    rep(i, N + M - 1) cout << C[i] << " ";
    cout << endl;
}

Compiler output:
a.cc:2:10: fatal error: atcoder/all: No such file or directory
    2 | #include <atcoder/all>
      |          ^~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <atcoder/convolution>
#include <atcoder/modint>
#include <cstdio>

using namespace std;
using namespace atcoder;

int main() {
    int n, m;
    scanf("%d %d", &n, &m);
    vector<long long> a(n), b(m);
    for (int i = 0; i < n; i++) {
        scanf("%lld", &(a[i]));
    }
    for (int i = 0; i < m; i++) {
        scanf("%lld", &(b[i]));
    }

    vector<long long> c = convolution(a, b);
    // or: vector<long long> c = convolution<998244353>(a, b);

    for (int i = 0; i < n + m - 1; i++) {
        printf("%lld ", c[i]);
    }
    printf("\n");

    return 0;
}

Compiler output:
a.cc:1:10: fatal error: atcoder/convolution: No such file or directory
    1 | #include <atcoder/convolution>
      |          ^~~~~~~~~~~~~~~~~~~~~
compilation terminated.
Language: C++

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include<atcoder/convolution>
#include<atcoder/modint>
#include<iostream>
#include<cstdint>
using namespace std;
using namespace atcoder;

using i32 = int_fast32_t;
using i64 = int_fast64_t;
using usize = uint_fast64_t;
#define rep(i, n) for (usize i = 0; i < (usize)(n); i++)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
using P = pair<i64,i64>;

int main(){
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
i32 n,m;
cin >> n >> m;
vector<i64> a(n),b(m);
rep(i,n)cin >> a[i];
rep(i,m)cin >> b[i];
vector<i64> c = convolution(a,b);
rep(i,n + m - 1)cout << c[i] << " \n"[i == n + m - 2];
}

Compiler output:
a.cc:5:9: fatal error: atcoder/convolution: No such file or directory
    5 | #include<atcoder/convolution>
      |         ^~~~~~~~~~~~~~~~~~~~~
compilation terminated.
Language: C++

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<cstdint>
#include<cstddef>
#include<atcoder/convolution>
#include<atcoder/modint>
using namespace std;
using namespace atcoder;

using i32 = int_fast32_t;
using i64 = int_fast64_t;
using usize = uint_fast64_t;
#define rep(i, n) for (usize i = 0; i < (usize)(n); i++)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
using P = pair<i64,i64>;

int main(){
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
i32 n,m;
cin >> n >> m;
vector<i64> a(n),b(m);
rep(i,n)cin >> a[i];
rep(i,m)cin >> b[i];
vector<i64> c = convolution(a,b);
rep(i,n + m - 1)cout << c[i] << " \n"[i == n + m - 2];
}

Compiler output:
a.cc:7:9: fatal error: atcoder/convolution: No such file or directory
    7 | #include<atcoder/convolution>
      |         ^~~~~~~~~~~~~~~~~~~~~
compilation terminated.
Language: C++

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<cstdint>
#include<cstddef>
#include<atcoder/all>
using namespace std;
using namespace atcoder;

using i32 = int_fast32_t;
using i64 = int_fast64_t;
using usize = uint_fast64_t;
#define rep(i, n) for (usize i = 0; i < (usize)(n); i++)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
using P = pair<i64,i64>;

int main(){
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
i32 n,m;
cin >> n >> m;
vector<i64> a(n),b(m);
rep(i,n)cin >> a[i];
rep(i,m)cin >> b[i];
vector<i64> c = convolution(a,b);
rep(i,n + m - 1)cout << c[i] << " \n"[i == n + m - 2];
}

Compiler output:
a.cc:7:9: fatal error: atcoder/all: No such file or directory
    7 | #include<atcoder/all>
      |         ^~~~~~~~~~~~~
compilation terminated.
Language: C++

// AC-Library

#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <queue>
#include <stack>
#include <unordered_set>
#include <cassert>

#include <atcoder/convolution>

using namespace std;

typedef long long int ll;
typedef pair<int, int> Pii;

const ll mod = 1000000007;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n, m;
  cin >> n >> m;
  vector<ll> a(n);
  for (auto &x: a) cin >> x;
  vector<ll> b(m);
  for (auto &x: b) cin >> x;

  vector<ll> c = atcoder::convolution<998244353>(a, b);

  for (auto &x: c) cout << x << " ";
  cout << endl;

  return 0;
}


Compiler output:
a.cc:14:10: fatal error: atcoder/convolution: No such file or directory
   14 | #include <atcoder/convolution>
      |          ^~~~~~~~~~~~~~~~~~~~~
compilation terminated.
Language: C++

// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <atcoder/convolution>
using namespace std;
using namespace atcoder;

#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << " = " << (x) << endl;
#define fs first
#define sc second
#define pb push_back
#define eb emplace_back
#define SP << " " <<

typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef vector<int> vec;
typedef vector<P> pvec;
typedef vector<vector<int>> vvec;
typedef vector<vector<P>> pvvec;
typedef priority_queue<int> PQI;
typedef priority_queue<P> PQP;
typedef priority_queue<int,vector<int>,greater<int>> PQIG;
typedef priority_queue<P,vector<P>,greater<P>> PQPG;

const vector<int> DX = {0, -1, 0, 1, 1, 1, -1, -1};
const vector<int> DY = {1, 0, -1, 0, 1, -1, 1, -1};
// constexpr int MOD = (1000000007);
const int MOD = (998244353);
// const int INF = (1 << 30); // 1073741824
const ll INF = (1LL << 60); // 1152921504606846976
const double PI = (3.141592653589794);
const double EPS = (0.0000000001); // 10^(-10)

template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return 1;} return 0;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return 1;} return 0;}
template<class T> inline T ceil(T a, T b) {return T((a + b - 1) / b);}
template<class T> inline T round(T a, T b) {return T(a / b);}
template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; }
template <class T> inline void out(T &a) { bool flag=true; for(auto&x:a){if(flag) {flag=false;} else{ cout << ' '; } cout<<x; } cout << endl; }



//----------------------------------------------------------------
int nmax=200000; // 2*(10^5)
vvec G(nmax);


void solve4ts()
{
  
  int n,m;
  cin>>n>>m;
  vector<int> a(n);
  rep(i,n) cin >> a[i];
  vector<int> b(m);
  rep(i,m) cin >> b[i];
  auto c=convolution(a,b);
  rep(i,n+m-1){
    cout<<c[i]<<" ";
  }
  cout<<endl;
  
}
//-----------------------------------------------------------------

signed main(){ ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(15);
  int repeat = 1;
  // cin >> repeat;
  while(repeat--) solve4ts();
}

/*

g++ -std=c++1z code.cpp

./a.out

python3 expander.py code.cpp

*/

Compiler output:
a.cc:3:10: fatal error: atcoder/convolution: No such file or directory
    3 | #include <atcoder/convolution>
      |          ^~~~~~~~~~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>

#include <atcoder/all>

#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void()
#endif

using namespace std;
using namespace atcoder;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  vector<int> a(n), b(m);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < m; i++) {
    cin >> b[i];
  }
  vector<int> c = convolution(a, b);
  for (int i = 0; i < n + m - 1; i++) {
    cout << c[i] << ' ';
  }
  cout << '\n';
  return 0;
}

Compiler output:
a.cc:3:10: fatal error: atcoder/all: No such file or directory
    3 | #include <atcoder/all>
      |          ^~~~~~~~~~~~~
compilation terminated.
Language: C++

#include "bits/stdc++.h"

#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define int long long
#define ll long long

ll INF = (1LL << 60);
int mod = 998244353;
using P = pair<int, int>;

signed main() {
	int n, m; cin >> n >> m;
	vector<int>a(n), b(m);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	for (int i = 0; i < m; i++) {
		cin >> b[i];
	}
	vector<int> c = convolution(a, b);
	for (int i = 0; i < n + m - 1; i++) {
		cout << c[i] << endl;
	}
	return 0;
}


Compiler output:
a.cc:3:10: fatal error: atcoder/all: No such file or directory
    3 | #include <atcoder/all>
      |          ^~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;

int main()
{
	cin >> n >> m;
	vector<ll> a(n,0),b(m,0);
	for(int i=0;i<n;++i) cin >> a[i];
	for(int i=0;i<m;++i) cin >> b[i];
	auto c = convolution<998244353>(a,b);
	for(auto x : c){
		cout<<x<<' ';
	}
	cout<<'\n';
	return 0;
}

Compiler output:
a.cc:2:10: fatal error: atcoder/all: No such file or directory
    2 | #include <atcoder/all>
      |          ^~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;

int main() {
	int n, m; cin >> n >> m;
	vector<int64_t> a(n), b(m);
	for(int64_t& v : a) cin >> v;
	for(int64_t& v : b) cin >> v;
	vector<int64_t> c = convolution(a, b);
	for(int i = 0; i < n + m - 1; ++i) {
		cout << c[i] << " \n"[i == n + m - 2];
	}
	return 0;
}


Compiler output:
a.cc:3:10: fatal error: atcoder/all: No such file or directory
    3 | #include <atcoder/all>
      |          ^~~~~~~~~~~~~
compilation terminated.
Language: C++

//g++ main.cpp -I ac-library
#include <bits/stdc++.h>
#include <atcoder/convolution>
using namespace std;
using ll = long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;

using namespace atcoder;
using mint = modint998244353;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N,M;
    cin >> N >> M;
    vec<int> A(N),B(M);
    for(auto& x:A) cin >> x;
    for(auto& x:B) cin >> x;
    auto C = convolution(A,B);
    for(int i=0;i<C.size();i++) cout << C[i] << (i+1!=C.size()? " ":"\n");
}


Compiler output:
a.cc:3:10: fatal error: atcoder/convolution: No such file or directory
    3 | #include <atcoder/convolution>
      |          ^~~~~~~~~~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;

int main(){
    ll N,M;
    cin >> N >> M;
    vector<ll> a(N);
    vector<ll> b(M);
    rep(i,N){
        cin >> a[i];
    }
    rep(i,M){
        cin >> b[i];
    }
    vector<ll> c = convolution<998244353>(a,b);
    rep(i,N + M - 1){
        cout << c[i] << " ";
    }
    cout << endl;
}

Compiler output:
a.cc:2:10: fatal error: atcoder/all: No such file or directory
    2 | #include <atcoder/all>
      |          ^~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>
//#include <atcoder/convolution>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using namespace atcoder;
using ll = long long;
using P = pair<int,int>;

int main() {
	int n, m;
	cin >> n >> m;
	vector<ll> a(n),b(m);
	rep(i,n) cin >> a[i];
	rep(i,m) cin >> b[i];
	vector<ll> c = convolution(a,b);
	for (int i=0;i < n + m -1;i++) {
		printf("%lld ",c[i]);
	}
	printf("\n");
	return 0;
}


Compiler output:
a.cc:5:17: error: 'atcoder' is not a namespace-name
    5 | using namespace atcoder;
      |                 ^~~~~~~
a.cc: In function 'int main()':
a.cc:15:24: error: 'convolution' was not declared in this scope
   15 |         vector<ll> c = convolution(a,b);
      |                        ^~~~~~~~~~~
Language: C++

#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
#include<cassert>
using namespace std;
#include<atcoder/all>
using namespace atcoder;


#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const long double eps = 1E-14;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

using mint = modint998244353;

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

/////////////////////////////////////


int main() {
	ll N, M;
	cin >> N >> M;

	vll a(N), b(M);
	rep(i, N)cin >> a[i];
	rep(i, M)cin >> b[i];

	vll c = convolution(a, b);

	rep(i, N + M - 1)cout << c[i] << " ";
	cout << endl;
}


Compiler output:
a.cc:16:9: fatal error: atcoder/all: No such file or directory
   16 | #include<atcoder/all>
      |         ^~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>
#include <atcoder/convolution>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using namespace atcoder;
using ll = long long;
using P = pair<int,int>;

int main() {
	int n, m;
	cin >> n >> m;
	vector<ll> a(n),b(m);
	rep(i,n) cin >> a[i];
	rep(i,m) cin >> b[i];
	vector<ll> c = convolution(a,b);
	for (int i=0;i < n + m -1;i++) {
		printf("%lld ",c[i]);
	}
	printf("\n");
	return 0;
}

Compiler output:
a.cc:2:10: fatal error: atcoder/convolution: No such file or directory
    2 | #include <atcoder/convolution>
      |          ^~~~~~~~~~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
 
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<int, int>;

#define INF 1001001001
#define MAX 1e18

int main() {
  int n, m;
  cin >> n >> m;
  vector<ll> a(n), b(m);
  rep(i,n) cin >> a[i];
  rep(i,m) cin >> b[i];
  vector<ll> c = convolution(a,b);
  rep(i,c.size()) {
    cout << c[i];
    if (i==c.size()-1) cout << endl; else cout << " ";
  }

  return 0;
}


Compiler output:
a.cc:2:10: fatal error: atcoder/all: No such file or directory
    2 | #include <atcoder/all>
      |          ^~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define Clear(a) a = decltype(a)()
#define all(a) a.begin(),a.end()
#define vec vector
typedef long long ll;
typedef pair<ll,ll> P;
//const ll big=998244353;
//const ll big=1000000007LL;
const ll big=1777777777LL;
const ll INF=1e18;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
ll max(ll x,ll y){
if(x>y)return x;
else return y;
}
ll min(ll x,ll y){
if(x<y)return x;
else return y;
}
ll expm(ll x,ll y){
    if(y==0)return 1;//0^0=1
    if(x==1||x==0)return x;
    if(y%2==1)return (expm(x,y-1)*x)%big;
    ll t=expm(x,y/2);
    return (t*t)%big;
}
ll exp(ll x,ll y){
    if(y==0)return 1;//0^0=1
    if(x==1||y==0)return x;
    if(y%2==1)return exp(x,y-1)*x;
    ll t=exp(x,y/2);
    return t*t;
}

int main(){
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    cout << fixed << setprecision(10);
    /*--------------------------------*/

  int n,m;cin >> n >> m;
  vector<ll> a(n),b(m);
  rep(i,n)cin >> a[i];
  rep(i,m)cin >> b[i];
  
  vector<ll> ans=convolution(a,b);
  rep(i,ans.size())cout << ans[i] << " \n"[i+1==ans.size()];
}

Compiler output:
a.cc:2:10: fatal error: atcoder/all: No such file or directory
    2 | #include <atcoder/all>
      |          ^~~~~~~~~~~~~
compilation terminated.
Language: C++

#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;

#include "atcoder/all"

using namespace std;

const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;

double equal(double a, double b) {
    return fabs(a - b) < DBL_EPSILON;
}

std::istream &operator>>(std::istream &in, set<int> &o) {
    int a;
    in >> a;
    o.insert(a);
    return in;
}

std::istream &operator>>(std::istream &in, queue<int> &o) {
    ll a;
    in >> a;
    o.push(a);
    return in;
}

bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }

typedef priority_queue<ll, vector<ll>, greater<ll> > PQ_ASK;


using mint =atcoder:: modint998244353;

int main() {

    int n, m;
    cin >> n >> m;
    vector<mint> a(n), b(m);
    rep(i, n)cin >> a[i];
    rep(i, m)cin >> b[i];

    auto c = atcoder::convolution(a, b);
    rep(i, n + m - 1) {
        cout << c[i].val() << ' ';
    }
    cout << endl;

}


Compiler output:
a.cc:9:10: fatal error: atcoder/all: No such file or directory
    9 | #include "atcoder/all"
      |          ^~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>
#include <atcoder/convolution>

using namespace std;
using namespace atcoder;

int main() {
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    int n, m;
    scanf("%d%d", &n, &m);
    vector<int> a(n), b(m);
    for (auto &x : a) {
        scanf("%d", &x);
    }
    for (int &x : b) {
        scanf("%d", &x);
    }
    vector<int> c = convolution(a, b);
    for (int x : c) {
        printf("%d ", x);
    }
    puts("");
    return 0;
}


Compiler output:
a.cc:2:10: fatal error: atcoder/convolution: No such file or directory
    2 | #include <atcoder/convolution>
      |          ^~~~~~~~~~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <iostream>
#include <iomanip>
#include <algorithm>
#include <assert.h>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include <functional>
#include <atcoder/all>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define rrep(i,a) for(ll i=ll(a-1);i>=0;--i)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using namespace atcoder;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
inline void Yes(bool condition){ if(condition) PRINT("Yes"); else PRINT("No"); }
template<class itr> void cins(itr first,itr last){
    for (auto i = first;i != last;i++){
        cin >> (*i);
    }
}
template<class itr> void array_output(itr start,itr goal){
    string ans = "",k = " ";
    for (auto i = start;i != goal;i++) ans += to_string(*i)+k;
    if (!ans.empty()) ans.pop_back();
    PRINT(ans);
}
ll gcd(ll a, ll b) {
    return a ? gcd(b%a,a) : b;
}

const int INF = 1e9;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll MOD3 = 1e6;
const ll EPS = 1e-10;
int sgn(const double a){
    return (a < -EPS ? -1 : (a > EPS ? +1 : 0));
}
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> tri;
typedef pair<long double,long double> point;
typedef complex<long double> Point;
const ll MAX = 1e9;
constexpr ll nx[4] = {-1,0,1,0};
constexpr ll ny[4] = {0,1,0,-1};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n,m;
    cin >> n >> m;
    vector<ll> a(n),b(m);
    cins(all(a));
    cins(all(b));
    auto c = convolution(a,b);
    array_output(all(c));
}


Compiler output:
a.cc:20:10: fatal error: atcoder/all: No such file or directory
   20 | #include <atcoder/all>
      |          ^~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>
#include <cassert>
#include <atcoder/convolution>


using namespace std;
using namespace atcoder;

#define SZ(x) (int)(x.size())
#define REP(i, n) for(int i=0;i<n;++i)
#define FOR(i, a, b) for(int i=a;i<b;++i)
#define RREP(i, n) for(int i=n-1;i>=0;--i)
#define RFOR(i, a, b) for(int i=b-1;i>=a;--i)

#define all(x) begin(x),end(x)
#define dump(x) cerr<<#x<<" = "<<(x)<<endl
#define debug(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<< endl;

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<int, int>;
const double eps = 1e-8;
const ll MOD = 1000000007;
const int INF = INT_MAX / 2;
const ll LINF = LLONG_MAX / 2;

template<class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}


template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> p) {
    os << p.first << ":" << p.second;
    return os;
}

template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    os << "[";
    REP(i, SZ(v)) {
        if (i) os << ", ";
        os << v[i];
    }
    return os << "]";
}

template<class T1, class T2>
ostream &operator<<(ostream &os, const map<T1, T2> &mp) {
    os << "[";
    for (auto it = mp.begin(); it != mp.end(); ++it) {
        if (it != mp.begin()) {
            os << ", ";
        }
        os << *it;
    }
    return os << "]";
}

// edit

void solve() {
    int N, M;
    cin >> N >> M;
    vector<int> a(N), b(M);
    REP(i, N) cin >> a[i];
    REP(i, M) cin >> b[i];
    auto c = convolution(a, b);
    for (auto e : c) {
        cout << e << " ";
    }
    cout << endl;
}


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
//    std::ifstream in("input.txt");
//    std::cin.rdbuf(in.rdbuf());

    solve();


    return 0;
}


Compiler output:
a.cc:36:10: fatal error: atcoder/convolution: No such file or directory
   36 | #include <atcoder/convolution>
      |          ^~~~~~~~~~~~~~~~~~~~~
compilation terminated.
Language: C++

#include<bits/stdc++.h>
#include<atcoder/modint>
#include<atcoder/convolution>

using namespace std;
using ll = long long;
namespace ac = atcoder;

using mint = atcoder::modint998244353;
ostream &operator<<(std::ostream &os,const mint &p){return os << p.val();}
istream &operator>>(std::istream &is, mint &a){ll x;is >> x;a = mint(x);return (is);}
template<class T> ostream& operator<<(ostream& os, const vector<T> arr){ for(int i = 0; i < (int)arr.size(); i++)cout << arr[i] << (i == (int)arr.size() -1 ? "" : " "); return os;} 

int main()
{   
    int n, m; cin >> n >> m;
    vector<mint> a(n), b(m);
    for(int i = 0; i < n; i++)cin >> a[i];
    for(int i = 0; i < m; i++)cin >> b[i];
    cout << ac::convolution(a, b) << endl;
}

Compiler output:
a.cc:2:9: fatal error: atcoder/modint: No such file or directory
    2 | #include<atcoder/modint>
      |         ^~~~~~~~~~~~~~~~
compilation terminated.
Language: C++

#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
#include<cstdio>
#include<tuple>
#include<bitset>
#include<map>
#include<atcoder/convolution.hpp>

using namespace std;
//using namespace atcoder;
#define int long long
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.end()
using ll = long long;
using lint = long long;
typedef pair<int,int> P;
const lint inf=1e18+7;
const int MOD=1000000007;
signed main(){
  int n,m;cin>>n>>m;
  vector<long long> a(n);
  vector<long long> b(m);
  rep(i,n)cin>>a[i];
  rep(i,m)cin>>b[i];
  vector<long long> c;
  c=atcoder::convolution(a,b);
  rep(i,n+m-1){
    cout<<c[i]<<" ";
  }
  cout<<endl;
  return 0;
}

Compiler output:
a.cc:11:9: fatal error: atcoder/convolution.hpp: No such file or directory
   11 | #include<atcoder/convolution.hpp>
      |         ^~~~~~~~~~~~~~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;

int main() {
  int n, m;
  vector<long long> a, b;
  cin >> n >> m;
  a.resize(n);
  for (auto &p : a) cin >> p;
  b.resize(m);
  for (auto &p : b) cin >> p;
  auto c = convolution(a, b);
  for (int i = 0; i < n + m - 1; ++i) cout << c[i] << " \n"[i == n + m - 2];
  return 0;
}


Compiler output:
a.cc:2:10: fatal error: atcoder/all: No such file or directory
    2 | #include <atcoder/all>
      |          ^~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <atcoder/convolution>
#include <atcoder/modint>
#include <cstdio>

using namespace std;
using namespace atcoder;

int main() {
    int n, m;
    scanf("%d %d", &n, &m);
    vector<long long> a(n), b(m);
    for (int i = 0; i < n; i++) {
        scanf("%lld", &(a[i]));
    }
    for (int i = 0; i < m; i++) {
        scanf("%lld", &(b[i]));
    }

    vector<long long> c = convolution(a, b);
    // or: vector<long long> c = convolution<998244353>(a, b);

    for (int i = 0; i < n + m - 1; i++) {
        printf("%lld ", c[i]);
    }
    printf("\n");

    return 0;
} // ???

Compiler output:
a.cc:1:10: fatal error: atcoder/convolution: No such file or directory
    1 | #include <atcoder/convolution>
      |          ^~~~~~~~~~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>
#include <random>
#include <atcoder/all>
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef pair<lint, lint> plint; typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(lint i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define endk '\n'
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
const lint MOD = 1e9 + 7, INF = 1e18;
lint dx[8] = { 0, -1, 1, 0, 1, -1, 1, -1 }, dy[8] = { 1, 0, 0, -1, -1, -1, 1, 1 };
typedef pair<lint, char> pa;

using namespace atcoder;
lint N, M;
int main() {
	cin >> N >> M;
	vector<lint> arr(N), _arr(M);
	REP(i, N) {
		cin >> arr[i];
	}
	REP(i, M) {
		cin >> _arr[i];
	}
	for (auto itr : convolution(arr, _arr)) {
		cout << itr << " ";
	}
	cout << endk;	
}


Compiler output:
a.cc:3:10: fatal error: atcoder/all: No such file or directory
    3 | #include <atcoder/all>
      |          ^~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;

#include <atcoder/all>
using namespace atcoder;


int main(){
    int n,m;
    cin >> n >> m;
    vector<ll> a(n),b(m);
    rep(i,n) cin >> a[i];
    rep(i,m) cin >> b[i];
    vector<ll> c = convolution(a,b);
    rep(i,n+m-1){
        cout << c[i] << " ";
    }
    cout << endl;
    return 0;
}

Compiler output:
a.cc:12:10: fatal error: atcoder/all: No such file or directory
   12 | #include <atcoder/all>
      |          ^~~~~~~~~~~~~
compilation terminated.
Language: C


#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <math.h>
#include <cmath>
#include<complex>
#include<cctype>
#include<string>
#include<set>
#include<iomanip>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include<bitset>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#include <numeric>
using namespace std;
using Complex = complex<double>;
using ll = long long;
template<typename T>using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
const ll inf = 1145141919810364364LL;
const double EPS = 1e-10;
double PI = acos(-1.0);
#define all(x) (x).begin(),(x).end()
#define puts(x) cout << x << endl
#define rep(i,m,n) for(ll i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(ll i = m;i >= n;--i)


//ntt
ll mod = 998244353;
ll root = 3;
ll wlist[30];

ll modpow(ll a, ll n) {
	ll res = 1;
	a %= mod;
	while (n > 0) {
		if (n & 1) res = res * a % mod;
		a = a * a % mod;
		n >>= 1;
	}
	return res;
}

vector<ll>dft(vector<ll>A,int N){
	//bit reverse
	int h = 0;
	for (int i = 0; (1 << i) < N; i++)h++;
	for (int i = 0; i < N; i++) {
		int j = 0;
		for (int k = 0; k < h; k++) j |= (i >> k & 1) << (h - 1 - k);
		if (i < j) swap(A[i], A[j]);
	}
	//

	//butterfly 
	int cnt = 1;
	for (int b = 1; b < N; b *= 2) {
		ll w = wlist[cnt];
		ll cur = 1;
		for (int j = 0; j < b; j++) {
			for (int k = 0; k < N; k += 2 * b) {
				ll s = A[j+k];
				ll t = A[j+k+b] * cur;
				A[j + k] = s + t;
				A[j+k+b] = s - t;
			}
			cur = (w * cur)%mod;
		}
		for (int i = 0; i < N; i++) {
			A[i] %= mod;
			if (A[i] < 0)A[i] += mod;
		}
		cnt++;
	}
	//

	return A;
}
vector<ll>inv_dft(vector<ll>A,int N) {
	vector<ll>arranged = dft(A, N);
	vector<ll>swapped(N);
	for (int i = 0; i < N; i++)swapped[i] = arranged[(N - i) % N];
	vector<ll>ret(N);
	ll rev = modpow(N,mod-2);
	for (int i = 0; i < N; i++)ret[i] = (rev*swapped[i]) % mod;
	return ret;
}

vector<ll>ntt(vector<ll>A,vector<ll>B){
	//calculate Nth root
	ll P = mod;
	P--;
	int N = 1;
	int cnt = 0;
	while (P % 2 == 0) {
		N *= 2;
		cnt++;
		P /= 2;
		if (A.size() + B.size() <= N)break;
	}
	ll Nroot = modpow(root,P);
	//

	//make list of root
	ll cur = Nroot;
	for (int i = cnt; i >= 0; i--) {
		wlist[i] = cur;
		cur = (cur*cur) % mod;
	}
	//

	A.resize(N);
	B.resize(N);

	A = dft(A,N);
	B = dft(B,N);

	vector<ll>F(N);
	for (int i = 0; i < N; i++) {
		F[i] = (A[i] * B[i]) % mod;
	}
	return inv_dft(F,N);
}
//nttここまで

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int N, M;
	cin >> N >> M;
	vector<ll>A(N), B(M);
	for (int i = 0; i < N; i++)cin >> A[i];
	for (int i = 0; i < M; i++)cin >> B[i];

	vector<ll>ans = ntt(A, B);
	for (int i = 0; i < N + M - 1; i++)cout << ans[i] << " ";
	puts("");


	return 0;
}

Compiler output:
main.c:2:9: fatal error: iostream: No such file or directory
    2 | #include<iostream>
      |         ^~~~~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
using namespace atcoder;

template<typename T, typename U> void cmax(T &a, U b) { if (a < b) a = b; }
template<typename T, typename U> void cmin(T &a, U b) { if (a > b) a = b; }

// constexpr int MOD = 1000000007;
constexpr int MOD = 998244353;

signed main() {
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);

  int N, M;
  cin >> N >> M;
  vector<long> A(N);
  for (int i = 0; i < N; i++) cin >> A.at(i);
  vector<long> B(M);
  for (int i = 0; i < M; i++) cin >> B.at(i);

  auto C = convolution<MOD>(A, B);

  for (int i = 0, n = C.size(); i < n; i++) {
    cout << C.at(i) << ((i == n - 1) ? "\n" : " ");
  }
}

Compiler output:
a.cc:4:10: fatal error: atcoder/all: No such file or directory
    4 | #include <atcoder/all>
      |          ^~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
using namespace atcoder;

template<typename T, typename U> void cmax(T &a, U b) { if (a < b) a = b; }
template<typename T, typename U> void cmin(T &a, U b) { if (a > b) a = b; }

// constexpr int MOD = 1000000007;
constexpr int MOD = 998244353;

signed main() {
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);

  int N, M;
  cin >> N >> M;
  vector<int> A(N);
  for (int i = 0; i < N; i++) cin >> A.at(i);
  vector<int> B(N);
  for (int i = 0; i < N; i++) cin >> B.at(i);

  auto C = convolution<MOD>(a, b);

  for (int i = 0, n = C.size(); i < n; i++) {
    cout << C.at(i) << ((i == n - 1) ? "\n" : " ");
  }
}

Compiler output:
a.cc:4:10: fatal error: atcoder/all: No such file or directory
    4 | #include <atcoder/all>
      |          ^~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>

#include <atcoder/all>

using namespace std;
using namespace atcoder;
 
//////////////////

#ifdef DEBUG
    #include "debug.h"
    #define dump(...)                                                              \
        DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                            \
                << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]"        \
                << endl                                                            \
                << "    ",                                                         \
            dump_func(__VA_ARGS__)
#else
    #define dump(...)
#endif


// http://beet-aizu.hatenablog.com/entry/2018/04/08/145516
template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}

template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

template<typename T,typename V>
typename enable_if<is_class<T>::value==0>::type
fill_v(T &t,const V &v){t=v;}

template<typename T,typename V>
typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t,const V &v){
  for(auto &e:t) fill_v(e,v);
}

//////////////////

#define int long long
 
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)

#define YES puts("YES")
#define Yes puts("Yes")
#define NO  puts("NO")
#define No  puts("No")
#define ALL(v) (v).begin(), (v).end()
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }

//*
#define mod 1000000007 /*/
#define mod 998244353 //*/

typedef pair<int, int> P;
#define INF (1LL<<60)
    
void solve(){
    int N, M;
    cin >> N >> M;
    vector<int> a(N), b(M);
    rep(i,N) cin >> a[i];
    rep(i,M) cin >> b[i];
    vector<int> c = convolution<998244353>(a,b);
    rep(i,N+M-1)
    cout << c[i] << " ";
    cout << endl;
}


signed main(){
    cout << fixed << setprecision(18);
//    cerr << fixed << setprecision(18);
    solve();
}


Compiler output:
a.cc:3:10: fatal error: atcoder/all: No such file or directory
    3 | #include <atcoder/all>
      |          ^~~~~~~~~~~~~
compilation terminated.
Language: C++

/*
AtCoder Library Practice Contest - F - Convolution
https://atcoder.jp/contests/practice2/tasks/practice2_f
*/

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<vl> vvl;

double EPS=1e-9;
int INF=1000000005;
long long INFF=1000000000000000005ll;
double PI=acos(-1);
int dirx[8]={ -1, 0, 0, 1, -1, -1, 1, 1 };
int diry[8]={ 0, 1, -1, 0, -1, 1, -1, 1 };
const ll MOD = 1000000007;

#define DEBUG fprintf(stderr, "====TESTING====\n")
#define VALUE(x) cerr << "The value of " << #x << " is " << x << endl
#define OUT(x) cout << x << endl
#define OUTH(x) cout << x << " "
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define READ(x) for(auto &(z):x) cin >> z;
#define FOR(a, b, c) for (int(a)=(b); (a) < (c); ++(a))
#define FORN(a, b, c) for (int(a)=(b); (a) <= (c); ++(a))
#define FORD(a, b, c) for (int(a)=(b); (a) >= (c); --(a))
#define FORSQ(a, b, c) for (int(a)=(b); (a) * (a) <= (c); ++(a))
#define FORC(a, b, c) for (char(a)=(b); (a) <= (c); ++(a))
#define EACH(a, b) for (auto&(a) : (b))
#define REP(i, n) FOR(i, 0, n)
#define REPN(i, n) FORN(i, 1, n)
#define MAX(a, b) a=max(a, b)
#define MIN(a, b) a=min(a, b)
#define SQR(x) ((ll)(x) * (x))
#define RESET(a, b) memset(a, b, sizeof(a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ALL(v) v.begin(), v.end()
#define ALLA(arr, sz) arr, arr + sz
#define SIZE(v) (int)v.size()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr, sz) sort(ALLA(arr, sz))
#define REVERSEA(arr, sz) reverse(ALLA(arr, sz))
#define PERMUTE next_permutation
#define TC(t) while (t--)
#define FAST_INP  ios_base::sync_with_stdio(false);cin.tie(NULL)


void solve() {

}

int main()
{
    FAST_INP;
    // #ifndef ONLINE_JUDGE
    // freopen("input.txt","r", stdin);
    // freopen("output.txt","w", stdout);
    // #endif

//    int tc; cin >> tc;
//    TC(tc) solve();
	int n, m;
	cin >> n >> m;
	vl a(n), b(m);
	READ(a);
	READ(b);
	vl conv = convolution(a,b);
	EACH(c,conv) OUTH(c);
    return 0;
}


Compiler output:
a.cc:7:10: fatal error: atcoder/all: No such file or directory
    7 | #include <atcoder/all>
      |          ^~~~~~~~~~~~~
compilation terminated.