Language: C++

//#pragma once
#include <stdio.h>
#include <string>
#include <iostream>
#include <queue>
#include <algorithm>
#include <sstream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <numeric>
#include<bitset>
#include <iomanip>

using namespace std;
#define modd 1000000007


typedef pair<long long, long long> pl;



#define ll long long




/*
class UnionFind {
public:
	vector <ll> par;
	vector <ll> siz;
	vector <ll> gr;

	// Constructor
	UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) ,gr(sz_){
		for (ll i = 0; i < sz_; ++i) par[i] = i;
	}
	void init(ll sz_) {
		par.resize(sz_);
		siz.assign(sz_, 1LL);  // resize だとなぜか初期化されなかった
		for (ll i = 0; i < sz_; ++i) par[i] = i; // 初期では親は自分自身
	}

	// Member Function
	// Find
	ll root(ll x) { // 根の検索
		while (par[x] != x) {
			x = par[x] = par[par[x]]; // x の親の親を x の親とする
		}
		return x;
	}

	// Union(Unite, Merge)
	bool merge(ll x, ll y) {
		x = root(x);
		y = root(y);
		if (x == y) return false;

		// merge technique（データ構造をマージするテク．小を大にくっつける）
		if (siz[x] < siz[y]) swap(x, y);
		siz[x] += siz[y];
		par[y] = x;
		return true;
	}



	bool issame(ll x, ll y) { // 連結判定
		return root(x) == root(y);
	}

	ll size(ll x) { // 素集合のサイズ
		return siz[root(x)];
	}


};*/


long long N, M, K, a, b, c, d, e, H, W, L;
long long A[200005] = {};
long long B[200005] = {};
long long kosuu[2][2001][100001]= {};
bool f, ff;
string S[2];
set <long long>sll;
pl bufpl;
vector <long long>vl[3];
vector <pl>vpl;
vector <string> vs;
set<ll> llset;

/*struct ST
{
	long long Kati;
	int bangou;

	bool operator<(const ST& another) const
	{
		return Kati < another.Kati;//比較
	};

};



vector <ST> vst;
ST st[200005];
ST bufst;
bitset<5000> bits;*/


long long modinv(long long aa, long long mm) {
	long long bb = mm, uu = 1, vv = 0;
	while (bb) {
		long long tt = aa / bb;
		aa -= tt * bb; swap(aa, bb);
		uu -= tt * vv; swap(uu, vv);
	}
	uu %= mm;
	if (uu < 0) uu += mm;
	return uu;
}

void kazoeru(){

}


ll minn, maxx;
double ansa;

int main() {

	cin >> N >> M;

	for (int i = 0; i < N; i++) {
		cin >> A[i];
	}

	for (int i = 0; i < M; i++) {
		cin >> B[i];
	}

	cout << e << endl;

	return 0;

}


Compiler output:
/tmp/ccBQUnMp.o: in function `__tcf_0':
a.cc:(.text+0x1d0): relocation truncated to fit: R_X86_64_PC32 against symbol `S[abi:cxx11]' defined in .bss section in /tmp/ccBQUnMp.o
a.cc:(.text+0x1d7): relocation truncated to fit: R_X86_64_PC32 against symbol `S[abi:cxx11]' defined in .bss section in /tmp/ccBQUnMp.o
/tmp/ccBQUnMp.o: in function `__tcf_1':
a.cc:(.text+0x204): relocation truncated to fit: R_X86_64_PC32 against symbol `vl' defined in .bss section in /tmp/ccBQUnMp.o
a.cc:(.text+0x20b): relocation truncated to fit: R_X86_64_PC32 against symbol `vl' defined in .bss section in /tmp/ccBQUnMp.o
/tmp/ccBQUnMp.o: in function `__static_initialization_and_destruction_0()':
a.cc:(.text+0x232): relocation truncated to fit: R_X86_64_PC32 against symbol `S[abi:cxx11]' defined in .bss section in /tmp/ccBQUnMp.o
a.cc:(.text+0x276): relocation truncated to fit: R_X86_64_PC32 against symbol `sll' defined in .bss section in /tmp/ccBQUnMp.o
a.cc:(.text+0x28f): relocation truncated to fit: R_X86_64_PC32 against symbol `sll' defined in .bss section in /tmp/ccBQUnMp.o
a.cc:(.text+0x2a8): relocation truncated to fit: R_X86_64_PC32 against symbol `vl' defined in .bss section in /tmp/ccBQUnMp.o
a.cc:(.text+0x2ec): relocation truncated to fit: R_X86_64_PC32 against symbol `vpl' defined in .bss section in /tmp/ccBQUnMp.o
a.cc:(.text+0x305): relocation truncated to fit: R_X86_64_PC32 against symbol `vpl' defined in .bss section in /tmp/ccBQUnMp.o
a.cc:(.text+0x31e): additional relocation overflows omitted from the output
collect2: error: ld returned 1 exit status