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

#include <bits/stdc++.h>
  
using namespace std;
  
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
const ll MOD = 10e9+7;
  
int binsearch_lower_bound(vector<int>& vec, int val) {
  int low = 0;            // ???????????????
  int high = vec.size();  // ????????????????????§?£????????????° [low, high] ???????????????¨??????
  while (low < high) {
    int mid = (low + high) / 2;  // ???????????????????????£????§????????????????????????????????????
                                 // ??????????????? mid=low+(high-low)/2 ???¨????????????
    int midval = vec[mid];       // ?????????§??????
  
    // ??§?£?????????????????????
    if (midval < val) low = mid + 1;
    else high = mid;
  }
  return low;
}
  
int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  
  int n,t;
  cin >> n >> t;
  std::vector<ll> v;
  for(int i=0;i<n;i++){
    ll d;
    cin >> d;
    v.push_back(d);
  }
  sort(v.begin(),v.end());
  ll res[n+1];
  res[0]=1;
  for(int i=1;i<n;i++){
    if(v[i-1]>=v[i]-t){
      int idx=binsearch_lower_bound(v,v[i]-t);
      res[i] = (res[i-1]*(i-idx+1))%MOD;
    }
    else res[i]=res[i-1];
  }
  cout << res[n-1] << endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:47:37: error: invalid initialization of reference of type 'std::vector<int>&' from expression of type 'std::vector<long long int>'
   47 |       int idx=binsearch_lower_bound(v,v[i]-t);
      |                                     ^
a.cc:15:40: note: in passing argument 1 of 'int binsearch_lower_bound(std::vector<int>&, int)'
   15 | int binsearch_lower_bound(vector<int>& vec, int val) {
      |                           ~~~~~~~~~~~~~^~~
Language: C++

const int mod = (int)1e9 + 7;
int n, t, d[10000];

int main(){
	cin >> n >> t;
	rep(i, n) cin >> d[i];
	sort(d, d + n);
	ll ans = 1;
	
	for(int i = 0, j = 0; j < n; j++){
		while(i < j && d[i] + t < d[j]) i++;
		ans = ans * (j - i + 1) % mod;
	}
	cout << ans << endl;
	
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:5:9: error: 'cin' was not declared in this scope
    5 |         cin >> n >> t;
      |         ^~~
a.cc:6:13: error: 'i' was not declared in this scope
    6 |         rep(i, n) cin >> d[i];
      |             ^
a.cc:6:9: error: 'rep' was not declared in this scope
    6 |         rep(i, n) cin >> d[i];
      |         ^~~
a.cc:7:9: error: 'sort' was not declared in this scope; did you mean 'short'?
    7 |         sort(d, d + n);
      |         ^~~~
      |         short
a.cc:8:9: error: 'll' was not declared in this scope
    8 |         ll ans = 1;
      |         ^~
a.cc:12:17: error: 'ans' was not declared in this scope
   12 |                 ans = ans * (j - i + 1) % mod;
      |                 ^~~
a.cc:14:9: error: 'cout' was not declared in this scope
   14 |         cout << ans << endl;
      |         ^~~~
a.cc:14:17: error: 'ans' was not declared in this scope
   14 |         cout << ans << endl;
      |                 ^~~
a.cc:14:24: error: 'endl' was not declared in this scope
   14 |         cout << ans << endl;
      |                        ^~~~
Language: Java

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

import static java.lang.Integer.parseInt;

/**
 * Sightseeing Tour
 */
public class P2386 {

	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String line;
		StringTokenizer st;

		int n = parseInt(br.readLine());

		int[][] G = new int[n][n];

		for (int i = 0; i < n; i++) {
			st = new StringTokenizer(br.readLine());
			for (int j = 0; j < n; j++) {
				G[i][j] = parseInt(st.nextToken());
			}
		}

		long ans = 0;

		for (int i = 0; i < n - 1; i++) {
			for (int j = i; j < n; j++) {
				ans += Math.min(G[i][j], G[j][i]);
			}
		}

		System.out.println(ans);
	}
}

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

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

int C[110][110];

int main() {
  int N;
  cin >> N;
  for (auto i=0; i<N; i++) {
    for (auto j=0; j<N; j++) {
      cin >> c[i][j];
    }
  }
  int ans = 0;
  for (auto i=0; i<N; i++) {
    for (auto j=i+1; j<N; j++) {
      ans = min(c[i][j], c[j][i]);
    }
  }
  cout << ans << endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:12:14: error: 'c' was not declared in this scope
   12 |       cin >> c[i][j];
      |              ^
a.cc:18:17: error: 'c' was not declared in this scope
   18 |       ans = min(c[i][j], c[j][i]);
      |                 ^
Language: C++

#include<iostream>
#include<vector>

using namespace std;
using P = pair<int, pair<int, int>>;


int N;
int C[100][100];
bool D[100][100] = {0};
bool from[100] = {0};
bool to[100] = {0};

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

    vector<P> v;
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < N; ++j) {
            v.push_back(P(C[i][j] - C[j][i], make_pair(i, j)));
        }
    }

    sort(v.begin(), v.end(), greater<P>());

    int ans = 0;
    int cnt = 0;
    for (P p : v) {
        if (cnt == N - 1) break;
        int i = p.second.first;
        int j = p.second.second;
        if (!from[i] && !to[j]) {
            from[i] = true;
            to[j] = true;
            ans += C[j][i];
            D[i][j] = true;
            D[j][i] = true;
            cnt++;
        }
    }

    for (int i = 0; i < N; ++i) {
        for (int j = i + 1; j < N; ++j) {
            if (!D[i][j]) ans += min(C[i][j], C[j][i]);
        }
    }

    cout << ans << endl;


}


Compiler output:
a.cc: In function 'int main()':
a.cc:29:5: error: 'sort' was not declared in this scope; did you mean 'short'?
   29 |     sort(v.begin(), v.end(), greater<P>());
      |     ^~~~
      |     short
Language: C++

include<iostream>
using namespace std;

int main(){
  int n,a[110][110];
  cin >> n; for(int i=0;i<n;i++)for(int j=0;j<n;j++)cin >> a[i][j];

  int res = 0;
  for(int i=0;i<n;i++)
    for(int j=i+1;j<n;j++)res += std::min(a[i][j],a[j][i]);
  cout << res << endl;
}

Compiler output:
a.cc:1:1: error: 'include' does not name a type
    1 | include<iostream>
      | ^~~~~~~
a.cc: In function 'int main()':
a.cc:6:3: error: 'cin' was not declared in this scope
    6 |   cin >> n; for(int i=0;i<n;i++)for(int j=0;j<n;j++)cin >> a[i][j];
      |   ^~~
a.cc:10:39: error: 'min' is not a member of 'std'
   10 |     for(int j=i+1;j<n;j++)res += std::min(a[i][j],a[j][i]);
      |                                       ^~~
a.cc:11:3: error: 'cout' was not declared in this scope
   11 |   cout << res << endl;
      |   ^~~~
a.cc:11:18: error: 'endl' was not declared in this scope
   11 |   cout << res << endl;
      |                  ^~~~
Language: C++

#include <vector>
#include <iostream>
#include <map>
#include <algorithm>
#include <random>
#include <complex>
#include <unordered_map>
#include <cmath>
#include <cstring>
#include <cassert>
#include <cstdio>
#include <bitset>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;

const int MN = 40000100;

ll gcd(ll a, ll b) {
    if (!a) return b;
    return gcd(b%a, a);
}

bitset<MN> mp[MN];

int main() {
    ll w, d, n, m, t;
    cin >> w >> d >> n >> m >> t; w++; d--;
    ll k = w+d;
    m %= t;
    m = t-m;
    ll u = gcd(t, k);
    ll s = 0;
    for (int i = 0; i < n; i++) {
        mp[s] = true;
        s += m;
        s %= t;
    }
    mp[t] = true;
    ll res = 0, c = 0;
    ll l = 0, r = 0;
    for (int i = 0; i <= t; i++) {
        if (mp[i]) {
            l = (l+u-1) /u*u;
            res += max(0LL, (r-l - w + u) / u);
            l = r = i+1;
        } else {
            r++;
        }
    }
    printf("%.20f\n", 1.0 * res / (t / u));
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:44:17: error: could not convert 'mp[i]' from 'std::bitset<40000100>' to 'bool'
   44 |         if (mp[i]) {
      |             ~~~~^
      |                 |
      |                 std::bitset<40000100>
Language: C++

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

struct unionfind{
  int parent[20000];
  int size[20000];
  
  void init(int n){
    parent.resize(n);
    size.resize(n);
    for(int i=0;i<n;i++){
      parent[i]=i;
      size[i]=1;
    }
  }
  int find(int x){
    if(parent[x]==x)return x;
    else parent[x]=find(parent[x]);
  }
  bool same(int x,int y){
    return (find(x)==find(y));
  }
  bool getSize(int x){
    return size[ find(x) ];
  }
  void unite(int x,int y){
    x=find(x);
    y=find(y);
    if(x==y)return;
    if(size[x]>size[y])swap(x,y);
    parent[x]=y;
    size[y]+=size[x];
  }
};
  
struct edge{
  int from,to,cost;
  bool operator < (const edge &e) const {
    return cost < e.cost;
  }
};

int n,t,k;

int main(){
  unionfind uf;
  
  for(int tc=1;;tc++){
    cin>>n>>t>>k;
    if(n==0&&t==0&&k==0)break;
    vector<edge> E;
    for(int i=0;i<n-1;i++){
      int a,b,c;
      cin>>a>>b>>c;
      a--,b--;
      E.push_back( (edge){a,b,-c} );
    }
    for(int i=0;i<t;i++){
      int a;
      cin>>a;
      a--;
      E.push_back( (edge){a,n,-20000} );
    }
    sort(E.begin(),E.end());
    uf.init(n+1);

    vector<edge> tmp;
    
    for(int i=0;i<(int)E.size();i++){
      edge e=E[i];
      if( uf.same(e.from,e.to) ){
        tmp.push_back(e);
      }else{
        uf.unite(e.from,e.to);
      }
    }

    int ans=0;
    for(int i=t-1-k;i<(int)tmp.size();i++){
      ans-=tmp[i].cost;
    }
    cout<<"Case "<<tc<<": "<<ans<<endl;
    
  }
  return 0;
}

Compiler output:
a.cc: In member function 'void unionfind::init(int)':
a.cc:9:12: error: request for member 'resize' in '((unionfind*)this)->unionfind::parent', which is of non-class type 'int [20000]'
    9 |     parent.resize(n);
      |            ^~~~~~
a.cc:10:10: error: request for member 'resize' in '((unionfind*)this)->unionfind::size', which is of non-class type 'int [20000]'
   10 |     size.resize(n);
      |          ^~~~~~
a.cc: In member function 'int unionfind::find(int)':
a.cc:18:19: warning: control reaches end of non-void function [-Wreturn-type]
   18 |     else parent[x]=find(parent[x]);
      |          ~~~~~~~~~^~~~~~~~~~~~~~~~
Language: C++

2 4 1
2 1
2 2 1
2 2
2 5 2
2 2
2 4
3 9 1
2 7
1 3 1
1 2
3 4 6
1 2
2 1
2 3
3 1
3 2
3 3
1 628 1
1 242
4 503 10
1 418
2 147
2 192
2 329
3 229
3 259
4 5
4 28
4 46
4 208
2 520 9
1 233
1 249
1 287
1 421
1 461
2 140
2 254
2 340
2 464
1 847612034611814966 1
1 216279700188484199
4 396982151831595032 9
1 160410890824759889
2 29508916993838462
2 168232668523151011
2 308455142782910759
2 339832658947706855
3 218667253980846599
4 66391342358616002
4 279690389093115549
4 296519701798063931
1 525978329091980701 4
1 269661928310144051
1 317935486046786881
1 323612087289727251
1 511938489989304615
13 7 1
8 2
5 9 5
1 4
2 6
3 3
3 5
4 2
5 2 5
2 1
2 2
3 1
4 2
5 1
9 681 1
9 145
14 133 7
1 95
2 109
4 84
6 82
9 40
9 60
11 40
11 604 1
10 394
7 928973520197917948 1
4 714207521576559632
15 638675861115060443 3
7 47020003943226869
11 358262746934178676
12 564506997432077473
15 912917728494725462 12
2 275470110884601247
2 616822757101892050
3 353631202987716154
6 332402909014736183
8 208961296040263477
8 271360230740003895
11 116923360383504824
11 178747802480063051
11 258035371273747188
13 494561516201419879
13 604845111595465206
14 850711260332186954
15 4 1
14 2
15 4 10
1 2
3 1
3 4
4 4
5 2
8 2
9 3
11 3
12 1
12 4
15 4 20
1 2
1 4
2 2
3 1
3 4
4 1
4 4
6 3
7 2
8 1
8 3
8 4
9 1
10 1
10 2
10 3
12 2
13 4
14 3
14 4
15 4 30
1 2
1 4
2 2
2 4
3 1
3 2
3 4
4 3
4 4
5 1
5 2
5 3
7 2
8 1
8 4
9 1
9 2
9 4
10 3
11 2
11 4
12 2
12 3
13 1
13 2
13 3
13 4
14 2
15 1
15 4
75 4 1
35 3
75 4 10
11 3
12 3
30 4
39 4
41 3
44 3
56 1
59 3
67 1
69 2
75 4 20
3 4
4 4
5 4
6 3
9 2
16 4
24 2
26 3
32 1
32 3
35 3
48 2
49 3
50 4
59 1
60 4
63 3
69 2
69 4
70 1
75 4 30
1 3
3 2
5 3
6 1
7 1
11 1
12 3
13 3
15 2
16 4
18 2
19 4
20 1
22 3
25 1
28 4
30 1
37 2
39 2
44 1
47 3
49 1
49 4
55 1
56 1
57 2
58 4
62 3
63 3
64 1
75 1000000000000000000 0
75 1000000000000000000 30
8 33333333333333333
7 66666666666666666
2 99999999999999999
4 133333333333333332
2 166666666666666665
8 199999999999999998
3 233333333333333331
5 266666666666666664
2 299999999999999997
6 333333333333333330
3 366666666666666663
4 399999999999999996
3 433333333333333329
4 466666666666666662
4 499999999999999995
7 533333333333333328
5 566666666666666661
3 599999999999999994
5 633333333333333327
1 666666666666666660
4 699999999999999993
1 733333333333333326
8 766666666666666659
6 799999999999999992
7 833333333333333325
3 866666666666666658
7 899999999999999991
4 933333333333333324
4 966666666666666657
8 999999999999999990
0 0 0

Compiler output:
a.cc:1:1: error: expected unqualified-id before numeric constant
    1 | 2 4 1
      | ^
Language: C++

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

typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;

ll mod=1e9+9;

mat mul(mat &a,mat &b){
  int h=a.size();
  int w=b[0].size();
  int n=a[0].size();
  mat res(h,vec(w,0));
  for(int i=0;i<h;i++){
    for(int j=0;j<w;j++){
      for(int k=0;k<n;k++){
        res[i][j]+=(a[i][k]*b[k][j]);
        res[i][j]%=mod;
      }
    }
  }
  return res;
}

mat mpow(mat &a,ll b){
  if(b==0){
    int n=a.size();
    mat res(n,vec(n,0));
    for(int i=0;i<n;i++)res[i][i]=1;
    return res;
  }
  mat res=mpow( mul(a,a) ,b/2);
  if(b%2)res=mul(res,a);
  return res;
}

void pr(mat C){
  cout<<endl;
  for(int i=0;i<C.size();i++){
    for(int j=0;j<C[i].size();j++){
      cout<<C[i][j]<<' ';
    }
    cout<<endl;
  }
  cout<<endl;
}

int main(){
  for(int tc=1;;tc++){
    ll W,H,N;
    cin>>W>>H>>N;
    if(W==0&&H==0&&N==0)break;
    
    vector<ll> v;
    map< ll , vector<ll> >G;
    mat ans(W,vec(1,0));
    ans[0][0]=1;

    mat B(W,vec(W,0));
    for(int i=0;i<W;i++){
      if(i+1<W)B[i][i+1]++;
      B[i][i]++;
      if(i-1>=0)B[i][i-1]++;
    }
    

    for(int i=0;i<N;i++){
      ll x,y;
      cin>>x>>y;
      v.push_back(y);
      G[y].push_back(x);
    }

    v.push_back(H);
    sort(v.begin(),v.end());
    v.erase( unique(v.begin(),v.end()) , v.end() );

    
    int last=1;
    for(int i=0;i<(int)v.size();i++){
      ll dist=v[i]-last;

      mat C=mpow(B,dist);
      //pr(C);
      
      ans=mul( C, ans );

      //pr(ans);
      
      last=v[i];


      if(G.count(v[i])==0)continue;
      for(int j=0;j<(int)G[v[i]].size();j++){
        int target=G[v[i]][j];
        //cout<<target<<endl;
        ans[ target-1 ][0]=0;
      }
    }
    cout<<"Case "<<tc<<": "<<ans[W-1][0]<<endl;
  }
  return 0;
}

Compiler output:
a.cc: In function 'mat mpow(mat&, ll)':
a.cc:33:20: error: cannot bind non-const lvalue reference of type 'mat&' {aka 'std::vector<std::vector<long long int> >&'} to an rvalue of type 'mat' {aka 'std::vector<std::vector<long long int> >'}
   33 |   mat res=mpow( mul(a,a) ,b/2);
      |                 ~~~^~~~~
a.cc:26:15: note:   initializing argument 1 of 'mat mpow(mat&, ll)'
   26 | mat mpow(mat &a,ll b){
      |          ~~~~~^
Language: C++


  int prv = 1;
  for(auto ob : obst){
    int y; vector<int> xs; tie(y, xs) = ob;
    res = mul(pow(way, y - prv), res);
    for(int x: xs){
      res[x - 1] = 0;
    }
    prv = y;
  }
  cout << res[w-1] << endl;
  }
}

Compiler output:
a.cc:3:3: error: expected unqualified-id before 'for'
    3 |   for(auto ob : obst){
      |   ^~~
a.cc:11:3: error: 'cout' does not name a type
   11 |   cout << res[w-1] << endl;
      |   ^~~~
a.cc:12:3: error: expected declaration before '}' token
   12 |   }
      |   ^
a.cc:13:1: error: expected declaration before '}' token
   13 | }
      | ^
Language: C++

#include <bits/stdc++.h>

using namespace std;
#define int long long

typedef int number;
typedef vector<number> Array;
typedef vector<Array> matrix;

const int mod = 1000000009;

// O( n )
matrix identity(int n) {
  matrix A(n, Array(n));
  for (int i = 0; i < n; ++i) A[i][i] = 1;
  return A;
}
// O( n^2 )
Array mul(const matrix &A, const Array &x) {
  Array y(A.size());
  for (int i = 0; i < A.size(); ++i)
    for (int j = 0; j < A[0].size(); ++j)
      y[i] = (y[i] + A[i][j] * x[j]) % mod;
  return y;
}
// O( n^3 )
matrix mul(const matrix &A, const matrix &B) {
  matrix C(A.size(), Array(B[0].size()));
  for (int i = 0; i < C.size(); ++i)
    for (int j = 0; j < C[i].size(); ++j)
      for (int k = 0; k < A[i].size(); ++k)
        C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % mod;
  return C;
}
// O( n^3 log e )
matrix pow(const matrix &A, int e) {
  return e == 0 ? identity(A.size())  :
     e % 2 == 0 ? pow(mul(A, A), e/2) : mul(A, pow(A, e-1));
}

#define range(i,x,y) i=(x);i<(y);i++
#define rep(i,n) for(int i=0,i##_len=n;i<i##_len;i++)
#define all(x) begin(x),end(x)
#define lim(x,r,l) (r<=x&&x<l)
typedef long long ll;
typedef long double ld;


signed main(){
  int w, h, n; int num = 1;
  while(cin >> w >> h >> n, w != 0){
  map<int, vector<int>> obst;
  rep(i, n){
    int x, y; cin >> x >> y;
    if (obst.find(y) == obst.end()){
      obst[y] = vector<int>{x};
    } else {
      obst[y].push_back(x);
    }
  }
  if (obst.find(h) == obst.end()){
    obst[h] = vector<int>{1};
  }
  Array res(w);
  res[0] = 1;

  matrix way(w, Array(w));
  rep(i, w){
    if(i-1 >= 0) way[i][i-1] = 1;
                  way[i][i] = 1;
    if(i+1 <  w) way[i][i+1] = 1;
  }

  int prv = 1;
  for(auto ob : obst){
    int y; vector<int> xs; tie(y, xs) = ob;
    res = mul(pow(way, y - prv), res);
    for(int x: xs){
      r2es[x - 1] = 0;
    }
    prv = y;

  }
  cout << "Case " << num << ": " << res[w-1] << endl;
  num++;
  }
}

Compiler output:
a.cc: In function 'int main()':
a.cc:79:7: error: 'r2es' was not declared in this scope; did you mean 'res'?
   79 |       r2es[x - 1] = 0;
      |       ^~~~
      |       res
Language: C++

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> P;


ll M=1e9+9;
ll dp[100][100][100];


int main(){
  ll w,h,n;
  ll T=1;

  while(cin>>w>>h>>n,w){

    vector<P> v;
    for(ll x,y,i=0;i<n;i++){

      cin>>x>>y;
      v.push_back(P(y-1,x-1));
      
    }
    
    sort(v.begin(),v.end());
    ll bt=0;bash-4.4$ g++ f.cpp

    memset(dp,0,sizeof(dp));
    
    for(ll i=0;i<w;i++)
      for(ll j=max(0LL,i-1);j<=min(w-1,i+1);j++)
	dp[0][i][j]=1;
  
    h--;

    while((1LL<<bt)<=h){
 
      for(ll i=0;i<w;i++)
	for(ll j=0;j<w;j++)
	  for(ll k=0;k<w;k++)
	    dp[bt+1][j][k]=(dp[bt][j][i]*dp[bt][i][k]+dp[bt+1][j][k])%M;
      
      bt++;
    }

    ll pr=0;

    v.push_back(P(h,-1));

    ll ans[100]={};

    ans[0]=1;
    
    for(ll p=0;p<=n;p++){
      bt=0;
      ll nh=v[p].first-pr;
      pr=v[p].first;
      while((1LL<<bt)<=nh){
	if((1LL<<bt)&nh){
	  ll tmp[100]={};
	  
	  for(ll i=0;i<w;i++)
	    for(ll j=0;j<w;j++)
	      tmp[j]=(tmp[j]+ans[i]*dp[bt][i][j])%M;
	  
	  for(ll i=0;i<w;i++)ans[i]=tmp[i];
	  
	}
	bt++;
      }

      ll yy=v[p].first;

      while(p<=n&&v[p].first==yy){
	if(v[p].second!=-1)ans[v[p].second]=0;
	p++;
      }
      
      p--;
      
    }
    cout<<"Case "<<T++<<": ";
    cout<<ans[w-1]<<endl;

  }



  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:28:13: error: 'bash' was not declared in this scope
   28 |     ll bt=0;bash-4.4$ g++ f.cpp
      |             ^~~~
a.cc:28:18: error: unable to find numeric literal operator 'operator""$'
   28 |     ll bt=0;bash-4.4$ g++ f.cpp
      |                  ^~~~
Language: C++

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <complex>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <stdio.h>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<double> VEC;
typedef vector<VEC> MAT;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
//container util

//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define MT(a,b,c) MP(a, MP(b, c))
#define T1 first
#define T2 second.first
#define T3 second.second

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define MOD 1000000009LL

int n;
map<LL, VI> bar;
VLL bary;
//LL pe[100][10000];

void mulmatmat(LL *l, LL *r, LL *ans){
	REP(i,n){
		FOR(j,i,n){
			REP(k,n){
				ans[i*75+j] = (ans[i*75+j]+l[i*75+k]*r[k*75+j])%MOD;
			}
			ans[j*75+i] = ans[i*75+j];
		}
	}
}

VLL mulmatvec(LL *l, VLL r){
	VLL ans(n,0LL);
	REP(i,n){
		REP(j,n){
			ans[i]+=l[i*75+j]*r[j];
			ans[i]%=MOD;
		}
	}
	return ans;
}

VLL mulmatvec(LL k, VLL r){
	int i=0;
	VLL tr = r;
	while(k){
		if(k&1){
			tr=mulmatvec(pe[i], tr);
		}
		k>>=1;
		i++;
	}
	return tr;
}

int main(){
	int t=1;
	LL h,nb;
	while(scanf("%lld%lld%lld",&n,&h,&nb),n){
		bar.clear();
		bary.clear();
//		memset(pe,0,sizeof(pe));
//		REP(i,n)FOR(j,max(0,i-1),min(n,i+2))pe[0][i*75+j]=1LL;
//		REP(i,65)mulmatmat(pe[i],pe[i],pe[i+1]);
		REP(i,nb){
			LL bx,by;
			scanf("%lld%lld",&bx,&by);
			bar[by].PB(bx);
			bary.PB(by);
		}
/*		bary.PB(h);
		SORT(bary);
		unique(ALL(bary));
		LL cur=1;
		VLL vec(n,0);
		vec[0]=1LL;
		REP(i,bary.size()){
			LL p=bary[i]-cur;
			cur = bary[i];
			vec=mulmatvec(p,vec);
			REP(j,bar[cur].size())vec[bar[cur][j]-1]=0LL;
		}*/
		printf("Case %d: %lld\n", t++, /*vec[n-1]*/5);
	}
	return 0;
}

Compiler output:
a.cc: In function 'VLL mulmatvec(LL, VLL)':
a.cc:100:38: error: 'pe' was not declared in this scope
  100 |                         tr=mulmatvec(pe[i], tr);
      |                                      ^~
Language: Java

class Main{
	int n;
	List<List<Integer>> list;

//	public void run(){
//		Scanner sc=new Scanner(System.in);
//		while(true){
//			n=sc.nextInt();
//			list=new ArrayList<List<Integer>>();
//			for(int i=0;i<n;i++){
//				List<Integer> tmp=new ArrayList<Integer>();
//				int m=sc.nextInt();
//				for(int j=0;j<m;j++){
//					tmp.add(sc.nextInt());
//				}
//				list.add(tmp);
//			}
//			List<Integer> s=new ArrayList<Integer>();
//			int m=sc.nextInt();
//			for(int i=0;i<m;i++){
//				s.add(sc.nextInt());
//			}
//
//			int i=1;
//
//			int val=-1;
//			for(List<Integer> l:list){
//				if(l.containsAll(s)){
//					if(val!=-1){
//						val=-1;
//						break;
//					}
//					val=i;
//				}
//				i++;
//			}
//			pr(val);
//		}
//	}

	public static void pr(Object o){
		System.out.println(o);
	}
	public static void main(String[] _) {
//		new Main().run();
	}
}

Compiler output:
Main.java:44: error: as of release 9, '_' is a keyword, and may not be used as an identifier
	public static void main(String[] _) {
	                                 ^
1 error
Language: C++

results = []

while True:
    N = int(input())
    if N == 0:
        break
       
    A = [list(map(int, input().split())) for _ in range(N)]
    K = list(map(int, input().split()))
    
    count = 0
    for i in range(N):
        tmp = 0
        A[i][0] = -1
        for j in range(K[0]):
            if K[j+1] in A[i]:
                tmp += 1
                
        if tmp == K[0]:
            count += 1
            res = i + 1
    
    if count == 1:
        results.append(res)
    else:
        results.append(-1)
        
for result in results:
    print(result)


Compiler output:
a.cc:1:1: error: 'results' does not name a type
    1 | results = []
      | ^~~~~~~
Language: C++

#include <cstdio>
#include <cassert>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <array>

using namespace std;

#define all(c) begin(c), end(c)
#define dump(c) cerr << "> " << #c << " = " << (c) << endl
#define REP(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;

const int INF = 1001001001;
const double EPS = 1e-10;


template<typename T1,typename T2>
ostream& operator<<(ostream& os, const pair<T1,T2>& p){
  return os << '(' << p.first <<',' << p.second << ')';
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& a){
  os << '[';
  rep(i,a.size()) os << (i ? " " : "") << a[i];
  return os << ']';
}

int main() {
  for(int N; cin >> N, N != 0; ) {
    bitset<100> ps[100];
    rep(i, N) {
      int M; cin >> M;
      rep(j, M) {
        int p; cin >> p;
        ps[i][p - 1] = 1;
      }
    }
    bitset<100> ls;
    int K; cin >> K;
    rep(i, K) {
      int l; cin >> l;
      ls[l - 1] = 1;
    }

    int cnt = 0;
    int ans = -1;
    rep(i, N) {
      if ((ps[i] | ls) == ps[i]) {
        cnt++;
        ans = i;
      }
    }

    if (cnt == 1) cout << ans + 1 << endl;
    else cout << -1 << endl;
  }
  
  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:41:5: error: 'bitset' was not declared in this scope
   41 |     bitset<100> ps[100];
      |     ^~~~~~
a.cc:12:1: note: 'std::bitset' is defined in header '<bitset>'; this is probably fixable by adding '#include <bitset>'
   11 | #include <array>
  +++ |+#include <bitset>
   12 | 
a.cc:41:17: error: 'ps' was not declared in this scope
   41 |     bitset<100> ps[100];
      |                 ^~
a.cc:49:17: error: 'ls' was not declared in this scope; did you mean 'll'?
   49 |     bitset<100> ls;
      |                 ^~
      |                 ll
Language: C++

#include<iostream>
#include<utility>
using namespace std;
bool comp[101][101];
int main(){
  int n;
  int num;
  while(cin>>n,n){
    memset(comp,0,sizeof(comp));
    for(int i=0;i<n;i++){
      cin>>num;
      for(int j=0;j<num;j++){
	int tmp; cin>>tmp;
	comp[i][tmp-1]=true;
      }
    }
    
    cin>>num;
    int list[num];
    int ans = -1;
    for(int i=0;i<num;i++){
      cin>>list[i];
      list[i]--;
    }
    for(int i=0;i<n;i++){
      bool match=true;
      for(int j=0;j<num;j++){
	if(comp[i][list[j]]==false){
	  match=false;
	  break;
	}
      }
	if(match==true){
	  if(ans==-1){
	    ans = i+1;
	  }else{
	    ans=-1;
	    break;
	  }
	}
      }
    cout << ans << endl;
  }
  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:9:5: error: 'memset' was not declared in this scope
    9 |     memset(comp,0,sizeof(comp));
      |     ^~~~~~
a.cc:3:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
    2 | #include<utility>
  +++ |+#include <cstring>
    3 | using namespace std;
Language: C++

#! /usr/bin/env python
# -*- coding: utf-8 -*-

import os
import sys
import itertools
import math
from collections import Counter, defaultdict

class Main(object):
    
    def __init__(self):
        pass

    def solve(self):
        '''
        insert your code
        '''
        while True:
            n = input()
            if n == 0:
                break
            p = []
            for i in range(n):
                p.append(map(int, raw_input().split())[1:])
            l = map(int, raw_input().split())[1:]
            flg = False
            num = -1
            for i in range(n):
                if set(l) <= set(p[i]):
                    if flg:
                        num = -1
                        break
                    else:
                        flg = True
                        num = i + 1
            print num
        return None

if __name__ == '__main__':
    m = Main()
    m.solve()

Compiler output:
a.cc:1:2: error: invalid preprocessing directive #!
    1 | #! /usr/bin/env python
      |  ^
a.cc:2:3: error: invalid preprocessing directive #-
    2 | # -*- coding: utf-8 -*-
      |   ^
a.cc:16:9: error: empty character constant
   16 |         '''
      |         ^~
a.cc:16:11: warning: missing terminating ' character
   16 |         '''
      |           ^
a.cc:16:11: error: missing terminating ' character
a.cc:18:9: error: empty character constant
   18 |         '''
      |         ^~
a.cc:18:11: warning: missing terminating ' character
   18 |         '''
      |           ^
a.cc:18:11: error: missing terminating ' character
a.cc:40:16: warning: multi-character literal with 8 characters exceeds 'int' size of 4 bytes
   40 | if __name__ == '__main__':
      |                ^~~~~~~~~~
a.cc:4:1: error: 'import' does not name a type
    4 | import os
      | ^~~~~~
a.cc:4:1: note: C++20 'import' only available with '-fmodules-ts'
Language: C++

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

int main() {

  while( true ) {

    long long int n;
    cin >> n;
    if ( n == 0 ) break;

    vector< long long int > v0, v1;

    for ( long long int i = 0; i < n+1; i++ ) {

      long long int m;
      cin >> m;

      long long int p0 = 0;
      long long int p1 = 0;

      for ( long long int j = 0; j < m; j++ ) {

	long long int in;
	cin >> in;
	if ( in < 50 ) {
	  p0 += ( 1 << in );
	}else {
	  p1 += ( 1 << ( in - 50 ) );
	}

      }

      v0.push_back( p0 );
      v1.push_back( p1 );

    }

    long long int ans = -1;

    for ( long long int j = 0; j < n; j++ ) {

      if ( ( v0[i] & v0[n] ) == v0[n] && ( v1[i] & v1[n] ) == v1[n] ) {

	if ( ans == -1 ) {
	  ans = i + 1;
	}else {
	  ans = -1;
	  break;
	}

      }

    }

    cout << ans << endl;

  }

  return 0;

}

Compiler output:
a.cc: In function 'int main()':
a.cc:44:17: error: 'i' was not declared in this scope
   44 |       if ( ( v0[i] & v0[n] ) == v0[n] && ( v1[i] & v1[n] ) == v1[n] ) {
      |                 ^
Language: C++

#include <iostream>
#include <vector>

using namespace std;

typedef vector<int> vi;
typedef pair<int,int> pii;

#define dump(x)  cerr << #x << " = " << (x) << endl
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(x) x.begin(),x.end()

bool solve(vi user,vi a){
    bool ret=true;
    rep(i,a.size()){
        if(find(all(user),a[i])==user.end())ret=false;
    }
    return ret;
}


int main(){
    int n;
    while(cin>>n){
        vi user[1000];
        vi loss;
        if(n==0)break;
        rep(i,n){
            int z;
            cin>>z;
            rep(j,z){
                int tmp;
                cin>>tmp;
                user[i].pb(tmp);
            }
            sort(all(user[i]));
        }
        int k;
        cin>>k;
        rep(i,k){
            int tmp;
            cin>>tmp;
            loss.pb(tmp);
        }
        int count=0;
        int ans=-1;
        rep(i,n){
            if(solve(user[i],loss)){
                count++;
                ans=i;
            }
        }
        if(count==1){
            cout<<ans+1<<endl;
        }
        else cout<<"-1"<<endl;
        
    }
    return 0;
}

Compiler output:
a.cc: In function 'bool solve(vi, vi)':
a.cc:17:16: error: no matching function for call to 'find(std::vector<int>::iterator, std::vector<int>::iterator, __gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type&)'
   17 |         if(find(all(user),a[i])==user.end())ret=false;
      |            ~~~~^~~~~~~~~~~~~~~~
In file included from /usr/include/c++/14/bits/locale_facets.h:48,
                 from /usr/include/c++/14/bits/basic_ios.h:37,
                 from /usr/include/c++/14/ios:46,
                 from /usr/include/c++/14/ostream:40,
                 from /usr/include/c++/14/iostream:41,
                 from a.cc:1:
/usr/include/c++/14/bits/streambuf_iterator.h:435:5: note: candidate: 'template<class _CharT2> typename __gnu_cxx::__enable_if<std::__is_char<_CharT2>::__value, std::istreambuf_iterator<_CharT> >::__type std::find(istreambuf_iterator<_CharT>, istreambuf_iterator<_CharT>, const _CharT2&)'
  435 |     find(istreambuf_iterator<_CharT> __first,
      |     ^~~~
/usr/include/c++/14/bits/streambuf_iterator.h:435:5: note:   template argument deduction/substitution failed:
a.cc:17:16: note:   '__gnu_cxx::__normal_iterator<int*, std::vector<int> >' is not derived from 'std::istreambuf_iterator<_CharT>'
   17 |         if(find(all(user),a[i])==user.end())ret=false;
      |            ~~~~^~~~~~~~~~~~~~~~
a.cc: In function 'int main()':
a.cc:37:13: error: 'sort' was not declared in this scope; did you mean 'short'?
   37 |             sort(all(user[i]));
      |             ^~~~
      |             short
Language: C++

//
//  main.cpp
//  c
//
//  Created by 13B10694 on 2015/06/01.
//  Copyright (c) 2015??´ 13B10694. All rights reserved.
//

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

vector< vector<int> > vec;
vector<int> vect;
int main(int argc, const char * argv[]) {
    freopen(")
    int n, in, m, k;
    while(cin>>n,n){
        vec.clear();
        vect.clear();
        for(int i=0;i<n;i++){
            cin>>m;
            vector<int> tem;
            for(int j=0;j<m;j++){
                cin>>in;
                tem.push_back(in);
            }
            sort(tem.begin(),tem.end());
            vec.push_back(tem);
        }
        cin>>k;
        for(int i=0;i<k;i++){
            cin>>in;
            vect.push_back(in);
        }
        sort(vect.begin(),vect.end());
        int suc=0,po=-1;
        for(int i=0;i<vec.size();i++){
            
            if(vec[i].size()==0&&vect.size()!=0)continue;
            int now=0;
            int j;int out =0,count=0;
            for(j=0;j<vect.size();j++){
                
                while(vect[j]>vec[i][now]){
                    now++;
                    if(now >= vec[i].size()){
                        out=1;
                        break;
                    }
                }
                
                if(vect[j]<vec[i][now]||out==1)
                    break;
                if(vect[j]==vec[i][now]){
                    now++;count++;
                }
            }
            if(out==1)continue;
            if(vect[vect.size()-1]==vec[i][now-1]&&count==(int)vect.size()){
                suc++;
                po = i+1;
            }
        }
        if(suc==1){
            cout<<po<<endl;
        }
        else{
            cout<< " " << -1<<endl;
        }
    }
    
    return 0;
}

Compiler output:
a.cc:17:13: warning: missing terminating " character
   17 |     freopen(")
      |             ^
a.cc:17:13: error: missing terminating " character
   17 |     freopen(")
      |             ^~
a.cc:70:27: error: stray '\23' in program
   70 |             cout<< " " << <U+0013>-1<<endl;
      |                           ^~~~~~~~
a.cc: In function 'int main(int, const char**)':
a.cc:18:5: error: expected primary-expression before 'int'
   18 |     int n, in, m, k;
      |     ^~~
a.cc:18:12: error: 'in' was not declared in this scope; did you mean 'int'?
   18 |     int n, in, m, k;
      |            ^~
      |            int
a.cc:18:16: error: 'm' was not declared in this scope; did you mean 'tm'?
   18 |     int n, in, m, k;
      |                ^
      |                tm
a.cc:18:19: error: 'k' was not declared in this scope
   18 |     int n, in, m, k;
      |                   ^
a.cc:19:16: error: 'n' was not declared in this scope
   19 |     while(cin>>n,n){
      |                ^
Language: C++

//
//  main.cpp
//  c
//
//  Created by 13B10694 on 2015/06/01.
//  Copyright (c) 2015??´ 13B10694. All rights reserved.
//

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

vector< vector<int> > vec;
vector<int> vect;
int main(int argc, const char * argv[]) {
 //   freopen(")
    int n, in, m, k;
    while(cin>>n,n){
        vec.clear();
        vect.clear();
        for(int i=0;i<n;i++){
            cin>>m;
            vector<int> tem;
            for(int j=0;j<m;j++){
                cin>>in;
                tem.push_back(in);
            }
            sort(tem.begin(),tem.end());
            vec.push_back(tem);
        }
        cin>>k;
        for(int i=0;i<k;i++){
            cin>>in;
            vect.push_back(in);
        }
        sort(vect.begin(),vect.end());
        int suc=0,po=-1;
        for(int i=0;i<vec.size();i++){
            
            if(vec[i].size()==0&&vect.size()!=0)continue;
            int now=0;
            int j;int out =0,count=0;
            for(j=0;j<vect.size();j++){
                
                while(vect[j]>vec[i][now]){
                    now++;
                    if(now >= vec[i].size()){
                        out=1;
                        break;
                    }
                }
                
                if(vect[j]<vec[i][now]||out==1)
                    break;
                if(vect[j]==vec[i][now]){
                    now++;count++;
                }
            }
            if(out==1)continue;
            if(vect[vect.size()-1]==vec[i][now-1]&&count==int(vect.size())){
                suc++;
                po = i+1;
            }
        }
        if(suc==1){
            cout<<po<<endl;
        }
        else{
            cout<< " " << -1<<endl;
        }
    }
    
    return 0;
}

Compiler output:
a.cc:70:27: error: stray '\23' in program
   70 |             cout<< " " << <U+0013>-1<<endl;
      |                           ^~~~~~~~
Language: C++

//
//  main.cpp
//  c
//
//  Created by 13B10694 on 2015/06/01.
//  Copyright (c) 2015??´ 13B10694. All rights reserved.
//

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

vector< vector<int> > vec;
vector<int> vect;
int main(int argc, const char * argv[]) {
    int n, in, m, k;
    while(cin>>n,n){
        vec.clear();
        vect.clear();
        for(int i=0;i<n;i++){
            cin>>m;
            vector<int> tem;
            for(int j=0;j<m;j++){
                cin>>in;
                tem.push_back(in);
            }
            sort(tem.begin(),tem.end());
            vec.push_back(tem);
        }
        cin>>k;
        for(int i=0;i<k;i++){
            cin>>in;
            vect.push_back(in);
        }
        sort(vect.begin(),vect.end());
        int suc=0,po=-1;
        for(int i=0;i<vec.size();i++){
            
	  if(vec[i].empty() && !vect.empty())continue;
	  int now=0;
	  int j;int out =0,count=0;
	  for(j=0;j<vect.size();j++){
	    
	    while(vect[j]>vec[i][now]){
	      now++;
	      if(now >= (int)vec[i].size()){
		out=1;
		break;
	      }
	    }
            
	    if(vect[j]<vec[i][now]||out==1)
	      break;
	    if(vect[j]==vec[i][now]){
	      now++;count++;
	    }
	  }
	  if(out==1)continue;
	  

	  // if(vect[vect.size()-1]==vec[i][now-1]&&count==(int)vect.size()){
	  if((int)vect.size() == count) {
	    suc++;
	    po = i+1;
//	    cout << "=======" << i << endl;
//	    cout<<out<<endl;
//	    for(int j=0; j<vec[i].size(); j++) cout << vec[i][j] << " ";
//	    cout << endl;
//	    for(int j=0; j<vect.size(); j++) cout << vect[j] << " ";
//	    cout << endl;
//       	  }
//        }
//        if(suc==1){
//	  cout<<po<<endl;
//        }
//        else{
//	  cout << -1<<endl;
//        }
          int mamam=out;
      }
    
    return 0;
}

Compiler output:
a.cc: In function 'int main(int, const char**)':
a.cc:84:2: error: expected '}' at end of input
   84 | }
      |  ^
a.cc:18:20: note: to match this '{'
   18 |     while(cin>>n,n){
      |                    ^
a.cc:84:2: error: expected '}' at end of input
   84 | }
      |  ^
a.cc:16:41: note: to match this '{'
   16 | int main(int argc, const char * argv[]) {
      |                                         ^
Language: C++

//
//  main.cpp
//  c
//
//  Created by 13B10694 on 2015/06/01.
//  Copyright (c) 2015??´ 13B10694. All rights reserved.
//

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

vector< vector<int> > vec;
vector<int> vect;
int main(int argc, const char * argv[]) {
    int n, in, m, k;
    while(cin>>n,n){
        vec.clear();
        vect.clear();
        for(int i=0;i<n;i++){
            cin>>m;
            vector<int> tem;
            for(int j=0;j<m;j++){
                cin>>in;
                tem.push_back(in);
            }
            sort(tem.begin(),tem.end());
            vec.push_back(tem);
        }
        cin>>k;
        for(int i=0;i<k;i++){
            cin>>in;
            vect.push_back(in);
        }
        sort(vect.begin(),vect.end());
        int suc=0,po=-1;
        for(int i=0;i<vec.size();i++){
            
	  if(vec[i].empty() && !vect.empty())continue;
	  int now=0;
	  int j;int out =0,count=0;
	  for(j=0;j<vect.size();j++){
	    
	    while(vect[j]>vec[i][now]){
	      now++;
	      if(now >= (int)vec[i].size()){
		out=1;
		break;
	      }
	    }
            
	    if(vect[j]<vec[i][now]||out==1)
	      break;
	    if(vect[j]==vec[i][now]){
	      now++;count++;
	    }
	  }
	  if(out==1)continue;
	  

	  // if(vect[vect.size()-1]==vec[i][now-1]&&count==(int)vect.size()){
	  if((int)vect.size() == count) {
	    suc++;
	    po = i+1;
//	    cout << "=======" << i << endl;
//	    cout<<out<<endl;
//	    for(int j=0; j<vec[i].size(); j++) cout << vec[i][j] << " ";
//	    cout << endl;
//	    for(int j=0; j<vect.size(); j++) cout << vect[j] << " ";
//	    cout << endl;
//       	  }
        }
        if(suc==1){
	  cout<<po<<endl;
        }
        else{
	  cout << -1<<endl;
        }
          int mamam=out;
      }
    
    return 0;
}

Compiler output:
a.cc: In function 'int main(int, const char**)':
a.cc:84:2: error: expected '}' at end of input
   84 | }
      |  ^
a.cc:16:41: note: to match this '{'
   16 | int main(int argc, const char * argv[]) {
      |                                         ^
Language: C++

//
//  main.cpp
//  c
//
//  Created by 13B10694 on 2015/06/01.
//  Copyright (c) 2015???´ 13B10694. All rights reserved.
//

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

vector< vector<int> > vec;
vector<int> vect;
int main(int argc, const char * argv[]) {
    
    int n, in, m, k;
    while(cin>>n,n){
        vec.clear();
        vect.clear();
        for(int i=0;i<n;i++){
            cin>>m;
            vector<int> tem;
            for(int j=0;j<m;j++){
                cin>>in;
                tem.push_back(in);
            }
            sort(tem.begin(),tem.end());
            vec.push_back(tem);
        }
        cin>>k;
        for(int i=0;i<k;i++){
            cin>>in;
            vect.push_back(in);
        }
        sort(vect.begin(),vect.end());
        int suc=0,po=-1;
        for(int i=0;i<vec.size();i++){
            
            if(vec[i].empty() && !vect.empty())continue;
            int now=0;
            int j;int out =0,count=0;
            for(j=0;j<vect.size();j++){
                
                while(vect[j]>vec[i][now]){
                    now++;
                    if(now >= (int)vec[i].size()){
                        out=1;
                        break;
                    }
                }
                
                if(vect[j]<vec[i][now]||out==1)
                    break;
                if(vect[j]==vec[i][now]){
                    now++;count++;
                }
            }
           // cout<<"out:  "<<out<<"     count:  "<<count<<endl;
            if(out==1){continue;}
            //cout<<"out:  "<<out<<"     count:  "<<count<<endl;
            
            // if(vect[vect.size()-1]==vec[i][now-1]&&count==(int)vect.size()){
            if((int)vect.size() == count) {
                suc++;
                po = i+1;
//                cout<<"out: "<<out<<endl;
//                      cout << "=======" << i << endl;
//                      cout<<out<<endl;
//                      for(int j=0; j<vec[i].size(); j++) cout << vec[i][j] << " ";
//                      cout << endl;
//                      for(int j=0; j<vect.size(); j++) cout << vect[j] << " ";
//                      cout << endl;
                
            }
        }
        int fai= -1;
        if(suc==1){
            cout<< po <<endl;
        }
        else{
            cout << fail <<endl;
        }
        
    }
    
    return 0;
}

Compiler output:
a.cc: In function 'int main(int, const char**)':
a.cc:83:21: error: 'fail' was not declared in this scope; did you mean 'fai'?
   83 |             cout << fail <<endl;
      |                     ^~~~
      |                     fai
Language: C++

#include <iostream>
#include <vector>

using namespace std;


int main(){
  int n, m, k;
  vector< vector<int> > v;
  vector<int> leakage;
  vector<int> answer;
  while(true){
    cin >> n;
    if (n == 0)
    {
      break;
    }
    v.reserve(n);
    for (int i = 0; i < n; ++i)
    {
      cin >> m;
      v[i].resize(m);
      for (int j = 0; j < m; ++j)
      {
        cin >> v[i][j];
      }
    }
    cin >> k;
    leakage.reserve(k);
    for (int i = 0; i < k; ++i)
    {
      cin >> leakage[i];
    }
    for (int i = 0; i < v.size(); ++i)
    {
      for (int k = 0; k < leakage.size() ; ++k)
      {
        bool flag = false;
        for (int j = 0; j < v[i].size; ++j)
        {
          if (v[i][j] == leakage[k])
          {
            flag = true;
            break;
          }
        }
        if (flag == false){
          break;
        }
      }
      answer.push_back(i+1);
    }
    if (answer.size() == 1){
      cout << answer[0] << endl;
    }else{
      cout << -1 << endl;
    }
    v.clear();
    leakage.clear();
    answer.clear();
  }
}

Compiler output:
a.cc: In function 'int main()':
a.cc:39:34: error: invalid use of member function 'std::vector<_Tp, _Alloc>::size_type std::vector<_Tp, _Alloc>::size() const [with _Tp = int; _Alloc = std::allocator<int>; size_type = long unsigned int]' (did you forget the '()' ?)
   39 |         for (int j = 0; j < v[i].size; ++j)
      |                                      ()