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

#include <iostream>
#include <vector>
#include "problems/printer.h"
using namespace std;

int main(){
    int n, s = 0;
    cin >> n;
    int arr[1 << n];
    for(int i = 0; i < (1 << n); i++) cin >> arr[i];
    sort(arr, arr+(1<<n), greater<int>());
    vector< pair<int,int> > a;
    a.push_back({arr[0], 1});
    for(int i = 1; i < (1 << n); i++){
        if(a[a.size()-1].first == arr[i])a[a.size()-1].second++;
        else a.push_back({arr[i], 1});
    }
    if(a[0].second > 1){
        cout << "No\n";
        return 0;
    }
    s = 1;
    for(int i = 1; i < a.size(); i++){
        if(a[i].second <= s){
            s += a[i].second;
        } else {
            cout << "No\n";
            return 0;
        }
    }
    cout << "Yes\n";
}


Compiler output:
a.cc:3:10: fatal error: problems/printer.h: No such file or directory
    3 | #include "problems/printer.h"
      |          ^~~~~~~~~~~~~~~~~~~~
compilation terminated.
Language: C++

#include "pch.h"
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define rip(i,n,s) for (int i=(s);i<(int)(n);i++)
#define all(a) (a).begin(),(a).end()
typedef long long ll;

int main() {
	int n;
	cin >> n;
	int m=1;
	rip(i, n, 0) {
		m *= 2;
	}
	vector<int> da(m);
	rip(i, m, 0) {
		cin >> da[i];
	}
	sort(all(da));
	int co = 1;
	reverse(all(da));
	bool ju = false;
	rip(i, n, 0) {
		rip (j, co , 0) {
			if (da[j] == da[co + j]) {
				ju = true;
				break;
			}
		}
		if (ju) {
			break;
		}
		co *= 2;
	}
	if (!ju) {
		cout << "Yes" << endl;
	}
	else {
		cout << "No" << endl;
	}
}

Compiler output:
a.cc:1:10: fatal error: pch.h: No such file or directory
    1 | #include "pch.h"
      |          ^~~~~~~
compilation terminated.
Language: C++

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

int main(){
  
  int N;
  std::cin >> N;
  std::vector<int> S(1<<N);
  for(int& s: S){
    std::cin >> s;
  }
  std::sort(S.begin(), S.end(), std::greater<int>());
  
  std::vector<std::pair<int, int>> R(1<<N);
  for(int i=0; i<N; i++){
    R.first = __builtin_popcount(i);
    R.second = i;
  }
  std::sort(R.begin(), R.end());
  
  
  
  for(const auto& r: R){
    int i=r.second;
    int derived_from = i & ~(1 << (31 - __builtin_clz(i)));
    if(S[i] > S[derived_from] - 1){
      std::cout << "No\n";
      return 0;
    }
  }
  std::cout << "Yes\n";
}
  

Compiler output:
a.cc: In function 'int main()':
a.cc:17:7: error: 'class std::vector<std::pair<int, int> >' has no member named 'first'
   17 |     R.first = __builtin_popcount(i);
      |       ^~~~~
a.cc:18:7: error: 'class std::vector<std::pair<int, int> >' has no member named 'second'
   18 |     R.second = i;
      |       ^~~~~~
Language: C++

#include <bits/stdc++.h>
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
int main() {
	ll n,n2,m;
	string ans="Yes";
	cin >> n;
	n1=1<<n;
	vector<ll>s(m);
	for(ll i=0;i<n1;i++) cin >> s.at(i);
	sort(s.begin(),s.end(),greater<ll>());
	for(ll i=1;i<=n;i++){
	  m=1<<(i-1);
	  for(ll j=0;j<m;j++){
			if(s.at(j)<=s.at(m+j)){
				ans="No";
			 	break;
			}
	   }
       if(ans=="No") break;
	}
	cout << ans

Compiler output:
a.cc: In function 'int main()':
a.cc:9:9: error: 'n1' was not declared in this scope; did you mean 'n2'?
    9 |         n1=1<<n;
      |         ^~
      |         n2
a.cc:23:20: error: expected ';' at end of input
   23 |         cout << ans
      |                    ^
      |                    ;
a.cc:23:20: error: expected '}' at end of input
a.cc:5:12: note: to match this '{'
    5 | int main() {
      |            ^
Language: C++

#include <iostream>
// #include <sstream>
// #include <cstdio>
// #include <cmath>
// #include <cstring>
// #include <cctype>
// #include <string>
#include <vector>
// #include <list>
// #include <set>
// #include <map>
// #include <queue>
// #include <stack>
// #include <algorithm>
// #include <functional>

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

// #include "beginner_138/beginner_138.h"
// Still dunno how to put linker 

using namespace std; 
typedef long long ll;

// Sort that saves index.
int n;
vector<int> P(n);

int secondHighest(int l, int r){

    return 0;
}


void f_sol01(){
    // Brute force
    // https://atcoder.jp/contests/abc140/submissions/7410886
    
    cin >> n;
    vector<long> S; // S[i] is the value of the health of the slimes.
    for(int i = 0; i < n*n; i++)cin >> S[i];

    
}

void f_sol02(){
    // Atcoder solution
    int n;
    cin >> n;
    int n2 = 1 << n;
    vector<int> a(n2);
    for(int i = 0; i < n2; i++)cin >> a[i];
    sort(a.begin(), a.end()); // Sort makes things easier here.
    vector<int> s;
    s.push_back(a.back());
    a.back() = -1; // Mark as -1 for value that has been used.

    for(int i = 0; i < n; i++){
        vector<int> p = s; // Create duplicate of s. The vector containing existing slimes health.
        sort(p.begin(), p.end());
        int ai = n2-1; // probably used for indexing of array with size n2-1
        while(p.size() > 0 && ai >= 0){ // Repeat until p is empty and ai finishes checking from n2-1 to 0
            if(a[ai] == -1){ // Checks if a[ai] has been used
                --ai;
                continue;
            }
            if(a[ai] < p.back()){ // if the health of slime in a is less than health of slime in p
                s.push_back(a[ai]);
                p.pop_back();
                a[ai] = -1;
            }
            --ai; // move on through a.
        }
        if(p.size() > 0){ // If p is not empty.
            puts("No");
            return;
        }
    }
    puts("Yes");
    return;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    f_sol02();
    
    
    return 0;
}

Compiler output:
a.cc: In function 'void f_sol02()':
a.cc:53:5: error: 'sort' was not declared in this scope; did you mean 'short'?
   53 |     sort(a.begin(), a.end()); // Sort makes things easier here.
      |     ^~~~
      |     short
Language: C++

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1e9+7;
const int INF=1e9;

int main(){
    int n;
    cin>>n;
    int m=1<<n;
    multiset<int> ms;
    for(int i=0;i<m;i++){
        int s;
        cin>>s;
        ms.insert(s);
    }#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1e9+7;
const int INF=1e9;

int main(){
    int n;
    cin>>n;
    int m=1<<n;
    int s[m];
    for(int i=0;i<m;i++){
        cin>>s[i];
    }
    sort(s,s+m,greater<int>());
    int t=1;
    for(int i=1;i<m;){
        for(int j=0;j<t;j++){
            if(s[j]<=s[i]){
                int it=upper_bound(s+i,s+m,s[j],greater<int>())-s;
                if(it==m){
                    cout<<"No"<<endl;
                    return 0;
                }
                else{
                    swap(s[it],s[i]);
                }
            }
            i++;
        }
        t*=2;
    }
    cout<<"Yes"<<endl;
}

    vector<int> ans;
    ans.push_back(*prev(ms.end()));
    for(int i=1;i<m;i*=2){
        for(int j=0;j<i;j++){
            auto it=ms.lower_bound(ans[j]);
            if(it==ms.begin()){
                cout<<"No"<<endl;
                return 0;
            }
            ans.push_back(*prev(it));
            ms.erase(prev(it));
        }
    }
    cout<<"Yes"<<endl;
}


Compiler output:
a.cc:16:6: error: stray '#' in program
   16 |     }#include<bits/stdc++.h>
      |      ^
a.cc: In function 'int main()':
a.cc:16:7: error: 'include' was not declared in this scope
   16 |     }#include<bits/stdc++.h>
      |       ^~~~~~~
a.cc:16:15: error: 'bits' was not declared in this scope
   16 |     }#include<bits/stdc++.h>
      |               ^~~~
a.cc:16:20: error: 'stdc' was not declared in this scope; did you mean 'std'?
   16 |     }#include<bits/stdc++.h>
      |                    ^~~~
      |                    std
a.cc:17:1: error: expected primary-expression before 'using'
   17 | using namespace std;
      | ^~~~~
a.cc:22:9: warning: empty parentheses were disambiguated as a function declaration [-Wvexing-parse]
   22 | int main(){
      |         ^~
a.cc:22:9: note: remove parentheses to default-initialize a variable
   22 | int main(){
      |         ^~
      |         --
a.cc:22:9: note: or replace parentheses with braces to value-initialize a variable
a.cc:22:11: error: a function-definition is not allowed here before '{' token
   22 | int main(){
      |           ^
Language: C++

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <set>
using namespace std;

int n;
multiset<int, greater<int>> st;
vector<int> vt;
int main() {
	int i, j, t;
	cin >> n;
	for(i=0; i<1<<n; i++) scanf("%d", &t), st.insert(t);
	vt.push_back(*st.begin());
	st.erase(st.begin());
	for(i=0; i<n; i++) {
		for(j=0; j<1<<i; j++) {
			auto x = st.upper_bound(vt[j]);
			if(x == st.end()) return puts("No"), 0;
			vt.push_back(*x);
			st.erase(x);
		}
	}
	puts("Yes");
	return 0;
}

Compiler output:
a.cc:9:1: error: 'vector' does not name a type
    9 | vector<int> vt;
      | ^~~~~~
a.cc: In function 'int main()':
a.cc:14:9: error: 'vt' was not declared in this scope; did you mean 't'?
   14 |         vt.push_back(*st.begin());
      |         ^~
      |         t
Language: C++

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> VI;
 
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
const int mod=1e9+7;

int main(){
  int n;cin>>n;
  int n0=(1<<n);
  priority_queue<P> Q;
  int s[n0];rep(i,n0)cin>>s[i];
  sort(s,s+n0,greater<int>());
  int ans[n0];int now=0;
  ans[0]=s[0];
  Q.push(P(s[0],0));
  rep(I,n){
    P t=Q.front();Q.pop();
    int d=t.second;
    int e=t.first;
    rep(i,n-d){
      if(s[++now]==e){
        cout<<"No"<<endl;exit(0);
      }
      Q.push(P(s[now],i+1+d));
    }
  }
  cout<<"Yes"<<endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:26:11: error: 'class std::priority_queue<std::pair<int, int> >' has no member named 'front'
   26 |     P t=Q.front();Q.pop();
      |           ^~~~~
Language: C++

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)




int main() {
	int N; cin >> N;
	int length = pow(2, N);
	vector<int> S(length);
	rep(i, length) cin >> S[i];
	sort(S.begin(), S.end());
	reverse(S.begin(), S.end());
	int count = 1;
	rep(i, N) {
		rep(j, count) {
			if (S[j] <= S[j + count]) {
				cout << "NO";
				return 1;
			}
		}
		count *= 2;
	}
	cout << "YES" << endl;

}

Compiler output:
a.cc: In function 'int main()':
a.cc:13:22: error: 'pow' was not declared in this scope
   13 |         int length = pow(2, N);
      |                      ^~~
Language: C++

#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define BIG 1000000010
#define EPS 1e-9
#define fst first
#define scd second

#define debug(x) cout<<x<<endl;
#define repi(i,x,n) for(int i=x;i<n;i++)
#define rep(i,n) repi(i,0,n)
#define repn(i,n) for(int i=n;i>=0;i--)
#define int long long
#define endl "\n"


int aa[200000],bb[200000],cc[2000000];
 
void t(){
  aa[0]=aa[1]=1;
  bb[0]=bb[1]=1;
  cc[1]=1;
  repi(i,2,200000){
    aa[i]=aa[i-1]*i%MOD;
    cc[i]=MOD-cc[MOD%i]*(MOD/i)%MOD;
    bb[i]=bb[i-1]*cc[i]%MOD;
  }
}
 
int calc(int n,int k){
  if(n<k) return 0;
  if(n<0 || k<0) return 0;
  return aa[n]*(bb[k]*bb[n-k]%MOD)%MOD;
}
 



signed main(){
  cin.tie(0);	
  // ios::sync_with_stdio(false);
  t();
  int n;
  cin>>n;
  int a[262155];
  int num=1;
   
  rep(i,n){
    num*=2;
  }
  rep(i,num){
    cin>>a[i];
  }
  
  sort(a,a+num);
 
  vector<int> v;
  
  int p=1;
  repn(i,num-2){
    if(a[i]==a[i+1]){
      p++;
    }else{
      v.push_back(p);
      p=1;
    }
  }
  v.push_back(p);
  
  //cout<<1<<endl;
  int now=0,prev=,check=1;
  rep(i,v.size()){
    now+=v[i];
    if(i==0 && v[i]!=1){cout<<"No"<<endl;return 0;}
    if(check<now){
      if(check<v[i]){cout<<"No"<<endl;return 0;}
      check*=2;
    }
  }
  cout<<"Yes"<<endl;
    

  return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:71:18: error: expected primary-expression before ',' token
   71 |   int now=0,prev=,check=1;
      |                  ^
a.cc:75:8: error: 'check' was not declared in this scope
   75 |     if(check<now){
      |        ^~~~~
Language: C++

/**
 * @author Finn Lidbetter
 */
import java.util.*;
import java.io.*;
import java.awt.geom.*;

public class Main {
  public static void main(String[] args) throws IOException {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringBuilder sb = new StringBuilder();
    
    int n = Integer.parseInt(br.readLine());
    TreeMap<Integer,Integer> have = new TreeMap<>(Collections.reverseOrder());
    TreeMap<Integer,Integer> toCome = new TreeMap<>();
    String[] s = br.readLine().split(" ");
    int max = 0;
    for (int i=0; i<(1<<n); i++) {
      int val = Integer.parseInt(s[i]);
      if (toCome.containsKey(val)) {
        toCome.put(val, toCome.get(val)+1);
      } else {
        toCome.put(val, 1);
      }
      if (val>max)
        max = val;
    }
    have.put(max, 1);
    if (toCome.get(max)==1) {
      toCome.remove(max);
    } else {
      toCome.put(max, toCome.get(max)-1);
    }
    
    for (int i=0; i<n; i++) {
      TreeMap<Integer, Integer> update = new TreeMap<>();
      for (int val: have.keySet()) {
        for (int j=0; j<have.get(val); j++) {
          Integer next = toCome.lowerKey(val);
          if (next==null) {
            System.out.println("No");
            return;
          }
          toCome.put(next, toCome.get(next) - 1);
          if (toCome.get(next)==0) 
            toCome.remove(next);
          if (update.containsKey(next)) {
            update.put(next, update.get(next)+1);
          } else {
            update.put(next, 1);
          }
        }
      }
      for (int val: update.keySet()) {
        if (have.containsKey(val)) {
          have.put(val, have.get(val) + update.get(val));
        } else {
          have.put(val, update.get(val));
        }
      }
    }
    System.out.println("Yes");
  }
}


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

#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <stdlib.h>
#include <math.h>


int merge(long int a1[], long int a2[], long int a1_size, long int a2_size, long int a[]);
int merge2(long int b1[], long int b2[], long int c1[], long int c2[], long int b1_size, long int b2_size, long int b[], long int c[]);
int mergeSort(long int a[], int number);
int mergeSort2(long int a[], long int b[], long int number);

int main(void)
{
	long int n, m;
	long int sum = 0;
	long int i, j;
	long int work;
	long int a[300000];
	
	scanf("%ld", &n);
	
	work = 1;
	
	for(i = 0; i < n; i++) {
		work *= 2;
	}
	
	for(i = 0; i < work; i++) {
		scanf("%ld", &a[i]);
	}
	
	mergeSort(a, n);
	
	for(i = 0; i < n; i++) {
		printf("%ld\n", a[i]);
	}
	
	for(i = work - 1; i > 0; i--) {
		if(a[i] > a[i / 2]) {
			printf("No\n");
			return 0;
		}
	}
		
	printf("Yes\n");
	
	return 0;
}

int merge(long int a1[], long int a2[], long int a1_size, long int a2_size, long int a[])
{
	int i = 0, j = 0;
	
	while( (i < a1_size ) || (j < a2_size) ){
		if( (j >= a2_size ) || ( (i < a1_size) && (a1[i] > a2[j]) ) ) {
			a[i + j] = a1[i];
			i++;
		} else {
			a[i + j] = a2[j];
			j++;
		}
	}
	
	return 0;
}

int merge2(long int b1[], long int b2[], long int c1[], long int c2[], long int b1_size, long int b2_size, long int b[], long int c[])
{
	int i = 0, j = 0;
	
	
	while( (i < b1_size ) || (j < b2_size ) ) {
		if( (j >= b2_size ) || ( (i < b1_size) && (c1[i] > c2[j]) ) ) {
			b[i + j] = b1[i];
			c[i + j] = c1[i];
			i++;
		} else {
			b[i + j] = b2[j];
			c[i + j] = c2[j];
			j++;
		}
	}
	
	return 0;
}

int mergeSort(long int a[], long int number)
{
	int m = number / 2, n = number - m;
	long int a1[m];
	long int a2[n];
	int i, j;
	
	if(number > 1) {
		for(i = 0; i < m; i++) {
			a1[i] = a[i];
		}
		for(i = 0; i < n; i++) {
			a2[i] = a[m + i];
		}
		mergeSort(a1, m);
		mergeSort(a2, n);
		merge(a1, a2, m, n, a);
	}
	
	return 0;
}

int mergeSort2(long int b[], long int c[], long int number)
{
	int m = number / 2, n = number - m;
	long int b1[m];
	long int b2[n];
	long int c1[m];
	long int c2[n];
	int i, j;
	
	if(number > 1) {
		for(i = 0; i < m; i++) {
			b1[i] = b[i];
		}
		for(i = 0; i < n; i++) {
			b2[i] = b[m + i];
		}
		
		for(i = 0; i < m; i++) {
			c1[i] = c[i];
		}
		for(i = 0; i < n; i++) {
			c2[i] = c[m + i];
		}
		
		mergeSort2(b1, c1, m);
		mergeSort2(b2, c2, n);
		merge2(b1, b2, c1, c2, m, n, b, c);
	}
	
	return 0;
}

Compiler output:
main.c:88:5: error: conflicting types for 'mergeSort'; have 'int(long int *, long int)'
   88 | int mergeSort(long int a[], long int number)
      |     ^~~~~~~~~
main.c:10:5: note: previous declaration of 'mergeSort' with type 'int(long int *, int)'
   10 | int mergeSort(long int a[], int number);
      |     ^~~~~~~~~
Language: C++

#include<iostream>
#include<algorithm>
#include<string>
#include<cstdlib>
#include<map>
#include<iomanip>
#include<sstream>
#include<vector>
#include<stack>
#include<math.h>
#include<queue>
#include<complex>
#include<random>
#include<ctime>
using namespace std;

const long long int mod=1000000007;
const long long int INF=99999999999999999;

long long int canmake[25][25]={},now2;
long long int n,k,m,a[300000],b[300000],c[300000]={},now=0,res=0,cou=1,cou2=1;
string str;
typedef pair<long long int,long long int>P;

priority_queue<P>pq;
int main() {
	cout << fixed << setprecision(10);
	cin>>n;
	for(int i=0;i<n;i++){
		cou*=2;
	}
	for(int i=0;i<=20;i++){
		canmake[0][i]=1;
	}
	for(int i=1;i<=20;i++){
		for(int j=i;j<=20;j++){
			canmake[i][j]=canmake[i][j-1]+canmake[i-1][j-1];
		}
	}
	for(int i=0;i<cou;i++){
		cin>>a[i];
	}
	sort(a,a+cou);
	now=0;
	for(int i=1;i<cou;i++){
		if(a[i]!=a[i-1]){
			c[now]=cou2;
			cou2=1;
			now++;
		}else{
			cou2++;
		}
	}
	c[now]=cou2;
	cou2=1;
	now++;
	
	for(int i=0;i<now;i++){
		
		//cout<<c[i]<<endl;
	}
	if(b[0]>1){cout<<"No"<<endl;return 0;}
	pq.push({now-1,n});
	now2=now-2;
	while(1){
		P mae =task;
		P task=pq.top();
		if(mae==task&&mae.second==0)
		//cout<<task.first<<" "<<task.second<<endl;
		pq.pop();
		for(int i=task.second-1;i>=0;i--){
			onemore:
			if(c[now2]!=0&&now2<task.first){
				pq.push({now2,i});
				c[now2]--;
			}else if(c[now2]==0){
				if(now2==0){cout<<"Yes"<<endl;return 0;}
				now2--;
				goto onemore;
			}else{
				cout<<"No"<<endl;
				return 0;
			}
		}
	}
} 


Compiler output:
a.cc: In function 'int main()':
a.cc:66:24: error: 'task' was not declared in this scope
   66 |                 P mae =task;
      |                        ^~~~
Language: C++

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

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

	int n,t;
	vector <int> v;

	cin >> n;

	for(int i=0;i<(1<<n);i++)
	{
		cin >> t;
		v.push_back(t);
	}

	sort(v.rbegin(),v.rend());

	priority_queue <int> pque;
	pque.push(v[0]);
	int l = 1;
	int r = 2;
	while(1)
	{
		//cout << l << ' ' << r << '\n';
		priority_queue <int> pque2;
		if(l>=v.size())
		{
			break;
		}
		for(int i=l;i<r;i++)
		{
			//cout << pque.top() << ' ' << v[i] << ' ' << i << '\n';
			if(pque.top()<=v[i])
			{
				cout << "No" << '\n';
				return 0;
			}
			pque2.push(pque.top());
			pque2.push(v[i]);
			pque.pop();
		}
		while(!pque2.empty())
		{
			pque.push(make_pair(pque2.top()));
			pque2.pop();
		}
		l = r;
		r = 2*r;
	}

	cout << "Yes" << '\n';
	return 0;	
}

Compiler output:
a.cc: In function 'int main()':
a.cc:49:44: error: no matching function for call to 'make_pair(const __gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type&)'
   49 |                         pque.push(make_pair(pque2.top()));
      |                                   ~~~~~~~~~^~~~~~~~~~~~~
In file included from /usr/include/c++/14/bits/stl_algobase.h:64,
                 from /usr/include/c++/14/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_pair.h:1132:5: note: candidate: 'template<class _T1, class _T2> constexpr std::pair<typename std::__strip_reference_wrapper<typename std::decay<_Tp>::type>::__type, typename std::__strip_reference_wrapper<typename std::decay<_Tp2>::type>::__type> std::make_pair(_T1&&, _T2&&)'
 1132 |     make_pair(_T1&& __x, _T2&& __y)
      |     ^~~~~~~~~
/usr/include/c++/14/bits/stl_pair.h:1132:5: note:   candidate expects 2 arguments, 1 provided
Language: C++

#pragma GCC optimize("-O3")

#include <bits/stdc++.h>
#include <random>

using namespace std;

#define ll long long
#define int long long

int pow2(int n) {
	if (n == 0) return 1;
	if (n == 1) return 2;
	int t = pow2(n / 2);
	if (t & 1)
		return t * t * 2;
	return t * t;
}

signed main() {
	int n; cin >> n;
	int m = pow2(n);
	vector<ll> s(m);
	for (int i = 0; i < n; ++i)
		cin >> s[i];

	sort(s.begin(), s.end(), greater<int>());

	if (s[0] == s[1]) {
		cout << "No" << endl;
		return 0;
	}

	if (s[m / 2 - 1] == s[m - 1]) {
		cout << "No" << endl;
		return 0;
	}

	bool ans = true;
	for (int i = 1; i < m; i *= 2) {
		for (int j = 0; j < i; ++j) {
			ans = ans && (s[j] > s[i + j]);
		}
		if (!ans) break;
	}

	if (ans) {
		cout << "Yes" << endl;
		return 0;
	}

	random_device rnd;
	cout << (rnd() & 1) ? "Yes" : "No" << endl;

	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:53:44: error: invalid operands of types 'const char [3]' and '<unresolved overloaded function type>' to binary 'operator<<'
   53 |         cout << (rnd() & 1) ? "Yes" : "No" << endl;
      |                                       ~~~~~^~~~~~~
Language: C++

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)


int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  const in n2=pow(2,n);
  int s[n2];
  int ms=0;
  multiset<int> set;
  rep(i,n2){
    cin >> s[i];
    ms=max(ms,s[i]);
    set.insert(s[i]);    
  }
  sort(s,s+n2,greater<int>());
  if(set.count(s[i])>=2){
    cout << "No" << endl;
    return 0;
  }
  cout << "Yes" << endl;
    
  return 0;
    

}


Compiler output:
a.cc: In function 'int main()':
a.cc:15:9: error: 'in' does not name a type; did you mean 'int'?
   15 |   const in n2=pow(2,n);
      |         ^~
      |         int
a.cc:16:9: error: 'n2' was not declared in this scope; did you mean 'n'?
   16 |   int s[n2];
      |         ^~
      |         n
a.cc:20:12: error: 's' was not declared in this scope
   20 |     cin >> s[i];
      |            ^
a.cc:24:8: error: 's' was not declared in this scope; did you mean 'ms'?
   24 |   sort(s,s+n2,greater<int>());
      |        ^
      |        ms
a.cc:25:18: error: 'i' was not declared in this scope
   25 |   if(set.count(s[i])>=2){
      |                  ^
Language: C++

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

int main() {
  int N;
  cin >> N;
  vector<int> S(pow(2,N));
  for (int i = 0; i < S.size(); i++)
    cin >> P.at(i);
  sort(S.begin(), S.end());
  reverse(S.begin(), S.end());
  
  bool a = true;
  for (int i = 1; i < N + 1; i++) {
    if (S.at(pow(2,i) - 1) > S.at(1) - i) {
      a = false;
    }
  }
  
  if (a = true)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:9:12: error: 'P' was not declared in this scope
    9 |     cin >> P.at(i);
      |            ^
Language: C++

#include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair 
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define vvi vector<vi>
#define DBG_N(hoge) cerr<<" "<<(hoge)<<endl;
#define DBG cerr<<"!"<<endl;
#define BITLE(n) (1LL<<((ll)n))
#define BITCNT(n) (__builtin_popcountll(n))
#define SUBS(s,f,t) ((s).substr((f)-1,(t)-(f)+1))
#define ALL(a) (a).begin(),(a).end()
using namespace std;
bool vis[BITLE(n+1)];
int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  ll n;cin>>n;
  vi A(BITLE(n));
  for(auto &a:A)cin>>a;
  sort(ALL(A),greater<ll>());
  priority_queue<ll> slime[2];
  slime[0].push(A[0]);
  bool ans=true;

  for(int i=0;i<n;i++){
    ll num=BITLE(i);
    ll cnt=0;
    ll now=slime[i%2].top();
    for(int j=0;j<BITLE(n);j++){
      if(vis[j])continue;
      if(now<=A[j])continue;
      slime[i%2].pop();
      slime[(i+1)%2].push(A[j]);
      slime[(i+1)%2].push(now);
      if(!slime[i%2].empty())
	now=slime[i%2].top();
      else break;
    }
    if(!slime[i%2].empty()){cout<<"No"<<endl;return 0;}
  }
  if(ans)cout<<"Yes"<<endl;
  else cout<<"No"<<endl;
  return 0;
}


Compiler output:
a.cc:20:16: error: 'n' was not declared in this scope; did you mean 'yn'?
   20 | bool vis[BITLE(n+1)];
      |                ^
a.cc:15:29: note: in definition of macro 'BITLE'
   15 | #define BITLE(n) (1LL<<((ll)n))
      |                             ^
a.cc: In function 'int main()':
a.cc:37:10: error: 'vis' was not declared in this scope; did you mean 'vi'?
   37 |       if(vis[j])continue;
      |          ^~~
      |          vi
Language: C++


    sort(a + 1, a + 1 + n,cmp);
    long long pp = 0;
    long long i = 2;
    for(long long pp = 0; pp <= 20 && i <= n; pp++){
        while(i <= (1LL << (pp + 1)) ){
            if(a[i - (1LL << pp)] <= a[i]){
                cout << "No" << '\n';
                return 0;
            }
            i++;
        }
    }
    cout << "Yes" << '\n';
    return 0;
}


Compiler output:
a.cc:2:9: error: expected constructor, destructor, or type conversion before '(' token
    2 |     sort(a + 1, a + 1 + n,cmp);
      |         ^
a.cc:5:5: error: expected unqualified-id before 'for'
    5 |     for(long long pp = 0; pp <= 20 && i <= n; pp++){
      |     ^~~
a.cc:5:27: error: 'pp' does not name a type
    5 |     for(long long pp = 0; pp <= 20 && i <= n; pp++){
      |                           ^~
a.cc:5:47: error: 'pp' does not name a type
    5 |     for(long long pp = 0; pp <= 20 && i <= n; pp++){
      |                                               ^~
a.cc:14:5: error: 'cout' does not name a type
   14 |     cout << "Yes" << '\n';
      |     ^~~~
a.cc:15:5: error: expected unqualified-id before 'return'
   15 |     return 0;
      |     ^~~~~~
a.cc:16:1: error: expected declaration before '}' token
   16 | }
      | ^
Language: C++

#include<bits/stdc++.h>
using namespace std;
#define ll long long 
#define ld long double 
#define pb push_back
#define pii pair<ll,ll>
ll M = 1e9+7;

ll power(ll a,ll b,ll c=M){
    ll res=1;
    a%=c;
    while(b>0){
        if(b%2)res= (res*a)%c;
        a = (a*a)%c;
        b/=2;
    }
    return res;
}

int main () {
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    ll d;
    cin>>d;
    ll n = pow(2,d);
    for(int i=0;i<n;++i)
        cin>>a[i];

    // ll st=0,ed=1,tmp;
    // while(st<n){
    //     tmp = ans[st];
    //     while(tmp>0){
    //         tmp--;
    //         if(a[ed]>=a[st]){
    //             fin="No\n";
    //             ed++;
    //         }
    //         ans[ed++] = tmp;
    //     }
    //     st++;
    // }
   //
    
    cout << "No\n";
    return 0;
}

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

#include <iostream>

int main(){
  cout<<"Yes"<<endl;
  return 0;
}

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

#include<cstdio>
#include<iostream>
using namespace std;
int main(){
  cout<<"Yes";
  return 0
}

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

#include<bits/stdc++.h>
#define ll long long
#define rep(i,a,b) for(i=a;i<b;i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define vi vector < ll  int >
#define CLR(a) memset((a),0,sizeof(a))
#define mp make_pair
#define hell 1000000007
using namespace std;

 //int dp[1001][1001];
 /*
vector < int > tree(400005);

void buildtree (vector < int > v,int node,int start,int fin)
  {
      if(start==fin)
      {
          tree[node]=v[start];
          return;
      }
      int mid=(start+fin)/2;
      buildtree(v,2*node,start,mid);
      buildtree(v,2*node+1,mid+1,fin);
      tree[node]=tree[2*node]+tree[2*node+1];
  }

 int sum (int node,int tl,int tr,int l , int r)
   {
       if(l>r) return 0;
       if(l==tl and r==tr) return tree[node];
       int mid=(tl+tr)/2;
       return sum(2*node,tl,mid,l,min(r,mid))+sum(2*node+1,mid+1,tr,max(l,mid+1),r);
   }

  void update(int node,int tl , int tr,int pos,int val)
    {
        if(tl==tr) {tree[node]=val; return;}
        int mid=(tl+tr)/2;
        if(pos<=mid)
              update(2*node,tl,mid,pos,val);
        else
            update(2*node+1,mid+1,tr,pos,val);
        tree[node]=tree[2*node]+tree[2*node+1];

    }
string findSum(string str1, string str2)
{
    // Before proceeding further, make sure length
    // of str2 is larger.
    if (str1.length() > str2.length())
        swap(str1, str2);

    // Take an empty string for storing result
    string str = "";

    // Calculate length of both string
    int n1 = str1.length(), n2 = str2.length();

    // Reverse both of strings
    reverse(str1.begin(), str1.end());
    reverse(str2.begin(), str2.end());

    int carry = 0;
    for (int i=0; i<n1; i++)
    {
        // Do school mathematics, compute sum of
        // current digits and carry
        int sum = ((str1[i]-'0')+(str2[i]-'0')+carry);
        str.push_back(sum%10 + '0');

        // Calculate carry for next step
        carry = sum/10;
    }

    // Add remaining digits of larger number
    for (int i=n1; i<n2; i++)
    {
        int sum = ((str2[i]-'0')+carry);
        str.push_back(sum%10 + '0');
        carry = sum/10;
    }

    // Add remaining carry
    if (carry)
        str.push_back(carry+'0');

    // reverse resultant string
    reverse(str.begin(), str.end());

    return str;
}
*/


void solve()
{
    ll int i,j=0,r=200,p,q,k,d,y=0,h,flag=1,n,m=0,a=hell,b=hell,id,h1,h2,a1,b1,a2,w,x,u,f,l;
   cin>>n;
    y=(1<<n);
    vi v(y);
    //y=0;
    map < ll , ll > M;
rep(i,0,y) cin>>v[i],M[v[i]]++;
  //map < ll, ll > :: iterator it;
  j=1; k=1;
  for(auto it=M.rbegin();it!=M.rend();++it)
  {
      if(it->second>k) {cout<<"No"; return;}
      k=j*n;
      j++;
  }
  it--;
  if(it.S>1) cout<<"No";
  else
  cout<<"Yes";

}


signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t=1;
   // cin>>t;
    while(t--)
     solve();
}


Compiler output:
a.cc: In function 'void solve()':
a.cc:116:3: error: 'it' was not declared in this scope; did you mean 'id'?
  116 |   it--;
      |   ^~
      |   id
Language: C++

// testcplusplus.cpp : This file contains the 'main' function. Program execution begins and ends there.
//

#include <iostream>
#include <vector>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <iterator>

using namespace std;


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

	map<int, int, greater<int>> freq;

	for (int i = 0; i < pow(2, n); i++) {
		int curr;
		cin >> curr;
		freq[curr]++;
	}

	if (freq.size() == 1) {
		cout << "NO";
		return 0;
	}

	int parentsCount = freq.begin() -> second;
	
	int totalSecondsNeeded = 0;

	for (auto it = ++freq.begin(); it != freq.end(); it++) {
		if (totalSecondsNeeded > n) {
			cout << "NO";
			return 0;
		}

		totalSecondsNeeded += (it->second) / parentsCount;
		parentsCount += it->second;
	}

	cout << "YES";
}


Compiler output:
a.cc: In function 'int main()':
a.cc:22:29: error: 'pow' was not declared in this scope
   22 |         for (int i = 0; i < pow(2, n); i++) {
      |                             ^~~
Language: C++

#include <algorithm>
#include <cstdio>

using namespace std ;

const int N=1<<20 ;

int A[N] ;
int n , m ;

int main ()
{
	int i , w ;
	scanf("%d",&m),n=1<<m;
	for ( i=1 ; i<=n ; i++ ) scanf("%d",A+i);
	sort(A+1,A+n+1,greater<int>());
	// for ( i=1 ; i<=n ; i++ ) printf("%d ",A[i]); puts("");
	for ( w=m-1 ; ~w ; w-- )
		for ( i=1 ; i<=(1<<w) ; i++ )
			if ( A[i]<=A[i+(1<<w)] ) return puts("No")*0;
	puts("Yes");
	return 0 ;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:16:24: error: 'greater' was not declared in this scope
   16 |         sort(A+1,A+n+1,greater<int>());
      |                        ^~~~~~~
a.cc:16:32: error: expected primary-expression before 'int'
   16 |         sort(A+1,A+n+1,greater<int>());
      |                                ^~~
Language: Java

import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Deque;
import java.util.Scanner;

public class Main2 {
    static final Scanner sc = new Scanner(System.in);
    static final int MOD = (int) 1E9 + 7;
    
    public static void main(String[] args) {
        int N = nint();
        int pow = (int) Math.pow(2, N);
        int[] S_ = nints(pow); 
        Arrays.sort(S_);
        
        int[] S = new int[pow];
        for (int i = 0; i < pow; i++) {
            S[i] = S_[pow-i-1];
        }
        
        Deque<Node> d = new ArrayDeque<>();
        int idx = 0;
        d.add(new Node(S[0], N));
        idx++;
        
        while (!d.isEmpty()) {
            Node f = d.poll();
            
            for (int i = f.n-1; i >= 0; i--) {
                if (S[idx] >= f.v) {
                    System.out.println("No");
                    return;
                }
                Node child = new Node(S[idx], i);
                idx++;
                d.add(child);
            }
        }
        
        System.out.println("Yes");
    }
    public static class Node {
        int v;
        int n;
        public Node(int v, int n) {
            super();
            this.v = v;
            this.n = n;
        }
    }

    private static long nlong() {
        return sc.nextLong();
    }

    private static int nint() {
        return sc.nextInt();
    }

    private static String nstr() {
        return sc.next();
    }

    private static char[] nchars() {
        return sc.next().toCharArray();
    }

    private static int[] nints(int n) {
        return nints(n, 0, 0);
    }

    private static int[] nints(int n, int padL, int padR) {
        int[] a = new int[padL + n + padR];
        for (int i = 0; i < n; i++)
            a[padL + i] = nint();
        return a;
    }

    private static char[][] nchars2(int h, int w) {
        return nchars2(h, w, 0);
    }

    private static char[][] nchars2(int h, int w, int pad) {
        char[][] a2 = new char[h + pad * 2][w + pad * 2];
        for (int i = 0; i < h; i++)
            System.arraycopy(nchars(), 0, a2[pad + i], pad, w);
        return a2;
    }
}


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

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

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

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

    cout<<"Yes";
}


Compiler output:
a.cc: In function 'int main()':
a.cc:10:14: error: 'A' was not declared in this scope
   10 |         cin>>A[i];
      |              ^
Language: C++

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
  vector<char>vec(3);
  for(ll i=0;i<3;i++){
    cin>>vec.at(i);
  }
  ll a=0;
  for(ll i=0;i<3;i++){
    char d;
    cin>>d;
    if(vec.at(i)==d){
      a+=1;
    }
  }
  cour<<a<<endl;
  return 0;
}
  
    


Compiler output:
a.cc: In function 'int main()':
a.cc:17:3: error: 'cour' was not declared in this scope
   17 |   cour<<a<<endl;
      |   ^~~~
Language: C++

#include <algorithm>
#include <string>
using namespace std;
int main() {
    string S,T;
    int a = 0;
    cin >> S;
    cin >> T;
    for (int i=0;i<3;i++)// Your code here!
    {
        if (S.at(i)==T.at(i)){
            // cout<<"g"<<endl;
            a++;
        }
    }
    cout << a << endl; 
    return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:7:5: error: 'cin' was not declared in this scope
    7 |     cin >> S;
      |     ^~~
a.cc:3:1: note: 'std::cin' is defined in header '<iostream>'; this is probably fixable by adding '#include <iostream>'
    2 | #include <string>
  +++ |+#include <iostream>
    3 | using namespace std;
a.cc:16:5: error: 'cout' was not declared in this scope
   16 |     cout << a << endl;
      |     ^~~~
a.cc:16:5: note: 'std::cout' is defined in header '<iostream>'; this is probably fixable by adding '#include <iostream>'
a.cc:16:18: error: 'endl' was not declared in this scope
   16 |     cout << a << endl;
      |                  ^~~~
a.cc:3:1: note: 'std::endl' is defined in header '<ostream>'; this is probably fixable by adding '#include <ostream>'
    2 | #include <string>
  +++ |+#include <ostream>
    3 | using namespace std;
Language: C++

#include <algorithm>

using namespace std;
int main() {
    string S,T;
    int a = 0;
    cin >> S;
    cin >> T;
    for (int i=0;i<3;i++)// Your code here!
    {
        if (S.at(i)==T.at(i)){
            // cout<<"g"<<endl;
            a++;
        }
    }
    cout << a << endl; 
    return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:5:5: error: 'string' was not declared in this scope
    5 |     string S,T;
      |     ^~~~~~
a.cc:2:1: note: 'std::string' is defined in header '<string>'; this is probably fixable by adding '#include <string>'
    1 | #include <algorithm>
  +++ |+#include <string>
    2 | 
a.cc:7:5: error: 'cin' was not declared in this scope
    7 |     cin >> S;
      |     ^~~
a.cc:2:1: note: 'std::cin' is defined in header '<iostream>'; this is probably fixable by adding '#include <iostream>'
    1 | #include <algorithm>
  +++ |+#include <iostream>
    2 | 
a.cc:7:12: error: 'S' was not declared in this scope
    7 |     cin >> S;
      |            ^
a.cc:8:12: error: 'T' was not declared in this scope
    8 |     cin >> T;
      |            ^
a.cc:16:5: error: 'cout' was not declared in this scope
   16 |     cout << a << endl;
      |     ^~~~
a.cc:16:5: note: 'std::cout' is defined in header '<iostream>'; this is probably fixable by adding '#include <iostream>'
a.cc:16:18: error: 'endl' was not declared in this scope
   16 |     cout << a << endl;
      |                  ^~~~
a.cc:2:1: note: 'std::endl' is defined in header '<ostream>'; this is probably fixable by adding '#include <ostream>'
    1 | #include <algorithm>
  +++ |+#include <ostream>
    2 |
Language: C++

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

int main(){
  char a, b, c, d, e, f;
  cin >> a >> b >> c;
  cin >> d >> e >> f;
  int ans = 0;
  if (a == d){
    ans++;
  }
  if (b == e){
    ans++;
  }
  if (c == f){
    ans++;
  }


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

include <bits/stdc++.h> 
using namespace std; 
int main (){
    string S,T;
    cin >> S >> T;
    int i,ans=0;
    for(i=0;i<3;i++){
    if(S[i] == T[i])
    ans++;
    }
    cout << ans << endl;
    return 0;
}

Compiler output:
a.cc:1:1: error: 'include' does not name a type
    1 | include <bits/stdc++.h>
      | ^~~~~~~
a.cc: In function 'int main()':
a.cc:4:5: error: 'string' was not declared in this scope
    4 |     string S,T;
      |     ^~~~~~
a.cc:5:5: error: 'cin' was not declared in this scope
    5 |     cin >> S >> T;
      |     ^~~
a.cc:5:12: error: 'S' was not declared in this scope
    5 |     cin >> S >> T;
      |            ^
a.cc:5:17: error: 'T' was not declared in this scope
    5 |     cin >> S >> T;
      |                 ^
a.cc:11:5: error: 'cout' was not declared in this scope
   11 |     cout << ans << endl;
      |     ^~~~
a.cc:11:20: error: 'endl' was not declared in this scope
   11 |     cout << ans << endl;
      |                    ^~~~
Language: C++

#include<iostream>
using namespace std;
int main(){
  int a=0;
  char a,b,c,d,e,f;
  cin >> a >> b >> c;
  cin >> d >> e >> f;
  if(a==d){
    a++;
  }
  else if(b==e){
    a++;
  }
  else if(c==f){
    a++;
  }
  cout << a << endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:5:8: error: conflicting declaration 'char a'
    5 |   char a,b,c,d,e,f;
      |        ^
a.cc:4:7: note: previous declaration as 'int a'
    4 |   int a=0;
      |       ^
Language: C++

#include <bits/stdc++.h> 
using namespace std; 
int main (){
    string S,T;
    cin >> S >> T;
    int i,ans=0;
    for(i=0;i<3;i++){
    if(S[i] == T[i])
    ans++;
    }
    cout << cnt << endl;
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:11:13: error: 'cnt' was not declared in this scope; did you mean 'int'?
   11 |     cout << cnt << endl;
      |             ^~~
      |             int
Language: C++

#include<bits/stdc++.h> 

#include<random> 

#define int long long 

#define pp pair<int,int> 

#define ss second 

#define ff first 

#define pb push_back 

#define mod 1000000007 

using namespace std; 

void fastio() 

{ 

    #ifndef ONLINE_JUDGE 

        freopen("INPUT.txt","r",stdin); 

            freopen("OUTPUT.txt","w",stdout); 

                #endif 

                    ios_base :: sync_with_stdio(false); 

                        cin.tie(NULL) ; 

                            cout.tie(NULL); 

                            }

signed main() 

{ 

    fastio(); 

        int t=1;

           // cin>>t;

                while(t--)

                    {

                         string s,t;

                         cin>>s>>t

                         int c=0;

                         for(int i=0;i<s.length();i++){

                         if(s[i]==t[i])

                         c++;}

                         cout<<c;

    }

    }

    

Compiler output:
a.cc: In function 'int main()':
a.cc:55:35: error: expected ';' before 'long'
   55 |                          cin>>s>>t
      |                                   ^
      |                                   ;
a.cc:63:26: error: 'c' was not declared in this scope
   63 |                          c++;}
      |                          ^
a.cc:65:32: error: 'c' was not declared in this scope
   65 |                          cout<<c;
      |                                ^
Language: C++

#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<random>
#include<bitset>
#include <queue>
#include <map>


using namespace std;
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using ldouble = long double;


//BDD,ZDD,kdtree, bdtree,bicalc, bolonoy, doloney,chinesemod,segmenttree,daikusutora, saidairyuu, 2bugurahu, heirokenshutu, topologicalsort, kyourenketuseibun


#define PRI(s) cout << s << endl
#define PRIY PRI("Yes")
#define PRIN PRI("No")

int main() {
	string p;
	string r;
	cin >> p;
	cin >> r;
	int c = 0;
	for (int i = 0; i < 3; ++i) {
		if (p[i] == c[i])++c;
	}
	PRI(c);
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:44:30: error: invalid types 'int[int]' for array subscript
   44 |                 if (p[i] == c[i])++c;
      |                              ^
Language: C++

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

int main(){
    string s,t;
    cin >> s >> t;
    int ans = 0;
    for(int i=0;i<3;i++){
        if(s.at(i)==s.at(t))ans++;
    }
    cout << ans << endl;
    
}

Compiler output:
a.cc: In function 'int main()':
a.cc:9:25: error: no matching function for call to 'std::__cxx11::basic_string<char>::at(std::string&)'
    9 |         if(s.at(i)==s.at(t))ans++;
      |                     ~~~~^~~
In file included from /usr/include/c++/14/string:54,
                 from /usr/include/c++/14/bitset:52,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:52,
                 from a.cc:1:
/usr/include/c++/14/bits/basic_string.h:1287:7: note: candidate: 'std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::const_reference std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::at(size_type) const [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>; const_reference = const char&; size_type = long unsigned int]'
 1287 |       at(size_type __n) const
      |       ^~
/usr/include/c++/14/bits/basic_string.h:1287:20: note:   no known conversion for argument 1 from 'std::string' {aka 'std::__cxx11::basic_string<char>'} to 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'}
 1287 |       at(size_type __n) const
      |          ~~~~~~~~~~^~~
/usr/include/c++/14/bits/basic_string.h:1309:7: note: candidate: 'std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::reference std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::at(size_type) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>; reference = char&; size_type = long unsigned int]'
 1309 |       at(size_type __n)
      |       ^~
/usr/include/c++/14/bits/basic_string.h:1309:20: note:   no known conversion for argument 1 from 'std::string' {aka 'std::__cxx11::basic_string<char>'} to 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'}
 1309 |       at(size_type __n)
      |          ~~~~~~~~~~^~~
Language: C++

#include <bits/stdc++.h>

using namespace std;

int main(){

  int i,j,c=1,p=0;
  cin>>i>>j;

  while (1){
    if ( c >= j){
      break;
    }
    c--
    c +=i;
    p +=1;
  }
  cout<<p;

  return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:14:8: error: expected ';' before 'c'
   14 |     c--
      |        ^
      |        ;
   15 |     c +=i;
      |     ~
Language: C++

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

int main() {
  stirng s, t;
  int S = 0;
  cin >> s >> t;
  for(int i = 0;i < 3;i++) {
    if(s[i] == t[i]) S++;
  }
  cout << S << endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:5:3: error: 'stirng' was not declared in this scope
    5 |   stirng s, t;
      |   ^~~~~~
a.cc:7:10: error: 's' was not declared in this scope
    7 |   cin >> s >> t;
      |          ^
a.cc:7:15: error: 't' was not declared in this scope
    7 |   cin >> s >> t;
      |               ^
Language: C++

#include<stdio.h>
#include<math.h>
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main() {
	string S;
	string T;
	cin >> S;
	cin >> T;
	int a;
	a = 1;
	int b;
	b = 0;
	while (a < =3) {
		if (S[a] = T[a]) {
			b++;
		}
		a++;
	}
	cout << b << endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:16:20: error: expected primary-expression before '=' token
   16 |         while (a < =3) {
      |                    ^