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

#include <iostream>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong, LP> LPP;

int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};

int map[200001][200001];
int N, M;


int main(){
    cin >> N >> M;
    REP(i, M){
        int a, b;
        cin >> a >> b;
        map[a][b] = 1;
    }
    int flag = 0;
    REP(i, 200001){
        if(map[1][i] == 1){
            if(map[i][N] == 1){
                flag = 1;
            }
        }
    }
    if(flag){
        cout << "POSSIBLE" << endl;
    }else{
        cout << "IMPOSSIBLE" << endl;
    }
    return 0;
}

Compiler output:
/tmp/ccmQ32GZ.o: in function `main':
a.cc:(.text+0xb): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/ccmQ32GZ.o
a.cc:(.text+0x27): relocation truncated to fit: R_X86_64_PC32 against symbol `M' defined in .bss section in /tmp/ccmQ32GZ.o
a.cc:(.text+0x98): relocation truncated to fit: R_X86_64_PC32 against symbol `M' defined in .bss section in /tmp/ccmQ32GZ.o
a.cc:(.text+0xd5): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/ccmQ32GZ.o
collect2: error: ld returned 1 exit status
Language: C++

#include<iostream>
#include<vector>
using namespace std;
int main(){
	vector<int> f;
	bool t[200000] = {};
	bool fl=false;
	int n,m;
	int a,b;
	cin>>n>>m;
	for(int i=0;i<m;i++){
		cin>>a>>b;
		if(a==1){
			f.push_back(b);
		}else if(b==n){
			t[a] = true;
		}
	}
	for(int i=0;i<f.size();i++){
		if(t[f[i]]){
			fl=true;
			break;
		}
	}
	cout<< (fl?"POSSIBLE":"IMPOSSIBLE")<<endl;
	return 0;
}
.

Compiler output:
a.cc:28:1: error: expected unqualified-id before '.' token
   28 | .
      | ^
Language: C++

#include <iostream>
#include <vector>
using namespace std;
vector<int> f[200005];
int main(){
 int N,M,a,b;
 cin>>N>>M;
 for(int i=1;i<=M;i++)
   {
   cin>>a>>b;
   f[a].push_back(b);
   }
 for(int i=0;i<f[1].size();i++)
 {
 	for(int j=0;j<f[f[1][i]].size();j++)
 	if(f[f[1][i]][j]==5) {
 		cout<<"POSSIBLE"<<endl; return 0;
	 }
 }
 cout<<"IMPOSSIBLE"<<endl;
 return 0
}


Compiler output:
a.cc: In function 'int main()':
a.cc:21:10: error: expected ';' before '}' token
   21 |  return 0
      |          ^
      |          ;
   22 | }
      | ~
Language: C++


#include <iostream>
#include <conio.h>
#include <vector>
using namespace std;

vector<int> graph[200005];

int main()
{
	int n, m;
	cin >> n >> m;
	int a, b;
	for (int i = 0; i < m; i++)
	{
		cin >> a >> b;
		graph[a].push_back(b);
		graph[b].push_back(a);
	}
	for (int i = 0; i < graph[1].size(); i++)
	{
		for (int j = 0; j < graph[graph[1][i]].size(); j++)
		{
			if (graph[graph[1][i]][j] == n)
			{
				cout << "POSSIBLE";
				//_getch();
				return 0;
			}
		}
	}

	cout << "IMPOSSIBLE";
	//_getch();
	return 0;
}

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

#include<bits/stdc++.h>
using namespace std;
bool f[200001][200001];
int main(){
    int n,m;
    cin>>n>>m;
    for(int i=0;i<m;i++){
        int a,b;
        cin>>a>>b;
        f[a][b]++;
        f[b][a]++;
    }
    bool ans=false;
    for(int i=2;i<n;i++){
        if(f[1][i]&&f[i][n]){
            ans++;
        }
    }
    if(!ans)cout<<"IM";
    cout<<"POSSIBLE"<<endl;
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:10:15: error: use of an operand of type 'bool' in 'operator++' is forbidden in C++17
   10 |         f[a][b]++;
      |         ~~~~~~^
a.cc:11:15: error: use of an operand of type 'bool' in 'operator++' is forbidden in C++17
   11 |         f[b][a]++;
      |         ~~~~~~^
a.cc:16:13: error: use of an operand of type 'bool' in 'operator++' is forbidden in C++17
   16 |             ans++;
      |             ^~~
Language: C++

#include <algorithm>
#include <iostream>
#include <string>
#include <cstring>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <ctime>
#include <unordered_set>
#include <unordered_map>

using namespace std;

#ifdef __APPLE__
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...)
#endif

const int N = (int)1e6 + 123;
const int MOD = (int)1e9 + 7;
const int inf = (int)5e8;
const long long infll = (long long)1e17;


bool used[N];
vector<int> g[N];

void dfs(int v) {
    used[v] = true;
    for (auto to : g[v]) {
        if (!used[to]) dfs(to);
    }
}

void solve() {
    int n, m;
    scanf("%d %d", &n, &m);
    for (int i = 0; i < m; ++i) {
        int u, v;
        scanf("%d %d", &u, &v);
        --u;
        --v;
        g[u].push_back(v);
       #g[v].push_back(u);
    }
    dfs(0);
    if (used[n - 1]) {
        printf("POSSIBLE");
    } else {
        printf("IMPOSSIBLE");
    }
}

int main() {
#ifdef __APPLE__
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    int t = 1;
    while (t--) {
        solve();
    }
    return 0;
}

Compiler output:
a.cc:46:9: error: invalid preprocessing directive #g
   46 |        #g[v].push_back(u);
      |         ^
Language: C++

#include <bits/stdc++.h>
using namespace std;
int main(){
    long long int k;
    cin >> k;
    cout << 50 << endl;
    for(long long int i=0;i<49;i++){
        cout << 1LL+50LL*(k/50LL+(k%50LL>i)) << " ";
    }
    cout << 1LLLL+50*(k/50LL) << " ";
}

Compiler output:
a.cc: In function 'int main()':
a.cc:10:13: error: unable to find numeric literal operator 'operator""LLLL'
   10 |     cout << 1LLLL+50*(k/50LL) << " ";
      |             ^~~~~
Language: C++

#include<bits/stdc++.h>
using namespace std;
///Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main()
{
    FastRead
    //freopen("output.txt", "w", stdout);
     if(n==0){
        cout<<"4"<<endl;
        cout<<"3 3 3 3"<<endl;
     }
     else if(n==1){
        cout<<"3"<<endl;
        cout<<"3 1 0 3"<<endl;
     }
     else if(n==2){
         cout<<"2"<<endl;
        cout<<"2 2"<<endl;
     }
     else if(n==3){
         cout<<"7"<<endl;
        cout<<"27 0 0 0 0 0 0"<<endl;
     }
     else{
        cout<<"2"<<endl;
        cout<<k-2<<" "<<k-1<<endl;
     }
    return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:19:9: error: 'n' was not declared in this scope; did you mean 'yn'?
   19 |      if(n==0){
      |         ^
      |         yn
a.cc:37:15: error: 'k' was not declared in this scope
   37 |         cout<<k-2<<" "<<k-1<<endl;
      |               ^
Language: C++

#include <bits/stdc++.h>

#define F first 
#define S second
#define PB push_back

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int> > RHEAP;

const int N = 100010, M = 1010;

LL a[N];
LL k;

int main()
{
	cin >> k;
	for (int i = 1; i <= n; i ++ ) a[i] = i + k / 50LL;
	for (int i = 1; i <= 50LL - k % 50LL; i ++ ) a[i] -- ;
	
	puts("50");
	for (int i = 1; i <= n; i ++ ) cout << a[i] << ' ';
	puts("");
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:22:30: error: 'n' was not declared in this scope
   22 |         for (int i = 1; i <= n; i ++ ) a[i] = i + k / 50LL;
      |                              ^
a.cc:26:30: error: 'n' was not declared in this scope
   26 |         for (int i = 1; i <= n; i ++ ) cout << a[i] << ' ';
      |                              ^
Language: C++

#include <bits/stdc++.h>

using namespace std;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define rSORT(a) reverse((a).begin(),(a).end())
#define For(i, a, b)    for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n)       For(i, 0, n)
#define debug(x)  cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
//Write From this Line

int main()
{
	ll k;
	cin >> k;
	for(int n = 50; n >= 2; n--){
		ll sum = (n - 1) * n + k;
		if(sum % n == 0){
			cout << n << endl;
			rep(i,n){
				cout << sum / n << endl;
			}
			return 0;
		}
	}
	// n = 2でやる
	ll sum = n + k;
	cout << 2 << endl;
	cout <<(sum+1) / 2  << endl;
	cout << sum / 2 << endl;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:30:18: error: 'n' was not declared in this scope
   30 |         ll sum = n + k;
      |                  ^
Language: C++

#include<iostream>
using namespace std ;

int main(){
  long long k ;
  cin >> k ;
  cout << "2\n" ;
  if(K&1){
    cout << (k-1)/2 << " " << (k+5)/2 << endl ;
  }else{
    cout << k/2 << " " << k/2 << endl ;
  }
}

Compiler output:
a.cc: In function 'int main()':
a.cc:8:6: error: 'K' was not declared in this scope
    8 |   if(K&1){
      |      ^
Language: C++

#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t K;
  cin>>K;
  int64_t a=K/50;
  int64_t b=K%50;
  vector<int64_t>a(50,49+a);
  for(int i=0;i<50-b;i++)
    a.at(i)-=b;
  for(int i=50-b;i<50;i++)
    a.at(i)+=51-b;
  cout<<50<<endl;
  for(int i=0;i<49;i++)
    cout<<a.at(i)<<" ";
  cout<<a.at(49)<<endl;
   return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:8:18: error: conflicting declaration 'std::vector<long int> a'
    8 |   vector<int64_t>a(50,49+a);
      |                  ^
a.cc:6:11: note: previous declaration as 'int64_t a'
    6 |   int64_t a=K/50;
      |           ^
a.cc:10:7: error: request for member 'at' in 'a', which is of non-class type 'int64_t' {aka 'long int'}
   10 |     a.at(i)-=b;
      |       ^~
a.cc:12:7: error: request for member 'at' in 'a', which is of non-class type 'int64_t' {aka 'long int'}
   12 |     a.at(i)+=51-b;
      |       ^~
a.cc:15:13: error: request for member 'at' in 'a', which is of non-class type 'int64_t' {aka 'long int'}
   15 |     cout<<a.at(i)<<" ";
      |             ^~
a.cc:16:11: error: request for member 'at' in 'a', which is of non-class type 'int64_t' {aka 'long int'}
   16 |   cout<<a.at(49)<<endl;
      |           ^~
Language: C++

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

signed main() {
    int K; cin >> K;
    int rec[60], ans[60];
    int div = K / 50, md = K % 50;
    int n=50;
    for(int i=0;i<n;i++){
        rec[i]=div+(i<md);
    }
 
    for(int i=0;i<n;i++){
        int S = 0;
        for(int j=0;j<n;j++) {
            if(i != j) S += rec[j];
        }
        ans[i] = 50 * (rec[i] + 1) - S - 1;
    }

    cout << 50 << endl;
    rep(i,0,50) cout << (i ? " " : "") << ans[i];
    cout << endl;
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:22:9: error: 'i' was not declared in this scope
   22 |     rep(i,0,50) cout << (i ? " " : "") << ans[i];
      |         ^
a.cc:22:5: error: 'rep' was not declared in this scope; did you mean 'rec'?
   22 |     rep(i,0,50) cout << (i ? " " : "") << ans[i];
      |     ^~~
      |     rec
Language: C++

int K, rec[60], ans[60];
const int N = 50;

signed main() {
    cin >> K;
    int div = K / N, mo = K % N;
    rep(i,0,N) rec[i] = div + (i < mo);

    rep(i,0,N) {
        int sum = 0;
        rep(j,0,N) if(i != j) sum += rec[j];
        ans[i] = N * (rec[i] + 1) - sum - 1;
    }
    cout << N << endl;
    rep(i,0,N) cout << (i ? " " : "") << ans[i];
    cout << endl;
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:5:5: error: 'cin' was not declared in this scope
    5 |     cin >> K;
      |     ^~~
a.cc:7:9: error: 'i' was not declared in this scope
    7 |     rep(i,0,N) rec[i] = div + (i < mo);
      |         ^
a.cc:7:5: error: 'rep' was not declared in this scope; did you mean 'rec'?
    7 |     rep(i,0,N) rec[i] = div + (i < mo);
      |     ^~~
      |     rec
a.cc:14:5: error: 'cout' was not declared in this scope
   14 |     cout << N << endl;
      |     ^~~~
a.cc:14:18: error: 'endl' was not declared in this scope
   14 |     cout << N << endl;
      |                  ^~~~
Language: C++

#include "bits/stdc++.h"

#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define ALL(v) v.begin(),v.end()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cout<<v[i]<<" "

using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<ll, ll> P;
typedef long double ld;
struct Edge{ll from, to, cost;};
struct node{ll cost, to;
  bool friend operator>(node a, node b){
    return a.cost>b.cost;
  }
};

ll mod(ll a, ll mod){
  ll res = a%mod;
  if(res<0)res=res + mod;
  return res;
}

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

ll modinv(ll a, ll mod){
  return modpow(a, mod-2, mod);
}

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

bool is_prime(ll n){
  ll i = 2;
  if(n==1)return false;
  if(n==2)return true;
  bool res = true;
  while(i*i <n){
    if(n%i==0){
      res = false;
    }
    i = i+1;
  }

  //if(i==1)res = false;
  if(n%i==0)res=false;
  return res;
}


/**************************************
** A main function starts from here  **
***************************************/
int main(){
  ll K, N;
  //cin >> K >> N;
  cin >> K;
  N=50
  //N=5;
  ll from = K/(N);
  ll exception = K/(N)+N-(K%(N));
  //cout << exception << endl;
  cout << N <<endl;
  FOR(i, from, from+N+1){
    if(i==exception)continue;
    cout << i << " ";
  }

  return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:73:7: error: expected ';' before 'll'
   73 |   N=50
      |       ^
      |       ;
   74 |   //N=5;
   75 |   ll from = K/(N);
      |   ~~   
a.cc:79:10: error: 'from' was not declared in this scope; did you mean 'fromfp'?
   79 |   FOR(i, from, from+N+1){
      |          ^~~~
a.cc:6:31: note: in definition of macro 'FOR'
    6 | #define FOR(i, j, k) for(ll i=j;i<k;i++)
      |                               ^
Language: C++

#include "bits/stdc++.h"

#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define ALL(v) v.begin(),v.end()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cout<<v[i]<<" "

using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<ll, ll> P;
typedef long double ld;
struct Edge{ll from, to, cost;};
struct node{ll cost, to;
  bool friend operator>(node a, node b){
    return a.cost>b.cost;
  }
};

ll mod(ll a, ll mod){
  ll res = a%mod;
  if(res<0)res=res + mod;
  return res;
}

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

ll modinv(ll a, ll mod){
  return modpow(a, mod-2, mod);
}

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

bool is_prime(ll n){
  ll i = 2;
  if(n==1)return false;
  if(n==2)return true;
  bool res = true;
  while(i*i <n){
    if(n%i==0){
      res = false;
    }
    i = i+1;
  }

  //if(i==1)res = false;
  if(n%i==0)res=false;
  return res;
}


/**************************************
** A main function starts from here  **
***************************************/
int main(){
  ll K, N;
  cin >> K;
  N=50
  ll from = K/(N+1);
  ll exception = K/(N+1)+N-(K%(N+1));
  cout << exception << endl;
  cout << N <<endl;
  FOR(i, from, from+N+1){
    if(i==exception)continue;
    cout << i << " ";
  }

  return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:72:7: error: expected ';' before 'll'
   72 |   N=50
      |       ^
      |       ;
   73 |   ll from = K/(N+1);
      |   ~~   
a.cc:77:10: error: 'from' was not declared in this scope; did you mean 'fromfp'?
   77 |   FOR(i, from, from+N+1){
      |          ^~~~
a.cc:6:31: note: in definition of macro 'FOR'
    6 | #define FOR(i, j, k) for(ll i=j;i<k;i++)
      |                               ^
Language: C++

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

#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<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef vector<ll> vec;
typedef vector<P> pvec;
typedef vector<vector<ll>> vvec;
typedef vector<vector<P>> pvvec;
typedef priority_queue<ll> PQI;
typedef priority_queue<P> PQP;
typedef priority_queue<ll,vector<ll>,greater<ll>> 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 int INF = (1LL << 60); // 1152921504606846976
const double EPS = (1 >> 30);

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< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; }

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



signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);
    //---------------------------------------------
    
    int k;
    cin>>k;

    vec a(50,49);
    int n=50;
    rep(i,n) a[i]+=k/50;
    int memo=k%50;
    a[0]+=memo*50;
    rep(i,n-1) a[i+1]-=memo;

    cout<<<50<endl;
    rep(i,n) cout<<a[i]<<" "; 
    cout<<endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:65:11: error: expected primary-expression before '<' token
   65 |     cout<<<50<endl;
      |           ^
Language: C++

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

#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<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef vector<ll> vec;
typedef vector<P> pvec;
typedef vector<vector<ll>> vvec;
typedef vector<vector<P>> pvvec;
typedef priority_queue<ll> PQI;
typedef priority_queue<P> PQP;
typedef priority_queue<ll,vector<ll>,greater<ll>> 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 int INF = (1LL << 60); // 1152921504606846976
const double EPS = (1 >> 30);

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< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; }

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



signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);
    //---------------------------------------------
    
    int k;
    cin>>k;

    vec a(50,49);
    rep(i,n) a[i]+=k/50;
    int memo=k%50;
    a[0]+=memo*50;
    rep(i,n-1) a[i+1]-=memo;

    cout<<<50<endl;
    rep(i,n) cout<<a[i]<<" "; 
    cout<<endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:59:11: error: 'n' was not declared in this scope
   59 |     rep(i,n) a[i]+=k/50;
      |           ^
a.cc:8:39: note: in definition of macro 'rep'
    8 | #define rep(i, n) for (int i = 0; i < n; ++i)
      |                                       ^
a.cc:62:11: error: 'n' was not declared in this scope
   62 |     rep(i,n-1) a[i+1]-=memo;
      |           ^
a.cc:8:39: note: in definition of macro 'rep'
    8 | #define rep(i, n) for (int i = 0; i < n; ++i)
      |                                       ^
a.cc:64:11: error: expected primary-expression before '<' token
   64 |     cout<<<50<endl;
      |           ^
a.cc:65:11: error: 'n' was not declared in this scope
   65 |     rep(i,n) cout<<a[i]<<" ";
      |           ^
a.cc:8:39: note: in definition of macro 'rep'
    8 | #define rep(i, n) for (int i = 0; i < n; ++i)
      |                                       ^
Language: C++

#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);i++)
#define repR(i,n) for(ll i=n;i>=0;i--)
#define all(v)(v).begin(),(v).end()
#define rall(v)(v).rbegin(),(v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout<<(x)<<endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll,vector<ll>,greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO"  ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No"  ) << endl
#define mp make_pair
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define sz(x) (int)(x).size()
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
using vc = vector<char>;
using vvc = vector<vc>;
ll dx[4]={0,1,0,-1};
ll dy[4]={1,0,-1,0};
int main(){
  ll k;
  cin>>k;
  ll n;
  if(k>50) n=50;
  else n=k;
  ll d=k/n;
  vll a(n,n-1+d);
  ll cu=k%n;
  ll i=0;
  while(cu){
    a[i]++;
    i++;
    cu--;
  }
  COUT(n);
  rep(i,n){
    cour<<a[i]<<" ";
  }
}
  


Compiler output:
a.cc: In function 'int main()':
a.cc:59:5: error: 'cour' was not declared in this scope; did you mean 'cu'?
   59 |     cour<<a[i]<<" ";
      |     ^~~~
      |     cu
Language: C

#include <bits/stdc++.h>
#define rep(i,n) for(int64_t i=0;i < (int64_t)(n);i++)
#define invrep(i,n) for(int64_t i=n-1;i >= 0;i--)
using namespace std;

//////全探索したいときに開けよ////////
vector<vector<int>> fspattern;
vector<int> fspattern_draft;
int fspcnt = 0;

void setfspattern_core(int floor,int number,int degree){
  if(floor==degree){
    fspattern.at(fspcnt) = fspattern_draft;
    fspcnt++;
  }else{
    rep(i,number){
      fspattern_draft.at(floor) = i;
      setfspattern_core(floor+1,number,degree);
    }
  }
}

void setfspattern(int number,int degree){
  fspcnt = 0;
  int64_t array_num = 1;
  rep(i,degree){
    array_num *= number;
  }
  fspattern = vector<vector<int>>(array_num,vector<int>(degree));
  fspattern_draft = vector<int>(degree);
  setfspattern_core(0,number,degree);
}

//////nCrのmodを求めたいときに開けよ/////////
//int64_t univMod = 1000000007;
//int64_t factnum = 100000
//vector<int64_t> modfact(factnum);
//vector<int64_t> modinvfact(factnum);

/*void setmodfact(){
  for(int i=0;i<factnum;i++){
    if(i == 0){
      modfact.at(i) = 1;
    }else{
      modfact.at(i) = (modfact.at(i-1)*i)%univMod;
    }
  }
}

int64_t calcmodpower(int64_t a,int64_t n){
  int64_t res = 1;
  while(n != 0){
    if(n & 1){
      res = (res * a) % univMod;
    }
    a = (a*a) % univMod;
    n = n >> 1;
  }
  return res;
}

int64_t calcinverse(int64_t n){
	return calcmodpower(n,univMod-2);
}

void setmodinvfact(){
  for(int i=0;i<factnum;i++){
    if(i==0){
      modinvfact.at(i) = 1;
    }else{
      modinvfact.at(i) = calcmodpower(modfact.at(i),univMod-2);
    }
  }
}*/


/*
int64_t calcGCD(int64_t a,int64_t b){
	int64_t p = a;
	int64_t q = b;
	int64_t c = a%b;
	while(c != 0){
		p = q;
		q = c;
		c = p%q;
	}
	return q;
}
*/
bool cmp(pair<int64_t,int64_t> a,pair<int64_t,int64_t> b){
  if(a.first != b.first){
    return a.first < b.first;
  }else{
    return a.second > b.second;
  }
}


int main(){
  int64_t k;
  cin >> k;
  vector<int64_t> a(50);
  rep(i,50){
    a.at(i) = 49+(k/50);
    if(i < k%50){
      a.at(i) -= ((k%50)-1-50);
    }else{
      a.at(i) -= (k%50);
    }
  }
  cout << 50 << endl;
  rep(i,50){
    cout << a.at(i) << " ";
  }
  cout << endl;
      
    
  
}

Compiler output:
main.c:1:10: fatal error: bits/stdc++.h: No such file or directory
    1 | #include <bits/stdc++.h>
      |          ^~~~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
#define rep(i,a,b) for(int i=(a); i<(b); ++i)
#define per(i,a,b) for(int i=(b)-1; i>=(a); --i)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define S second

int main(void) {
	//freopen("in.txt", "r", stdin);
	ll k;
	cin >> k;
	int n = 50;
	vl ret(n);
	rep(i,0,n) {
		ret[i] = i;
	}
	ll x = k / n;
	ll y = k % n;
	rep(i,0,n) {
		ret[i] += x
	}
	rep(i,0,y) {
		ret[i] += (ll)n;
		ret[i] -= y-1;
	}
	rep(i,y,n) {
		ret[i] -= y;
	}
	cout << n << '\n';
	rep(i,0,n) {
		cout << ret[i] << ' ';
	}
	cout << '\n';
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:29:28: error: expected ';' before '}' token
   29 |                 ret[i] += x
      |                            ^
      |                            ;
   30 |         }
      |         ~
Language: C++

#include "bits/stdc++.h"
#define rep(i,n) for(ll i = 0; i < n; i++)
typedef long long ll;
using namespace std;
#define llMAX numeric_limits<long long>::max()
#define intMAX numeric_limits<int>::max()
#define ll long long
#define vl vector<long long>
#define vll vector<vector<long long>>
ll count(ll num1,ll num2){
  if(num1>num2)swap(num1,num2);
  ll k1;
    if((num2-num1)%3==0){
      k1=(num2-num1)/3;
    }else{
      k1=(num2-num1)/3;
      for(ll dif=-2;dif<3;dif++){
        if(num2-2*(k1+dif)<=k1+dif+num1){
          k1+=dif;
          break;
        }
      }
    }
    if(k1<0)return -1;
    ll k2;
    if(k1+num1==num2-2*k1){
      k2=2*k1-2;
    }else{
      k2=num1+num2-k1-1;
    }
    //cout<<k1<<" "<<k2<<" "<<k1+k2<<" "<<num1+num2<<endl;
    return k1+k2;
}
int main(void){
	ll k;
  cin >> k ;
  //t-2*k1<=k1 t<=3*k1
  /* 
  if(t-k1 %2==1){
    k2=t-k1-1;

  }else{
    k2=t-k1-2;
  }
  
  */
 if(k>100000000000000){
   vi a(2);
   a[1000]=1;
 }
  ll ans=k+500;
  ll ans1,ans2;
  int flag2=0;
  rep(i,1000){
    ll c=count(0,ans-i);
    if(c<0)continue;
    if(c==k){
      ans-=i;
      //cout<<k1<<" "<<k2<<endl;
      break;
    }
    if(c<k){
      ll i2=i-1;
      flag2=1;

      rep(j,10000){
        ll num1=j;
        ll num2=ans-i-j;
        ll c2=count(num1,num2);
        if(c2==k){
          ans1=num1;
          ans2=num2;
          break;
        }
      }
      ans-=i;
      break;
    }
  }

  cout<<2<<endl;
  if(flag2==0){
    cout<<flag2<<" "<<ans<<endl;

  }else{
    cout<<ans1<<" "<<ans2<<endl;
  }
	return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:48:4: error: 'vi' was not declared in this scope; did you mean 'vl'?
   48 |    vi a(2);
      |    ^~
      |    vl
a.cc:49:4: error: 'a' was not declared in this scope
   49 |    a[1000]=1;
      |    ^
Language: C++

#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using datas=pair<ll,ll>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
#define For(i,a,b) for(i=a;i<b;i++)
#define bFor(i,a,b) for(i=a;i>=b;i--)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N-1,0)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define mod 1000000007
#define endl "\n"
#define output(v) do{bool f=0;for(auto i:v){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}while(0)

long mmid(long a,long b,long c){return a<b?(b<c?b:max(a,c)):(b>c?b:min(a,c));}

ll modinv(ll a) {
  ll b=mod,u=1,v=0,t;
  while(b){
    t=a/b;
    a-=t*b; swap(a,b);
    u-=t*v; swap(u,v);
  }
  return (u+mod)%mod;
}

ll moddevide(ll a,ll b){return (a*modinv(b))%mod;}

ll modncr(ll n,ll r){
  ll i,plus=1;
  rep(i,r){
    plus=(plus*(n-i))%mod;
    plus=moddevide(plus,i+1);
  }
  return plus;
}

ll modncrlistp[200000],modncrlistm[200000];

ll modncrs(ll n,ll r){
  ll i,j;
  if(modncrlistp[n]==0){
    for(i=n;i>=0;i--){
      if(modncrlistp[i])break;
    }
    if(i<0){
      modncrlistp[0]=1;
      rep1(i,n+1){
        modncrlistp[i]=(modncrlistp[i-1]*i)%mod;
      }
    }else{
      For(j,i+1,n+1){
        modncrlistp[j]=(modncrlistp[j-1]*j)%mod;
      }
    }
  }
  if(modncrlistm[n]==0){
    for(i=n;i>=0;i--){
      if(modncrlistm[i])break;
    }
    if(i<0){
      modncrlistm[0]=1;
      rep1(i,n+1){
        modncrlistm[i]=(modncrlistm[i-1]*modinv(i))%mod;
      }
    }else{
      For(j,i+1,n+1)modncrlistm[j]=(modncrlistm[j-1]*modinv(j))%mod;
    }
  }
  return (((modncrlistp[n]*modncrlistm[r])%mod)*modncrlistm[n-r])%mod;
}

ll gcd(ll a,ll b){if(!b)return a;return (a%b==0)?b:gcd(b,a%b);}

ll countdigits(ll n){
  ll ans=0;
  while(n){n/=10;ans++;}
  return ans;
}

ll sumdigits(ll n){
  ll ans=0;
  while(n){ans+=n%10;n/=10;}
  return ans;
}

vec eratosthenes(ll N){
  ll i;
  vec ch(N+1,1),p;
  ch[0]=ch[1]=0;
  rep(i,N+1){
    if(ch[i]){
      p.push_back(i);
      for(ll j=2;i*j<=N;j++){
        ch[i*j]=0;
      }
    }
  }
  return ch;
}
int main(){
  ll i,j,N=50,K;
  cin>>K;
  cout<<N<<endl;
  ll x=K/N,y=K%N;
  vec ans(N);
  rep(i,N){
    ans[i]=i+x;
  }
  rep(i,y){
    ans[i]+=N+1;
    rep(j,n){
      ans[j]--;
    }
  }
  output(ans);
  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:121:11: error: 'n' was not declared in this scope
  121 |     rep(j,n){
      |           ^
a.cc:11:30: note: in definition of macro 'For'
   11 | #define For(i,a,b) for(i=a;i<b;i++)
      |                              ^
a.cc:121:5: note: in expansion of macro 'rep'
  121 |     rep(j,n){
      |     ^~~
Language: C++

#include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF=(long long)1E17;
#define i_7 (long long)(1E9+7)
long mod(long a){
    long long c=a%i_7;
    if(c>=0)return c;
    return c+i_7;
}
using namespace std;
bool prime_(int n){
  if(n==1){
    return false;
  }else if(n==2){
    return true;
  }else{
    for(int i=2;i<=sqrt(n);i++){
      if(n%i==0){
        return false;
      }
    }
    return true;
  }
}

long long gcd_(long long a, long long b){
  if(a<b){
    swap(a,b);
  }
  if(a%b==0){
    return b;
  }else{
    return gcd_(b,a%b);
  }
}
 
long long lcm_(long long x, long long y){
  return (x/gcd_(x,y))*y;
}
 
class UnionFind {
    public:
    //各頂点の親の番号を格納する。その頂点自身が親だった場合は-(その集合のサイズ)を入れる。
    vector<int> Parent;
    
    //クラスを作るときは、Parentの値を全て-1にする。
    //以下のようにすると全てバラバラの頂点として解釈できる。
    UnionFind(int N) {
        Parent = vector<int>(N, -1);
    }
    
    //Aがどのグループに属しているか調べる
    int root(int A) {
        if (Parent[A] < 0) return A;
        return Parent[A] = root(Parent[A]);
    }
    
    //自分のいるグループの頂点数を調べる
    int size(int A) {
        return -Parent[root(A)];//先祖をrootで取っておきたい。
    }
    
    //AとBをくっ付ける
    bool connect(int A, int B) {
        //AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
        A = root(A);
        B = root(B);
        if (A == B) {
            //すでにくっついてるからくっ付けない
            return false;
        }
        
        //大きい方(A)に小さいほう(B)をくっ付けたい
        //大小が逆だったらAとBをひっくり返す。
        if (size(A) < size(B)) swap(A, B);
        
        //Aのサイズを更新する
        Parent[A] += Parent[B];
        //Bの親をAに変更する
        Parent[B] = A;
        
        return true;
    }
};

int main(){
  
  long long k;
  long long n = 50;
  vector<long long> ans(n);
  REP(i,n){
    ans[i] = i;
  }
  long long loop = k/n;
  long long rest = k%n;
  REP(i,n){
    ans[i] += loop;
  }
  REP(i,rest){
    ans[i] += n;
    ans[i] -= rest-1;
  }
  for(int i=rest;i<n;i++){
    ans[i] -= rest;
  }
  
  cout<<n<<endl;
  REP(i,n){
    cout<<a[i]<<' ';
  }
  cout<<endl;
  return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:112:11: error: 'a' was not declared in this scope
  112 |     cout<<a[i]<<' ';
      |           ^
Language: C++

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  ll K;
  cin >> K;
  ll N = 50;
  vector<ll> A(N);
  for (int i = 0; i < N; i++)
    A[i] = 49 + K / N;
  K = K % N;
  for (int i = 0; i < K; i++) {
    A[i] += N + 1;
    for (int j = 0; j < N; j++)
      A[j]--;
  }
  cout << N << '\n';
  for (int i = 0; i < N; i++)
    cout << A[i] << (i == N - 1 ? '\n' : " ");
  return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:23:33: error: operands to '?:' have different types 'char' and 'const char*'
   23 |     cout << A[i] << (i == N - 1 ? '\n' : " ");
      |                      ~~~~~~~~~~~^~~~~~~~~~~~
Language: C++

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

typedef long long ll;

int main(){
  ll K;cin>>K;
  int r=K%50, q=K/50;
  ll a(50);
  for (int i=0;i<50;++i){
    if (i<r-1){a[i]=50+q;}else{
      a[i]=q;
    }
  }
  cout << 50 << endl;
  for (int i=0;i<50;++i){
    cout << a[i] << ' ';
  }
  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:11:17: error: invalid types 'll {aka long long int}[int]' for array subscript
   11 |     if (i<r-1){a[i]=50+q;}else{
      |                 ^
a.cc:12:8: error: invalid types 'll {aka long long int}[int]' for array subscript
   12 |       a[i]=q;
      |        ^
a.cc:17:14: error: invalid types 'll {aka long long int}[int]' for array subscript
   17 |     cout << a[i] << ' ';
      |              ^
Language: C++

#include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
long long inf=(long long)1E17;
#define i_7 (long long)(1E9+7)
long mod(long a){
    long long c=a%i_7;
    if(c>=0)return c;
    return c+i_7;
}
using namespace std;
long long gcd(long long a, long long b){
  if(a<b){
    swap(a,b);
  }
  if(a%b==0){
    return b;
  }else{
    return gcd(b,a%b);
  }
}
 
long long lcm(long long x, long long y){
  return (x/gcd(x,y))*y;
}
 
class UnionFind {
    public:
    //各頂点の親の番号を格納する。その頂点自身が親だった場合は-(その集合のサイズ)を入れる。
    vector<int> Parent;
    
    //クラスを作るときは、Parentの値を全て-1にする。
    //以下のようにすると全てバラバラの頂点として解釈できる。
    UnionFind(int N) {
        Parent = vector<int>(N, -1);
    }
    
    //Aがどのグループに属しているか調べる
    int root(int A) {
        if (Parent[A] < 0) return A;
        return Parent[A] = root(Parent[A]);
    }
    
    //自分のいるグループの頂点数を調べる
    int size(int A) {
        return -Parent[root(A)];//先祖をrootで取っておきたい。
    }
    
    //AとBをくっ付ける
    bool connect(int A, int B) {
        //AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
        A = root(A);
        B = root(B);
        if (A == B) {
            //すでにくっついてるからくっ付けない
            return false;
        }
        
        //大きい方(A)に小さいほう(B)をくっ付けたい
        //大小が逆だったらAとBをひっくり返す。
        if (size(A) < size(B)) swap(A, B);
        
        //Aのサイズを更新する
        Parent[A] += Parent[B];
        //Bの親をAに変更する
        Parent[B] = A;
        
        return true;
    }
};
 
int main(){
  long long k;
  cin>>k
  
  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:73:9: error: expected ';' before 'return'
   73 |   cin>>k
      |         ^
      |         ;
   74 | 
   75 |   return 0;
      |   ~~~~~~
Language: C++

#include <iostream>
using namespamce std;
int main(){
cout<< "POSSIBLE" << endl;
return 0;
}

Compiler output:
a.cc:2:7: error: expected nested-name-specifier before 'namespamce'
    2 | using namespamce std;
      |       ^~~~~~~~~~
a.cc: In function 'int main()':
a.cc:4:1: error: 'cout' was not declared in this scope; did you mean 'std::cout'?
    4 | cout<< "POSSIBLE" << endl;
      | ^~~~
      | std::cout
In file included from a.cc:1:
/usr/include/c++/14/iostream:63:18: note: 'std::cout' declared here
   63 |   extern ostream cout;          ///< Linked to standard output
      |                  ^~~~
a.cc:4:22: error: 'endl' was not declared in this scope; did you mean 'std::endl'?
    4 | cout<< "POSSIBLE" << endl;
      |                      ^~~~
      |                      std::endl
In file included from /usr/include/c++/14/iostream:41:
/usr/include/c++/14/ostream:744:5: note: 'std::endl' declared here
  744 |     endl(basic_ostream<_CharT, _Traits>& __os)
      |     ^~~~
Language: C++

#include <bits/stdc++.h>
// statics
using namespace std;
using int64 = int_fast64_t;
using PAIR = pair<int, int>;
constexpr int INF = 1 << 30;
constexpr int64 LINF = 1LL << 60;
constexpr int MOD = 1e9 + 7;
constexpr int MAX_N = 1e5 + 1;

// init/input
#define int int64
#define INIT ios::sync_with_stdio(false);cin.tie(0);
#define VAR(type, ...) type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T &t) {cin>>t;}
template<typename First, typename...Rest> void MACRO_VAR_Scan(First &first, Rest&...rest) {cin>>first;MACRO_VAR_Scan(rest...);}
#define VEC(type, c, n) vector<type> c(n);for(auto &&i:c)cin>>i;

// out
#define OUT(dist) cout<<(dist);
#define FOUT(n, dist) cout<<fixed<<setprecision(n)<<(dist);
#define SP cout<<" ";
#define BR cout<<"\n";
#define debug(x) cerr<<#x<<":"<< (x);BR;

// utility
#define ALL(a) (a).begin(), (a).end()
#define EACH(i, a) for(auto &&i:(a))
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=0;--i)
#define REP(i, n) for(int i=0;i<(n);++i)
#define RREP(i, n) for(int i=(n)-1;i>=0;--i)

signed main() {
  INIT;

	VAR(int, k);

	int p = k / 50, q = k % 50;
	vector< int > ans(50, n + p);
	REP(i, q) {
		ans[i] += 51;
	}
	OUT(50)BR;
	REP(i, 50) {
		OUT(ans[i]);
		if (i < 49) SP
			else BR
	}
	
  
  return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:40:31: error: 'n' was not declared in this scope
   40 |         vector< int > ans(50, n + p);
      |                               ^
Language: C++

#include<cstdio>
#include<queue>
#include<utility>
#include<cstring>
#include<stack>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<map>
#define MAX_N 100001
#define INF_INT 2147483647
#define INF_LL 9223372036854775807
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
int main()
{
  ll a[51],K,k,mo;
  REP(i,50){
    a[i] = i;
  }
  cin >> K;
  d = K/50;
  mo = K % 50;
  REP(i,50){
    a[i] += d;
  }
  REP(i,mo){
    a[49-i] += 1;
  }
  REP(i,50)
    cout << a[i] << endl;
  return 0;
}



Compiler output:
a.cc: In function 'int main()':
a.cc:24:3: error: 'd' was not declared in this scope
   24 |   d = K/50;
      |   ^
Language: C++

#include <iostream>
#include<cstdlib>
#include<queue>
#include<set>
#include<vector>
#include<string>
#include<algorithm>
#include<stack>
#include<map>
#include<cstdio>
using namespace std;
#define rep(i,a) for(int i=0;i<a;i++)
#define mp make_pair
#define pb push_back
#define P pair<int,int>
#define ll __int64
//#define ll long long
const int INF=1000000007;
ll  k;
ll n;
ll t[100];

int main(){
	cin>>k;
	if(k>=50)n=50;
	else n=k;
	if(k==0)n=1;

	rep(i,n)t[i]=(k/n)+(n-1);
	rep(i,(k%n))t[i]--;

	cout<<n<<endl;
	rep(i,n){cout<<t[i];if(i!=n-1)cout<<" ";}
	cout<<endl;
	
	return 0;
}



Compiler output:
a.cc:16:12: error: '__int64' does not name a type; did you mean '__int64_t'?
   16 | #define ll __int64
      |            ^~~~~~~
a.cc:19:1: note: in expansion of macro 'll'
   19 | ll  k;
      | ^~
a.cc:16:12: error: '__int64' does not name a type; did you mean '__int64_t'?
   16 | #define ll __int64
      |            ^~~~~~~
a.cc:20:1: note: in expansion of macro 'll'
   20 | ll n;
      | ^~
a.cc:16:12: error: '__int64' does not name a type; did you mean '__int64_t'?
   16 | #define ll __int64
      |            ^~~~~~~
a.cc:21:1: note: in expansion of macro 'll'
   21 | ll t[100];
      | ^~
a.cc: In function 'int main()':
a.cc:24:14: error: 'k' was not declared in this scope
   24 |         cin>>k;
      |              ^
a.cc:25:18: error: 'n' was not declared in this scope
   25 |         if(k>=50)n=50;
      |                  ^
a.cc:26:14: error: 'n' was not declared in this scope
   26 |         else n=k;
      |              ^
a.cc:27:17: error: 'n' was not declared in this scope
   27 |         if(k==0)n=1;
      |                 ^
a.cc:29:15: error: 'n' was not declared in this scope
   29 |         rep(i,n)t[i]=(k/n)+(n-1);
      |               ^
a.cc:12:32: note: in definition of macro 'rep'
   12 | #define rep(i,a) for(int i=0;i<a;i++)
      |                                ^
a.cc:29:17: error: 't' was not declared in this scope
   29 |         rep(i,n)t[i]=(k/n)+(n-1);
      |                 ^
a.cc:30:18: error: 'n' was not declared in this scope
   30 |         rep(i,(k%n))t[i]--;
      |                  ^
a.cc:12:32: note: in definition of macro 'rep'
   12 | #define rep(i,a) for(int i=0;i<a;i++)
      |                                ^
a.cc:30:21: error: 't' was not declared in this scope
   30 |         rep(i,(k%n))t[i]--;
      |                     ^
a.cc:32:15: error: 'n' was not declared in this scope
   32 |         cout<<n<<endl;
      |               ^
a.cc:33:24: error: 't' was not declared in this scope
   33 |         rep(i,n){cout<<t[i];if(i!=n-1)cout<<" ";}
      |                        ^
Language: C++

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<string>
#include<sstream>
#include<iomanip>
#include<utility>
#include<cmath>
#include<set>
#include<list>
#include<queue>
#include<stack>
#include<deque>
#include<map>
#include<set>
#include<cstring>
#include<iterator>
#include<bitset>
#include<assert.h>
using namespace std;
 
#define int ll
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,pair<int,int> > PP;
typedef vector<int> VI;
typedef vector<long long int> VL;
static const int MOD = 1000000007;
static const int INF = 2147483647;
//static const long long INF = 9223372000000000000;
//static const long long INF = 9223372000000000000/2;
//static const int INF = 1000010000;
//int dx4[4] = {0,1,0,-1}, dy4[4] = {-1,0,1,0};
//int dx5[5] = {-1,0,0,0,1}, dy5[5] = {0,-1,0,1,0};
//int dx8[8] = {-1,0,1,1,1,0,-1,-1}, dy8[8] = {1,1,1,0,-1,-1,-1,0};
//int dx9[9] = {-1,0,1,1,1,0,-1,-1,0}, dy9[9] = {1,1,1,0,-1,-1,-1,0,0};
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define FI first
#define SE second
#define NP next_permutation
#define PQ priority_queue
#define UB upper_bound
#define LB lower_bound
#define ALL(x) (x).begin(),(x).end()
#define SZ(a) int((a).size())
#define LEN(a) int((a).length())
#define MAX(a,b,c) max((a),max((b),(c)))
#define MIN(a,b,c) min((a),min((b),(c)))
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REP1(i,x) for(int i=1;i<=(int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RREP1(i,x) for(int i=((int)(x));i>0;i--)
//struct edge {int to,cost;};
 
signed main(){
    int k;
    cin >> k;
    if(k<=50){
        printf("%lld\n",k);
        REP1(i,k) printf("%lld ",i);
        puts("");
    } else {
        int a = k/50;
        int b = k%50;
        int ans[51]={};
        REP(i,50) ans[i] = i+1;
        REP(i,50) ans[i] += a;
        for(int i=50-b;i<50;i++) ans[i]++;
        puts("50");
        REP(i,50) printf("%lld ",ans[i]);
        puts("")
    }
    return 0;
}



Compiler output:
a.cc: In function 'int main()':
a.cc:77:17: error: expected ';' before '}' token
   77 |         puts("")
      |                 ^
      |                 ;
   78 |     }
      |     ~
Language: C++

#include <iostream>
#include <vector>

using namespace std;

int main()
{
    unsigned long long K;
    cin >> K;

    long long N = 50;
    vector<long long> numVec;

    for (int i = 0; i < N; i++)
    {
        numVec.push_back(i + N * K / N);
    }

    for (int count = 0; count < N % K; count++)
    {
        for (int i = 0; i < N i++)
        {
            if (i == count)
            {
                numVec[i] += N;
            }
            else
            {
                numVec[i]--;
            }
        }
    }

    cout << N << endl;

    for (int i = 0; i < N; i++)
    {
        if (i)
            cout << " ";
        cout << numVec[i];
    }

    cout << endl;
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:21:30: error: expected ';' before 'i'
   21 |         for (int i = 0; i < N i++)
      |                              ^~
      |                              ;
Language: C++

#include <iostream>
#include <vector>

using namespace std;

int main()
{
    unsigned long long K;
    cin >> K;

    long long N = 50;
    vector<long long> numVec;

    for (int i = 0; i < N; i++)
    {
        numVec.push_back(i + N * K / N);
    }

    for (int i = 0; i < N % K; i++)
    {
        if (i == count)
        {
            numVec[i] += N;
        }
        else
        {
            numVec[i]--;
        }
    }

    cout << N << endl;

    for (int i = 0; i < N; i++)
    {
        if (i)
            cout << " ";
        cout << numVec[i];
    }

    cout << endl;
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:21:18: error: 'count' was not declared in this scope
   21 |         if (i == count)
      |                  ^~~~~
Language: C++

#include <bits/stdc++.h>
#define maxs 2020202
#define mme(i,j) memset(i,j,sizeof(i))
using namespace std;

int main(){
   __int64 k;
    while(~scanf("%I64d",&k)){
        if(k==0){
            printf("4\n3 3 3 3\n");
            continue;
        }
        printf("2\n");
        printf("0 %I64d\n",2*k+1);
    }
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:7:4: error: '__int64' was not declared in this scope; did you mean '__ynf64'?
    7 |    __int64 k;
      |    ^~~~~~~
      |    __ynf64
a.cc:8:27: error: 'k' was not declared in this scope
    8 |     while(~scanf("%I64d",&k)){
      |                           ^
Language: C++

#include <iostream>
#include <cstdio>

using namespace std;

int main() {

		int  K, N = 4;
		int a[4] = { 0,1,2,3 };
		int div, rem;
		cin >> K;
		rem = K % 4;
		div = K / 4;

		if (rem == 0) {
			a[0] += div; a[1] += div;
			a[2] += div; a[3] += div;
		}
		if (rem == 1) {
			a[0] = div + N;  a[1] = div;
			a[2] = div + 1; a[3] = div + 2;
		}
		if (rem == 2) {
			a[0] = 3 + div; a[1] = N + div;
			a[2] = div; a[3] = 1 + div;
		}
		if (rem == 3) {
			a[0] = 2 + div; a[1] = 3 + div;
			a[2] = N + div; a[3] = div;
		}

		cout << N << endl;
		cout << a[0] << ' ' << a[1] << ' ' << a[2] << ' ' << a[3] << endl:
 
	return 0;

}

Compiler output:
a.cc: In function 'int main()':
a.cc:33:82: error: expected ';' before ':' token
   33 |                 cout << a[0] << ' ' << a[1] << ' ' << a[2] << ' ' << a[3] << endl:
      |                                                                                  ^
      |                                                                                  ;