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

#include <map>
using namespace std;
int func(string s) {
	int a = 0;
	map<char, int> d;
	for (size_t i = 0; i < s.size(); ++i) {
		d[s[i]]++;
		if (d[s[i]] % 2 == 0) {
			++a;
		}
	}
	if ((int)s.size() - a * 2 != 0) {
			return ((int)s.size() - a * 2);
	}
	else {
		return 1;
	}
	return ((int)s.size() - a * 2);
}
int main() {
	string str;
	cin >> str;
	cout << func(str);
}

Compiler output:
a.cc:3:10: error: 'string' was not declared in this scope
    3 | int func(string s) {
      |          ^~~~~~
a.cc:2:1: note: 'std::string' is defined in header '<string>'; this is probably fixable by adding '#include <string>'
    1 | #include <map>
  +++ |+#include <string>
    2 | using namespace std;
a.cc: In function 'int main()':
a.cc:21:9: error: 'string' was not declared in this scope
   21 |         string str;
      |         ^~~~~~
a.cc:21:9: note: 'std::string' is defined in header '<string>'; this is probably fixable by adding '#include <string>'
a.cc:22:9: error: 'cin' was not declared in this scope
   22 |         cin >> str;
      |         ^~~
a.cc:2:1: note: 'std::cin' is defined in header '<iostream>'; this is probably fixable by adding '#include <iostream>'
    1 | #include <map>
  +++ |+#include <iostream>
    2 | using namespace std;
a.cc:22:16: error: 'str' was not declared in this scope; did you mean 'std'?
   22 |         cin >> str;
      |                ^~~
      |                std
a.cc:23:9: error: 'cout' was not declared in this scope
   23 |         cout << func(str);
      |         ^~~~
a.cc:23:9: note: 'std::cout' is defined in header '<iostream>'; this is probably fixable by adding '#include <iostream>'
a.cc:23:21: error: 'func' cannot be used as a function
   23 |         cout << func(str);
      |                 ~~~~^~~~~
Language: C++

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

string s;
ll dp[1 << 20];
ll n;
ll mark[1 << 20];

ll solve(ll index){
    if(index == n){
        return 0;
    }
    if(dp[index] != -1){
        return dp[index];
    }
    ll hash1[26];
    memset(hash1,0,sizeof hash1);
    ll ans = 10000000000000ll;
    for(ll i = index;i < n;i++){
        hash1[s[i] - 'a']++;
        ll cnt = 0;
        for(ll j = 0;j < 26;j++){
            if(hash1[j]%2){
                cnt++;
            }
        }
        if(cnt <= 1 and mark[i+1]){
            ans = min(ans,1+solve(i+1));
        }
    }
    return dp[index] = ans;
}

int main(){
    cin >> s;
    n = s.size();
    memset(dp,-1,sizeof dp);
    ll hash1[26];
    memset(hash1,0,sizeof hash1);
    ll ans = 10000000;
    for(ll i = 0;i < m;i++){
        hash1[s[i] - 'a']++;
        ll cnt = 0;
        for(ll j = 0;j < 26;j++){
            if(hash1[j]%2){
                cnt++;
            }
        }
        mark[i] = cnt;
    }
    cout << mark[n-1];
    //cout << solve(0);
}


Compiler output:
a.cc: In function 'int main()':
a.cc:42:22: error: 'm' was not declared in this scope
   42 |     for(ll i = 0;i < m;i++){
      |                      ^
Language: C++

#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;
typedef vector<int>   vi;
typedef vector<long long> vll;
typedef vector<pair<int,int> > vii;
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define pq priority_queue
#define mii map<int,int>
#define sf1(x) scanf("%d",&x)
#define sf2(x,y) scanf("%d %d",&x,&y)
#define sf3(x,y,z) scanf("%d %d %d",&x,&y,&z)
int inf = (1e9) + 7;
int mod = 998244353;


int occ[26];
int main(){

    string s;
    cin >> s;



    for (int i = 0; i < s.size(); ++i)
    {
        occ[s[i]-'a']++;
    }

    ll ans = 0;
    for (int i = 0; i < 26; ++i)
    {
        if(occ[i] % 2 == 1)
            ans++;
    }

    printf("%lld\n",max(ans,1));

}   

Compiler output:
a.cc: In function 'int main()':
a.cc:41:24: error: no matching function for call to 'max(long long int&, int)'
   41 |     printf("%lld\n",max(ans,1));
      |                     ~~~^~~~~~~
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:41:24: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   41 |     printf("%lld\n",max(ans,1));
      |                     ~~~^~~~~~~
/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:41:24: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   41 |     printf("%lld\n",max(ans,1));
      |                     ~~~^~~~~~~
Language: C++

#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;
typedef vector<int>   vi;
typedef vector<long long> vll;
typedef vector<pair<int,int> > vii;
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define pq priority_queue
#define mii map<int,int>
#define sf1(x) scanf("%d",&x)
#define sf2(x,y) scanf("%d %d",&x,&y)
#define sf3(x,y,z) scanf("%d %d %d",&x,&y,&z)
int inf = (1e9) + 7;
int mod = 998244353;


int occ[26];
int main(){

    string s;
    cin >> s;



    for (int i = 0; i < s.size(); ++i)
    {
        occ[s[i]-'a']++;
    }

    ll ans = 0;
    for (int i = 0; i < 26; ++i)
    {
        if(occ[i] % 2 == 1)
            ans++;
    }

    printf("%lld\n",max(ans.1));

}   

Compiler output:
a.cc: In function 'int main()':
a.cc:41:28: error: expected ')' before numeric constant
   41 |     printf("%lld\n",max(ans.1));
      |                        ~   ^~
      |                            )
a.cc:41:24: error: no matching function for call to 'max(long long int&)'
   41 |     printf("%lld\n",max(ans.1));
      |                     ~~~^~~~~~
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:   candidate expects 2 arguments, 1 provided
/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, 1 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:   template argument deduction/substitution failed:
a.cc:41:24: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   41 |     printf("%lld\n",max(ans.1));
      |                     ~~~^~~~~~
/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:   candidate expects 2 arguments, 1 provided
Language: C++

#include <bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef pair<int,int>P;
#define F first
#define S second
string s,t;
int a[200001][26];
string s;
int b[2<<26];
main(){
  int a=0;
  cin>>s;
  a[0][s[0]-'a']++;
  r(i,s.size()){
    r(j,26)a[i+1][j]=a[i][j];
    a[i+1][s[i+1]-'a']++;
  }
  r(i,s.size()){
    int t=(1<<(s[i]-'0'));
  }
}

Compiler output:
a.cc:9:8: error: redefinition of 'std::string s'
    9 | string s;
      |        ^
a.cc:7:8: note: 'std::string s' previously declared here
    7 | string s,t;
      |        ^
a.cc:11:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   11 | main(){
      | ^~~~
a.cc: In function 'int main()':
a.cc:14:4: error: invalid types 'int[int]' for array subscript
   14 |   a[0][s[0]-'a']++;
      |    ^
a.cc:16:13: error: invalid types 'int[int]' for array subscript
   16 |     r(j,26)a[i+1][j]=a[i][j];
      |             ^
a.cc:16:23: error: invalid types 'int[int]' for array subscript
   16 |     r(j,26)a[i+1][j]=a[i][j];
      |                       ^
a.cc:17:6: error: invalid types 'int[int]' for array subscript
   17 |     a[i+1][s[i+1]-'a']++;
      |      ^
Language: C++

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) FOR(i,0,n)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define PQ priority_queue
#define UM unordered_map
#define ALL(a) (a).begin(),(a).end()
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
const ll INF = (1ll << 60);
typedef pair<ll,ll> pii;
typedef vector<vector<ll>> Graph;
typedef vector<pii> vpii;

int v[1ll<<26];

int main() {
  string s; cin>>s;
  for (ll i=0;i<(1ll<<26);i++) v[i]=INF;
  ll cur=0ll; v[cur]=0;
  for(char c:s) {
    c-='a';
    cur^=(1ll<<c);
    ll mi=v[cur];
    for(int i=0;i<26;i++) {
      mi=min(mi,v[cur^(1ll<<i)]);
    }
    v[cur]=mi+1;
  }
  cout<<v[cur]<<endl;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:23:37: warning: overflow in conversion from 'long long int' to 'int' changes value from '1152921504606846976' to '0' [-Woverflow]
   23 |   for (ll i=0;i<(1ll<<26);i++) v[i]=INF;
      |                                     ^~~
a.cc:30:13: error: no matching function for call to 'min(ll&, int&)'
   30 |       mi=min(mi,v[cur^(1ll<<i)]);
      |          ~~~^~~~~~~~~~~~~~~~~~~~
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:233:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::min(const _Tp&, const _Tp&)'
  233 |     min(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:233:5: note:   template argument deduction/substitution failed:
a.cc:30:13: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   30 |       mi=min(mi,v[cur^(1ll<<i)]);
      |          ~~~^~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algobase.h:281:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare)'
  281 |     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:281: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:5686:5: note: candidate: 'template<class _Tp> constexpr _Tp std::min(initializer_list<_Tp>)'
 5686 |     min(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5686:5: note:   candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_algo.h:5696:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::min(initializer_list<_Tp>, _Compare)'
 5696 |     min(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5696:5: note:   template argument deduction/substitution failed:
a.cc:30:13: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   30 |       mi=min(mi,v[cur^(1ll<<i)]);
      |          ~~~^~~~~~~~~~~~~~~~~~~~
Language: C++

#include <bits/stdc++.h>

using namespace std;

const int inf=1e9;
const int N=1e5+10;


int f[N];
int ma[1<<26];
int main(){
        string s;
        cin>>s;
        int n=s.length();
        memset(ma,-1,sizeof(ma));
        ma[0]=0;
        f[0]=0;
        for(int i=1,mask=0;i<=n;i++){
                mask^=1<<(s[i-1]-'a');
                f[i]=inf;
                if (ma[mask]!=-1) f[i]=min(f[i],f[ma[mask]]+1);
                for(int j=0;j<26;j++){
                        int cmask=mask^(1<<j);
#include <bits/stdc++.h>

using namespace std;

const int inf=1e9;
const int N=1e5+10;


int f[N];
int ma[1<<26];
int main(){
        string s;
        cin>>s;
        int n=s.length();
        memset(ma,-1,sizeof(ma));
        ma[0]=0;
        f[0]=0;
        for(int i=1,mask=0;i<=n;i++){
                mask^=1<<(s[i-1]-'a');
                f[i]=inf;
                if (ma[mask]!=-1) f[i]=min(f[i],f[ma[mask]]+1);
                for(int j=0;j<26;j++){
                        int cmask=mask^(1<<j);
#include <bits/stdc++.h>

using namespace std;

const int inf=1e9;
const int N=1e5+10;


int f[N];
int ma[1<<26];
int main(){
        string s;
        cin>>s;
        int n=s.length();
        memset(ma,-1,sizeof(ma));
        ma[0]=0;
        f[0]=0;
        for(int i=1,mask=0;i<=n;i++){
                mask^=1<<(s[i-1]-'a');
                f[i]=inf;
                if (ma[mask]!=-1) f[i]=min(f[i],f[ma[mask]]+1);
                for(int j=0;j<26;j++){
                        int cmask=mask^(1<<j);
                        if (ma[cmask]!=-1) f[i]=min(f[i],f[ma[cmask]]+1);
                }
                if (ma[mask]==-1) ma[mask]=i;
        }
        //for(int i=1;i<=n;i++) cout<<f[i]<<" \n"[i==n];
        cout<<f[n];
}



Compiler output:
a.cc: In function 'int main()':
a.cc:34:9: warning: empty parentheses were disambiguated as a function declaration [-Wvexing-parse]
   34 | int main(){
      |         ^~
a.cc:34:9: note: remove parentheses to default-initialize a variable
   34 | int main(){
      |         ^~
      |         --
a.cc:34:9: note: or replace parentheses with braces to value-initialize a variable
a.cc:34:11: error: a function-definition is not allowed here before '{' token
   34 | int main(){
      |           ^
a.cc:76:2: error: expected '}' at end of input
   76 | }
      |  ^
a.cc:22:38: note: to match this '{'
   22 |                 for(int j=0;j<26;j++){
      |                                      ^
a.cc:76:2: error: expected '}' at end of input
   76 | }
      |  ^
a.cc:18:37: note: to match this '{'
   18 |         for(int i=1,mask=0;i<=n;i++){
      |                                     ^
a.cc:76:2: error: expected '}' at end of input
   76 | }
      |  ^
a.cc:11:11: note: to match this '{'
   11 | int main(){
      |           ^
Language: C++

#include <bits/stdc++.h>

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

#define LL long long
#define Ldouble long double
#define PI 3.14159265358979323846264338327950288419

#define PII pair<int,int>
#define PLL pair<LL,LL>
#define mp make_pair
#define fi first
#define se second

using namespace std;

char s[200005];
int len, ps[26][200005], num[200005];
int dp[200005];
map<int, int> M;

int main(){
	scanf("%s", s + 1);
	len = strlen(s + 1);
	FI(i, 1, len){
		FI(j, 0, 25) ps[j][i] = ps[j][i - 1];
		ps[s[i] - 'a'][i]++;
		FI(j, 0, 25) if(ps[j][i] & 1){
			num[i] += (1 << j);
		}
	}
	M[0] = 0;
	FI(j, 1, n){
		dp[j] = 999999;
		FI(k, 0, 26){
			int x = num[j];
			if(k != 26) x ^= (1 << k);
			if(M.count(x)){
				dp[j] = min(dp[j], M[x] + 1);
			}
		}
		if(M.count(num[j])){
			M[num[j]] = min(M[num[j]], dp[j]);
		}
		else M[num[j]] = dp[j];
	}
	printf("%d\n", dp[n]);
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:34:18: error: 'n' was not declared in this scope
   34 |         FI(j, 1, n){
      |                  ^
a.cc:3:37: note: in definition of macro 'FI'
    3 | #define FI(i,a,b) for(int i=(a);i<=(b);i++)
      |                                     ^
a.cc:48:27: error: 'n' was not declared in this scope; did you mean 'yn'?
   48 |         printf("%d\n", dp[n]);
      |                           ^
      |                           yn
Language: C++

#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#include<numeric>

#define rep(n) for(int i=0;i<n;i++)
#define repp(j, n) for(int j=0;j<n;j++)
#define reppp(i, m, n) for(int i=m;i<=n;i++)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define pb(x) push_back(x)
#define eb(x,y) emplace_back(x,y)
#define MOD 1000000007
#define MAX 1000000001
#define INF 1410065408
#define EPS 1e-9
#define DEBUG 0
#define ll long long
#define Pll pair<ll, ll>
#define Pii pair<int, int>
 
using namespace std;
struct edge{int from, to; ll cost;};

signed main(){
    ios::sync_with_stdio(0); cin.tie(0);
    string s;
    cin >> s;
    int n = (int)s.length();
    map<char, int> mp;
    rep(n){
        mp[s[i]]++;
    }

    ll ans = 0LL;
    for(auto iter=mp.begin();iter!=mp.end();++iter){
        if(iter->second % 2 == 1){
            ans++;
        }
    }
    cout << max(1, ans);
}


Compiler output:
a.cc: In function 'int main()':
a.cc:49:16: error: no matching function for call to 'max(int, long long int&)'
   49 |     cout << max(1, ans);
      |             ~~~^~~~~~~~
In file included from /usr/include/c++/14/bits/specfun.h:43,
                 from /usr/include/c++/14/cmath:3906,
                 from a.cc:3:
/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:49:16: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'long long int')
   49 |     cout << max(1, ans);
      |             ~~~^~~~~~~~
/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:11:
/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:49:16: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   49 |     cout << max(1, ans);
      |             ~~~^~~~~~~~
Language: C++

#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <set>
#include <map>
#include <queue>
#include <tuple>
#include <unordered_set>
#include <unordered_map>
#include <functional>
#include <cassert>
#define repeat(i, n) for (int i = 0; (i) < int(n); ++(i))
#define repeat_from(i, m, n) for (int i = (m); (i) < int(n); ++(i))
#define repeat_reverse(i, n) for (int i = (n)-1; (i) >= 0; --(i))
#define repeat_from_reverse(i, m, n) for (int i = (n)-1; (i) >= int(m); --(i))
#define whole(x) begin(x), end(x)
#define unittest_name_helper(counter) unittest_ ## counter
#define unittest_name(counter) unittest_name_helper(counter)
#define unittest __attribute__((constructor)) void unittest_name(__COUNTER__) ()
using ll = long long;
using namespace std;

constexpr int inf = 1e9+7;
int main() {
    string s; cin >> s;
    int n = s.length();
    vector<int32_t> xoracc(n + 1);
    repeat (i, n) {
        xoracc[i + 1] = xoracc[i] ^ (1 << (s[i] - 'a'));
    }
    vector<int> dp(n + 1, inf);
    dp[0] = 0;
    repeat (r, n) {
        repeat (l, r + 1) {
            if (__builtin_popcount(xoracc[r + 1] ^ xoracc[l]) <= 1) {
                setmin(dp[r + 1], dp[l] + 1);
            }
        }
    }
    cout << dp[n] << endl;
    return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:37:17: error: 'setmin' was not declared in this scope; did you mean 'stdin'?
   37 |                 setmin(dp[r + 1], dp[l] + 1);
      |                 ^~~~~~
      |                 stdin
Language: C++

#include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>

const int N = 200000;

char s[N + 1];
std::map<int, int> mi;

int get(int msk)
{
    if (mi.count(msk)) {
        return mi[msk];
    }
    return N;
}

int add(int msk, int val)
{
    if (!mi.count(msk)) {
        mi[msk] = val;
    } else {
        mi[msk] = std::min(mi[msk], val);
    }
}

int main()
{
    scanf("%s", s);
    int n = strlen(s);
    int dp = 0;
    int msk = 0;
    for (int i = 0; i < n; ++ i) {
        add(msk, dp);
        msk ^= 1 << s[i] - 'a';
        dp = get(msk) + 1;
        for (int j = 0; j < 26; ++ j) {
            dp = std::min(dp, get(msk ^ (1 << j)) + 1);
        }
    }
    printf("%d\n", dp);


Compiler output:
a.cc: In function 'int add(int, int)':
a.cc:26:1: warning: no return statement in function returning non-void [-Wreturn-type]
   26 | }
      | ^
a.cc: In function 'int main()':
a.cc:42:24: error: expected '}' at end of input
   42 |     printf("%d\n", dp);
      |                        ^
a.cc:29:1: note: to match this '{'
   29 | {
      | ^
Language: C++

#include <iostream>
#define llint long long
#define mod 1000000007

using namespace  std;

llint n;
llint a[405], b[405];
bool haveA[405][405], haveB[405][405];
llint sum[405][405];
llint dp[405][405][405], dpsum[405][405];

const int FACT_MAX = 2005;
llint fact[FACT_MAX], fact_inv[FACT_MAX];

llint modpow(llint a, llint n)
{
	if(n == 0) return 1;
	if(n % 2){
		return ((a%mod) * (modpow(a, n-1)%mod)) % mod;
	}
	else{
		return modpow((a*a)%mod, n/2) % mod;
	}
}

void make_fact()
{
	llint val = 1;
	fact[0] = 1;
	for(int i = 1; i < FACT_MAX; i++){
		val *= i;
		val %= mod;
		fact[i] = val;
	}
	fact_inv[FACT_MAX-1] = modpow(fact[FACT_MAX-1], mod-2);
	for(int i = FACT_MAX-2; i >= 0; i--){
		fact_inv[i] = fact_inv[i+1] * (i+1) % mod;
	}
}

llint comb(llint n, llint k)
{
	llint ret = 1;
	ret *= fact[n];
	ret *= fact_inv[k], ret %= mod;
	ret *= fact_inv[n-k], ret %= mod;
	return ret;
}

llint get(llint sum[405][405], llint sx, llint sy, llint tx, llint ty)
{
  if(sx > tx || sy > ty) return 0;
  llint ret = sum[tx][ty]  + sum[sx-1][sy-1];
  ret += mod - (sum[sx-1][ty] + sum[tx][sy-1])%mod, ret %= mod;
  return ret;
}

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

  make_fact();

  cin >> n;
  for(int i = 1; i <= n; i++) cin >> a[i];
  for(int i = 1; i <= n; i++) cin >> b[i];

  reverse(a+1, a+n+1);
  reverse(b+1, b+n+1);

  for(int i = 1; i <= n; i++){
    for(int j = 1; j <= n; j++){
      sum[i][j] = sum[i-1][j] + sum[i][j-1] - sum[i-1][j-1];
      if(a[i] == b[j]) sum[i][j]++;
    }
  }

  for(int i = 1; i <= n; i++){
    for(int j = i; j <= n; j++) haveA[j][a[i]] = true;
    for(int j = i; j <= n; j++) haveB[j][b[i]] = true;
  }

  for(int j = 1; j <= n; j++){
    for(int k = 1; k <= n; k++){
      if(!haveA[j-1][b[k]] || !haveB[k-1][a[j]]) continue;
      llint num = get(sum, 1, 1, j-1, k-1);
      if(num <= 0) continue;
      dp[1][j][k] = num * 2 % mod;
    }
  }

  for(int i = 2; i <= n/3; i++){
    for(int j = 1; j <= n; j++){
      for(int k = 1; k <= n; k++){
        dpsum[j][k] = dpsum[j-1][k] + dpsum[j][k-1] + dp[i-1][j][k], dpsum[j][k] %= mod;
        dpsum[j][k] += mod - dpsum[j-1][k-1], dpsum[j][k] %= mod;
      }
    }
  
    for(int j = 1; j <= n; j++){
      for(int k = 1; k <= n; k++){
        if(!haveA[j-1][b[k]] || !haveB[k-1][a[j]]) continue;
        llint num = get(sum, 1, 1, j-1, k-1);
        if(num-2*(i-1) <= 0) continue;
        llint tmp = get(dpsum, 1, 1, j-1, k-1);
        tmp *= num-3*(i-1), tmp %= mod;
        tmp *= comb(3*(i-1)+2, 2) * 2 % mod, tmp %= mod;
        dp[i][j][k] = tmp;
      }
    }
  
  }
  cout << dp[n/3][n][n] << endl;

  return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:70:3: error: 'reverse' was not declared in this scope
   70 |   reverse(a+1, a+n+1);
      |   ^~~~~~~
Language: C++

int main() {
  int a,b,c;
  cin >>a>>b>>c;
  if(a==b) cout <<c<<endl;
  if(b==c) cout <<a<<endl;
  if(a==c) cout <<b<<endl;
  
}
      

Compiler output:
a.cc: In function 'int main()':
a.cc:3:3: error: 'cin' was not declared in this scope
    3 |   cin >>a>>b>>c;
      |   ^~~
a.cc:4:12: error: 'cout' was not declared in this scope
    4 |   if(a==b) cout <<c<<endl;
      |            ^~~~
a.cc:4:22: error: 'endl' was not declared in this scope
    4 |   if(a==b) cout <<c<<endl;
      |                      ^~~~
a.cc:5:12: error: 'cout' was not declared in this scope
    5 |   if(b==c) cout <<a<<endl;
      |            ^~~~
a.cc:5:22: error: 'endl' was not declared in this scope
    5 |   if(b==c) cout <<a<<endl;
      |                      ^~~~
a.cc:6:12: error: 'cout' was not declared in this scope
    6 |   if(a==c) cout <<b<<endl;
      |            ^~~~
a.cc:6:22: error: 'endl' was not declared in this scope
    6 |   if(a==c) cout <<b<<endl;
      |                      ^~~~
Language: C++

#include<iostream>
using namespace std;
int main(){
  int a,b,c;
  cin>>a>>b>>c;
  if(a==b&&b!=c){
    cout<<c<<endl;
  }
  else(a!=b&&b==c){
    cout<<a<<endl;
  }
  else{
    cout<<b<<endl;
  }
  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:9:19: error: expected ';' before '{' token
    9 |   else(a!=b&&b==c){
      |                   ^
      |                   ;
a.cc:12:3: error: 'else' without a previous 'if'
   12 |   else{
      |   ^~~~
Language: C++

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
  int a, b, c;
  cin >> a >> b >> c;
  if(a == b) cout << c << "\n";
  else{
    if(a == c) cout << b << "\n";
    e;se cout << a << "\n";
  }
}


Compiler output:
a.cc: In function 'int main()':
a.cc:10:5: error: 'e' was not declared in this scope
   10 |     e;se cout << a << "\n";
      |     ^
a.cc:10:7: error: 'se' was not declared in this scope
   10 |     e;se cout << a << "\n";
      |       ^~
Language: C++

#include <iostream>
#include <algorithm>
#include <string>
#include <set>

#include <regex>
#include <locale>
#include <iomanip>

using namespace std;
using ll = long long;

#define OVERLOAD3(_1,_2,_3,name,...) name
#define REP(i,n) REPI(i,0,n)
#define REPI(i,a,b) for(int i=int(a),i##_Len=int(b);i<i##_Len;++i)
#define rep(...) OVERLOAD3(__VA_ARGS__,REPI,REP,)(__VA_ARGS__)
#define ALL(x) (x).begin(),(x).end()
#defien SZ(x) ((int)(x).size())

int main () {
  int a, b, c;
  cin >> a >> b >> c;
  cout << (a == b ? c : a == c ? b : a) << endl;
}

Compiler output:
a.cc:18:2: error: invalid preprocessing directive #defien; did you mean #define?
   18 | #defien SZ(x) ((int)(x).size())
      |  ^~~~~~
      |  define
Language: C++

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

#define ll long long int
#define All(a) (a).begin(),(a).end()

void solve(){
  int n,m;
 
  scanf("%d %d",&n,&m);
  char A[n][m];
  int ans[n][m]={};
  for(int i=0;i<n;i++){
    for (int  j = 0; j < m; j++)
    {
      cin >> A[i][j];
    }
  }
  for (int i = 0; i < n; i++){
    for (int  j = 0; j < m; j++){
      if(A[i][j]=='#'){
        if(i!=0)    ans[i-1][j]+=1;
        if(j!=0)    ans[i][j-1]+=1;
        if(i!=n-1)  ans[i+1][j]+=1;
        if(j!=m-1)  ans[i][j+1]+=1;
        if(i!=0 && j!=0)      ans[i-1][j-1]+=1;
        if(i!=0 && j!=m-1)    ans[i-1][j+1]+=1;
        if(i!=n-1 && j!=0)    ans[i+1][j-1]+=1;
        if(i!=n-1 && j!=m-1)  ans[i+1][j+1]+=1;
      }
    }
  }
  for(int i=0;i<n;i++){
    for (int j = 0; j < m; j++)
    {
       if(A[i][j]=='#'){
         printf("#");
       }else{
          printf("%c",'0'+ans[i][j]);
      }
    printf("\n");
  }
}
int main(){
  solve();
  return 0;
}

Compiler output:
a.cc: In function 'void solve()':
a.cc:44:9: warning: empty parentheses were disambiguated as a function declaration [-Wvexing-parse]
   44 | int main(){
      |         ^~
a.cc:44:9: note: remove parentheses to default-initialize a variable
   44 | int main(){
      |         ^~
      |         --
a.cc:44:9: note: or replace parentheses with braces to value-initialize a variable
a.cc:44:11: error: a function-definition is not allowed here before '{' token
   44 | int main(){
      |           ^
a.cc:47:2: error: expected '}' at end of input
   47 | }
      |  ^
a.cc:7:13: note: to match this '{'
    7 | void solve(){
      |             ^
Language: C++

/*
   Author : tarang
*/
#include<bits/stdc++.h>
#define ll long long
#define fastio ios_base::sync_with(false); cin.tie(0);cout.tie(0);
const int MOD = 1000000007;
#define PI = acos(-1)
using namespace std ;
int a[106];
int main(){
	map<int,int> mp;
    int a , b , c;
    cin >> a >> b >> c ;
    mp[a]++;
    mp[b]++;
    mp[c]++;
    if((*mp.begin()).second == 1){
    	cout << (*mp.begin()).first;
    	return 0 ;
	}
	auto it = mp.end();
	it--;
	cout << *it.second << endl;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:24:21: error: 'struct std::_Rb_tree_iterator<std::pair<const int, int> >' has no member named 'second'
   24 |         cout << *it.second << endl;
      |                     ^~~~~~
Language: C++

/*
   Author : tarang
*/
#include<bits/stdc++.h>
#define ll long long
#define fastio ios_base::sync_with(false); cin.tie(0);cout.tie(0);
const int MOD = 1000000007;
#define PI = acos(-1)
using namespace std ;
int a[106];
int main(){
	map<int,int> mp;
    int a , b , c;
    cin >> a >> b >> c ;
    mp[a]++;
    mp[b]++;
    mp[c]++;
    if(*mp.begin().second ==1){
    	cout << *mp.begin().first;
    	return 0 ;
	}
	auto it = mp.end();
	it--;
	cout << *it.second << endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:18:20: error: 'std::map<int, int>::iterator' {aka 'std::_Rb_tree<int, std::pair<const int, int>, std::_Select1st<std::pair<const int, int> >, std::less<int>, std::allocator<std::pair<const int, int> > >::iterator'} has no member named 'second'
   18 |     if(*mp.begin().second ==1){
      |                    ^~~~~~
a.cc:19:29: error: 'std::map<int, int>::iterator' {aka 'std::_Rb_tree<int, std::pair<const int, int>, std::_Select1st<std::pair<const int, int> >, std::less<int>, std::allocator<std::pair<const int, int> > >::iterator'} has no member named 'first'
   19 |         cout << *mp.begin().first;
      |                             ^~~~~
a.cc:24:21: error: 'struct std::_Rb_tree_iterator<std::pair<const int, int> >' has no member named 'second'
   24 |         cout << *it.second << endl;
      |                     ^~~~~~
Language: C

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int a,b,c;
    cin>>a>>b>>c;
    if(a==b){cout<<c;}
    else if(a==c){cout<<b;}
    else{cout<<a;}
}

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

#include<iostream>
using namespace std;
int main()
{
    int a,b,c;
    cin>>a>>b>>c;
    if(a==b){cout<<c;}
    else if(a==c){cout<<b;}
    else{cout<<a;}
}

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

#include<bits.stdc++.h>
using namespace std;
int main(){
  int a,b,c;
  cin>>a>>b>>c;
  if(a==b){cout<<c<<endl;}
  else if(a==c){cout<<b<<endl;}
  else{cout<<a<<endl;}
}
  

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

#include <stdio.h>

int main(void){
  int A, B, C;
  scanf ("%d %d %d", %A, %B, %C);
  if ( A == B){
    printf("%d\n",C);
  } else if (A == C){
      printf("%d\n",C);
  }  else if (B == C){
      printf("%d\n",A);
  }
    return 0;   
   }


Compiler output:
main.c: In function 'main':
main.c:5:22: error: expected expression before '%' token
    5 |   scanf ("%d %d %d", %A, %B, %C);
      |                      ^
Language: C

#include <stdio.h>

int main(void){
  int A, B, C;
  scanf ("%d %d %d", %A, %B, %c);
  if ( A == B){
    printf("%d\n",C);
  } else if (A == C){
      printf("%d\n",C);
  }  else if (B == C){
      printf("%d\n",A);
  }
    return 0;   
   }


Compiler output:
main.c: In function 'main':
main.c:5:22: error: expected expression before '%' token
    5 |   scanf ("%d %d %d", %A, %B, %c);
      |                      ^
Language: C

#include <stdio.h>

int main(void){
  int A, B, C;
  scanf ("%d %d %d, %A, %B, %C);
  if ( A == B){
    printf("%d\n",C);
  } else if (A == C){
      printf("%d\n",C);
  }  else if (B == C){
      printf("%d\n",A);
  }
    return 0;   
   }


Compiler output:
main.c: In function 'main':
main.c:5:10: warning: missing terminating " character
    5 |   scanf ("%d %d %d, %A, %B, %C);
      |          ^
main.c:5:10: error: missing terminating " character
    5 |   scanf ("%d %d %d, %A, %B, %C);
      |          ^~~~~~~~~~~~~~~~~~~~~~~
main.c:6:3: error: expected expression before 'if'
    6 |   if ( A == B){
      |   ^~
main.c:13:14: error: expected ';' before '}' token
   13 |     return 0;
      |              ^
      |              ;
   14 |    }
      |    ~
Language: C

#include <stdio.h>

int main(void){
  int A, B, C;
  scanf ("%d %d %d, %A, %B, %c);
  if ( A == B){
    printf("%d\n",C);
  } else if (A == C){
      printf("%d\n",C);
  }  else if (B == C){
      printf("%d\n",A);
  }
    return 0;   
   }

Compiler output:
main.c: In function 'main':
main.c:5:10: warning: missing terminating " character
    5 |   scanf ("%d %d %d, %A, %B, %c);
      |          ^
main.c:5:10: error: missing terminating " character
    5 |   scanf ("%d %d %d, %A, %B, %c);
      |          ^~~~~~~~~~~~~~~~~~~~~~~
main.c:6:3: error: expected expression before 'if'
    6 |   if ( A == B){
      |   ^~
main.c:13:14: error: expected ';' before '}' token
   13 |     return 0;
      |              ^
      |              ;
   14 |    }
      |    ~
Language: C++

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

//type
#define ll long long
typedef pair<int, int> P;
//定数
#define INF 1000000000000 //10^12:∞
#define MOD 1000000007    //10^9+7:合同式の法
#define MAXR 100000       //10^5:配列の最大のrange
//略記
#define PB push_back //挿入
#define MP make_pair //pairのコンストラクタ
#define F first      //pairの一つ目の要素
#define S second     //pairの二つ目の要素
#define Z class
// OTHER
// xの二乗を返す (関数テンプレート版)
template <typename T>
T square(T x) { return x * x; }
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
// loop
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= ll(b); i--)
#define FORA(i, I) for (const auto &i : I)

// vector
#define ALL(x) x.begin(), x.end()

// output
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n", (x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define ln cout << '\n'
template <Z A>
void pr(A a)
{
  cout << a;
  ln;
}
template <Z A, Z B>
void pr(A a, B b)
{
  cout << a << ' ';
}

int ans = 0;
bool check = 0;
string s;
int N = 3;
vector<int> v(N);
int a, b;
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *

int main()
{
  int x;

  cin >> a >> b >> x;
  if (a == b)
    pr(c);
  else if (b == c)
    pr(a);
  else
    pr(b);
  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:67:8: error: 'c' was not declared in this scope
   67 |     pr(c);
      |        ^
a.cc:68:17: error: 'c' was not declared in this scope
   68 |   else if (b == c)
      |                 ^
Language: Java

/**
 * 
 */
package One_out_of_Three;
  
import java.util.Scanner;

public class Main {


	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		int A = scanner.nextInt();
    	int B = scanner.nextInt();
    	int C = scanner.nextInt();
		if(A==B){
			System.out.println(C);
	    }
    	if(B==C){
    		System.out.println(A);
    	}
		if(A==C){
    		System.out.println(B);
    	}
		
      
      
	}

}



Compiler output:
Main.java:13: error: cannot find symbol
		int A = scanner.nextInt();
		        ^
  symbol:   variable scanner
  location: class Main
Main.java:14: error: cannot find symbol
    	int B = scanner.nextInt();
    	        ^
  symbol:   variable scanner
  location: class Main
Main.java:15: error: cannot find symbol
    	int C = scanner.nextInt();
    	        ^
  symbol:   variable scanner
  location: class Main
3 errors
Language: Java

/**
 * 
 */
package One out of Three;
  
import java.util.Scanner;

public class Main {


	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		int A = scanner.nextInt();
    	int B = scanner.nextInt();
    	int C = scanner.nextInt();
		if(A==B){
			System.out.println(C);
	    }
    	if(B==C){
    		System.out.println(A);
    	}
		if(A==C){
    		System.out.println(B);
    	}
		
      
      
	}

}



Compiler output:
Main.java:4: error: ';' expected
package One out of Three;
           ^
1 error
Language: C++

#include <bits/stdc++.h>
#include<iostream>
using namespace std;
 
 int main(){
 	int a,b,c;
 	cin >> a >> b >> c;
 
	 if(a == b){
		 cout << c;
	 }else if(a == c){
 		cout << b;
	}else{
 		cout << a;
 	}


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

#include <bits/stdc++.h>
#include<iostream>
using namespace std;
 
 int main() {
 	int a,b,c;
 	cin >> a >> b >> c;
 
	 if(a == b){
		 cout << c;
	 }else if(a == c){
 		cout << b;
	}else{
 		cout << a;
 	}


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

 int main() {
 	int a,b,c;
 	cin >> a >> b >> c;

	 if(a == b){
		 cout << c;
	 }else if(a == c){
 		cout << b;
	}else{
 		cout << a;
 	}

 }


Compiler output:
a.cc: In function 'int main()':
a.cc:3:9: error: 'cin' was not declared in this scope
    3 |         cin >> a >> b >> c;
      |         ^~~
a.cc:6:18: error: 'cout' was not declared in this scope
    6 |                  cout << c;
      |                  ^~~~
a.cc:8:17: error: 'cout' was not declared in this scope
    8 |                 cout << b;
      |                 ^~~~
a.cc:10:17: error: 'cout' was not declared in this scope
   10 |                 cout << a;
      |                 ^~~~
Language: C++

 int main(void) {
 	int a,b,c;
 	cin >> a >> b >> c;

	 if(a == b){
		 cout << c;
	 }else if(a == c){
 		cout << b;
	}else{
 		cout << a;
 	}

 }


Compiler output:
a.cc: In function 'int main()':
a.cc:3:9: error: 'cin' was not declared in this scope
    3 |         cin >> a >> b >> c;
      |         ^~~
a.cc:6:18: error: 'cout' was not declared in this scope
    6 |                  cout << c;
      |                  ^~~~
a.cc:8:17: error: 'cout' was not declared in this scope
    8 |                 cout << b;
      |                 ^~~~
a.cc:10:17: error: 'cout' was not declared in this scope
   10 |                 cout << a;
      |                 ^~~~
Language: C++

 int main(void) {
 	int a,b,c;
 	cin >> a >> b >> c;

	 if(a == b){
		 cout << c << endl;
	 }else if(a == c){
 		cout << b << endl;
	}else{
 		cout << a << endl;
 	}

 }

Compiler output:
a.cc: In function 'int main()':
a.cc:3:9: error: 'cin' was not declared in this scope
    3 |         cin >> a >> b >> c;
      |         ^~~
a.cc:6:18: error: 'cout' was not declared in this scope
    6 |                  cout << c << endl;
      |                  ^~~~
a.cc:6:31: error: 'endl' was not declared in this scope
    6 |                  cout << c << endl;
      |                               ^~~~
a.cc:8:17: error: 'cout' was not declared in this scope
    8 |                 cout << b << endl;
      |                 ^~~~
a.cc:8:30: error: 'endl' was not declared in this scope
    8 |                 cout << b << endl;
      |                              ^~~~
a.cc:10:17: error: 'cout' was not declared in this scope
   10 |                 cout << a << endl;
      |                 ^~~~
a.cc:10:30: error: 'endl' was not declared in this scope
   10 |                 cout << a << endl;
      |                              ^~~~
Language: C++

#include <iostream>

using namespace std;

int main()
{
    int num1 , num2 , num3;
    cout<<" Enter the three number plase : "<<endl;
    cout << " First number : ";
    cin >> num1;
    cout << " secound number : ";
    cin >> num2;
    cout << " therid number : ";
    cin >> num3;
        if( num1 == num2 )
            cout<<" The number " << num3 << " is different " <<endl;
        else if ( num1 == num3 )
            cout<<" The number " << num2 << " is different " <<endl;
        else if ( num2 == num3 )
            cout<<" The number " << num1 << " is different " <<endl;
   
    return 0;

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

#include <iostream>

using namespace std;

int main()
{
    int num1 , num2 , num3;
    cout<<" Enter the three number plase : "<<endl;
    cout << " First number : ";
    cin >> num1;
    cout << " secound number : ";
    cin >> num2;
    cout << " therid number : ";
    cin >> num3;

    if ( (num1 && num2 && num3) >= -100 && (num1 && num2 && num3) <=100 )
    {
        if( num1 == num2 )
            cout<<" The number " << num3 << " is different " <<endl;
        else if ( num1 == num3 )
            cout<<" The number " << num2 << " is different " <<endl;
        else if ( num2 == num3 )
            cout<<" The number " << num1 << " is different " <<endl;
     }
     else if  ( (num1 && num2 && num3) <= -100 && (num1 && num2 && num3) >=100 )
     {
         cout << "The number is overload"<<endl;
     }
    return 0;

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

#include <bits/stdc++.h>
#define LOCAL
using namespace std;
template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
out << "["; bool first = true;
for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
out << "["; bool first = true;
for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
out << "{"; bool first = true;
for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
out << "{"; bool first = true;
for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
#define int long long
using P = pair<int,int>;
//#########################################
signed main(){
	int a,b,c;cin >> a >>b >>c;
	if(a == b)cout << c << endl;
	if(b == c)cout << a << endl;
	if(c == a)cout << b << <endl;
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:57:32: error: expected primary-expression before '<' token
   57 |         if(c == a)cout << b << <endl;
      |                                ^
Language: C

#include <stdio.h>

int main(void)
{
        int a,b,c;
        scanf("%d%d%d",&a,&b,&c);
        if(a==b)put(c);
        else if(a==c)put(b);
        else put(a);
        return 0;
}


Compiler output:
main.c: In function 'main':
main.c:7:17: error: implicit declaration of function 'put'; did you mean 'puts'? [-Wimplicit-function-declaration]
    7 |         if(a==b)put(c);
      |                 ^~~
      |                 puts
Language: C++

#include<bits/stdc++.h>
using namespace std;
int main()
{
  int a,b,c;
  cin>>a>>b>>c;
  map<int,int> m;
  m[a]++;
  m[b]++;
  m[c]++;
  for(auto x:m)
  {
    if(x.second==1)
    {
      cout<<x.first<<endl;
    }
}

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

#include<stdio.h>

int main()
{
 int A,B,C;

 scanf("%d%d%d",&A,&B,&C);

 if(A==B)printf("%d\n",C);
 else if(A==C)pritnf("%d\n",B);
 else if(B==C)printf("%d\n",A);

 return 0;
}


Compiler output:
main.c: In function 'main':
main.c:10:15: error: implicit declaration of function 'pritnf'; did you mean 'printf'? [-Wimplicit-function-declaration]
   10 |  else if(A==C)pritnf("%d\n",B);
      |               ^~~~~~
      |               printf
Language: C++

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

int main(){
  int A,B<C;
  cin >> A >> B >>C;
  if(A == B){
  cout << C << endl;
  }
if(A == C){
cout << B << endl;
}
  if(B == C){
cout << A << endl;
  }
}


Compiler output:
a.cc: In function 'int main()':
a.cc:5:10: error: expected initializer before '<' token
    5 |   int A,B<C;
      |          ^
a.cc:6:15: error: 'B' was not declared in this scope
    6 |   cin >> A >> B >>C;
      |               ^
a.cc:6:19: error: 'C' was not declared in this scope
    6 |   cin >> A >> B >>C;
      |                   ^