criyle/codenet-compile-errors huggingface dataset:
Language: Java

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

public class Java {

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tok;

        public InputReader(InputStream inputStream) {
            reader = new BufferedReader(new InputStreamReader(inputStream));
            tok = null;
        }

        public InputReader(String inputFile) throws FileNotFoundException {
            reader = new BufferedReader(new FileReader(inputFile));
            tok = null;
        }

        public String nextLine() {
            String c = "";
            try {
                c = reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }

            return c;
        }

        public String next() {
            while (tok == null || !tok.hasMoreTokens()) {
                try {
                    tok = new StringTokenizer(nextLine());
                } catch (Exception e) {
                    throw new RuntimeException(e);
                }
            }

            return tok.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public double nextDouble(){
            return Double.parseDouble(next());
        }
    }

    public static void main(String args[]) {
        InputStream inputstream = System.in;
        OutputStream outputstream = System.out;
        InputReader in = new InputReader(inputstream);
        PrintWriter out = new PrintWriter(outputstream);
        Task solver = new Task();
        solver.solve(in, out);
        out.flush();
    }

    static class Task {
        public void solve(InputReader in, PrintWriter out) {
            int n=in.nextInt();
            int[][] dice=new int[n][2];
            for(int i=0;i<n;i++){
                dice[i][0]=in.nextInt();
                dice[i][1]=in.nextInt();
            }
            int ans=0;
            boolean flag=false;
            for(int i=0;i<n;i++){
                if(dice[i][0]==dice[i][1])
                ans++;
                else
                ans=0;
                if(ans>=3){
                    flag=true;
                    break;
                }
            }
            if(flag)
            out.println("Yes");
            else
            out.println("No");
        }
    }
}

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

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

int main() {
	int i;
	vector<int> d1(i), d2(i);
	int t = 0;
	cin >> i;
	for (int a = 0; a < i; ++a) {
		cin >> d1[a];
		cin >> d2[a];
	}
	for (int a = 0; a < i; ++a) {
		if (d1[a] == d2[a]) {
			++t;
			if (t >= 3) {
				cout << "Yes" << endl;
				return;
			}
		}
		else {
			t = 0;
		}
	}
	cout << "No" << endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:20:33: error: return-statement with no value, in function returning 'int' [-fpermissive]
   20 |                                 return;
      |                                 ^~~~~~
Language: Java

import java.util.*;
import java.io.*;
public class Main
{
	public static void main(String[] args)
	{
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int[] x = new int[N];
		int[] y = new int[N];
		int maxc = 0;
		int c = 0;
		for(int i = 0; i < N; i++) {
			x[i] = sc.nextInt();
			y[i] = sc.nextInt();
			if(x[i]==y[i])
				c++;
			else
			{
				if(c >maxc)
					maxx = c;
				c=1;
			}
		}
		if(maxc >= 3)
			System.out.println("Yes");
		else
			System.out.println("No");
	}
}

Compiler output:
Main.java:21: error: cannot find symbol
					maxx = c;
					^
  symbol:   variable maxx
  location: class Main
1 error
Language: C++

#include <bits/stdc++.h>
#include<conio.h>
using namespace std;
const int N=2e5+5;
#define ll long long
#define     f           first
#define     s           second
#define     pb          push_back
#define     lb          lower_bound
#define     ub          upper_bound
#define     pii         pair<long long,long long>
#define     all(x)      x.begin(),x.end()
#define     fix         fixed<<setprecision(10)
#define     rep(i,a,b)  for(int i=int(a);i<=int(b);i++)

vector<ll> adj[N];
bool visited[N];
int main()
{

    int n;
    cin>>n;
    int a[100][2];
    for(int i=0;i<n;i++)
    {
        cin>>a[i][0]>>a[i][1];
    }
    int flag=0,ans=INT_MIN;
    for(int i=0;i<n;i++)
    {
        if(a[i][0]==a[i][1])
            flag++;
        else
            flag=0;
        ans=max(ans,flag);
    }
    if(ans>=3)
    cout<<"Yes"<<endl;
    else
    cout<<"No"<<endl;
 //getch();
    return 0;
}

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

#include<iostream>
#include<variant>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<stack>
#include<queue>
#include<climits>
#include<set>

using namespace std;

int main() {
	int x, y, n;
	int cnt = 0, y = 0;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> x >> y;
		if (x == y)cnt++;
		else cnt = 0;
		if (cnt >= 3)y = 1;
	}
	if (y)cout << "Yes";
	else cout << "No";
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:16:22: error: redeclaration of 'int y'
   16 |         int cnt = 0, y = 0;
      |                      ^
a.cc:15:16: note: 'int y' previously declared here
   15 |         int x, y, n;
      |                ^
Language: C++

#include <bits/stdc++.h>

using namespace std;
int D1[111], D2[111], N;

int main(){
    cin>>N;
    for (int i=0; i<N; i++){
        cin>>D1[i]>>D2[i];
        if (i>=2){
            if (D1[i]-D2[i]==0&&D1[i-1]-D2[i-1]&&D1[i-2]-D2[i-2]==0){
                cout<<"Yes";
                return ;
            }
        }
    }
    cout<<"No";
}


Compiler output:
a.cc: In function 'int main()':
a.cc:13:17: error: return-statement with no value, in function returning 'int' [-fpermissive]
   13 |                 return ;
      |                 ^~~~~~
Language: C++

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

#define LL long long int
#define rep(k, n) for(LL i=k;i<n;++i)

int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
  int n; cin>>n;
  int a, b;
  count =0;
  while(n--){
    cin>> a>> b;
    if(a==b) count++;
    else count =0;
    
    if(count>= 3)break;
  }
  if(count >= 3) cout<< "YES"<< endl;
  else cout<< "NO"<< endl;
  
}

Compiler output:
a.cc: In function 'int main()':
a.cc:14:10: error: overloaded function with no contextual type information
   14 |   count =0;
      |          ^
a.cc:17:19: error: no post-increment operator for type
   17 |     if(a==b) count++;
      |                   ^~
a.cc:18:17: error: overloaded function with no contextual type information
   18 |     else count =0;
      |                 ^
a.cc:20:13: error: invalid operands of types '<unresolved overloaded function type>' and 'int' to binary 'operator>='
   20 |     if(count>= 3)break;
      |        ~~~~~^~~~
a.cc:22:12: error: invalid operands of types '<unresolved overloaded function type>' and 'int' to binary 'operator>='
   22 |   if(count >= 3) cout<< "YES"<< endl;
      |      ~~~~~~^~~~
Language: C++

/***********************************************************
	When you are inspired by passion 
	and you want to live for the current moment

	When your every thought and action
	has the power to become the story of your future

	When difficulties stand to demolish your Glory
	Just remember that Life is a 'Golden adverse Story'

	Withstand it to acheive your passion and dreams
	more amazingly more easily.

	Why then? When writing the story of your Life
	You want to Let someone else hold your pen

					huzaifa242©

***********************************************************/
#include "bits/stdc++.h"
using namespace std;
#define int int32_t
#define MAX 100005
#define x first 
#define y second

int seed;
mt19937 rng(seed=chrono::steady_clock::now().time_since_epoch().count());
inline int rnd(int l = 0, int r = numeric_limits <int>::max())
{return uniform_int_distribution<int> (l, r)(rng);}

template <typename T, typename G>
ostream& operator << (ostream& out, const pair <T, G> &a) 
{return out << "( " << a.x << ", " << a.y << ")";}

template <typename T>
ostream& operator << (ostream& out, const vector <T> &a) 
{out << "[ "; for(const auto &i: a) out << i << ", "; return out << "]" << endl;}

template <typename T>
ostream& operator << (ostream& out, const set <T> &a) 
{out << "{ "; for(const auto &i: a) out << i << ", "; return out << "}" << endl;}

template <typename T, typename G>
ostream& operator << (ostream& out, const map <T, G> &a) 
{out << "< "; for(const auto &i: a) out << i << ", "; return out << ">" << endl;}

template <typename T, size_t N>
typename enable_if<!is_same <typename remove_cv <T>::type, char>::value,
ostream&>::type operator << (ostream& out, T (&a)[N])
{out << "[ "; for(const auto &i: a) out << i << ", "; return out << "]" << endl;}

void debug_out(){cerr << endl;} 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T)
{cerr << (H) << ' '; debug_out(T...);}
 
#ifdef LOCAL
#define debug(...) cerr << '#' << #__VA_ARGS__ << ":\n", debug_out(__VA_ARGS__)
#else
#define debug(...) 24
#endif

signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	int n;
	cin >> n;
	vector <pair <int,int> > a(n);
	for (int i = 0; i < n; ++i) 
		cin >> a[i].x >> a[i].y;
	for (int i = 0; i < n - 2; ++i) {
		bool ok = true;
		for (int j = 0; j < 3; ++j) {
			ok &= (a[i + j].x == a[i + j].y) 
		}
		if (ok) {
			cout << "Yes\n";
			exit(0);
		} 
	}
	cout << "No\n";
	return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:75:57: error: expected ';' before '}' token
   75 |                         ok &= (a[i + j].x == a[i + j].y)
      |                                                         ^
      |                                                         ;
   76 |                 }
      |                 ~
Language: C++

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

typedef long long ll;

const string YES = "Yes";
const string NO = "No";

void solve(long long N, std::vector<std::vector<long long>> D){
  ll dc = 0;
  ll mdc = 0;
  for (ll i = 0; i < N; ++i) {
    if (D[i][0] == D[i][1]) {
      dc++;
    } else {
      dc = 0;
    }
    mdc = max(mdc, dc);
  }
  cout << (mdc >= 3 ? YES : NO) << endl;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long N;
  std::cin >> N;
  std::vector<std::vector<long long>> D(N, std::vector<long long>(2));
  for(int i = 0 ; i < N ; i++){
    for(int j = 0 ; j < 2 ; j++){
      std::cin >> D[i][j];
    }
  }
  solve(N, std::move(D));
  return 0;
}


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

#include<bits/stdc++.h>
#define int long long int
const int mod=1e9+7;
#define fastinout     ios_base::sync_with_stdio(false); cin.tie(NULL);

using namespace std;
int power(int x, int y, int p)
{
    int res = 1;
    x = x % p;
    while (y > 0)
    {
        if (y & 1)
            res = (res * x) % p;
        y = y >> 1;
        x = (x * x) % p;
    }
    return res;
}
int imod(int a, int m)
{
    return power(a, m - 2, m);
}

void myfun()
{
	int n,i,a,b;
	cin>>n;
	vector<int>arr;
	for(i=0;i<n;i++)
	{
		cin>>a>>b;
		if(a==b)
		arr.push_back(i);
	}
	n=arr.size();
	int cn=0;
	for(i=1;i<n;i++)
	{
		if(arr[i]==(arr[i-1]+1))
		cn++;
		else
		cn=0;
		if(cn==2)
		break;
	}
	if(i==n)
	cout<<"No\n";
	else
	cout<<"Yes\n";
}

Compiler output:
/usr/bin/ld: /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/Scrt1.o: in function `_start':
(.text+0x17): undefined reference to `main'
collect2: error: ld returned 1 exit status
Language: C++

#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
	ll n;
	cin>>n;
	vector< pair<ll,ll> > vec;
	for(ll i=0;i<n;i++){
		ll a,b;
		cin>>a>>b;
		vec.push_back({a,b});
	}

	bool bb=0;
	for(ll i=0;i<n-2;i++){
		if(vec[i][0]==vec[i][1]&&vec[i+1][0]==vec[i+1][1]&&vec[i+2][0]==vec[i+2][1]) bb=1;
	}
	if(bb) cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
	
}

Compiler output:
a.cc: In function 'int main()':
a.cc:17:26: error: no match for 'operator[]' (operand types are '__gnu_cxx::__alloc_traits<std::allocator<std::pair<long long int, long long int> >, std::pair<long long int, long long int> >::value_type' {aka 'std::pair<long long int, long long int>'} and 'int')
   17 |                 if(vec[i][0]==vec[i][1]&&vec[i+1][0]==vec[i+1][1]&&vec[i+2][0]==vec[i+2][1]) bb=1;
      |                          ^
a.cc:17:37: error: no match for 'operator[]' (operand types are '__gnu_cxx::__alloc_traits<std::allocator<std::pair<long long int, long long int> >, std::pair<long long int, long long int> >::value_type' {aka 'std::pair<long long int, long long int>'} and 'int')
   17 |                 if(vec[i][0]==vec[i][1]&&vec[i+1][0]==vec[i+1][1]&&vec[i+2][0]==vec[i+2][1]) bb=1;
      |                                     ^
a.cc:17:50: error: no match for 'operator[]' (operand types are '__gnu_cxx::__alloc_traits<std::allocator<std::pair<long long int, long long int> >, std::pair<long long int, long long int> >::value_type' {aka 'std::pair<long long int, long long int>'} and 'int')
   17 |                 if(vec[i][0]==vec[i][1]&&vec[i+1][0]==vec[i+1][1]&&vec[i+2][0]==vec[i+2][1]) bb=1;
      |                                                  ^
a.cc:17:63: error: no match for 'operator[]' (operand types are '__gnu_cxx::__alloc_traits<std::allocator<std::pair<long long int, long long int> >, std::pair<long long int, long long int> >::value_type' {aka 'std::pair<long long int, long long int>'} and 'int')
   17 |                 if(vec[i][0]==vec[i][1]&&vec[i+1][0]==vec[i+1][1]&&vec[i+2][0]==vec[i+2][1]) bb=1;
      |                                                               ^
a.cc:17:76: error: no match for 'operator[]' (operand types are '__gnu_cxx::__alloc_traits<std::allocator<std::pair<long long int, long long int> >, std::pair<long long int, long long int> >::value_type' {aka 'std::pair<long long int, long long int>'} and 'int')
   17 |                 if(vec[i][0]==vec[i][1]&&vec[i+1][0]==vec[i+1][1]&&vec[i+2][0]==vec[i+2][1]) bb=1;
      |                                                                            ^
a.cc:17:89: error: no match for 'operator[]' (operand types are '__gnu_cxx::__alloc_traits<std::allocator<std::pair<long long int, long long int> >, std::pair<long long int, long long int> >::value_type' {aka 'std::pair<long long int, long long int>'} and 'int')
   17 |                 if(vec[i][0]==vec[i][1]&&vec[i+1][0]==vec[i+1][1]&&vec[i+2][0]==vec[i+2][1]) bb=1;
      |                                                                                         ^
Language: C++

import java.util.*;
public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		// 整数の入力
		int a = sc.nextInt();
		int b = 0;
		boolean c = false;
		// 文字列の入力
		int[] d = new int[a];
		int[] e = new int[a];
		for(int i = 0; i < a; i++){
			d[i] = sc.nextInt();
			e[i] = sc.nextInt();
			if(d[i] == e[i]){
				b++;
				if(b == 3){
					c = true;
				}
			}else{
				b = 0;
			}
		}
		if(c){
			System.out.println("Yes");
		}else{
			System.out.println("No");
		} 
		
		
	}
}

Compiler output:
a.cc:1:1: error: 'import' does not name a type
    1 | import java.util.*;
      | ^~~~~~
a.cc:1:1: note: C++20 'import' only available with '-fmodules-ts'
a.cc:2:1: error: expected unqualified-id before 'public'
    2 | public class Main {
      | ^~~~~~
Language: C++

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 
#include <functional>
using namespace __gnu_pbds;  
using namespace std;

typedef tree<long long, null_type, less<long long>, rb_tree_tag, 
             tree_order_statistics_node_update> 
    new_data_set; 
//defines
typedef long long ll;
typedef long double ld;

ll a,b,c,n,m,k;

ll t=1;

void solve()
{
   cin>>n;
   vector<pair<ll,ll>>v(n);
   for(ll i=0;i<n;i++)cin>>v[i].first>>v[i].second;
   for(ll i=0;i<=n-3;i++)
   {
       if(v[i].first==v[i].second and v[i+1].first==v[i+1].second and v[i+2].first==v[i+2].second)
       {f=1;break;}
   }
   cout<<((f==1)?"Yes":"No");
 if(t>0)cout<<"\n";
}

int32_t main()
{
#ifdef ONPC
    freopen("input.txt", "r", stdin);
#endif
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    
   //cin>>t;
    while(t--)
    {
        solve();
    }
  //cout<<sum;
        
    return 0;
}

Compiler output:
a.cc: In function 'void solve()':
a.cc:27:9: error: 'f' was not declared in this scope
   27 |        {f=1;break;}
      |         ^
a.cc:29:12: error: 'f' was not declared in this scope
   29 |    cout<<((f==1)?"Yes":"No");
      |            ^
Language: C++

#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
	ll n;
	cin>>>n;
	vector< pair<ll,ll> > vec;
	for(ll i=0;i<n;i++){
		ll a,b;
		cin>>a>>b;
		vec.push_back({a,b});
	}

	bool bb=0;
	for(ll i=0;i<n-2;i++){
		if(vec[i][0]==vec[i][1]&&vec[i+1][0]==vec[i+1][1]&&vec[i+2][0]==vec[i+2][1]) bb=1;
	}
	if(bb) cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
	
}

Compiler output:
a.cc: In function 'int main()':
a.cc:7:14: error: expected primary-expression before '>' token
    7 |         cin>>>n;
      |              ^
a.cc:17:26: error: no match for 'operator[]' (operand types are '__gnu_cxx::__alloc_traits<std::allocator<std::pair<long long int, long long int> >, std::pair<long long int, long long int> >::value_type' {aka 'std::pair<long long int, long long int>'} and 'int')
   17 |                 if(vec[i][0]==vec[i][1]&&vec[i+1][0]==vec[i+1][1]&&vec[i+2][0]==vec[i+2][1]) bb=1;
      |                          ^
a.cc:17:37: error: no match for 'operator[]' (operand types are '__gnu_cxx::__alloc_traits<std::allocator<std::pair<long long int, long long int> >, std::pair<long long int, long long int> >::value_type' {aka 'std::pair<long long int, long long int>'} and 'int')
   17 |                 if(vec[i][0]==vec[i][1]&&vec[i+1][0]==vec[i+1][1]&&vec[i+2][0]==vec[i+2][1]) bb=1;
      |                                     ^
a.cc:17:50: error: no match for 'operator[]' (operand types are '__gnu_cxx::__alloc_traits<std::allocator<std::pair<long long int, long long int> >, std::pair<long long int, long long int> >::value_type' {aka 'std::pair<long long int, long long int>'} and 'int')
   17 |                 if(vec[i][0]==vec[i][1]&&vec[i+1][0]==vec[i+1][1]&&vec[i+2][0]==vec[i+2][1]) bb=1;
      |                                                  ^
a.cc:17:63: error: no match for 'operator[]' (operand types are '__gnu_cxx::__alloc_traits<std::allocator<std::pair<long long int, long long int> >, std::pair<long long int, long long int> >::value_type' {aka 'std::pair<long long int, long long int>'} and 'int')
   17 |                 if(vec[i][0]==vec[i][1]&&vec[i+1][0]==vec[i+1][1]&&vec[i+2][0]==vec[i+2][1]) bb=1;
      |                                                               ^
a.cc:17:76: error: no match for 'operator[]' (operand types are '__gnu_cxx::__alloc_traits<std::allocator<std::pair<long long int, long long int> >, std::pair<long long int, long long int> >::value_type' {aka 'std::pair<long long int, long long int>'} and 'int')
   17 |                 if(vec[i][0]==vec[i][1]&&vec[i+1][0]==vec[i+1][1]&&vec[i+2][0]==vec[i+2][1]) bb=1;
      |                                                                            ^
a.cc:17:89: error: no match for 'operator[]' (operand types are '__gnu_cxx::__alloc_traits<std::allocator<std::pair<long long int, long long int> >, std::pair<long long int, long long int> >::value_type' {aka 'std::pair<long long int, long long int>'} and 'int')
   17 |                 if(vec[i][0]==vec[i][1]&&vec[i+1][0]==vec[i+1][1]&&vec[i+2][0]==vec[i+2][1]) bb=1;
      |                                                                                         ^
Language: C++

#include <bits/stdc++.h>
using namespace std;
int main(){
    int N;
    cin >> N;
    vector<int> D1(N),D2(N);
    for(int i=0;i<N;i++) cin >> D1.at(i) >> D2.at(i);
    int count = 0;
    for(int i=0;i<N;i++){
        if(D1.at(i)==D2.at(i)) count++;
        else count = 0;
        if(count==3) break;
    }
    if(count==3) cout << "Yes" << endl;
    else cout << "No" << endl;
    

Compiler output:
a.cc: In function 'int main()':
a.cc:15:31: error: expected '}' at end of input
   15 |     else cout << "No" << endl;
      |                               ^
a.cc:3:11: note: to match this '{'
    3 | int main(){
      |           ^
Language: C++

//
#include <atcoder/fenwicktree>
#include <atcoder/segtree>
#include <atcoder/lazysegtree>
#include <atcoder/string>
#include <atcoder/math>
#include <atcoder/convolution>
#include <atcoder/modint>
#include <atcoder/dsu>
#include <atcoder/maxflow>
#include <atcoder/mincostflow>
#include <atcoder/scc>
#include <atcoder/twosat>
//
#include <vector>
#include <set>
#include <map>
#include <array>
#include <iostream>
#include <cstdio>
#include <cstdint>
#include <algorithm>
#include <numeric>
#include <bitset>
#include <iomanip>
//
using ll = long long;
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
#define outD(fpv) cout << setprecision(20) << fpv << endl;
inline void yes(bool cond) { cond ? puts("Yes") : puts("No"); }
inline void YES(bool cond) { cond ? puts("YES") : puts("NO"); }
template<typename Type> inline void chmin(Type& a, Type b) { if (a > b) a = b; }
template<typename Type> inline void chmax(Type& a, Type b) { if (a < b) a = b; }
template<typename Arr, typename Type> inline void fill(Arr& arr, Type v) { std::fill(arr.begin(), arr.end(), v); }
template<typename Type> inline void sort(Type& arr) { std::sort(arr.begin(), arr.end()); }
template<typename Type> inline void reverse(Type& arr) { reverse(arr.begin(), arr.end()); }
template<typename Type> inline Type nth(vector<Type>& arr, size_t pos) { std::nth_element(arr.begin(), arr.begin() + pos, arr.end()); return arr[pos]; }
template<typename Type> inline void unique(Type& arr) { sort(arr); arr.erase(unique(arr.begin(), arr.end()), arr.end()); }
constexpr ll INF_I = std::numeric_limits<ll>::max();
constexpr ll BIGP = 1000000007L;
constexpr double INF_F = std::numeric_limits<float>::infinity();
constexpr double PI = 3.14159265358979323846L;
using P = pair<ll, ll>;
//
int main()
{
    cin.tie(0); ios::sync_with_stdio(false);
    ll N;
    cin >> N;
    bool state[3] = {};
    bool valid = false;
    rep(i, N)
    {
        //
        state[0] = state[1];
        state[1] = state[2];
        //
        ll D1, D2;
        cin >> D1 >> D2;
        state[2] = (D1 == D2);
        //
        if (state[0] && state[1] && state[2])
        {
            valid = true;
        }
    }
    yes(valid);
    return 0;
}

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

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <queue>
#include <climits>


int main(){
  long N;
  std::cin >> N;
  long D[100+1][2];
  
  for(long i=1; i<=N; i++){
    std::cin >> D[i][0] >> D[i][1];
  }

  long len=0;
  bool flag=0;
  for(long i=1; i<=N; i++){
    if(D[i][0]==D[i][1]){
      len++;
      if(len>=3){
        flag=1;
        break;
      }
    }else{
      len=0;
    }
  }
  if(flag){
    std::cout << "Yes" << std::endl;
  }else{
    std::cout << "No" << std::endl;
  }
  return 0;
}

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

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

#define ll long long int
#define pb push_back
#define f(i,x,y) for(i=x;i<y;i++)
#define vll vector<ll>
#define fast    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl

void solve()
{
    ll n;
    cin>>n;
    vector<pair<ll,ll>> v(n);
    f(i,0,n)
    {
        cin>>v[i].first>>v[i].second;
    }
    ll f=0;
    f(i,0,n-2)
    {
        if(v[i].first==v[i].second && v[i+1].first==v[i+1].second && v[i+2].first==v[i+2].second)
        {
            cout<<"Yes"<<endl;
            return ;
        }
    }
    cout<<"No"<<endl;

}

int main()
{
    fast;
    ll t=1;
    //cin>>t;
    while(t--)
        solve();
    return 0;
}

Compiler output:
a.cc: In function 'void solve()':
a.cc:17:7: error: 'i' was not declared in this scope
   17 |     f(i,0,n)
      |       ^
a.cc:6:22: note: in definition of macro 'f'
    6 | #define f(i,x,y) for(i=x;i<y;i++)
      |                      ^
a.cc:22:7: error: 'i' was not declared in this scope
   22 |     f(i,0,n-2)
      |       ^
a.cc:6:22: note: in definition of macro 'f'
    6 | #define f(i,x,y) for(i=x;i<y;i++)
      |                      ^
Language: C++

#include <iostream>
using namespace std;

int main() {
	int n;
	int count=0;
	cin>>n;
	for(int i=0;i<n;i++){
		int x,y;
		cin>>x>>y;
		if(x==y){
			count++;
		}
	}
	if(count>=3){
		cout<<"Yes"<<endl;
	}
	else{
		cout<<"No"<<Endl;
		
	}
	
}

Compiler output:
a.cc: In function 'int main()':
a.cc:19:29: error: 'Endl' was not declared in this scope
   19 |                 cout<<"No"<<Endl;
      |                             ^~~~
Language: C++

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

int main()
  
{
 ll n,p=0,i;cin>>n,d=0;
  for(i=0;i<n;i++){
    ll a,b;
    cin>>a>>b;
    if(a==b)
      p++;
    else
      p=0;
    if(p==3)
      d=1;
  }
  if(d==1)
    cout<<"Yes"<<Endl;
  else
    cout<<"No"<<endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:8:20: error: 'd' was not declared in this scope
    8 |  ll n,p=0,i;cin>>n,d=0;
      |                    ^
a.cc:20:18: error: 'Endl' was not declared in this scope
   20 |     cout<<"Yes"<<Endl;
      |                  ^~~~
Language: C++

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

int main(){
  int N;cin>>N;
  vector<bool> A(N);
  for(int i=0;i<N;i++){
    int S,T;cin>>S>>T;
    if(S==T) A.at(i)=true;
    else A.at(i)=false;
  }
  bool can=false;
  for(int i=2;i<N;i++){
    if(A.at(i) && A.at(i-1) %% A.at(i-2)){
      can=true;
      break;
    }
  }
  cout<<(can?"Yes":"No")<<endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:14:30: error: expected primary-expression before '%' token
   14 |     if(A.at(i) && A.at(i-1) %% A.at(i-2)){
      |                              ^
Language: C++

#include<bits/stdc++.h>

using namespace std;

#define int long long
#define ll long long
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define endl '\n'
#define Endl '\n'
#define cont continue
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a*b/__gcd(a,b)
#define pb push_back
#define mp make_pair
#define mem(x) memset(x, 0, sizeof(x))

const ll inf=1e18;
const int mod=1e9+7;
inline int bigmod(int B,int P){int R=1;while(P>0){if(P&1){R=(R*B)%mod;}P>>=1;B=(B*B)%mod;}return R;}
const int mxn = 2e5+10;

int Mod(int a) {
	return (a+mod)%mod;
}
int Mul(int a, int b) {
	return Mod(Mod(a) * Mod(b));
}
int Add(int a, int b) {
	return Mod(Mod(a) + Mod(b));
}
//ll fact[mxn];
//ll in_fact[mxn];
//fact[0] = 1;
//for(ll i = 1; i < mxn; i++) {
	//fact[i] = (i*fact[i-1])%mod;
//}
//in_fact[mxn-1] = bigmod(fact[mxn-1],mod-2);
//for(ll i = mxn-2; i >= 0; i--) {
	//in_fact[i] = (in_fact[i+1] * (i+1))%mod;
//}
//ll c(ll n,ll r) {
	//ll ans = (fact[n] * (in_fact[r] * in_fact[n-r]%mod))%mod;
	//return ans;
//}


signed main(){
    fast;
	//freopen ("input.txt", "r", stdin);
	//freopen ("output.txt", "w", stdout);
    int tt = 1;
    cin>>tt;
    for(int tc = 1; tc <= tt; tc++) {
        int n;
        cin>>n;
        int a[n],b[n];
        for(int i = 0; i < n; i++) {
			cin>>a[i]>>b[i];
		}
		for(int i = 0; i < n-2; i++) {
			if(a[i] == b[i] && a[i+1] == b[i+1] && a[i+2] == b[i+2) {
				cout<<"YES";
				return 0;
			}
		}
		cout<<"NO";
			
        
        
    }



return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:61:79: error: expected ']' before ')' token
   61 |                         if(a[i] == b[i] && a[i+1] == b[i+1] && a[i+2] == b[i+2) {
      |                                                                               ^
      |                                                                               ]
Language: C++

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

using namespace std;
using namespace atcoder;

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;
}

typedef long long ll;
typedef unsigned long long ull;

int main() {
    int n;
    cin >> n;
    int cnt = 0;
    bool yes = false;
    for (int i = 0; i < n; i++) {
        int a, b;
        cin >> a >> b;
        if (a == b) {
            cnt++;
        }
        else {
            cnt = 0;
        }
        if (cnt == 3) {
            yes = true;
        }
    }
    if (yes) {
        cout << "Yes" << endl;
    }
    else {
        cout << "No" << endl;
    }
    return 0;
}

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

#include <bits/stdc++.h>
using namespace std;
#define INF 0x7fffffff
typedef long long ll;
typedef long double ld;

typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<double> vd;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<ld> vld;

#define fastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define beg(x) x.begin()
#define en(x) x.end()

const int mod = 1e9 + 7;
int block;

int main()
{
	fastIO;

	int n; cin >> n;
	int cnt = 0;
	for(int i = 0; i < n; i++) 
	{
		cin >> d[i][0] >> d[i][1];
		cnt = d[i][0] == d[i][1]? cnt + 1 : 0;
		if(cnt == 3) 
		{
			cout << "Yes" << endl;
			return 0;
		}
	}
	cout << "No" << endl;

	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:37:24: error: 'd' was not declared in this scope
   37 |                 cin >> d[i][0] >> d[i][1];
      |                        ^
Language: C++

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

#define rep(i, a, b) for(int i=a; i<=b; i++)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int) x.size()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int MOD = 1e9+7;

int a, b, cnt;

int main(){
  // freopen("input.txt", "r", stdin); 
  // freopen("output.txt", "w", stdout);
  cin.sync_with_stdio(0); cin.tie();
  cin.exceptions(cin.failbit);

  cin >> n;
  rep(i, 1, n){
    cin >> a >> b;
    if(a==b) cnt++;
  }
  cout << (cnt>=3? "Yes":"No");
}

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

#include <bits/stdc++.h>
#define int long long int
#define endl "\n"
#define mod 1000000007
#define ps(x,noOfDecimal) fixed<<setprecision(noOfDecimal)<<x
#define IO if(fopen("input.txt", "r")){freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);} std::ios::sync_with_stdio(false);
using namespace std;


signed main()
{

    IO
    int t = 1;
    // cin >> t;
    while (t--) {


        int n;
        cin >> n;
        int ans = 0;
        for (int i = 0; i < n; i++) {
            int a,b;
            cin>>a>>b;
            if(a == b) cnt++;
            else cnt = 0;

            if(cnt >= 3){
                ans = 1;
            }
        }

        if(ans == 1){
            cout<<"Yes\n";
        }else{
            cout<<"No\n";
        }

    }


    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:25:24: error: 'cnt' was not declared in this scope; did you mean 'int'?
   25 |             if(a == b) cnt++;
      |                        ^~~
      |                        int
a.cc:26:18: error: 'cnt' was not declared in this scope; did you mean 'int'?
   26 |             else cnt = 0;
      |                  ^~~
      |                  int
a.cc:28:16: error: 'cnt' was not declared in this scope; did you mean 'int'?
   28 |             if(cnt >= 3){
      |                ^~~
      |                int
Language: C++

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int MOD = 1e9+7;
using ll = long long;
using vi = vector<int>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) x.begin(), x.end()
int main() {
  int a,b,c,ans=0,tmp=0;
  cin >> a;
  rep(i,a){
    cin >> b >> c;
    if(b==c){
      tmp++;
    }
    else {
     ans = max(ans,tmp);
     tmp = 0;
  }
  if(ans>=3) cout << "Yes";
  else cout << "No";
}


Compiler output:
a.cc: In function 'int main()':
a.cc:24:2: error: expected '}' at end of input
   24 | }
      |  ^
a.cc:10:12: note: to match this '{'
   10 | int main() {
      |            ^
Language: C++

#include < bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define repl(i,l,r) for(int i=l;i<r;i++)
using ll = long long;
const int inf=2e9+10;
const ll MOD=1e9+7;
const ll INF=9e18+10;
const int dx[]={1,0,-1,0};
const int dy[]={0,1,0,-1};

int main(){
        int n;cin>>n;
        int cnt=0;
        rep(i,n){
                int x,y;cin>>x>>y;
                if(x==y)cnt++;
                else cnt=0;
                if(cnt==3){
                        cout<<"Yes\n";
                        return 0;
                }
        }
        cout<<"No"<<endl;
        return 0;
}

Compiler output:
a.cc: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;

#define MOD (1000000000+7)
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define nl '\n'
#define all(x) x.begin(), x.end()
#define print(vec,l,r) for(int i = l; i <= r; i++) cout << vec[i] <<" "; cout << endl;
#define forf(i,a,b) for(int i = (a); i < (b); i++)
#define forr(i,a,b) for(int i = (a); i > (b); i--)
#define input(vec,N) for(int i = 0; i < (N); i++) cin >> vec[i];
#define debug(x) cerr << #x << " = " << (x) << endl;

// template starts
typedef long long int ll;

// template ends here

void solve(){
	// code starts from here
	int n;
	cin >> n;
	vector<pair<int,int>> vec(n);
	for(int i = 0; i < N; i++) cin >> vec[i].first >> vec[i].second;
	
	bool ok = false;
	for(int i = 0; i+2 < N; i++){
		if(vec[i].first == vec[i].second && vec[i+1].first == vec[i+1].second && vec[i+2].first == vec[i+2].second) ok = true;
	}
	if(ok) cout << "Yes" << endl;
	else cout << "No" << endl;
}

clock_t startTime;
double getCurrentTime() {
	return (double)(clock() - startTime) / CLOCKS_PER_SEC;
}

int main(){
 	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
	//startTime = clock();
	
	int T;
	//cin >> T;
	T = 1;
	while(T--){
		solve();
	}
	
	//cout << getCurrentTime() << endl;
	return 0;
}


Compiler output:
a.cc: In function 'void solve()':
a.cc:25:28: error: 'N' was not declared in this scope
   25 |         for(int i = 0; i < N; i++) cin >> vec[i].first >> vec[i].second;
      |                            ^
a.cc:28:30: error: 'N' was not declared in this scope
   28 |         for(int i = 0; i+2 < N; i++){
      |                              ^
Language: C++

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double PI = 4*atan(1);
const int INF = 0x3f3f3f3f;
const int MOD = 1e9+7;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const double EPS = 1e-9;
const string YES = "Possible";
const string NO = "Impossible";
#define pb push_back
#define mp make_pair
#define eb emplace_back

const int MAX_N = 2e6+10;
int N;
int d1[MAX_N],d2[MAX_N];

void solve()
{
	for(int i=2;i<N;++i){
		if(d1[i]==d2[i]&&d1[i-1]==d2[i-1]&&d1[i-2]==d2[i-2]){
			cout<<"Yes\n";
			return;
		}
	}
	return "No\n";
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> N;
	for(int i=0;i<N;++i){
		cin >>d1[i]>>d2[i];
	}
	solve();
	return 0;
}

Compiler output:
a.cc: In function 'void solve()':
a.cc:28:16: error: return-statement with a value, in function returning 'void' [-fpermissive]
   28 |         return "No\n";
      |                ^~~~~~
Language: C++

#include <bits/stdc++.h>

using namespace std;

const int mod = 1e9 + 7;
const int INF = 1e6;

long long add(long long a, long long b) {
    long long res = a + b;
    if (res >= mod) res -= mod;
    return res;
}

long long sub(long long a, long long b) {
    long long res = a - b + mod;
    if (res >= mod) res -= mod;
    return res;
}

long long mul(long long a, long long b) {
    return (((a % mod) * (b % mod)) % mod);
}

long long potolok(long long a, long long b){   // округление вверх для целых
    return (a + b - 1) / b;
}


long long gcd(long long x, long long y){
    if(y == 0){
        return x;
    }
    if(x > y){
         return gcd(y, x % y);
    }
    else{
         return gcd(x, y % x);
    }
}

bool cmpr(int x, int y){            // сортировка по абсолютной величине
    if(abs(x) < abs(y)) return true;
    else{
        return false;
    }
}

bool comp(pair<int, int> x, pair<int, int> y){  // сортировка по первой компоненте
    if(x.first < y.first)return true;
    else if(x.first == y.first){
        if(x.second < y.second)return true;
        else return false;
    }
    else{
        return false;
    }
}

int cnt(string &s, string &p, int m, int n){
    if((m == 0 && n == 0) || n == 0){
        return 1;
    }
    if(m == 0){
        return 0;
    }
    if(s[m - 1] == p[n - 1]){
        return cnt(s, p, m - 1, n - 1) + cnt(s, p, m - 1, n);
    }
    else{
        return cnt(s, p, m - 1, n);
    }
}

int main(){
    int n;
    cin >> n;
    int j = 0;
    for(int i = 0;i < n;i++){
        int x, y;
        cin >> x >> y;
        if(x == y){
            j++;
            if(j == 3){
                cout << "Yes" <<endl;
                return;
            }
        }
    }
    cout << "No" <<endl;
 }


Compiler output:
a.cc: In function 'int main()':
a.cc:85:17: error: return-statement with no value, in function returning 'int' [-fpermissive]
   85 |                 return;
      |                 ^~~~~~
Language: C++


#include<bits/stdc++.h>
using namespace std;
 
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define f0(i,a,b) for(int i=a;i<b;i++)
#define f1(i,a,b) for(int i=a;i<=b;i++)
#define f2(i,a,b) for(int i=a;i>b;i--)
#define f3(i,a,b) for(int i=a;i>=b;i--)
#define all(a) a.begin(),a.end()
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define int long long
#define fi first
#define se second
#define mod 1000000007
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define test int t;cin>>t;while(t--)

signed main(){
    fast
string s="No";
 int n;
 cin>>n;int x=0;
 f0(i,0,n)
 {
     int a,b;
     cin>>a>>b;
     if(a==b)c++;
     else c--;
     if(c==3)s="Yes";
 }cout<<s;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:32:14: error: 'c' was not declared in this scope
   32 |      if(a==b)c++;
      |              ^
a.cc:33:11: error: 'c' was not declared in this scope
   33 |      else c--;
      |           ^
a.cc:34:9: error: 'c' was not declared in this scope
   34 |      if(c==3)s="Yes";
      |         ^
Language: C++

#include <bits/stdc++.h>  
#define lli long long 
using namespace std; 
long long mod2=1e9+7,mod=998244353;
lli power(lli x, lli y,lli m=mod) 
{
    lli res = 1;  
   
    while (y > 0) 
    { 
        if (y & 1) 
            res = (res*x)%m; 
        y = y>>1; 
        x = (x*x)%m;  
    }
    if(res<0)
       res+=m; 
    return res; 
}
// lli fact[2000009];
// lli ncr(lli n,lli r){
//     lli ans=fact[n];
//     if(r>n)return 1;
//     if(r<0)return 0;
//     if(n<0)return 0;
//     ans=(ans*power(fact[n-r],mod-2))%mod;
//     ans=(ans*power(fact[r],mod-2))%mod;
//     return ans;
// }

int main() 
{ 
    // fact[0]=1;
    // for(int i=1;i<=2000005;i++)fact[i]=(i*fact[i-1])%mod;
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--){
        int n;cin>>n;
        int x[n],[n];
        for(int i=0;i<n;i++){
            // int x,y;cin>>
            cin>>x[i]>>y[i];
        }
        int ans=0;
        for(int i=2;i<n;i++){
            if(x[i]==y[i] && x[i-1]==y[i-1] && x[i-2]==y[i-2])ans=1;
        }
        if(ans)cout<<"Yes\n";
        else cout<<"No\n";
    }
    return 0; 
} 

Compiler output:
a.cc: In function 'int main()':
a.cc:42:18: error: expected unqualified-id before '[' token
   42 |         int x[n],[n];
      |                  ^
a.cc:45:24: error: 'y' was not declared in this scope
   45 |             cin>>x[i]>>y[i];
      |                        ^
a.cc:49:22: error: 'y' was not declared in this scope
   49 |             if(x[i]==y[i] && x[i-1]==y[i-1] && x[i-2]==y[i-2])ans=1;
      |                      ^
Language: C++

/** 
If comrades that you trust gather around you, hope can take physical form and become visible. That’s what I believe.
*/
#include <bits/stdc++.h>
using namespace std;
/**
(▀̿Ĺ̯▀̿ ̿) (ง ͠° ͟ل͜ ͡°)ง
*/
auto solve() -> void {
    int n; cin >> n;
    vector<pair<int, int>> a(n);
    int last = -1;
    int ct = 0;
    bool can = false;
    for (int i = 0; i < n; ++i) {
        cin >> a[i].first >> a[i].second;
        if (a[i].first != a[i].second) {
            ct = 0;
        } else {
            ct++;
        }
        if (ct >= 3) can = true;
    }
    if (can) cout << "Yes\n";
    else cout << "No\n":
}
auto main() -> int {
    ios_base::sync_with_stdio(false); cin.tie(0);
    int tc = 1;
    while (tc--) {
        solve();
    }
    
    return 0;
}


Compiler output:
a.cc: In function 'void solve()':
a.cc:25:24: error: expected ';' before ':' token
   25 |     else cout << "No\n":
      |                        ^
      |                        ;
Language: C++

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

int main() {
    int n, a, b;
    cin >> n;
    bool a[n] = {};
    for (int i = 0; i < n; ++i) {
        cin >> a >> b;
        a[i] = a == b;
        if (i >= 2 && a[i] && a[i-1] && a[i-2]) {
            cout << "Yes" << endl;
            return 0;
        }
    }
    cout << "No" << endl;
    return 0;
};

Compiler output:
a.cc: In function 'int main()':
a.cc:7:10: error: conflicting declaration 'bool a [n]'
    7 |     bool a[n] = {};
      |          ^
a.cc:5:12: note: previous declaration as 'int a'
    5 |     int n, a, b;
      |            ^
a.cc:10:10: error: invalid types 'int[int]' for array subscript
   10 |         a[i] = a == b;
      |          ^
a.cc:11:24: error: invalid types 'int[int]' for array subscript
   11 |         if (i >= 2 && a[i] && a[i-1] && a[i-2]) {
      |                        ^
a.cc:11:32: error: invalid types 'int[int]' for array subscript
   11 |         if (i >= 2 && a[i] && a[i-1] && a[i-2]) {
      |                                ^
a.cc:11:42: error: invalid types 'int[int]' for array subscript
   11 |         if (i >= 2 && a[i] && a[i-1] && a[i-2]) {
      |                                          ^
Language: C++

#include<bits/stdc++.h>
#include <atcoder/all>
#define ll long long int
#define rep(i,n) for(ll i=0;i<n;i++)
#define vec vector<ll>
#define mat vector<vector<ll>>

using namespace std;
using namespace atcoder;

const ll mod=1000000007;//998244353;
const ll inf=LONG_LONG_MAX;
ll dx4[4]={1,0,-1,0};
ll dy4[4]={0,-1,0,1};
ll dx8[8]={1,0,-1,1,-1,1,0,-1};
ll dy8[8]={1,1,1,0,0,-1,-1,-1};

int main(){

  ll n;
  cin >> n;
  bool ok=false;
  ll c=0;
  for(ll i=0;i<n;i++){
    ll a,b;
    cin >> a >> b;
    if(a==b)c++;
    else c=0;
    if(c==3)ok=1;
  }

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


  return 0;
}

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

#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
	int n;
	bool b=false;
	cin>>n;
	int a[n+1],b[n+1];
	cin>>a[1]>>b[1]>>a[2]>>b[2];
	for(int i=3;i<=n;i++){
		cin>>a[i]>>b[i];
		if(a[i-2]==b[i-2]&&a[i-1]==b[i-1]&&a[i]==b[i]) {
			b=true;
		}
	}
	if(b){
		cout<<"Yes";
	}
	else{
		cout<<"No";
	}

	return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:8:20: error: conflicting declaration 'long long int b [(n + 1)]'
    8 |         int a[n+1],b[n+1];
      |                    ^
a.cc:6:14: note: previous declaration as 'bool b'
    6 |         bool b=false;
      |              ^
a.cc:9:21: error: invalid types 'bool[int]' for array subscript
    9 |         cin>>a[1]>>b[1]>>a[2]>>b[2];
      |                     ^
a.cc:9:33: error: invalid types 'bool[int]' for array subscript
    9 |         cin>>a[1]>>b[1]>>a[2]>>b[2];
      |                                 ^
a.cc:11:29: error: invalid types 'bool[long long int]' for array subscript
   11 |                 cin>>a[i]>>b[i];
      |                             ^
a.cc:12:29: error: invalid types 'bool[long long int]' for array subscript
   12 |                 if(a[i-2]==b[i-2]&&a[i-1]==b[i-1]&&a[i]==b[i]) {
      |                             ^
a.cc:12:45: error: invalid types 'bool[long long int]' for array subscript
   12 |                 if(a[i-2]==b[i-2]&&a[i-1]==b[i-1]&&a[i]==b[i]) {
      |                                             ^
a.cc:12:59: error: invalid types 'bool[long long int]' for array subscript
   12 |                 if(a[i-2]==b[i-2]&&a[i-1]==b[i-1]&&a[i]==b[i]) {
      |                                                           ^
Language: C++

#include <bits/stdc++.h>

//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_poizcy.hpp>
typedef long long  ll;
#define pb                push_back
#define mp                make_pair
#define all(a)            (a).begin(), (a).end()
#define mem(a,h)          memset(a, (h), sizeof(a))
#define se second
#define fi first
#define por(a,b) (((a%MOD) * (b%MOD))%MOD)
#define forg(i, b, e, c)    for (ll i = (ll)b; i < (ll)e; i+=c)
#define forr(i, b, e)    for (ll i = b; i < e; i++)
 
 
using namespace std;
//using namespace __gnu_pbds;
typedef double lldb;
typedef pair<ll, ll>  ii;
typedef vector<int>  vi;
typedef pair<ii, ll>  iii;
typedef pair<double, double>  iidb;
//typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
const ll INF = 1e9+7;
const double PI = acos(-1);
#define initseg ll new_nodo=(nodo*2)+1,mid=(iz+der)/2;
 
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define offset 9000

const ll MOD=1e9+7;

#define cmplog 20
#define tam 600000


using namespace std;

int main()
{	
	ios::sync_with_stdio(false);cin.tie(0);
	int n,c,iz,der;
	cin>>n;
	c=0;
	forr(i,0,n)
	{
		cin>>iz>>der;
		if (iz==der)c++;
		else{
			maxx=max(maxx,c);
			c=0;
		}
	}
	maxx=max(maxx,c);
	if (maxx>=3)
		cout<<"Yes\n";
	else
		cout<<"No\n";
}


Compiler output:
a.cc: In function 'int main()':
a.cc:51:25: error: 'maxx' was not declared in this scope
   51 |                         maxx=max(maxx,c);
      |                         ^~~~
a.cc:55:9: error: 'maxx' was not declared in this scope
   55 |         maxx=max(maxx,c);
      |         ^~~~
Language: C++

#!/usr/bin/python3
#coding: utf-8

import sys

N = int(input())

zoromes = 0
for i in range(N):
    D1, D2 = (int(x) for x in input().split())
    if D1 == D2:
        zoromes += 1
        if zoromes >= 3:
            print("Yes")
            sys.exit(0)
    else:
        zoromes = 0
print("No")

Compiler output:
a.cc:1:2: error: invalid preprocessing directive #!
    1 | #!/usr/bin/python3
      |  ^
a.cc:2:2: error: invalid preprocessing directive #coding
    2 | #coding: utf-8
      |  ^~~~~~
a.cc:4:1: error: 'import' does not name a type
    4 | import sys
      | ^~~~~~
a.cc:4:1: note: C++20 'import' only available with '-fmodules-ts'