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

#include <iostream>
#include <stdlib.h>
#include <string>
#include <math.h>
#include<algorithm>

using namespace std;

int main(void)
{

    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);

    long long max = -9999999999;
    int n,i;
    int f[101][11];
    long long p[101][11];
    cin >> n;
    for (i = 1; i <= n;i++)
    {
        int j;
        for (j = 1; j <= 10; j++)
        cin >> f[i][j];
    }
    for (i = 1; i <= n;i++)
    {
        int j;
        for (j = 0; j <= 10; j++)
        cin >> p[i][j];
    }
    for (int i1 = 0; i1 <= 1; i1 ++)
    for (int i2 = 0; i2 <= 1; i2 ++)
    for (int i3 = 0; i3 <= 1; i3 ++)
    for (int i4 = 0; i4 <= 1; i4 ++)
    for (int i5 = 0; i5 <= 1; i5 ++)
    for (int i6 = 0; i6 <= 1; i6 ++)
    for (int i7 = 0; i7 <= 1; i7 ++)
    for (int i8 = 0; i8 <= 1; i8 ++)
    for (int i9 = 0; i9 <= 1; i9 ++)
    for (int i10 = 0; i10 <= 1; i10 ++)
    if ((i1 + i2 + i3 + i4 + i5 + i6 + i7 + i8 + i9 + i10) != 0)
    {
        int j;
        long long date[101];
        long long answ = 0;
        memset(date,0,sizeof date);
        for (j = 1; j <= n; j++)
        {
            if ((f[j][1] == i1) && (i1 == 1))
            date[j]++;
        }
        for (j = 1; j <= n; j++)
        {
            if ((f[j][2] == i2) && (i2 == 1))
            date[j]++;
        }
        for (j = 1; j <= n; j++)
        {
            if ((f[j][3] == i3) && (i3 == 1))
            date[j]++;
        }
        for (j = 1; j <= n; j++)
        {
            if ((f[j][4] == i4) && (i4 == 1))
            date[j]++;
        }
        for (j = 1; j <= n; j++)
        {
            if ((f[j][5] == i5) && (i5 == 1))
            date[j]++;
        }
        for (j = 1; j <= n; j++)
        {
            if ((f[j][6] == i6) && (i6 == 1))
            date[j]++;
        }for (j = 1; j <= n; j++)
        {
            if ((f[j][7] == i7) && (i7 == 1))
            date[j]++;
        }
        for (j = 1; j <= n; j++)
        {
            if ((f[j][8] == i8) && (i8 == 1))
            date[j]++;
        }
        for (j = 1; j <= n; j++)
        {
            if ((f[j][9] == i9) && (i9 == 1))
            date[j]++;
        }
        for (j = 1; j <= n; j++)
        {
            if ((f[j][10] == i10) && (i10 == 1))
            date[j]++;
        }
        for (j = 1; j <= n; j++)
        {
            answ = answ + p[j][date[j]];
        }
        if (answ > max)
        max = answ;
    }
    cout << max;
    return 0;
}

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

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

#define ll long long
int N;
int F[101][15];
int P[101][14];
int one( int b){
	ll sum=0;
	for (int i=0;i<N;i++){
		int c = 0;
		for(int j=0;j<10;j++)if((b>>j&1)&&F[i][j])c++;
		sum+=P[i][c];
	}
	return sum;
}

int main(){
	cin >> N;

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

	for(int i=0;i<N;i++){
		for(int j=0;j<11;j++){
			cin >> P[i][j];
		}
	}
	ll ans=-10000008;
	for(int b=1;b<(1 << 10);b++){
		ans = max(ans,one(b));
	}
	cout << ans << endl;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:34:26: error: no matching function for call to 'max(long long int&, int)'
   34 |                 ans = max(ans,one(b));
      |                       ~~~^~~~~~~~~~~~
In file included 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_algobase.h:257:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  257 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:257:5: note:   template argument deduction/substitution failed:
a.cc:34:26: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   34 |                 ans = max(ans,one(b));
      |                       ~~~^~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algobase.h:303:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  303 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:303:5: note:   candidate expects 3 arguments, 2 provided
In file included from /usr/include/c++/14/algorithm:61:
/usr/include/c++/14/bits/stl_algo.h:5706:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(initializer_list<_Tp>)'
 5706 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5706:5: note:   candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_algo.h:5716:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(initializer_list<_Tp>, _Compare)'
 5716 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5716:5: note:   template argument deduction/substitution failed:
a.cc:34:26: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   34 |                 ans = max(ans,one(b));
      |                       ~~~^~~~~~~~~~~~
Language: C++

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

typedef ll long long
int N;
int F[101][15];
int P[101][14];
int one( int b){
	ll sum=0;
	for (int i=0;i<N;i++){
		int c = 0;
		for(int j=0;j<10;j++)if((b>>j&1)&&F[i][j])c++;
		sum+=P[i][c];
	}
	return sum;
}

int main(){
	cin >> N;

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

	for(int i=0;i<N;i++){
		for(int j=0;j<11;j++){
			cin >> P[i][j];
		}
	}
	ll ans=-10000008;
	for(int b=1;b<(1 << 10);b++){
		ans = max(ans,one(b));
	}
	cout << ans << endl;
}


Compiler output:
a.cc:4:9: error: 'll' does not name a type
    4 | typedef ll long long
      |         ^~
a.cc: In function 'int one(int)':
a.cc:9:9: error: 'll' was not declared in this scope
    9 |         ll sum=0;
      |         ^~
a.cc:10:24: error: 'N' was not declared in this scope
   10 |         for (int i=0;i<N;i++){
      |                        ^
a.cc:13:17: error: 'sum' was not declared in this scope
   13 |                 sum+=P[i][c];
      |                 ^~~
a.cc:15:16: error: 'sum' was not declared in this scope
   15 |         return sum;
      |                ^~~
a.cc: In function 'int main()':
a.cc:19:16: error: 'N' was not declared in this scope
   19 |         cin >> N;
      |                ^
a.cc:32:9: error: 'll' was not declared in this scope
   32 |         ll ans=-10000008;
      |         ^~
a.cc:34:17: error: 'ans' was not declared in this scope; did you mean 'abs'?
   34 |                 ans = max(ans,one(b));
      |                 ^~~
      |                 abs
a.cc:36:17: error: 'ans' was not declared in this scope; did you mean 'abs'?
   36 |         cout << ans << endl;
      |                 ^~~
      |                 abs
Language: C++

#include <iostream>
#include <algorithm>
#include <map>
#include <vector>
#include <queue>
#include <string>
#define INF LLONG_MIN
#define int long long
#define P pair<int,int>
#define vec vector<int>
#define rep(i,n) for(int i=0;i<n;i++)
#define vsort(vec) sort(vec.begin(),vec.end())
using namespace std;
signed main() {
	int n, f[100][10], p[100][11];
	cin >> n;
	rep(i, n) {
		rep(j, 10) {
			cin >> f[i][j];
		}
	}
	rep(i, n) {
		rep(j, 11) {
			cin >> p[i][j];
		}
	}
	int ans = INF;

	system("PAUSE");
	return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:7:13: error: 'LLONG_MIN' was not declared in this scope
    7 | #define INF LLONG_MIN
      |             ^~~~~~~~~
a.cc:27:19: note: in expansion of macro 'INF'
   27 |         int ans = INF;
      |                   ^~~
a.cc:6:1: note: 'LLONG_MIN' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
    5 | #include <queue>
  +++ |+#include <climits>
    6 | #include <string>
Language: C++

#include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>

using namespace std;
typedef long long ll;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

// char to int
int ctoi(char c) {
	if (c >= '0' && c <= '9') {
		return c - '0';
	}
	return 0;
}

const int FLAG_NUM = 10;
// 1023 => 1111 1111
vector<int> num_to_flags(int x){
    stringstream ss;
    ss << static_cast<bitset<FLAG_NUM> >(x);
    string s = ss.str();
    vector<int> V(FLAG_NUM);
    FOR(i, 0, FLAG_NUM){
        V[i] = ctoi(s[i]);
    }
    return V;
}

void pV(vector<int> v){
    for(auto a : v){
        cout << a << " ";
    }
    cout << endl;
}

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

    // input
    int N;
    cin >> N;

    vector<vector<int> > F(N);
    FOR(i, 0, N){
        FOR(j, 0, 10){
            int f;
            cin >> f;
            F[i].push_back(f);
        }
    }

    vector<vector<int> > P(N);
    FOR(i, 0, N){
        FOR(j, 0, 11){
            int p;
            cin >> p;
            P[i].push_back(p);
        }
    }

    ll max_profit = -inf;
    FOR(i, 1, 1024){
        auto flags = num_to_flags(i);

        ll profit_sum = 0;
        FOR(j, 0, N){
            auto tenpo = F[j];
            int both_work = 0;
            FOR(k, 0, 10){
                if(tenpo[k]==1 && flags[k]==1){
                    both_work++;
                }
            }
            int profit = P[j][both_work];
            profit_sum += profit;
        }
        max_profit = max(max_profit, profit_sum);
    }

    p(max_profit);
    
    return 0;
}

Compiler output:
a.cc: In function 'std::vector<int> num_to_flags(int)':
a.cc:43:23: error: 'bitset' does not name a type
   43 |     ss << static_cast<bitset<FLAG_NUM> >(x);
      |                       ^~~~~~
a.cc:43:29: error: expected '>' before '<' token
   43 |     ss << static_cast<bitset<FLAG_NUM> >(x);
      |                             ^
a.cc:43:29: error: expected '(' before '<' token
   43 |     ss << static_cast<bitset<FLAG_NUM> >(x);
      |                             ^
      |                             (
a.cc:43:29: error: expected primary-expression before '<' token
a.cc:43:40: error: expected primary-expression before '>' token
   43 |     ss << static_cast<bitset<FLAG_NUM> >(x);
      |                                        ^
a.cc:43:44: error: expected ')' before ';' token
   43 |     ss << static_cast<bitset<FLAG_NUM> >(x);
      |                                            ^
      |                                            )
Language: C++

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

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

    int k;
    int f[n];
    fill(f, f+n, 0);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < 10; j++) {
            cin >> k;
            if (k == 1) f[i] |= (1<<j);
        }
    }

    int p[n][11];
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < 11; j++) {
            cin >> p[i][j];
        }
    }

    int ans;
    int tmp_ans;
    ans = INT_MIN;

    for (int i = 1; i < 1<<10; i++) {
        tmp_ans = 0;

        for (int j = 0; j < n; j++) {
            tmp_ans += p[j][__builtin_popcount(i&f[j])];
        }

        ans = max(ans, tmp_ans);
    }

    cout << ans << endl;
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:30:11: error: 'INT_MIN' was not declared in this scope
   30 |     ans = INT_MIN;
      |           ^~~~~~~
a.cc:5:1: note: 'INT_MIN' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
    4 | #include <vector>
  +++ |+#include <climits>
    5 | using namespace std;
Language: C++

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <time.h>
#include <list>

using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define reps(x,c) for(auto x:c)
#define all(x) begin(x), end(x)
#define pb(a) emplace_back(a) 
#define mp(a,b) make_pair((a),(b))
#define pl pair<ll,ll>
#define INF 2147483600
#define MOD 1000000007
#define fi first
#define se second
#define dbg(x) cout << #x"="<< (x) << endl
#define dbgv(x) cout<<#x<<endl;reps(y,x){cout<<y<<" ";}cout<<endl

int main(){

  ll n;cin>>n;
  vector<vector<ll>> f(n,vector<ll>(10));
  vector<vector<ll>> p(n,vector<ll>(10));
  rep(i,n){
    rep(j,10){
      cin>>f[i][j];
    }
  }
  rep(i,n){
    rep(j,11){
      cin>>p[i][j];
    }
  }
  ll cnt=0;
  string s;
  ll ans=-INF,temp_ans=0;
  FOR(i,1,1024){
    temp_ans=0;
    s=(bitset<10>(i)).to_string();
    rep(j,n){
      cnt=0;
      rep(k,10){
        if(s[k]=='1'&&f[j][k]){
          cnt++;
        }
      }
      temp_ans+=p[j][cnt];
    }
    ans=max(temp_ans,ans);
  }

  cout<<ans<<endl;
  
  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:49:8: error: 'bitset' was not declared in this scope
   49 |     s=(bitset<10>(i)).to_string();
      |        ^~~~~~
a.cc:12:1: note: 'std::bitset' is defined in header '<bitset>'; this is probably fixable by adding '#include <bitset>'
   11 | #include <list>
  +++ |+#include <bitset>
   12 |
Language: C++

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <time.h>
#include <list>

using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define reps(x,c) for(auto x:c)
#define all(x) begin(x), end(x)
#define pb(a) emplace_back(a) 
#define mp(a,b) make_pair((a),(b))
#define pl pair<ll,ll>
#define INF 2147483600
#define MOD 1000000007
#define fi first
#define se second
#define dbg(x) cout << #x"="<< (x) << endl
#define dbgv(x) cout<<#x<<endl;reps(y,x){cout<<y<<" ";}cout<<endl

int main(){

  ll n;cin>>n;
  vector<vector<ll>> f(n,vector<ll>(10));
  vector<vector<ll>> p(n,vector<ll>(10));
  rep(i,n){
    rep(j,10){
      cin>>f[i][j];
    }
  }
  rep(i,n){
    rep(j,11){
      cin>>p[i][j];
    }
  }
  ll cnt=0;
  string s;
  ll ans=-INF,temp_ans=0;
  FOR(i,1,1024){
    temp_ans=0;
    s=bitset<10>(i).to_string();
    rep(j,n){
      cnt=0;
      rep(k,10){
        if(s[k]=='1'&&f[j][k]){
          cnt++;
        }
      }
      temp_ans+=p[j][cnt];
    }
    ans=max(temp_ans,ans);
  }

  cout<<ans<<endl;
  
  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:49:7: error: 'bitset' was not declared in this scope
   49 |     s=bitset<10>(i).to_string();
      |       ^~~~~~
a.cc:12:1: note: 'std::bitset' is defined in header '<bitset>'; this is probably fixable by adding '#include <bitset>'
   11 | #include <list>
  +++ |+#include <bitset>
   12 | 
a.cc:49:21: error: request for member 'to_string' in 'i', which is of non-class type 'int'
   49 |     s=bitset<10>(i).to_string();
      |                     ^~~~~~~~~
Language: C++

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
using namespace std;
typedef long long unsigned int ll;

#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)

#define C_MAX 30
#define N_MAX 100000

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

  bool r[N_MAX][C_MAX];

  REP(i, N_MAX){
    REP(j, C_MAX){
      r[i][j] = 0;
    }
  }

  int min_x = N_MAX;
  int max_y = 0;
  REP(i, n){
    int x, y, z;
    cin >> x >> y >> z;
    FOR(j, x - 1, y - 1){
      r[j][z - 1] = 1;
    }
    min_x = min(min_x, x - 1);
    max_y = max(max_y, y - 1);
  }

  int ans = 1;
  FOR(i, min_x, max_y){
    ans = max(ans, std::accumulate(r[i], r[i] + C_MAX, 0));
  }

  cout << ans << endl;

  return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:56:25: error: 'accumulate' is not a member of 'std'
   56 |     ans = max(ans, std::accumulate(r[i], r[i] + C_MAX, 0));
      |                         ^~~~~~~~~~
Language: C

#include <stdio.h>
#include <string>
#include <iostream>
#include <iomanip>
#include <map>
#include <algorithm>
#include <vector>
using namespace std;

int main(void) {
	int n;
	cin >> n;
	int open[101][10];
	for(int i=0; i<n; i++){
		for(int j=0; j<10; j++){
			cin >> open[i][j];
		}
	}
	int profit[101][11];
	for(int i=0; i<n; i++){
		for(int j=0; j<=10; j++){
			cin >> profit[i][j];
		}
	}

	int ans=-1000000000,sum;
	for(int i=1; i<1<<10; i++){
		sum=0;
		for(int j=0; j<n; j++){
			int count=0;
			for(int k=0; k<10; k++){
				if(i>>k&1 && open[j][k])count++;
			}
			sum+=profit[j][count];
		}
		ans=max(ans,sum);
	}
	cout << ans << endl;
	return 0;
}


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

#include <stdio.h>
#include <string>
#include <iostream>
#include <iomanip>
#include <map>
#include <algorithm>
#include <vector>
using namespace std;

int main(void) {
	int n;
	int open[101][10];
	int profit[101][11];
	cin >> n;
	for(int i=0; i<n; i++){
		for(int j=0; j<10; j++){
			cin >> open[i][j];
		}
	}
	for(int i=0; i<n; i++){
		for(int j=0; j<=10; j++){
			cin >> profit[i][j];
		}
	}
	long long maxi=-100000000;
	long long sum;
	for(int i=1; i<(1<<10); i++){
		sum=0;
		for(int j=0; j<n; j++){
			int count=0;
			for(int k=0; k<10; k++){
				if((i&(1<<k)) && open[j][k])count++;
			}
			sum+=profit[j][count];
		}
		maxi=max(sum,maxi);
	}
	cout << maxi << endl;
	return 0;
}


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

#include <iostream>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>

#define rep(i, N) for(int (i) = 0; (i) < (N); (i) ++)
typedef long long ll;
using namespace std;

typedef vector<vector<int>> vii;


int main(){
    int N;
    cin >> N;
    vector<bitset<10>> fs = vector<bitset<10>> (N, bitset<10> (0));
    vector<vector<int>> ps = vector<vector<int>> (N, vector<int> (10 + 1));
    rep(i, N){
        rep(j, 10){
            int tmp;
            cin >> tmp;
            if(tmp){
                fs[i].set(j);
            }
        }

    }

    rep(i, N){
        rep(j, 10 + 1){
            int tmp;
            cin >> tmp;
            ps[i][j] = tmp;
        }
    }

    int max_p = (1 << 10) - 1;
    ll ans = -1e10;
    for(int i = 1; i =< max_p; i++){
        bitset<10> tmp(i);
        ll  sum = 0;
        rep(j, N){
            int size = (fs[j] & tmp).count();
            //bit_set<size>でsizeが定数なりで型が同じでないとつかえない.
            sum += ps[j][size];
        }
        ans = max(sum, ans);
    }

    cout << ans << endl;

    return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:40:23: error: expected primary-expression before '<' token
   40 |     for(int i = 1; i =< max_p; i++){
      |                       ^
Language: C++

#include<iostream>
#include<array>
#include<vector>
#include <algorithm>
#include <stdio.h>
#include <string>
using namespace std;

namespace CsF {
	string ConvertBit(int N, int e) {
		string s = "";
		int r = 0;
		while (N != 0) {
			r = N % e;
			s = to_string(r) + s;
			N -= r;
			N /= e;
		}
		return s;
	}
}

using namespace CsF;


int main() {
	int N;
	cin >> N;
	array<array<int, 10>, 100> F;
	array<array<int, 11>, 100> P;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < 10; j++)cin >> F[i][j];
	}
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < 11; j++)cin >> P[i][j];
	}
	array<int, 10> box;
	string s;
	int max = 0;
	int ans = INT_MIN;
	int count = 0;
	for (int bit = 1; bit < 1024; bit++) {
		s = ConvertBit(bit, 2);
		for (int i = s.length(); i < 10; i++) {
			s = "0" + s;
		}
		for (int i = 0; i < 10; i++) {
			box[i] = stoi(string() + s[i]);
		}
		for (int i = 0; i < N; i++) {
			count = 0;
			for (int j = 0; j < 10; j++) {
				if (box[j] == F[i][j] && box[j] == 1)count++;
			}
			max += P[i][count];
		}
		if (ans < max)ans = max;
		max = 0;
	}
	cout << ans << endl;
	return 0;
}



Compiler output:
a.cc: In function 'int main()':
a.cc:40:19: error: 'INT_MIN' was not declared in this scope
   40 |         int ans = INT_MIN;
      |                   ^~~~~~~
a.cc:5:1: note: 'INT_MIN' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
    4 | #include <algorithm>
  +++ |+#include <climits>
    5 | #include <stdio.h>
Language: C++

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

void main() {
	int N;
	cin >> N;
	int F[100][10];
	int P[100][11];
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < 10; j++)cin >> F[i][j];
	}
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < 11; j++)cin >> P[i][j];
	}
	int count = 0;
	int ans = 0;
	int max = -(1 << 10);
	int m_p = 0;
	bool s = true;
	for (int i = 0; i < N; i++) {
		count = 0;
		for (int j = 0; j < 10; j++)count += (F[i][j] == 1 ? 1 : 0);
		count = (count == 0 ? 1 : count);
		max = -(1 << 10);
		m_p = 0;
		for (int j = 0; j <= count; j++) {
			if (max < P[i][j]) {
				max = P[i][j];
				m_p = j;
			}
		}
		if (m_p != 0)s = false;
		ans += max;
	}
	if (s) {
		max = -(1 << 10);
		int min = (1 << 10);
		for (int i = 0; i < N; i++) {
			count = 0;
			for (int j = 0; j < 10; j++)count += (F[i][j] == 1 ? 1 : 0);
			count = (count == 0 ? 1 : count);
			for (int j = 1; j < count; j++) {
				if (max < P[i][j])max = P[i][j];
			}
			if (min > P[i][0])min = P[i][0];
		}
		ans += max;
		ans -= min;
	}
	cout << ans << endl;
}



Compiler output:
a.cc:6:1: error: '::main' must return 'int'
    6 | void main() {
      | ^~~~
Language: C++

#include <iostream>
#include <vector>
#include <climits>

using ll = long long;
#define int ll

using namespace std;

int main(void){
	int n;
	cin >> n;
	vector<int> f(n, 0);
	vector<vector<int> > p(n, vector<int>(11));
	for(auto& fi : f){
		for(int i = 0; i < 10; i++){
			int t;
			cin >> t;
			fi <<= 1;
			fi += t;
		}
	}
	for(auto& pi : p){
		for(auto& pii : pi){
			cin >> pii;
		}
	}
	int m = INT_MIN;
	for(int i = 0; i < 1<<10; i++){
		int t = 0;
		for(int j = 0; j < n; j++){
			int c = 0;
			for(int fi = f[j] & i; fi; fi >>= 1){
				c += fi & 1;
			}
			t += p[j][c];
		}
		m = max(m, t);
	}
	cout << m << endl;
	return 0;
}


Compiler output:
a.cc:6:13: error: '::main' must return 'int'
    6 | #define int ll
      |             ^~
a.cc:10:1: note: in expansion of macro 'int'
   10 | int main(void){
      | ^~~
Language: C++

#include <iostream>
#include <vector>
#include <climits>

using ll = long long
#define int ll

using namespace std;

int main(void){
	int n;
	cin >> n;
	vector<int> f(n, 0);
	vector<vector<int> > p(n, vector<int>(11));
	for(auto& fi : f){
		for(int i = 0; i < 10; i++){
			int t;
			cin >> t;
			fi <<= 1;
			fi += t;
		}
	}
	for(auto& pi : p){
		for(auto& pii : pi){
			cin >> pii;
		}
	}
	int m = INT_MIN;
	for(int i = 0; i < 1<<10; i++){
		int t = 0;
		for(int j = 0; j < n; j++){
			int c = 0;
			for(int fi = f[j] & i; fi; fi >>= 1){
				c += fi & 1;
			}
			t += p[j][c];
		}
		m = max(m, t);
	}
	cout << m << endl;
	return 0;
}


Compiler output:
a.cc:5:21: error: expected ';' before 'using'
    5 | using ll = long long
      |                     ^
      |                     ;
......
    8 | using namespace std;
      | ~~~~~                
a.cc:6:13: error: 'll' does not name a type
    6 | #define int ll
      |             ^~
a.cc:10:1: note: in expansion of macro 'int'
   10 | int main(void){
      | ^~~
Language: C++

#include <iostream>
#include <vector>
#include <climits>

#define int long long

using namespace std;

int main(void){
	int n;
	cin >> n;
	vector<int> f(n, 0);
	vector<vector<int> > p(n, vector<int>(11));
	for(auto& fi : f){
		for(int i = 0; i < 10; i++){
			int t;
			cin >> t;
			fi <<= 1;
			fi += t;
		}
	}
	for(auto& pi : p){
		for(auto& pii : pi){
			cin >> pii;
		}
	}
	int m = INT_MIN;
	for(int i = 0; i < 1<<10; i++){
		int t = 0;
		for(int j = 0; j < n; j++){
			int c = 0;
			for(int fi = f[j] & i; fi; fi >>= 1){
				c += fi & 1;
			}
			t += p[j][c];
		}
		m = max(m, t);
	}
	cout << m << endl;
	return 0;
}


Compiler output:
cc1plus: error: '::main' must return 'int'
Language: C++

#include <cstdio>
#include <string>
#include <cmath>
#include <string>
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#include <iomanip>
#include <tuple>
#include <queue>
using namespace std;
typedef long long ll;
#define rep(i, a, n) for (int i=a;i<n;++i)
#define repeq(i, a, n) for(int i=a;i<=n;++i)
#define per(i, a, n) for (int i=n-1; i>=a;--i)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()

// C - Shopping Street
int N;
int F[100][10];
int P[100][10];
int sum[100];
int ans = INT_MIN;

int main(){
    cin >> N;
    rep(i, 0, N){
        rep(j, 0, 10){
            cin >> F[i][j];
        }
    }
    rep(i, 0, N){
        rep(j, 0, 11){
            cin >> P[i][j];
        }
    }
    int L = 10;
    // 2^L - 1回の全探索
    for(int i=0;i<1<<L;++i){
        if(i==0) continue;
        int r;
        rep(j, 0, N){
            sum[j] = 0;
        }
        for(r=0;r<L;++r){
            // Bitが立っているときの処理
            if((i & (1 << r)) != 0){
                rep(j, 0, N){
                    sum[j] += F[j][r];
                }
            }
        }
        int tmp=0;
        rep(j, 0, N){
            tmp += P[j][sum[j]];
        }
        ans = max(ans, tmp);
    }

    cout << ans << endl;
    return 0;
}




Compiler output:
a.cc:26:11: error: 'INT_MIN' was not declared in this scope
   26 | int ans = INT_MIN;
      |           ^~~~~~~
a.cc:12:1: note: 'INT_MIN' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
   11 | #include <queue>
  +++ |+#include <climits>
   12 | using namespace std;
Language: C++

#include <bits/stdc++.h>
using namespace std;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(j, n) for (int j = 0; j < (n); j++)

typedef long long ll;

int main()
{
    int n;
    cin >> n;
    int f[n][10];
    int p[n][11];
    rep(i, n) rep(j, 10) cin >> f[i][j];
    rep(i, n) rep(j, 11) cin >> p[i][j];
    int ans = -999999999;
    for (int bit = 1; bit < (1 << 10);bit++){//1<<10 = 1024
        int c = 0;
        rep(i,n){
            rep(j,10){
                int d = 0;
                if(f[i][j]&&(bit>>j&1))
                    d++;
            }
            c += p[i][d];
        }
        ans = max(ans, c);
    }
    cout << ans << endl;
    return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:25:23: error: 'd' was not declared in this scope
   25 |             c += p[i][d];
      |                       ^
Language: C++

#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <bitset>
using namespace std;
int main(){
  int n;
  cin>>n;
  int f[n][10];int p[n][11];
  for(int i=0;i<n;i++){
    for(int j=0;j<10;j++){
      cin >> f[i][j];
    }
  }
  for(int i=0;i<n;i++){
    for(int j=0;j<11;j++){
      cin >> p[i][j];
    }
  }
  string s;long long int ans=-10000000000000;int sum=0;int c[n];
  for(int i=1;i<=1023;i++){
    for(int l=0;l<n;l++) c[l]=0;
    stringstream jo;
    jo<< static_cast<std::bitset<10>>(i);
    s=jo.str();
    for(int j=0;j<n;j++){
      for(int k=0;k<10;k++){
        if(s[k]=='1'&&f[j][k]==1) c[j]++;
      }
    }
    for(int i=0;i<n;i++){
      sum+=p[i][c[i]];
    }
    ans=max(sum,ans);sum=0;
  }
  cout << ans <<endl;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:35:12: error: no matching function for call to 'max(int&, long long int&)'
   35 |     ans=max(sum,ans);sum=0;
      |         ~~~^~~~~~~~~
In file included from /usr/include/c++/14/string:51,
                 from /usr/include/c++/14/bits/locale_classes.h:40,
                 from /usr/include/c++/14/bits/ios_base.h:41,
                 from /usr/include/c++/14/ios:44,
                 from /usr/include/c++/14/ostream:40,
                 from /usr/include/c++/14/iostream:41,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_algobase.h:257:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  257 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:257:5: note:   template argument deduction/substitution failed:
a.cc:35:12: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'long long int')
   35 |     ans=max(sum,ans);sum=0;
      |         ~~~^~~~~~~~~
/usr/include/c++/14/bits/stl_algobase.h:303:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  303 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:303:5: note:   candidate expects 3 arguments, 2 provided
In file included from /usr/include/c++/14/algorithm:61,
                 from a.cc:2:
/usr/include/c++/14/bits/stl_algo.h:5706:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(initializer_list<_Tp>)'
 5706 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5706:5: note:   candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_algo.h:5716:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(initializer_list<_Tp>, _Compare)'
 5716 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5716:5: note:   template argument deduction/substitution failed:
a.cc:35:12: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   35 |     ans=max(sum,ans);sum=0;
      |         ~~~^~~~~~~~~
Language: C++

#include <iostream>
using namespace std;
 
int main() {
	int F[100][10], P[100][11], p[100] = { 0 }, N;
	long long int sum = 0, max = 0;
 
	cin >> N;
	for (int i = 0; i<N; i++)for (int j = 0; j<10; j++) cin >> F[i][j];
	for (int i = 0; i<N; i++)for (int j = 0; j<11; j++) cin >> P[i][j];
 
	for (int i = 1; i<1024; i++) {
		for (int j = 0; j<N; j++)p[j] = q[j] = 0;
		for (int j = 0; j<11; j++)
			if ((i>>j)%2)
				for (int k = 0; k<N; k++)p[k] += F[k][j];
		sum = 0;
		for (int j = 0; j < N; j++) sum += P[j][p[j]];
		if (i == 1 || sum > max)max = sum;
	}
	cout << max << endl;
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:13:49: error: 'q' was not declared in this scope
   13 |                 for (int j = 0; j<N; j++)p[j] = q[j] = 0;
      |                                                 ^
Language: C++

#include <iostream>
using namespace std;
int pow2(int);

int main() {
	int F[100][10], P[100][11], p[100] = { 0 }, N;
	long long int sum = 0, max = 0;

	cin >> N;
	for (int i = 0; i<N; i++)for (int j = 0; j<10; j++) cin >> F[i][j];
	for (int i = 0; i<N; i++)for (int j = 0; j<11; j++) cin >> P[i][j];

	for (int i = 1; i<1024; i++) {
		for (int j = 0; j<N; j++)p[j] = q[j] = 0;
		for (int j = 0; j<11; j++)
			if ((i>>j)%2)
				for (int k = 0; k<N; k++)p[k] += F[k][j];
		sum = 0;
		for (int j = 0; j < N; j++) sum += P[j][p[j]];
		if (i == 1 || sum > max)max = sum;
	}
	cout << max << endl;
	system("pause");
	return 0;
}
int pow2(int k) {
	if (k == 0)return 1;
	return 2 * pow2(k - 1);
}

Compiler output:
a.cc: In function 'int main()':
a.cc:14:49: error: 'q' was not declared in this scope
   14 |                 for (int j = 0; j<N; j++)p[j] = q[j] = 0;
      |                                                 ^
Language: C++

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

int INF = 100000000;

int f[110][20];
int p[110][20];
int bit[20];
int sum[110];

void Bit(int n) {
	int i = 1;
	while (n > 0) {
		bit[i] = n % 2;
		n /= 2;
		i++;
	}
}

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

	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= 10; j++) {
			cin >> f[i][j];
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j <= 10; j++) {
			cin >> p[i][j];
		}
	}

	int ans = 0, Max = -INF;
	for (int i = 1; i <= 1023; i++) {
		memset(bit, 0, 20);
		Bit(i);

		for (int j = 1; j <= n; j++) {
			for (int k = 1; k <= 10; k++) {
				if (f[j][k] && bit[11 - k]) {
					sum[j]++;
				}
			}
		}

		for (int j = 1; j <= n; j++) {
			ans += p[j][sum[j]];
		}
		Max = max(Max, ans);
		ans = 0;
		memset(sum, 0, n + 10);
	}
	cout << Max << endl;
}


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

#include <iostream>
#include <climits>
using namespace std;
const int N_MAX = 100;
const ll INF = INT_MAX / 3;
int N;
int F[N_MAX][10];
ll P[N_MAX][11];
int O[10];
ll ans = - INF;
void dfs(int i) {
    if (i >= 10) {
        int cnt = 0;
        for (int j = 0; j < 10; j++) {
            if (O[j]) {
                cnt++;
            }
        }
        if (cnt != 0) {
            ll sum = 0;
            for (int j = 0; j < N; j++) {
                cnt = 0;
                for (int k = 0; k < 10; k++) {
                    if (O[k] == 1 && O[k] == F[j][k]) {
                        cnt++;
                    }
                }
                sum += P[j][cnt];
            }
            ans = max(ans, sum);
        }
    } else {
        O[i] = 0;
        dfs(i + 1);
        O[i] = 1;
        dfs(i + 1);
    }
}
int main (void) {
    cin >> N;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < 10; j++) {
            cin >> F[i][j];
        }
    }
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < 11; j++) {
            cin >> P[i][j];
        }
    }

    dfs(0);

    cout << ans << endl;

    return 0;
}


Compiler output:
a.cc:5:7: error: 'll' does not name a type
    5 | const ll INF = INT_MAX / 3;
      |       ^~
a.cc:8:1: error: 'll' does not name a type
    8 | ll P[N_MAX][11];
      | ^~
a.cc:10:1: error: 'll' does not name a type
   10 | ll ans = - INF;
      | ^~
a.cc: In function 'void dfs(int)':
a.cc:20:13: error: 'll' was not declared in this scope
   20 |             ll sum = 0;
      |             ^~
a.cc:28:17: error: 'sum' was not declared in this scope
   28 |                 sum += P[j][cnt];
      |                 ^~~
a.cc:28:24: error: 'P' was not declared in this scope
   28 |                 sum += P[j][cnt];
      |                        ^
a.cc:30:13: error: 'ans' was not declared in this scope; did you mean 'abs'?
   30 |             ans = max(ans, sum);
      |             ^~~
      |             abs
a.cc:30:28: error: 'sum' was not declared in this scope
   30 |             ans = max(ans, sum);
      |                            ^~~
a.cc: In function 'int main()':
a.cc:48:20: error: 'P' was not declared in this scope
   48 |             cin >> P[i][j];
      |                    ^
a.cc:54:13: error: 'ans' was not declared in this scope; did you mean 'abs'?
   54 |     cout << ans << endl;
      |             ^~~
      |             abs
Language: C++

#include <iostream>
#include <string>
#include <algorithm>
#include <set>
#include <numeric>
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i, k, n) for(int i = (k); i < (int)(n); i++)
using namespace std;
using ll = long long;
int N, F[101][11], P[101][11];
int main(){
    cin >> N;
    REP(i, N) REP(j, 10) cin >> F[i][j];
    REP(i, N) REP(j, 11) cin >> P[i][j];
    int ans = (-1) * INT_MAX/2;
    for(int msk = 1; msk < 1 << 10; msk++){
        int sm = 0;
        REP(i, N){
            int c = 0;
            REP(j, 10) if(msk & (1 << j)) if(F[i][j]) c++;
            sm += P[i][c];
        }
        ans = max(ans, sm);
    }
    cout << ans << endl;
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:15:22: error: 'INT_MAX' was not declared in this scope
   15 |     int ans = (-1) * INT_MAX/2;
      |                      ^~~~~~~
a.cc:6:1: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
    5 | #include <numeric>
  +++ |+#include <climits>
    6 | #define REP(i, n) for(int i = 0; i < (int)(n); i++)
Language: C++

#include <iostream>
#include <string>
#include <algorithm>
#include <set>
#include <numeric>
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i, k, n) for(int i = (k); i < (int)(n); i++)
using namespace std;
using ll = long long;
#define INF INT_MAX/2
int N, F[101][11], P[101][11];
int main(){
    cin >> N;
    REP(i, N) REP(j, 10) cin >> F[i][j];
    REP(i, N) REP(j, 11) cin >> P[i][j];
    int ans = -INF;
    for(int msk = 1; msk < 1 << 10; msk++){
        int sm = 0;
        REP(i, N){
            int c = 0;
            REP(j, 10) if(msk & (1 << j)) if(F[i][j]) c++;
            sm += P[i][c];
        }
        ans = max(ans, sm);
    }
    cout << ans << endl;
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:10:13: error: 'INT_MAX' was not declared in this scope
   10 | #define INF INT_MAX/2
      |             ^~~~~~~
a.cc:16:16: note: in expansion of macro 'INF'
   16 |     int ans = -INF;
      |                ^~~
a.cc:6:1: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
    5 | #include <numeric>
  +++ |+#include <climits>
    6 | #define REP(i, n) for(int i = 0; i < (int)(n); i++)
Language: C

#include <iostream>
#include <string>
#include <algorithm>
#include <set>
#include <numeric>
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i, k, n) for(int i = (k); i < (int)(n); i++)
using namespace std;
using ll = long long;
#define INF INT_MAX/2
int N, F[101][11], P[101][11];
int main(){
    cin >> N;
    REP(i, N) REP(j, 10) cin >> F[i][j];
    REP(i, N) REP(j, 11) cin >> P[i][j];
    int ans = -INF;
    for(int msk = 1; msk < 1 << 10; msk++){
        int sm = 0;
        REP(i, N){
            int c = 0;
            REP(j, 10) if(msk & (1 << j)) if(F[i][j]) c++;
            sm += P[i][c];
        }
        ans = max(ans, sm);
    }
    cout << ans << endl;
    return 0;
}

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

#include <vector> 
#include <list> 
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <queue>
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(); }

//math
//-------------------------------------------
template<class T> inline T sqr(T x) { return x * x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//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())

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

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

//debug
#define dump(x)  cerr << #x << '=' << (x) << endl;
#define debug(x) cerr << #x << '=' << (x) << '('<<'L' << __LINE__ << ')' << ' ' << __FILE__ << endl;

const LL mod = 1e9 + 7;


bool F[101][5][2];
LL P[101][11];
int main() {
	
	int N;
	cin >> N;

	REP(i, N)REP(j, 5)REP(k, 2) {
		cin >> F[i][j][k];
	}
	REP(i, N)REP(j, 11) {
		cin >> P[i][j];
	}
	LL maxscore = -9223372036854775807i64;
	for (int p = 1; p < (1 << 10); p++) {
		VI kaburi(N);
		REP(i, N) { kaburi[i] = 0; }
		for(int i = 0; i < 5; i++) {
			if ((p&(1 << (2*i))) != 0) {
				REP(j, N) {
					kaburi[j] += F[j][i][0];
				}
			}
			if ((p&(1 << ((2*i)+1))) != 0) {
				REP(j, N) {
					kaburi[j] += F[j][i][1];
				}
			}
		}

		LL score = 0LL;
		REP(i, N) {
			score += P[i][kaburi[i]];
		}
		//debug(score);
		maxscore = max(score, maxscore);
	}
	cout << maxscore << endl;

}

Compiler output:
a.cc: In function 'int main()':
a.cc:86:24: error: unable to find numeric literal operator 'operator""i64'
   86 |         LL maxscore = -9223372036854775807i64;
      |                        ^~~~~~~~~~~~~~~~~~~~~~
Language: C++

// AtCoder Beginner Contest 080 2017/12/03

#include <iostream>
using namespace std;

int ans = -(1 << 30);
using ushort = unsigned short;
// 自分の店を開くか
ushort my_shop = 0;
// 店の数
int n;
// ほかの店の開店時間
ushort others[110];
// ほかの店との兼ね合いによる利益
int profit[110][11];

void update(int n);
void calc_profit();
int pop_count(ushort a);
int pop_count(ushort a, ushort b);

int main(){
	// 店の数
	cin >> n;
	int input;
	// ほかの店の開店時間
	for(int j = 0; j < n; j++){
		others[j] = 0;
	for(int i = 0; i < 10; i++){
		cin >> input;
		others[j] |= (input << i);
	}
	}
	// 開店時間の重複数と利益
	for(int j = 0; j < n; j++){
	for(int i = 0; i < 11; i++){
		cin >> input;
		profit[j][i] = input;
	}
	}
	update(0);
	cout << ans << endl;
	return 0;
}

void update(int n){
	if(n == 10){
		calc_profit();
		return;
	}else{
		// この時間帯に店を開く場合
		my_shop |= (1 << n);  update(n + 1);
		// この時間帯に店を開かない場合
		my_shop &= ~(1 << n); update(n + 1);
	}
}

inline int max(int a, int p){
	return a < p? p: a;
}
void calc_profit(){
	int p = 0
	for(int i = 0; i < n; i++){
		p += profit[i][pop_count(my_shop, others[i])];
	}
	ans = max(ans, p);
}

int pop_count(ushort a) {
	a = (a & 0x5555) + ((a >> 1) & 0x5555);// 0101 0101 0101 0101
	a = (a & 0x3333) + ((a >> 2) & 0x3333);// 0011 0011 0011 0011
	a = (a & 0x0f0f) + ((a >> 4) & 0x0f0f);// 0000 1111 0000 1111
	a = (a & 0x00ff) + ((a >> 8) & 0x00ff);// 0000 0000 1111 1111
	return a;
}
int pop_count(ushort a, ushort b) {
	return pop_count(a & b);
}


Compiler output:
a.cc: In function 'void calc_profit()':
a.cc:63:9: error: expected ',' or ';' before 'for'
   63 |         for(int i = 0; i < n; i++){
      |         ^~~
a.cc:63:24: error: 'i' was not declared in this scope
   63 |         for(int i = 0; i < n; i++){
      |                        ^
Language: C++

// AtCoder Beginner Contest 080 2017/12/03

#include <iostream>
using namespace std;

int ans = -(1 << 30);
using ushort = unsigned short;
// 自分の店を開くか
ushort my_shop = 0;
// 店の数
int n;
// ほかの店の開店時間
ushort others[110];
// ほかの店との兼ね合いによる利益
int profit[110][11];

void update(int n);
void calc_profit();
int pop_count(ushort a);
int pop_count(ushort a, ushort b);

int main(){
	// 店の数
	cin >> n;
	int input;
	// ほかの店の開店時間
	for(int j = 0; j < n; j++){
		others[j] = 0;
	for(int i = 0; i < 10; i++){
		cin >> input;
		others[j] |= (input << i);
	}
	}
	// 開店時間の重複数と利益
	for(int j = 0; j < n; j++){
	for(int i = 0; i < 11; i++){
		cin >> input;
		profit[j][i] = input;
	}
	}
	update(0);
	cout << ans << endl;
	return 0;
}

void update(int n){
	if(n == 10){
		calc_profit();
		return;
	}else{
		// この時間帯に店を開く場合
		my_shop |= (1 << n);  update(n + 1);
		// この時間帯に店を開かない場合
		my_shop &= ~(1 << n); update(n + 1);
	}
}

inline int max(int a, int p){
	return a < p? p: a;
}
void calc_profit(){
	for(int i = 0; i < n; i++){
		int p = profit[i][pop_count(a, i)];
		ans = max(ans, p);
	}
}

int pop_count(ushort a) {
	a = (a & 0x5555) + ((a >> 1) & 0x5555);// 0101 0101 0101 0101
	a = (a & 0x3333) + ((a >> 2) & 0x3333);// 0011 0011 0011 0011
	a = (a & 0x0f0f) + ((a >> 4) & 0x0f0f);// 0000 1111 0000 1111
	a = (a & 0x00ff) + ((a >> 8) & 0x00ff);// 0000 0000 1111 1111
	return a;
}
int pop_count(ushort a, ushort b) {
	return pop_count(a & b);
}


Compiler output:
a.cc: In function 'void calc_profit()':
a.cc:63:45: error: 'a' was not declared in this scope
   63 |                 int p = profit[i][pop_count(a, i)];
      |                                             ^
Language: C++

// AtCoder Beginner Contest 080 2017/12/03

#include <iostream>
using namespace std;

int ans = -(1 << 30);
using ushort = unsigned short;
// 自分の店を開くか
ushort my_shop = 0;
// 店の数
int n;
// ほかの店の開店時間
ushort others[110];
// ほかの店との兼ね合いによる利益
int profit[110][11];

void update(int n);
void calc_profit();
int pop_count(ushort a);
int pop_count(ushort a, ushort b);

int main(){
	// 店の数
	cin >> n;
	int input;
	// ほかの店の開店時間
	for(int j = 0; j < n; j++){
		others[j] = 0;
	for(int i = 0; i < 10; i++){
		cin >> input;
		others[j] |= (input << i);
	}
	}
	// 開店時間の重複数と利益
	for(int j = 0; j < n; j++){
	for(int i = 0; i < 11; i++){
		cin >> input;
		profit[j][i] = input;
	}
	}
	update(0);
	cout << ans << endl;
	return 0;
}

void update(int n){
	if(n == 10){
		calc_profit();
		return;
	}else{
		// この時間帯に店を開く場合
		my_shop |= (1 << n);  update(n + 1);
		// この時間帯に店を開かない場合
		my_shop &= ~(1 << n); update(n + 1);
	}
}

inline int max(int a, int p){
	return a < p? p: a;
}
void calc_profit(){
	for(int i = 0; i < n; i++){
		int p = profit[i][count(a, i)];
		ans = max(ans, p);
	}
}

int pop_count(ushort a) {
	a = (a & 0x5555) + ((a >> 1) & 0x5555);// 0101 0101 0101 0101
	a = (a & 0x3333) + ((a >> 2) & 0x3333);// 0011 0011 0011 0011
	a = (a & 0x0f0f) + ((a >> 4) & 0x0f0f);// 0000 1111 0000 1111
	a = (a & 0x00ff) + ((a >> 8) & 0x00ff);// 0000 0000 1111 1111
	return a;
}
int pop_count(ushort a, ushort b) {
	return pop_count(a & b);
}


Compiler output:
a.cc: In function 'void calc_profit()':
a.cc:63:41: error: 'a' was not declared in this scope
   63 |                 int p = profit[i][count(a, i)];
      |                                         ^
a.cc:63:35: error: 'count' was not declared in this scope
   63 |                 int p = profit[i][count(a, i)];
      |                                   ^~~~~