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

// V solo
#include <bits/stdc++.h>

#define forn(i, a, b) for (int i = a; i <= b; ++i)
#define forr(i, a, b) for (int i = a; i >= b; --i)

using namespace std;

const int N = (int)1e5 + 1;
const int INF = 1e9 + 7;

typedef long long ll;
typedef long double ld;

typedef pair < int, int > pii;
typedef pair < ll, ll > pll;

int n, curt, curx, cury, t1[N], x1[N], y1[N];
int main (){
  scanf ("%d", &n);
  forn (i, 1, n) scanf ("%d %d %d", &t1[i], (int)&x1[i], (int)&y1[i]);
  forn (i, 1, n){
    int t = t1[i], x = x1[i], y = y1[i];
    ll d = abs(curx - x) + abs(cury - y);
    if (d <= (t - curt) && ((t - curt) % 2 == d % 2)){
      curt = t;
      cury = y;
      curx = x;
    } else return printf ("No\n"), 0;
  }
  printf ("Yes\n");
  return 0;
}


Compiler output:
a.cc:18:44: error: 'int y1 [100001]' redeclared as different kind of entity
   18 | int n, curt, curx, cury, t1[N], x1[N], y1[N];
      |                                            ^
In file included from /usr/include/features.h:523,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/os_defines.h:39,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/c++config.h:683,
                 from /usr/include/c++/14/cassert:43,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:33,
                 from a.cc:2:
/usr/include/x86_64-linux-gnu/bits/mathcalls.h:257:1: note: previous declaration 'double y1(double)'
  257 | __MATHCALL (y1,, (_Mdouble_));
      | ^~~~~~~~~~
a.cc: In function 'int main()':
a.cc:21:45: error: cast from 'int*' to 'int' loses precision [-fpermissive]
   21 |   forn (i, 1, n) scanf ("%d %d %d", &t1[i], (int)&x1[i], (int)&y1[i]);
      |                                             ^~~~~~~~~~~
a.cc:21:68: warning: pointer to a function used in arithmetic [-Wpointer-arith]
   21 |   forn (i, 1, n) scanf ("%d %d %d", &t1[i], (int)&x1[i], (int)&y1[i]);
      |                                                                    ^
a.cc:21:58: error: cast from 'double (*)(double) noexcept' to 'int' loses precision [-fpermissive]
   21 |   forn (i, 1, n) scanf ("%d %d %d", &t1[i], (int)&x1[i], (int)&y1[i]);
      |                                                          ^~~~~~~~~~~
a.cc:23:39: warning: pointer to a function used in arithmetic [-Wpointer-arith]
   23 |     int t = t1[i], x = x1[i], y = y1[i];
      |                                       ^
a.cc:23:39: error: invalid conversion from 'double (*)(double) noexcept' to 'int' [-fpermissive]
   23 |     int t = t1[i], x = x1[i], y = y1[i];
      |                                       ^
      |                                       |
      |                                       double (*)(double) noexcept
Language: C++

// V solo
#include <bits/stdc++.h>

#define forn(i, a, b) for (int i = a; i <= b; ++i)
#define forr(i, a, b) for (int i = a; i >= b; --i)

using namespace std;

const int N = (int)1e5 + 1;
const int INF = 1e9 + 7;

typedef long long ll;
typedef long double ld;

typedef pair < int, int > pii;
typedef pair < ll, ll > pll;

int n, curt, curx, cury, t1[N], x1[N], y1[N];
int main (){
  scanf ("%d", &n);
  forn (i, 1, n) scanf ("%d %d %d", &t1[i], &x1[i], &y1[i]);
  forn (i, 1, n){
    int t = t1[i], x = x1[i], y = y1[i];
    ll d = abs(curx - x) + abs(cury - y);
    if (d <= (t - curt) && ((t - curt) % 2 == d % 2)){
      curt = t;
      cury = y;
      curx = x;
    } else return printf ("No\n"), 0;
  }
  printf ("Yes\n");
  return 0;
}


Compiler output:
a.cc:18:44: error: 'int y1 [100001]' redeclared as different kind of entity
   18 | int n, curt, curx, cury, t1[N], x1[N], y1[N];
      |                                            ^
In file included from /usr/include/features.h:523,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/os_defines.h:39,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/c++config.h:683,
                 from /usr/include/c++/14/cassert:43,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:33,
                 from a.cc:2:
/usr/include/x86_64-linux-gnu/bits/mathcalls.h:257:1: note: previous declaration 'double y1(double)'
  257 | __MATHCALL (y1,, (_Mdouble_));
      | ^~~~~~~~~~
a.cc: In function 'int main()':
a.cc:21:58: warning: pointer to a function used in arithmetic [-Wpointer-arith]
   21 |   forn (i, 1, n) scanf ("%d %d %d", &t1[i], &x1[i], &y1[i]);
      |                                                          ^
a.cc:23:39: warning: pointer to a function used in arithmetic [-Wpointer-arith]
   23 |     int t = t1[i], x = x1[i], y = y1[i];
      |                                       ^
a.cc:23:39: error: invalid conversion from 'double (*)(double) noexcept' to 'int' [-fpermissive]
   23 |     int t = t1[i], x = x1[i], y = y1[i];
      |                                       ^
      |                                       |
      |                                       double (*)(double) noexcept
Language: C++

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef pair<int,int> P;

#define INF 1<<30
#define LINF 1ll<<60ll
#define MOD 1000000007
#define pb(a) push_back(a)

#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) _repi(i,0,n)
#define _repi(i,a,b) for(int i=a, i##_len=(b); i<i##_len; ++i)
#define REP(...) _overload3(__VA_ARGS__,_repi,_rep,)(__VA_ARGS__)

#define REPR(i, n) for(int i = n;i >= 0;--i)
#define REPARR(i, v) for(int i = 0;i < sz(v);++i)

#define all(vec) (vec.begin()),(vec.end())
#define sz(x) ((int)(x).size())
#define bit(n) (1ll<<(n))

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(a>b){a=b;return true;}return false;}

#define YES(n) cout<<((n)?"YES":"NO")<<endl
#define Yes(n) cout<<((n)?"Yes":"No")<<endl
#define yes(n) cout<<((n)?"yes":"no")<<endl
#define poss(n) cout<<((n)?"possible":"impossible")<<endl
#define Poss(n) cout<<((n)?"Possible":"Impossible")<<endl


int main(){
    int n;
    int t,x,y;
    int bx=0,by=0,bt=0;
    bool=true;
    cin>>n;
    REP(i,n){
        cin>>t>>x>>y;
        int l=abs(x-bx)+abs(y-by);
        if(t-bt<l || (t-bt-l)%2){
            flag=false;
            break;
        }
    }
    Yes(flag);
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:43:9: error: expected unqualified-id before '=' token
   43 |     bool=true;
      |         ^
a.cc:49:13: error: 'flag' was not declared in this scope
   49 |             flag=false;
      |             ^~~~
a.cc:53:9: error: 'flag' was not declared in this scope
   53 |     Yes(flag);
      |         ^~~~
a.cc:33:24: note: in definition of macro 'Yes'
   33 | #define Yes(n) cout<<((n)?"Yes":"No")<<endl
      |                        ^
Language: Java

import java.util.*;
import java.lang.*;

class Main{
  public static void main(String[] args) {
      Scanner sc = new Scanner(System.in);
      int N = Integer.parseInt(sc.next());
      int[] t = new int[N+1];
      int[] x = new int[N+1];
      int[] y = new int[N+1];
      for(int i = 1; i<N+1; i++){
        t[i] = Integer.parseInt(sc.next());
        x[i] = Integer.parseInt(sc.next());
        y[i] = Integer.parseInt(sc.next());
      }
      for(int i = 1; i<N+1; i++){
        int tdiff = t[i] - t[i-1];
        int xd = Math.abs(x[i]-x[i-1]);
        int yd = Math.abs(y[i]-y[i-1]);
        int dd = xd+yd;
        if(tdiff >= dd && (tdiff%2 == dd%2) continue;
        else{
          System.out.println("No");
          return;
        }
      }
      System.out.println("Yes");
  }
}

Compiler output:
Main.java:21: error: ')' expected
        if(tdiff >= dd && (tdiff%2 == dd%2) continue;
                                           ^
1 error
Language: C++

#include <iostream>
using namespace std;
int main(){
  int n,k[112345],l[112345],m[112345];
  cin>>n;
  for(int i=0;i<n;i++){
    cin>>k[i]>>l[i]>>m[i];
  }
  if(n==1&&l[0]+m[0]>k[0]) cout<<"No"<<endl;
  else if(n==1&&l[0]+m[0]<=k[0]) cout<<"Yes"<<endl;]
    else{
  for(int i=1;i<n;i++){
    int dis=l[i-1]+m[i-1];
    if(dis<0) dis=dis*-1;
    if((k[i]-k[i-1])%2!=dis%2){
      cout<<"No"<<endl;
      return 0;
    }
  }
      cout<<"Yes"<<endl;
  }
}

Compiler output:
a.cc: In function 'int main()':
a.cc:10:52: error: expected primary-expression before ']' token
   10 |   else if(n==1&&l[0]+m[0]<=k[0]) cout<<"Yes"<<endl;]
      |                                                    ^
Language: C++

#include <stdio.h>
 
int myabs(int n)
{
	return n>0?n:-n;
}
 
int main()
{
	int n, i;
	scanf("%d", &n);
	int flag = 1;
	int t0 = 0, x0 = 0, y0 = 0;
	for(i=0;i<n;i++)
	{
		int t, x, y;
		scanf("%d%d%d", &t, &x, &y);
		int dt = myabs(t-t0);
		int dx = myabs(x-x0);
		int dy = myabs(y-y0);
		if((dx+dy)%2!=dt%2)
			flag = 0;
		else if((dx+dy)>dt)
			flag = 0;
		t0 = t;
		x0 = x;
		y0 = y;
	} 
	if(flag)
		printf("Yes\n");
	else
		printf("No\n");
    return 0;

Compiler output:
a.cc: In function 'int main()':
a.cc:33:14: error: expected '}' at end of input
   33 |     return 0;
      |              ^
a.cc:9:1: note: to match this '{'
    9 | {
      | ^
Language: C++

#include <stdio.h>
 
int myabs(int n)
{
	return n>0?n:-n;
}
 
int main()
{
	int n, i;
	scanf("%d", &n);
	int flag = 1;
	int t0 = 0, x0 = 0, y0 = 0;
	for(i=0;i<n;i++)
	{
		int t, x, y;
		scanf("%d%d%d", &t, &x, &y);
		int dt = myabs(t-t0);
		int dx = myabs(x-x0);
		int dy = myabs(y-y0);
		if((dx+dy)%2!=dt%2)
			flag = 0;
		else if((dx+dy)>dt)
			flag = 0;
		t0 = t;
		x0 = x;
		y0 = y;
	} 
	if(flag)
		printf("Yes\n");
	else
		printf("No\n");
    return 0;


Compiler output:
a.cc: In function 'int main()':
a.cc:33:14: error: expected '}' at end of input
   33 |     return 0;
      |              ^
a.cc:9:1: note: to match this '{'
    9 | {
      | ^
Language: C++

include <stdio.h>
 
int myabs(int n)
{
	return n>0?n:-n;
}
 
int main()
{
	int n, i;
	scanf("%d", &n);
	int flag = 1;
	int t0 = 0, x0 = 0, y0 = 0;
	for(i=0;i<n;i++)
	{
		int t, x, y;
		scanf("%d%d%d", &t, &x, &y);
		int dt = myabs(t-t0);
		int dx = myabs(x-x0);
		int dy = myabs(y-y0);
		if((dx+dy)%2!=dt%2)
			flag = 0;
		else if((dx+dy)>dt)
			flag = 0;
		t0 = t;
		x0 = x;
		y0 = y;
	} 
	if(flag)
		printf("Yes\n");
	else
		printf("No\n");
    return 0;
}

Compiler output:
a.cc:1:1: error: 'include' does not name a type
    1 | include <stdio.h>
      | ^~~~~~~
a.cc: In function 'int main()':
a.cc:11:9: error: 'scanf' was not declared in this scope
   11 |         scanf("%d", &n);
      |         ^~~~~
a.cc:18:26: error: 'myabs' was not declared in this scope
   18 |                 int dt = myabs(t-t0);
      |                          ^~~~~
a.cc:30:17: error: 'printf' was not declared in this scope
   30 |                 printf("Yes\n");
      |                 ^~~~~~
a.cc:1:1: note: 'printf' is defined in header '<cstdio>'; this is probably fixable by adding '#include <cstdio>'
  +++ |+#include <cstdio>
    1 | include <stdio.h>
a.cc:32:17: error: 'printf' was not declared in this scope
   32 |                 printf("No\n");
      |                 ^~~~~~
a.cc:32:17: note: 'printf' is defined in header '<cstdio>'; this is probably fixable by adding '#include <cstdio>'
Language: C++

#include<bits\\stdc++.h>
using namespace std;
int a[2002][2002];
int b[2002][2002];
char s[4];
inline int f(int (*d)[2002],int sx,int sy,int ex,int ey){
	return d[ex][ey]-d[ex][sy]-d[sx][ey]+d[sx][sy];
}
int main(){
	int i,j,n,m,t,r=0;
	scanf("%d%d",&n,&m);
	while(n--){
		scanf("%d%d%s",&i,&j,s);
		if(s[0]=='W')a[i%(m+m)+1][j%(m+m)+1]++;
		else b[i%(m+m)+1][j%(m+m)+1]++;
	}
	for(i=1;i<=m+m;i++)for(j=1;j<=m+m;j++){
		a[i][j]+=a[i-1][j]+a[i][j-1]-a[i-1][j-1];
		b[i][j]+=b[i-1][j]+b[i][j-1]-b[i-1][j-1];
	}
	for(i=1;i<=m;i++)for(j=1;j<=m;j++){
		t=f(a,0,0,i,j)+f(b,i,0,i+m,j)+f(a,i+m,0,m+m,j)+f(b,0,j,i,j+m)+f(a,i,j,i+m,j+m)+f(b,i+m,j,m+m,j+m)+f(a,0,j+m,i,m+m)+f(b,i,j+m,i+m,m+m)+f(a,i+m,j+m,m+m,m+m);
		if(t>r)r=t;
		t=f(b,0,0,i,j)+f(a,i,0,i+m,j)+f(b,i+m,0,m+m,j)+f(a,0,j,i,j+m)+f(b,i,j,i+m,j+m)+f(a,i+m,j,m+m,j+m)+f(b,0,j+m,i,m+m)+f(a,i,j+m,i+m,m+m)+f(b,i+m,j+m,m+m,m+m);
		if(t>r)r=t;
	}
	printf("%d\n",r);
}

Compiler output:
a.cc:1:9: fatal error: bits\\stdc++.h: No such file or directory
    1 | #include<bits\\stdc++.h>
      |         ^~~~~~~~~~~~~~~~
compilation terminated.
Language: C++

#include<bits\\stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define repl(i,n) for(int i=1;i<=(int)(n);i++)
#define chmax(x,y) x=max(x,y)
using namespace std;
int s[3010][3010];
int a[2][1010][1010];
int main(){
	int n,k;
	cin>>n>>k;
	rep(i,n){
		int x,y;
		char c;
		cin>>x>>y>>c;
		if(c=='B')y+=k;
		x%=2*k;
		y%=2*k;
		s[x][y]++;
		s[x+k][y+k]++;
		s[x][y+k]--;
		s[x+k][y]--;
	}
	rep(i,3*k) rep(j,3*k) s[i][j+1]+=s[i][j];
	rep(i,3*k) rep(j,3*k) s[i+1][j]+=s[i][j];
	int ans=0;
	rep(i,k*3) rep(j,k*3){
		int p=(i/k+j/k)%2;
		a[p][i%k][j%k]+=s[i][j];
	}
	rep(p,2) rep(i,k) rep(j,k) chmax(ans,a[p][i][j]);
	cout<<ans<<endl;
}

Compiler output:
a.cc:1:9: fatal error: bits\\stdc++.h: No such file or directory
    1 | #include<bits\\stdc++.h>
      |         ^~~~~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key

typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef long double ld;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
typedef set<int>::iterator sit;
typedef map<int,int>::iterator mit;
typedef vector<int>::iterator vit;

// template from zscoder

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    //freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
    int n,t,x,y,pt(0);
    cin >> n;
    vi tt(n);
    vi xx(n);
    vi yy(n);
    bool ok = true;
    for(int i = 0; i < n; i++)
    {
        cin >> tt[i] >> x[i] >> y[i];
    }
    for(int i = 1; i < n; i++)
    {
        t = abs(tt[i]-tt[i-1]);
        x = abs(xx[i]-xx[i-1]);
        y = abs(yy[i]-yy[i-1]);
        if(t<(x+y)||(t-(x+y))%2==1)ok = false;
    }
    if(ok)cout << "Yes" << endl;
    else cout << "No" << endl;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:38:26: error: invalid types 'int[int]' for array subscript
   38 |         cin >> tt[i] >> x[i] >> y[i];
      |                          ^
a.cc:38:34: error: invalid types 'int[int]' for array subscript
   38 |         cin >> tt[i] >> x[i] >> y[i];
      |                                  ^
Language: C++

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int main() {
    int n,k;
    cin >> n >> k;
    vector<vector<int>> table = vector<vector<int>>(2*k, vector<int>(2*k, 0));
    int x,y;
    char t;
    for(int i=0;i<n;i++){
        cin >> x >> y >> t;
        if(t=='B'){
            table[x%(2*k)][y%(2*k)]++;
        }else{
            table[(x+k)%(2*k)][y%(2*k)]++;
        }
    }
    show_2d_vector(table);


    vector<vector<int>> n_table = vector<vector<int>>(3*k+1, vector<int>(3*k+1, 0));

    for(int i=0;i<k;i++){
        for(int j=0;j<k;j++){
            n_table[i+1][j+1] = table[i][j];
            n_table[2*k+i+1][j+1] = table[i][j];
            n_table[i+1][2*k+j+1] = table[i][j];
            n_table[2*k+i+1][2*k+j+1] = table[i][j];
            n_table[k+i+1][j+1] = table[k+i][j];
            n_table[k+i+1][2*k+j+1] = table[k+i][j];
            n_table[i+1][k+j+1] = table[i][k+j];
            n_table[2*k+i+1][k+j+1] = table[i][k+j];
            n_table[k+i+1][k+j+1] = table[k+i][k+j];
        }
    }
    vector<vector<int>> i_table = vector<vector<int>>(3*k+1, vector<int>(3*k+1, 0));
    for(int i=0;i<3*k+1;i++){
        for(int j=1;j<3*k+1;j++){
            i_table[i][j] += i_table[i][j-1] + n_table[i][j];
        }
    }
    for(int i=1;i<3*k+1;i++){
        for(int j=0;j<3*k+1;j++){
            i_table[i][j] += i_table[i-1][j];
        }
    }
    int ans = 0;
    int hope1,hope2;
    for(int i=0;i<k+1;i++){
        for(int j=0;j<k+1;j++){
            hope1 = i_table[k+i][k+j] - i_table[k+i][j] - i_table[i][k+j] + i_table[i][j];
            hope2 = i_table[2*k+i][2*k+j] - i_table[2*k+i][k+j] - i_table[k+i][2*k+j] + i_table[k+i][k+j];
           
            int hope_sum = max(hope1+hope2,n-(hope1+hope2));
            ans = max(ans,hope_sum);
        }
    }

    cout << ans << "\n";
}


Compiler output:
a.cc: In function 'int main()':
a.cc:20:5: error: 'show_2d_vector' was not declared in this scope
   20 |     show_2d_vector(table);
      |     ^~~~~~~~~~~~~~
Language: C++

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long long unsigned int llui;
typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector< vector<int> > vvi;
typedef set<int> si;
typedef map<string, int> msi;

#define INF INT_MAX
#define MOD 1000000007
#define EPS 1e-9
#define DEBUG(x) cout<< '>' << #x << ':' << x << "\n";
#define ALL(x) (x).begin(), (x).end()
#define SORT(x) sort((x).begin(),(x).end())
#define sz(a) int((a).size())
#define UNIQUE(x) (x).erase(unique((x).begin(),(x).end()),(x).end())
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define clr(a) memset(a,0,sizeof(a))
#define trace(x) cout << '>' << #x << ':' << x << endl;
#define trace2(x,y) cout<< '>' << #x << ':' << x << " | " << #y << ':' << y << endl;

inline int two(int n) { return 1 << n; }
inline int test(int n, int b) { return (n>>b)&1; }
inline void set_bit(int & n, int b) { n |= two(b); }
inline void unset_bit(int & n, int b) { n &= ~two(b); }
inline int last_bit(int n) { return n & (-n); }
inline int ones(int n) { int res = 0; while(n && ++res) n-=n&(-n); return res; }

#define LSOne(S) (S&(-S))

const double pi = acos(-1);

template<class T> inline T gcd(T a,T b) //NOTES:__gcd(0,0) gives exception
  {if(a<0)return gcd(-a,b);if(b<0)return gcd(a,-b);return (b==0)?a:gcd(b,a%b);}

int cmp(double x, double y = 0, double tol = EPS) {
    return (x <= y + tol) ? (x + tol < y) ? -1 : 0 : 1;
}

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

/*bool sortby(const pair<ll,ll> &a,const pair<ll,ll> &b)
{
    return (a.second < b.second);
}*/

const int MAX_N = 123456;

int arr[MAX_N];
int t[MAX_N];
vii V;

int main() {
	int N,x,y;
	scanf("%d",&N);
	V.PB(ii(0,0));
	bool ans=1;
	arr[0]=t[0]=0;
	for(int i=0;i<N;i++){
		scanf("%d %d %d",t+1,&x,&y);
		V.PB(ii(x,y));
		arr[i+1]=abs(x-V[i].F)+abs(y-V[i].S);
		if(t[i+1]>arr[i+1] || (t[i+1]-arr[i+1])%2==1)
			ans=0;
	}
	if(ans)
		print("Yes\n");
	else
		printf("No\n");
	return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:75:17: error: 'print' was not declared in this scope; did you mean 'rint'?
   75 |                 print("Yes\n");
      |                 ^~~~~
      |                 rint
Language: C++

#include <cstdio>
#include <cmath>
#define N 100005
using namespace std;
int n, t0, x0, y0, t1, x1, y1, t, d;
int main() {
	scanf("%d", &n);
	for(int i=1; i<=n; i++) {
		scanf("%d%d%d", &t1, &x1, &y1);
		t = abs(t1 - t0);
		d = abs(x1 - x0) + abs(y1 - y0);
		if(t<d || (t-d)%2) {puts("No"); return 0;}
		t0=t1, x0=x1, y0=y1;
	}
	puts("Yes");
	return 0;
}

Compiler output:
a.cc:5:16: error: 'int y0' redeclared as different kind of entity
    5 | int n, t0, x0, y0, t1, x1, y1, t, d;
      |                ^~
In file included from /usr/include/features.h:523,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/os_defines.h:39,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/c++config.h:683,
                 from /usr/include/c++/14/cstdio:41,
                 from a.cc:1:
/usr/include/x86_64-linux-gnu/bits/mathcalls.h:256:1: note: previous declaration 'double y0(double)'
  256 | __MATHCALL (y0,, (_Mdouble_));
      | ^~~~~~~~~~
a.cc:5:28: error: 'int y1' redeclared as different kind of entity
    5 | int n, t0, x0, y0, t1, x1, y1, t, d;
      |                            ^~
/usr/include/x86_64-linux-gnu/bits/mathcalls.h:257:1: note: previous declaration 'double y1(double)'
  257 | __MATHCALL (y1,, (_Mdouble_));
      | ^~~~~~~~~~
a.cc: In function 'int main()':
a.cc:11:43: error: ISO C++ forbids using pointer to a function in subtraction [-fpermissive]
   11 |                 d = abs(x1 - x0) + abs(y1 - y0);
      |                                        ~~~^~~~
a.cc:13:33: error: assignment of function 'double y0(double)'
   13 |                 t0=t1, x0=x1, y0=y1;
      |                               ~~^~~
Language: Java

import java.util.Scanner;

public class AtCorder_Traveling {
	public static void main(String[] args) {
		System.out.println("まず、入力回数を指定してください。");
		Scanner scan = new Scanner(System.in);
		int count = scan.nextInt();
		System.out.println("時間、xの位置、yの位置を空白区切りで回数分指定してください。");

		int[] before = {0, 0, 0};
		boolean judge = true;
		for (int i=0; i<count; i++) {
			boolean temp = check(scan, before);
			if (judge) {
				judge = temp;
			}
		}

		if (judge) {
			System.out.println("Yes");
		}
		else {
			System.out.println("No");
		}
	}

	protected static boolean check(Scanner scan, int[] before) {
		int t = scan.nextInt();
		int x = scan.nextInt();
		int y = scan.nextInt();

		int dif = Math.abs(x - before[1] + y - before[2]);
		int before_bak = before[0];
		before[0] = t;
		before[1] = x;
		before[2] = y;

		t = t - before_bak;
		while(t > 0) {
			if (dif == t) {
				return true;
			}
			t -= 2;
		}
		return false;
	}
}

Compiler output:
Main.java:3: error: class AtCorder_Traveling is public, should be declared in a file named AtCorder_Traveling.java
public class AtCorder_Traveling {
       ^
1 error
Language: C++

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

int main()
{
int n;
cin>>n;
int a,b,c;
int pr=0,pr2=0;
long long tot=0;
     for(int i=0;i<n;i++)
{
  cin>>a>>b>>c;
  long long pre_tot=tot;
   tot= (a);
   int min_tim= abs(pr-b)+abs(pr2-c);
  pre_tot+=min_tim;
  
   if((tot-pre_tot)%2) || tot<pre_tot ){cout<<"No";return 0;}
   pr=b,pr2=c;
}
cout<<"Yes";
     return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:19:24: error: expected primary-expression before '||' token
   19 |    if((tot-pre_tot)%2) || tot<pre_tot ){cout<<"No";return 0;}
      |                        ^~
Language: C++

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

int main()
{
int n;
cin>>n;
int a,b,c;
int pr=0,pr2=0;
long long tot=0;
     for(int i=0;i<n;i++)
{
  cin>>a>>b>>c;
  long long pre_tot=tot;
   tot= (a);
   int min_tim= abs(pr-b)+abs(pr2-c);
  pre_tot+=min_tim;
  
   if((tot-pre_tot)%2) ){cout<<"No";return 0;}
   pr=b,pr2=c;
}
cout<<"Yes";
     return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:19:24: error: expected primary-expression before ')' token
   19 |    if((tot-pre_tot)%2) ){cout<<"No";return 0;}
      |                        ^
Language: C++

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

int main()
{
int n;
cin>>n;
int a,b,c;
int pr=0,pr2=0;
long long tot=0;
     for(int i=0;i<n;i++)
{
  cin>>a>>b>>c;
  long long pre_tot=tot;
   tot+= (a);
   int min_tim= abs(pr-b)+abs(pr2-c);
  pre_tot+=min_tim;
  
   if((tot-pre_tot)%2) ){cout<<"No";return 0;}
   pr=b,pr2=c;
}
cout<<"Yes";
     return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:19:24: error: expected primary-expression before ')' token
   19 |    if((tot-pre_tot)%2) ){cout<<"No";return 0;}
      |                        ^
Language: C++

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

class position {
public:
  int x;
  int y;
  int n;

  bool judge(position * p) {
    int distance = std::abs(x - p->x) + std::abs(y - p->y);
    int time = std::abs (p->n - n);
    // cout << distance << " " << time << endl;
    if (distance > time)
      return false;
    else if (distance == time)
      return true;
=>  else if (((time - distance) % 2) == 0)
      return true;
    else return false;
  }

  bool operator<<(position p) {

  }

  position(int x, int y, int n) : x(x), y(y), n(n) {}
};

int main() {
  int num;
  cin >> num;

  auto vec = std::vector<position*>(num);

  for (int i = 0; i < num; i++){
    int x, y, n;
    cin >> n >> x >> y;
    vec[i] = new position(x, y, n);
  }

  if (num == 1) {
    cout << "Yes" << endl;
    return 0;
  }

  position * p = new position (0, 0, 0);
  bool flag = true;
  std::for_each(vec.begin(), vec.end(), [&](position *& p2){
      if (! p->judge(p2)) {
        flag = false;
      }
    });

  if (flag)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;

  return 0;
}

Compiler output:
a.cc: In member function 'bool position::judge(position*)':
a.cc:21:1: error: expected primary-expression before '=' token
   21 | =>  else if (((time - distance) % 2) == 0)
      | ^
a.cc:21:2: error: expected primary-expression before '>' token
   21 | =>  else if (((time - distance) % 2) == 0)
      |  ^
a.cc:21:5: error: expected primary-expression before 'else'
   21 | =>  else if (((time - distance) % 2) == 0)
      |     ^~~~
a.cc:23:5: error: 'else' without a previous 'if'
   23 |     else return false;
      |     ^~~~
a.cc: In member function 'bool position::operator<<(position)':
a.cc:28:3: warning: no return statement in function returning non-void [-Wreturn-type]
   28 |   }
      |   ^
Language: C++

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

class position {
public:
  int x;
  int y;
  int n;

  bool judge(position * p) {
    int distance = std::abs(x - p->x) + std::abs(y - p->y);
    int time = std::abs (p->n - n);
    // cout << distance << " " << time << endl;
    if (distance > time)
      return false;
    else if (distance == time)
      return true;
=>  else if ((time - distance) % 2 == 0)
      return true;
    else return false;
  }

  bool operator<<(position p) {

  }

  position(int x, int y, int n) : x(x), y(y), n(n) {}
};

nt main() {
  int num;
  cin >> num;

  auto vec = std::vector<position*>(num);

  for (int i = 0; i < num; i++){
    int x, y, n;
    cin >> n >> x >> y;
    vec[i] = new position(x, y, n);
  }

  if (num == 1) {
    cout << "Yes" << endl;
    return 0;
  }

  position * p = new position (0, 0, 0);
  bool flag = true;
  std::for_each(vec.begin(), vec.end(), [&](position *& p2){
      if (! p->judge(p2)) {
        flag = false;
      }
    });

  if (flag)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;

  return 0;
}

Compiler output:
a.cc: In member function 'bool position::judge(position*)':
a.cc:21:1: error: expected primary-expression before '=' token
   21 | =>  else if ((time - distance) % 2 == 0)
      | ^
a.cc:21:2: error: expected primary-expression before '>' token
   21 | =>  else if ((time - distance) % 2 == 0)
      |  ^
a.cc:21:5: error: expected primary-expression before 'else'
   21 | =>  else if ((time - distance) % 2 == 0)
      |     ^~~~
a.cc:23:5: error: 'else' without a previous 'if'
   23 |     else return false;
      |     ^~~~
a.cc: In member function 'bool position::operator<<(position)':
a.cc:28:3: warning: no return statement in function returning non-void [-Wreturn-type]
   28 |   }
      |   ^
a.cc: At global scope:
a.cc:33:1: error: 'nt' does not name a type; did you mean 'int'?
   33 | nt main() {
      | ^~
      | int
Language: C++

#include<stdio.h>
int main()
{
    int str[10000][3],n,t=0,x=0,y=0,sum[10000],flag;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<3;i++)
        {
            scanf("%d",&str[i][j]);
        }
    }
    for(int i=0;i<n;i++)
    {
        sum[i]+=str[i][1]+str[i][2];
        if(sum[i]>str[0])
        {
            printf("No");
            return;
        }
        if((sum[i]%2==0)and(str[0]%2==0))
        {
            flag=1;
        }
        if((sum[i]%2==1)and(str[0]%2==1))
        {
            flag=1;
        }
    }
return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:16:18: error: ISO C++ forbids comparison between pointer and integer [-fpermissive]
   16 |         if(sum[i]>str[0])
      |            ~~~~~~^~~~~~~
a.cc:19:13: error: return-statement with no value, in function returning 'int' [-fpermissive]
   19 |             return;
      |             ^~~~~~
a.cc:21:35: error: invalid operands of types 'int [3]' and 'int' to binary 'operator%'
   21 |         if((sum[i]%2==0)and(str[0]%2==0))
      |                             ~~~~~~^~
      |                                  | |
      |                                  | int
      |                                  int [3]
a.cc:25:35: error: invalid operands of types 'int [3]' and 'int' to binary 'operator%'
   25 |         if((sum[i]%2==1)and(str[0]%2==1))
      |                             ~~~~~~^~
      |                                  | |
      |                                  | int
      |                                  int [3]
Language: C++

#include<stdio.h>
int main()
{
    int str[10000][3],n,t=0,x=0,y=0,sum[10000],flag;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<3;i++)
        {
            scanf("%d",&str[i][j]);
        }
    }
    for(int i=0;i<n;i++)
    {
        sum[i]+=str[i][1]+str[i][2];
        if(sum[i]>str[0])
        {
            printf("No");
            return;
        }
        if((sum[i]%2==0)&&(str[0]%2==0))
        {
            flag=1;
        }
        if((sum[i]%2==1)&&(str[0]%2==1))
        {
            flag=1;
        }
    }
return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:16:18: error: ISO C++ forbids comparison between pointer and integer [-fpermissive]
   16 |         if(sum[i]>str[0])
      |            ~~~~~~^~~~~~~
a.cc:19:13: error: return-statement with no value, in function returning 'int' [-fpermissive]
   19 |             return;
      |             ^~~~~~
a.cc:21:34: error: invalid operands of types 'int [3]' and 'int' to binary 'operator%'
   21 |         if((sum[i]%2==0)&&(str[0]%2==0))
      |                            ~~~~~~^~
      |                                 | |
      |                                 | int
      |                                 int [3]
a.cc:25:34: error: invalid operands of types 'int [3]' and 'int' to binary 'operator%'
   25 |         if((sum[i]%2==1)&&(str[0]%2==1))
      |                            ~~~~~~^~
      |                                 | |
      |                                 | int
      |                                 int [3]
Language: C++

#include<cstdio>
#include<cmath>
int x,y,lst,n;
int main(){
	cin>>n;
	for(int i=0;i<n;i++)
	{
		int t,xx,yy;cin>>t>>x>>y;
		int d=labs(x-xx)+labs(y-yy);
		if(d>t-lst||(d^(t-lst))&1)
			return puts("No"),0;
		lst=t,x=xx,y=yy;
	}
	puts("Yes");
}


Compiler output:
a.cc: In function 'int main()':
a.cc:5:9: error: 'cin' was not declared in this scope; did you mean 'sin'?
    5 |         cin>>n;
      |         ^~~
      |         sin
Language: C++

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
int loc[100005][2];
int time[100005];
int main()
{
    int n;
    loc[0][0]=0;
    loc[0][1]=0;
    time[0]=0;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%d%d%d",&time[i],&loc[i][0],&loc[i][1]);
    }
    int flag=1;
    for(int i=0;i<=n-1;i++){
        int newt=time[i+1]-time[i];
        int newl=abs(loc[i+1][0]-loc[i][0])+abs(loc[i+1][1]-loc[i][1]);
        if(newl>newt)
        {
            flag=0;
            break;
        }
        if(newl==0)
        {
            int ca=newt%2;
            if(ca==1)
            {
                flag=0;
                break;
            }

        }
    }
    if(flag)
    {
        printf("Yes\n");
    }else{
        printf("No");
    }
    return 0;
}

Compiler output:
a.cc:7:16: error: 'int time [100005]' redeclared as different kind of entity
    7 | int time[100005];
      |                ^
In file included from /usr/include/pthread.h:23,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/gthr-default.h:35,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/gthr.h:157,
                 from /usr/include/c++/14/ext/atomicity.h:35,
                 from /usr/include/c++/14/bits/ios_base.h:39,
                 from /usr/include/c++/14/ios:44,
                 from /usr/include/c++/14/ostream:40,
                 from /usr/include/c++/14/iostream:41,
                 from a.cc:1:
/usr/include/time.h:76:15: note: previous declaration 'time_t time(time_t*)'
   76 | extern time_t time (time_t *__timer) __THROW;
      |               ^~~~
a.cc: In function 'int main()':
a.cc:13:11: warning: pointer to a function used in arithmetic [-Wpointer-arith]
   13 |     time[0]=0;
      |           ^
a.cc:13:12: error: assignment of read-only location '* time'
   13 |     time[0]=0;
      |     ~~~~~~~^~
a.cc:17:31: warning: pointer to a function used in arithmetic [-Wpointer-arith]
   17 |         scanf("%d%d%d",&time[i],&loc[i][0],&loc[i][1]);
      |                               ^
a.cc:21:26: warning: pointer to a function used in arithmetic [-Wpointer-arith]
   21 |         int newt=time[i+1]-time[i];
      |                          ^
cc1plus: warning: pointer to a function used in arithmetic [-Wpointer-arith]
a.cc:21:34: warning: pointer to a function used in arithmetic [-Wpointer-arith]
   21 |         int newt=time[i+1]-time[i];
      |                                  ^
a.cc:21:27: error: ISO C++ forbids using pointer to a function in subtraction [-fpermissive]
   21 |         int newt=time[i+1]-time[i];
      |                  ~~~~~~~~~^~~~~~~~
Language: C++

#include <iostream>
#include <string>
#include <stdlib.h>
using namespace std;
int main(void){
    int N;
    cin >> N;
    //cout << N << endl;
    
    int x[N + 1], y[N + 1], t[N + 1];
    int xsub, ysub, tsub, xysub;
    
    x[0] = 0;
    y[0] = 0;
    t[0] = 0;
    
    for(int i = 1;i < N + 1;i++) {
        cin >> t[i];
        cin >> x[i];
        cin >> y[i];
        //cout << t[i] << " " << x[i] << " " << y[i] << endl;
        tsub = t[i] - t[i - 1];
        xsub = abs(x[i] - x[i - 1]);
        ysub = abs(y[i] - y[i - 1]);
        xysub = xsub + ysub;
        //cout << tsub << " " << xysub << endl;
        if(xysub > tsub) {cout << "no"; exit(0);}
        else if(tsub % 2 == 0 && xysub % 2 == 1) {cout << "no"l; exit(0);}
        else if(tsub % 2 == 1 && xysub % 2 == 0) {cout << "no"l; exit(0);}
    }
    cout << "yes";
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:28:59: error: unable to find string literal operator 'operator""l' with 'const char [3]', 'long unsigned int' arguments
   28 |         else if(tsub % 2 == 0 && xysub % 2 == 1) {cout << "no"l; exit(0);}
      |                                                           ^~~~~
a.cc:29:59: error: unable to find string literal operator 'operator""l' with 'const char [3]', 'long unsigned int' arguments
   29 |         else if(tsub % 2 == 1 && xysub % 2 == 0) {cout << "no"l; exit(0);}
      |                                                           ^~~~~
Language: Java

import java.io.*;
import java.util.Scanner;

public class C {

    public static void main(String args[]) throws IOException {

        Scanner in = new Scanner(System.in);

        boolean result = true;
        int n = in.nextInt();

        int tPrev = 0;
        int xPrev = 0;
        int yPrev = 0;

        for (int i = 0; i<n; i++) {
            int t = in.nextInt();
            int x = in.nextInt();
            int y = in.nextInt();

            result = ((t-tPrev)%2 == Math.abs(x+y-xPrev-yPrev)%2) && result;
            result = (Math.abs(x+y-xPrev-yPrev) <= (t-tPrev)) && result;

            tPrev = t;
            xPrev = x;
            yPrev = y;
        }

        if (result)
            System.out.println("Yes");
        else
            System.out.println("No");
    }
}

Compiler output:
Main.java:4: error: class C is public, should be declared in a file named C.java
public class C {
       ^
1 error
Language: C++

#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
#include <ext/pb_ds/detail/standard_policies.hpp>
#define int long long
#define boost() ios_base :: sync_with_stdio(0); cin.tie(); cout.tie(); cout << fixed; cout << setprecision(15); srand(time(NULL))
using namespace std;
using namespace __gnu_pbds;
typedef tree<pair <int, string>, null_type, less<pair <int, string>>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int n;

signed main () {
  boost();
  cin >> n;
  int curx = 0, cury = 0, curt = 0;
  while (n--) {
    cin >> t >> x >> y;
    int dist = abs(x - curx) + abs(y - cury);
    curt += dist;
    if (curt > t) {
      cout << "No" << endl;
      return 0;
    }
    curt = t;
    curx = x;
    cury = y;
  }
  cout << "Yes" << endl;
  return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:24:12: error: 't' was not declared in this scope; did you mean 'tm'?
   24 |     cin >> t >> x >> y;
      |            ^
      |            tm
a.cc:24:17: error: 'x' was not declared in this scope
   24 |     cin >> t >> x >> y;
      |                 ^
a.cc:24:22: error: 'y' was not declared in this scope; did you mean 'yn'?
   24 |     cin >> t >> x >> y;
      |                      ^
      |                      yn
Language: C++

#include<cmath>
#include<math.h>
#include<ctype.h>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<complex>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cwchar>
#include<cwctype>
#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<string.h>
#include<stdlib.h>
#include<stdio.h>
int n,nowx,nowy,nowt;
int main(){
	//freopen("input.in","r",stdin);
	//freopen("output.out","w",stdout);
	cin>>n;
	while(n--){
		int t,x,y;
		cin>>t>>x>>y;
		int sol=abs(x-nowx)+abs(y-nowy);
		if(t-nowt<sol){
			cout<<"No";
			return 0;
		}
		if(t-nowt>sol && (t-nowt-sol)%2==1){
			cout<<"No";
			return 0;
		}
		nowt=t;
		nowx=x;
		nowy=y;
	}
	cout<<"Yes";
	//system("pause");
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:60:9: error: 'cin' was not declared in this scope; did you mean 'std::cin'?
   60 |         cin>>n;
      |         ^~~
      |         std::cin
In file included from a.cc:31:
/usr/include/c++/14/iostream:62:18: note: 'std::cin' declared here
   62 |   extern istream cin;           ///< Linked to standard input
      |                  ^~~
a.cc:66:25: error: 'cout' was not declared in this scope; did you mean 'std::cout'?
   66 |                         cout<<"No";
      |                         ^~~~
      |                         std::cout
/usr/include/c++/14/iostream:63:18: note: 'std::cout' declared here
   63 |   extern ostream cout;          ///< Linked to standard output
      |                  ^~~~
a.cc:70:25: error: 'cout' was not declared in this scope; did you mean 'std::cout'?
   70 |                         cout<<"No";
      |                         ^~~~
      |                         std::cout
/usr/include/c++/14/iostream:63:18: note: 'std::cout' declared here
   63 |   extern ostream cout;          ///< Linked to standard output
      |                  ^~~~
a.cc:77:9: error: 'cout' was not declared in this scope; did you mean 'std::cout'?
   77 |         cout<<"Yes";
      |         ^~~~
      |         std::cout
/usr/include/c++/14/iostream:63:18: note: 'std::cout' declared here
   63 |   extern ostream cout;          ///< Linked to standard output
      |                  ^~~~
Language: C++

# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <tuple>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
# include <chrono>
# include <random>
# include <limits.h>
# include <unordered_map>
# include <unordered_set>
# include <deque>
# include <cstdio>
# include <cstring>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
constexpr long long MOD = 1000000000 + 7;
constexpr long long INF = 1e17 - 10;
const double PI = acos(-1);
typedef pair<LL, LL> Pll;
typedef pair<LL, pair<LL, LL>> Ppll;
typedef pair<LL, LL> Vec2;
typedef tuple<LL, LL, LL> Tll;
typedef pair<LL, Tll> Ptll;
#define rep(i,rept) for(LL i=0;i<rept;i++)
#define Mfor(i,n) for(LL i=n-1;i>=0;i--)
struct Edge { LL to, cost; };
vector<Edge>vec[1100000];
LL h, w, n, m, s, t, ans = 0, a[1000000],pos[1000000][2],sum;
Ppll b[1000000];
int main() {
	cin >> n;
	rep(i, n) {
		cin >> a[i] >> pos[i][0] >> pos[i][1];
		b[i].first = a[i];
		b[i].second.first = pos[i][0];
		b[i].second.second = pos[i][1];
	}
	sort(b, b + n, [](Ppll aa, Ppll ss) {return aa.first < ss.first; });
	Pll now(0, 0);
	rep(i, n) {
		if ((b[i].second.first + b[i].second.second) % 2 == b[i].first % 2&&
	       sum + abs(now.first - b[i].second.first){
				+ abs(now.second - b[i].second.second)
				<= b[i].first) {
				sum = b[i].first;
				now.first = b[i].second.first;
				now.second = b[i].second.second;
		}
		else {
			cout << "No" << endl;
			return 0;
		}
	}
	cout << "Yes" << endl;
	return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:54:56: error: expected ';' before '{' token
   54 |                sum + abs(now.first - b[i].second.first){
      |                                                        ^
      |                                                        ;
a.cc:66:30: error: expected ')' before ';' token
   66 |         cout << "Yes" << endl;
      |                              ^
      |                              )
a.cc:53:20: note: to match this '('
   53 |                 if ((b[i].second.first + b[i].second.second) % 2 == b[i].first % 2&&
      |                    ^
a.cc:68:2: error: expected '}' at end of input
   68 | }
      |  ^
a.cc:42:12: note: to match this '{'
   42 | int main() {
      |            ^
Language: Java

import java.util.*;

public class Main {

    public static String doPlan(int[] t, int[] x, int[] y) {
        for (int i = 0; i < N; i++) {
            int t1 = t[i];
            int t2 = t[i+1];
            int x1 = x[i];
            int x2 = x[i+1];
            int y1 = y[i];
            int y2 = y[i+1];
            if (((t2 - t1) >= Math.abs(x2 - x1) + Math.abs(y2 - y1))
                && ((t2 - t1) % 2 == (Math.abs(x2 - x1) + Math.abs(y2 - y1)) % 2)) {

            } else {
                return "No";
            }
         }
         return "Yes";
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] t = new int[N + 1];
        int[] x = new int[N + 1];
        int[] y = new int[N + 1];
        t[0] = 0;
        x[0] = 0;
        y[0] = 0;
        for (int i = 1; i <= N; i++) {
            t[i] = sc.nextInt();
            x[i] = sc.nextInt();
            y[i] = sc.nextInt();
        }
        System.out.println(doPlan(t, x, y));
    }

}


Compiler output:
Main.java:6: error: cannot find symbol
        for (int i = 0; i < N; i++) {
                            ^
  symbol:   variable N
  location: class Main
1 error
Language: C++

//#include <bits/stdc++.h>
#include <assert.h>
#include <ctype.h>
#include <errno.h>
#include <float.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <locale>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <wchar.h>
#include <wctype.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cerrno>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <exception>
#include <functional>
#include <map>
#include <ios>
#include <iosfwd>
#include <istream>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <utility>
#include <vector>
#include <cwchar>
#include <cwctype>
#include <complex.h>
#include <fenv.h>
#include <inttypes.h>
#include <stdbool.h>
#include <stdint.h>
#include <tgmath.h>
#include <conio.h>
#include <numeric>
#include <list>
#include <windows.h>
#include <cfloat>
#include <climits>
#include <unordered_map>
#include <unordered_set>
using namespace std;

template<typename T> bool getint(T &x)
{
	char t=getchar();
	bool neg=false;
	x=0;
	for(;(t>'9'||t<'0')&&t!='-'&&t!=EOF;t=getchar());
	if(t=='-') neg=true,t=getchar(); if(t==EOF)return false;
	for(;t<='9'&&t>='0';t=getchar()) x=x*10+t-'0';
	if(neg) x=-x;
	return true;
}
template<typename T> void printint(T x)
{
	if(x<0) putchar('-'),x=-x;
	short a[20]={},sz=0;
	while(x>0) a[sz++]=x%10,x/=10;
	if(sz==0) putchar('0');
	for(int i=sz-1;i>=0;i--) putchar('0'+a[i]);
}

typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef float fl;
typedef double ld;
typedef pair<int,int> pii;
#define ui(n) ((unsigned int)(n))
#define ll(n) ((long long)(n))
#define ull(n) ((unsigned long long)(n))
#define fl(n) ((float)(n))
#define ld(n) ((double)(n))
#define fixpoint(n) fixed<<setprecision(n)
const int INF=1e9+7;
const ll LINF=1e18;
#define pb push_back
#define pop_b pop_back
#define m_p make_pair
#define all(a) (a).begin(),(a).end()
#define pall(a) (a).rbegin(),(a).rend()
#define mod 1000000007
#define sz(a) ((int)(a).size())
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define repa(i,a,n) for(int i=a;i<n;i++)
#define repa1(i,a,n) for(int i=a;i<=n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define per1(i,n) for(int i=n;i>0;i--)
#define pera(i,a,n) for (int i=n-1;i>=a;i--)
#define pera1(i,a,n) for (int i=n;i>a;i--)
#define sqr(x) ((x)*(x))

ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) {return b?gcd(b,a%b):a;}

int n,x,y,tt;

int main()
{
	cin>>n;
	while(n--)
	{
		int t,xx,yy;
		cin>>t>>xx>>yy;
		if(abs(x-xx)+abs(y-yy)>t-tt||(abs(x-xx)+abs(y-yy)-(t-tt))%2) {cout<<"No";return 0;}
		tt=t;x=xx;y=yy;
	}
	cout<<"Yes";
	return 0;
}

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

#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <set>
using namespace std;

#define printLn(X) cout << X << endl
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)

int main(){
	int N;
	cin >> N;

	int tNow = 0;
	int xNow = 0;
	int yNow = 0;
	bool ans = true;
	rep(i, N){
		int tNext;
		int xNext;
		int yNext;
		cin >> tNext >> xNext >> yNext;

		int t = tNext - tNow;
		int d = abs(xNext - xNow) + abs(yNext - yNow);
		if(d <= t && (d - t) % 2 == 0){
		}else{
			ans = false;
			break;
		}
		tNow = tNext;
		xNow = xNext;
		yNow = yNext;
	}
	cout << (ans ? "Yes" : "No") << endl;
	return 0;
}


Compiler output:
main.c:1:10: fatal error: algorithm: No such file or directory
    1 | #include <algorithm>
      |          ^~~~~~~~~~~
compilation terminated.