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

/**
 *    +--+--+--++--++--In the name of ALLAH--++--++--+--+--+
 *
 *    author:  skmonir
 *    created: 13-Sep-2020 18:00:58
**/

#include <bits/stdc++.h>

using namespace std;

#define endl                '\n'
#define TN                  typename
#define mod                 1000000007LL
#define len(x)              (int) x.size()
#define all(x)              x.begin(), x.end()
#define rall(x)             x.rbegin(), x.rend()
#define mem(x, y)           memset(x, y, sizeof x)
#define FOR(x, l, r)        for (int x = l; x <= r; ++x)
#define ROF(x, l, r)        for (int x = l; x >= r; --x)

template <TN T> inline void Int(T &n) {
    n = 0; int f = 1; register int ch = getchar();
    for (; !isdigit(ch); ch = getchar()) if (ch == '-') f = -1;
    for (; isdigit(ch); ch = getchar()) n = (n << 3) + (n << 1) + ch - '0';
    n = n * f;
}

template <TN T> T gcd(T a, T b) {return !b ? a : gcd(b, a % b);}
template <TN T> inline void umin(T &a, T b) {a = a < b ? a : b;}
template <TN T> inline void umax(T &a, T b) {a = a > b ? a : b;}
template <TN T, TN W> inline void Int(T &x, W &y) {Int(x), Int(y);}
template <TN T, TN W, TN Q> void Int(T &x, W &y, Q &z) {Int(x, y), Int(z);}

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


int solve() {
	int x; INT(x);
	cout << (x ^ 1) << endl;

    return 0;
}

int main() {
    int tests = 1, CaseNo = 0; //Int(tests);
    while (tests--) {
        //printf("Case %d: ", ++CaseNo);
        solve();
    }
    return 0;
}

Compiler output:
a.cc: In function 'void Int(T&)':
a.cc:23:36: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   23 |     n = 0; int f = 1; register int ch = getchar();
      |                                    ^~
a.cc: In function 'int solve()':
a.cc:40:16: error: 'INT' was not declared in this scope; did you mean 'Int'?
   40 |         int x; INT(x);
      |                ^~~
      |                Int
Language: C++

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define MOD2 1000000007
#define MOD 1000000009
#define endl "\n"
#define pii pair <int, int>
#define pll pair <ll, ll>
#define vvi vector <vector<int>>
#define F first
#define S second




int main()
{   
    IOS;
        #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
        #endif
    
    int n;
    cin >> n;
    if(n == 0)
        cout << 1 << endl;
    else
        cout << 0 << endl;
    
        

    }
    
return 0;
}

Compiler output:
a.cc:36:1: error: expected unqualified-id before 'return'
   36 | return 0;
      | ^~~~~~
a.cc:37:1: error: expected declaration before '}' token
   37 | }
      | ^
Language: C

#include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)

int charToInt(char c){
    char zero_num = '0';
    return (int)c - (int)zero_num;
}

signed main(){
    int x; cin>>x;
    if(x==0){
     cout<<1<<endl;  
    }else{
     cout<<0<<endl;  
    }

    return 0;
}

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

#include <bits/stdc++.h>
#define ll long long
#define ld long double 
#define foi(a,n) for(int i = a; i < n; i++)
#define ee 1000000007
#define pb push_back
 
using namespace std;

void solve() {
    ll n;
	cin >> n;
	if(x){
		cout << 1;
		return;
	}
	else cout << 0;
}

int main() {
    int t = 1;
    //~ cin >> t;
    while(t--){
		solve();
		cout << '\n';
	}
}


Compiler output:
a.cc: In function 'void solve()':
a.cc:13:12: error: 'x' was not declared in this scope
   13 |         if(x){
      |            ^
Language: C++

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

int main(){
	int a;
  cin>>a;
  cout<<a^1<<endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:7:12: error: invalid operands of types 'int' and '<unresolved overloaded function type>' to binary 'operator<<'
    7 |   cout<<a^1<<endl;
      |           ~^~~~~~
Language: C++

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

#define x first
#define y second
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()

using namespace std;
using namespace __gnu_pbds;

typedef tree< int, null_type, less< int >, rb_tree_tag, tree_order_statistics_node_update> ost;
// name.find_by_order(x) or name.order_of_key(x)
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
typedef vector<vector<int>> vvi;

void yes() {printf("YES\n");}
void no() {printf("NO\n");}

int dx4[] = {-1, 1, 0, 0};
int dy4[] = {0, 0, -1, 1};
int dx8[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy8[] = {-1, 0, 1, -1, 1, -1, 0, 1};

const int maxn = 2e5 + 5, maxv = 2e6 + 5;
const int MOD = 1e9 + 7;

int mult(ll a, ll b) {return (a * b) % MOD;}
int pot(int n, int k) {
	int ret = 1, pot = n;
	for(;k > 0;k >>= 1, pot = mult(pot, pot)) 
		ret = mult(ret, (k & 1) ? pot : 1);
	return ret;
}
int divide(int a, int b) {return mult(a, pot(b, MOD - 2));}
int add(int a, int b) {a += b;if(a >= MOD) a -= MOD;return a;}
int sub(int a, int b) {a -= b;if(a < 0) a += MOD;return a;}

vector<int> fact;
void calc_fact(int n) {
	fact = vector<int>(n + 1, 1);
	for(int i = 1;i <= n;i++) fact[i] = mult(fact[i - 1], i);
}
int choose(int n, int k) {return divide(fact[n], mult(fact[n - k], fact[k]));}

bool prime(ll a) {
	if (a == 1) return 0;
	for(ll i = 2;i * i <= a;i++) 
		if (a % i == 0) return 0;
	return 1;
}

ll gcd(ll a, ll b) {return (b == 0 ? a : gcd(b, a % b));}
ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}

ll phi(ll x) {
	double ret = x;
	for(ll i = 2;i * i <= x;i++) {
		if (x % i) continue;
		ret *= (1.0 - 1.0 / (double)i);
		while (x % i == 0) x /= i;
	}
	if (x > 1) ret *= (1.0 - 1.0 / (double)x );
	return (ll)ret;
}

void solve() {
	int x;
	scanf("%d", &x);
	pritnf("%d\n", !x);
}

int main() {
	int t = 1;
	//scanf("%d", &t);
	while(t--) solve();
	return 0;
}


Compiler output:
a.cc: In function 'void solve()':
a.cc:74:9: error: 'pritnf' was not declared in this scope; did you mean 'printf'?
   74 |         pritnf("%d\n", !x);
      |         ^~~~~~
      |         printf
Language: C++

#include <bits/stdc++.h>
#include<windows.h> 
using namespace std;
#define Online
#define nowtime (double)clock()/CLOCKS_PER_SEC
void tie()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
}
int main()
{
	tie();
	#ifndef Online
	freopen("in.txt","r",stdin);
	freopen("out.txt","w",stdout);
	#endif
	int x;
	cin>>x; 
	cout<<!x<<endl;
	#ifndef Online
	fclose(stdin);
	fclose(stdout);
	#endif
	return 0;
}


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

#include <bits/stdc++.h> 
#include <iostream>
 #include<stdio.h>
 #include<math,h>
 #include<string.h>
using namespace std;

int main() {
    int t,n,i,j,k,l;
     int a[100001];
     char s[100001];
     vector<int> v;
     scanf("%d",&n);
     if(n==0)
     printf("1");
     if(n==1)
     printf("0");
	
	return 0;
}


Compiler output:
a.cc:4:10: fatal error: math,h: No such file or directory
    4 |  #include<math,h>
      |          ^~~~~~~~
compilation terminated.
Language: C++

#include<bits/stdc++.h>
using namespace std;
#define M_PI  3.1415926535
#define ll long long
#define ld long double
#define all(a) a.begin(),a.end()
#-define Summon_Tourist ios::sync_with_stdio(false);cin.tie(0);
ll gcd(ll a , ll b) { return b==0?a: gcd( b, a%b); }
ll lcm(ll a , ll b) { return a/gcd(a,b) * b ; }
ll inf = 1e9 + 7
ll modexp( ll base ,ll power)
 {
     if( power == 0  ) return 1;
     if( power & 1) return base*modexp( base , power-1 )%inf;
     return modexp(base*base%inf,power/2);
 }
int main()
{
  Summon_Tourist
  //freopen("input.txt" , "r" , stdin ) ;
  ll t = 1;
  //cin>>t;
  while(t--)
  {
     ll n ; cin>>n ; 
     if( n==0 ) cout<<1;
     else cout<<0;
  }

 return 0;
}


Compiler output:
a.cc:3:9: warning: "M_PI" redefined
    3 | #define M_PI  3.1415926535
      |         ^~~~
In file included from /usr/include/c++/14/cmath:47,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:114,
                 from a.cc:1:
/usr/include/math.h:1121:10: note: this is the location of the previous definition
 1121 | # define M_PI           3.14159265358979323846  /* pi */
      |          ^~~~
a.cc:7:2: error: invalid preprocessing directive #-
    7 | #-define Summon_Tourist ios::sync_with_stdio(false);cin.tie(0);
      |  ^
a.cc:4:12: error: expected ',' or ';' before 'long'
    4 | #define ll long long
      |            ^~~~
a.cc:11:1: note: in expansion of macro 'll'
   11 | ll modexp( ll base ,ll power)
      | ^~
a.cc: In function 'int main()':
a.cc:19:3: error: 'Summon_Tourist' was not declared in this scope
   19 |   Summon_Tourist
      |   ^~~~~~~~~~~~~~
a.cc:23:9: error: 't' was not declared in this scope; did you mean 'tm'?
   23 |   while(t--)
      |         ^
      |         tm
Language: Java

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

public class Solution {
    public static void main(String[] args) throws IOException {
        FastReader sc = new FastReader();
        int x = sc.nextInt();
        
        if (x == 1)
            System.out.println(0);
        else
            System.out.println(1);
    }

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new
                    InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

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

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

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}

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

#include<bits/stdc++.h>
using namespace std;
int main()
{
  int x;
  cin >> x ;
  if(x==1)cout << 0 << '\n';
  else cout << 1 << '\n'l\;
}

Compiler output:
a.cc:8:26: error: stray '\' in program
    8 |   else cout << 1 << '\n'l\;
      |                          ^
a.cc: In function 'int main()':
a.cc:8:21: error: unable to find character literal operator 'operator""l' with 'char' argument
    8 |   else cout << 1 << '\n'l\;
      |                     ^~~~~
Language: C++

#include <bits/stdc++.h>
#define REP(i,n) for (int i=0; i<(n); ++i)
#define REPR(i,n,m) for (int i=(n); i>=(m); --i)
using namespace std;
using LL = long long;
using LD = long double;
using PLL = pair<long long, long long>;
using PLD = pair<long double, long double>;
using VLL = vector<long long>;
using VLD = vector<long double>;
using VPLL = vector<PLL>;
using VPLD = vector<PLD>;

const int INF = numeric_limits<int>::max();
const unsigned long long int ULLINF = numeric_limits<unsigned long long int>::max();

int main() {
    
	int x;
  cin >> x;
  if (x==1) { cout << 0 << endl;}
  else { cout << 1 << endl;
        
  return 0;

}


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

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

typedef __int64 ll;
#define FOR(i,a,b) for(ll i=a;i<ll(b);i++)
#define REP(i,n) FOR(i,0,n)

#define MOD 10e9+7


int main(){
int i,j,k;

scanf("%d",&i);
if(i==0) puts("1");
else puts("0");
return 0;
}


Compiler output:
main.c:5:9: error: unknown type name '__int64'; did you mean '__int64_t'?
    5 | typedef __int64 ll;
      |         ^~~~~~~
      |         __int64_t
Language: C

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

int main() {
  int N;
  cin >> N;
  if (N == 0) {
    cout << 1 << endl;
  } else if (N == 1) {
    cout << 0 << endl;
  }
}


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

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N = 1000000009;
void solve()
{
	ll n;
	cin>>n;
	if(n==0)
	{
		cout<<1<<endl;
		return;
	}
	cout<<0<<return;
}
	

int main()
{
#ifndef ONLINE_JUDGE
	// for getting input from input.txt
	freopen("input.txt", "r", stdin);
	// for writing output to output.txt
	freopen("output.txt", "w", stdout);
#endif

	int t=1;
	//cin >> t;

	while (t--)
	{
		solve();
	}


	return 0;
}


Compiler output:
a.cc: In function 'void solve()':
a.cc:14:18: error: expected primary-expression before 'return'
   14 |         cout<<0<<return;
      |                  ^~~~~~
Language: C++

// MOHIT KUMAR
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pin;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
void change(ll&a , ll b) {a = max(a, b);}
#define ff(i, a, b) for ( ll i=a; i<(b); i++)
#define ffd(i, a, b) for ( ll i=a; i<= b; i++)
#define fr(i, a, b) for ( ll i = (b)-1; i >= a; i--)
#define ffr(i, a, b) for ( ll i = b ; i >= a; i--)
#define vl vector < ll >
#define vp vector < pl >
#define endl "\n"
#define sz(x) (ll)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const ld pi = acos(-1) ;
const ll maxn = 105 ;
const int mod = 1e9 + 7 ;
const ll INF = 1e18 ;
const int MX = 2000000001 ; // check the limits, dummy

int main() {
  ios_base::sync_with_stdio(0) , cin.tie(0);
  ll t, q, n, a, b, c, d, k, l, m, r,  x = 0, y = 0, z = 0 , sum = 0, ans = 0, temp = 0, res = 0 ;
  string s ;
  cin >> n ;
  cout << 1 ^ n << endl ;

}

Compiler output:
a.cc: In function 'int main()':
a.cc:44:17: error: invalid operands of types 'll' {aka 'long long int'} and 'const char [2]' to binary 'operator<<'
   44 |   cout << 1 ^ n << endl ;
      |               ~ ^~
      |               |
      |               ll {aka long long int}
Language: C++

#include<bits/stdc++.h>
using namespace std;
int main (){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int x;
	cin>>x;
	cout<<!x;
-}

Compiler output:
a.cc: In function 'int main()':
a.cc:9:2: error: expected primary-expression before '}' token
    9 | -}
      |  ^
Language: Java

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

public class code
{
	static class FastReader 
    { 
        BufferedReader br; 
        StringTokenizer st; 
  
        public FastReader() 
        { 
            br = new BufferedReader(new InputStreamReader(System.in)); 
        } 
  
        String next() 
        { 
            while (st == null || !st.hasMoreElements()) 
            { 
                try
                {
                    st = new StringTokenizer(br.readLine()); 
                }
                catch (IOException  e) 
                {
                    e.printStackTrace(); 
                }
            } 
            return st.nextToken(); 
        } 
  
        int nextInt() 
        { 
            return Integer.parseInt(next()); 
        } 
  
        long nextLong() 
        { 
            return Long.parseLong(next()); 
        } 
  
        double nextDouble() 
        { 
            return Double.parseDouble(next()); 
        } 
  
        String nextLine() 
        { 
            String str = ""; 
            try
            {
                str = br.readLine(); 
            }
            catch (IOException e) 
            {
                e.printStackTrace(); 
            }
            return str; 
        } 
    }


	public static void main(String args[])throws IOException
	{
		FastReader scn = new FastReader();
		int x = scn.nextInt();
		System.out.println(1 - x);
	}

	public static void dfs(String[] grid, boolean[][] visited, int N, int M, int i, int j, int end_r, int end_c)
	{

		if(visited[end_r][end_c])
			return;

		visited[i][j] = true;
		if(Math.abs(i - end_r) + Math.abs(j - end_c) == 1)
			visited[end_r][end_c] = true;

		if(visited[end_r][end_c])
			return;

		if(isValid(i + 1, j, N, M) && !visited[i + 1][j] && grid[i + 1].charAt(j) == '.')
		{
			dfs(grid, visited, N, M, i + 1, j, end_r, end_c);
		}

		if(isValid(i - 1, j, N, M) && !visited[i - 1][j] && grid[i - 1].charAt(j) == '.')
		{
			dfs(grid, visited, N, M, i - 1, j, end_r, end_c);
		}

		if(isValid(i, j + 1, N, M) && !visited[i][j + 1] && grid[i].charAt(j + 1) == '.')
		{
			dfs(grid, visited, N, M, i, j + 1, end_r, end_c);
		}

		if(isValid(i, j - 1, N, M) && !visited[i][j - 1] && grid[i].charAt(j - 1) == '.')
		{
			dfs(grid, visited, N, M, i, j - 1, end_r, end_c);
		}

	}

	public static boolean isValid(int i, int j, int N, int M)
	{
		return ( i >= 0 && i < N) && ( j >= 0 && j < M);
	}
	
}

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

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define speed                   \
  ios_base::sync_with_stdio(0); \
  cin.tie(0);                   \
  cout.tie(0);
#define ll long long
#define pb push_back
#define mem1(a) memset(a, -1, sizeof(a))
#define mem0(a) memset(a, 0, sizeof(a))
#define endl "\n"
#define mod1 1000000007
#define mod 998244353
#define ff first
#define ss second
#define MAX 500005
#define N 200005
#define INF 1000000009
#define all(v) v.begin(), v.end()
#define sbit(a) __builtin_popcount(a)
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef pair<ll, ll> pll;
typedef pair<pll, ll> ppl;
typedef map<ll, ll> mpll;
typedef map<vector<ll>, ll> mpvl;
unordered_map<ll, vector<pll>> mp;
ll power(ll x, ll y, ll p)
{
  ll res = 1;

  x = x % p;

  if (x == 0)
    return 0;
  while (y > 0)
  {

    if (y & 1)
      res = (res * x) % p;

    y = y >> 1;
    x = (x * x) % p;
  }

  return res;
}
void solve()
{ 
  if(x)cout<<0<<endl;
  else cout<<1<<endl;

  
}

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

Compiler output:
a.cc: In function 'void solve()':
a.cc:57:6: error: 'x' was not declared in this scope
   57 |   if(x)cout<<0<<endl;
      |      ^
Language: C++

#include<bits/stdc++.h>
using namespace std;
long long arr[1000000];
int main()
{
    ios_base::sync_with_stdio(false); 
    cin.tie(NULL);   
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    long long x;
    cin>>x;
    if (x==0)
    {
    	cout<<1<<endl;
	}
	else
	{
		cout<<0<<endl;1
	}
}

Compiler output:
a.cc: In function 'int main()':
a.cc:18:32: error: expected ';' before '}' token
   18 |                 cout<<0<<endl;1
      |                                ^
      |                                ;
   19 |         }
      |         ~
Language: C++

#ifndef ONLINE_JUDGE
    #include "debug.cpp"
#endif

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

#define endl '\n'
#define int long long

const int inf = 1e18 + 5;

void solve()
{
    int x;
    cin >> x;
    cout << x ^ 1 << endl;
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--)
        solve();
    return 0;
}

Compiler output:
a.cc:2:14: fatal error: debug.cpp: No such file or directory
    2 |     #include "debug.cpp"
      |              ^~~~~~~~~~~
compilation terminated.
Language: C++

#include<bits/stdc++.h>
using namespace std;
int main(){
  int x;
  cin>>x;
  if(x==1){coutt<<"0"<<endl;}
  else{cout<<"1"<<endl;}
}

Compiler output:
a.cc: In function 'int main()':
a.cc:6:12: error: 'coutt' was not declared in this scope
    6 |   if(x==1){coutt<<"0"<<endl;}
      |            ^~~~~
Language: Java

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

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int a = sc.nextInt();
        

        if (a == 0)
            System.out.println("1");
        else (a == 1)
            System.out.println("0");

    }
}


Compiler output:
Main.java:14: error: not a statement
        else (a == 1)
             ^
Main.java:14: error: ';' expected
        else (a == 1)
                     ^
2 errors
Language: C++

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

#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds; 
  
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
 
#define FS              ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll              long long int
#define ld              long double
#define pb              push_back
#define bp              __builtin_popcount
#define sz              size()
#define ff              first
#define ss              second
#define vll             vector<ll>
#define vbool           vector<bool>
#define vpll            vector<pair<ll,ll>>
#define pll             pair<ll,ll>
#define vllv            vector<vector<ll>>
#define setpri(x)       cout<<setprecision(x)<<fixed;
#define all(v)          v.begin(),v.end()
#define allr(v)         v.rbegin(),v.rend()
#define yesr {cout<<"YES"<<endl;return;}
#define nor {cout<<"NO"<<endl;return;}
// getline (std::cin,name);
ll MOD=1e9+7;
ll ceil1(ll n,ll x){return (n-1)/x+(n>0);}

ll gcd(ll a,ll b){return __gcd(a,b);}
ll lcm(ll a,ll b){return (max(a,b)/gcd(a,b))*min(a,b);}

ll pow1(ll n,ll m ,ll mod=MOD );
ll pow2(ll n,ll k);

ll modinv(ll n,ll mod=MOD){  return pow1(n,mod-2,mod);}

bool func(pair<ll,ll> &a,pair<ll,ll> &b ){
        if(a.ff != b.ff)return a.ff < b.ff;
        return a.ss > b.ss;
}

ll const N=(ll)2e6+11;
ll const LG=(ll)log2(N)+1;


void solve(){
        ll i,j,k,l,n,m,x,y,z,r;

        
        cin>>x;
        cout<<1-x<<endl
        
        
}       
int main(){
        FS;
        
        ll i,j,k,n,m,x,y,z,q;
        q=1;
        // cin>>q;
        for(ll tc=1;tc<=q;tc++){
                // cout<<"Case #"<<tc<<": ";
                solve();
        }
        return 0;
}


ll pow1(ll n,ll m,ll mod){
        if(m==0)return 1;
        
        if(m%2==0)return pow1((n*n)%mod,m/2,mod);
            
            return (pow1((n*n)%mod,m/2,mod)*n)%mod;
}

ll pow2(ll n,ll k){
        ll ans=1;
            while(k>0){
                if(k%2==1)ans=ans*n;
                n=n*n;
                k/=2;
            }
            return ans;
}


Compiler output:
a.cc: In function 'void solve()':
a.cc:54:24: error: expected ';' before '}' token
   54 |         cout<<1-x<<endl
      |                        ^
      |                        ;
......
   57 | }
      | ~
Language: C++

#include <bits/stdc++.h>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <utility>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <iomanip>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 
//setbase - cout << setbase (16); cout << 100 << endl; Prints 64
//setfill -   cout << setfill ('x') << setw (5); cout << 77 << endl; prints xxx77
//setprecision - cout << setprecision (14) << f << endl; Prints x.xxxx
//cout.precision(x)  cout<<fixed<<val;  // prints x digits after decimal in val
 
using namespace std;
using namespace __gnu_pbds;
 	// find_by_order()  // order_of_key
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define f(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) f(i,0,n)
#define fd(i,a,b) for(ll i=a;i>=b;i--)
#define pb push_back
#define mp make_pair
#define vi vector< int >
#define vl vector< ll >
#define ss second
#define ff first
#define ll long long
#define pii pair< int,int >
#define pll pair< ll,ll >
#define sz(a) a.size()
#define inff (1000*1000*1000+5)
#define all(a) a.begin(),a.end()
#define tri pair<int,pii>
#define vii vector<pii>
#define vll vector<pll>
#define viii vector<tri>
#define pqueue priority_queue< int >
#define pdqueue priority_queue< int,vi ,greater< int > >
#define flush fflush(stdout) 
#define primeDEN 727999983
#define SPEED ios_base::sync_with_stdio(false) ;cin.tie(NULL) ;cout.tie(NULL) ;
#define fp(i,a,n) for(ll i=n-1; i>a ;i--)
#define deb(x) cout << #x << " ---> " << x << endl;
#define X first
#define Y second
#define pia 3.1415926536
#define mod 1000003 
#define mod2 998244353
#define ml map<ll,ll>
#define mll map<pair<ll,ll> ,ll>
#define letsh(a,b) a<<b
#define rigsh(a,b) a>>b 
#define vvl vector<vl>
mt19937 rng32(chrono::steady_clock::now().time_since_epoch().count()) ;
		ll lcm(ll a, ll b)
		{
               return a / __gcd(a, b) * b;
       	}
       ll power(ll a,ll n,ll m=mod)
	   {
        ll ans=1;
        while(n)
		{
        if(n&1) ans=(ans*a)%m;
        a %=m ;
        a=(a*a)%m ;
        n=n>>1;
   		 }
   		 return ans;
      }
      vll dir({{1, 0}, {-1, 0}, {0, 1}, {0, -1}}) ;
      
      ll mul(ll a, ll b) {
				return (ll)(a * 1LL * b % mod);
			    }
			    
			    
void update(ll &a, ll b){
	a -= b;
	if(a >= mod) a %= mod;
	if(a < 0) a += mod;
}

ll inv(ll a)
{
	ll ia = power(a, mod - 2);
	assert(mul(a, ia) == 1);
	return ia;
}

#define N 100050

          void solve()
      {
         ll x ;cin>>x ;
         cout<<x^1<<endl ;
	  
	  }
      
      int main() 
	  {
		SPEED
        ll t =1;
        while(t--) solve() ; 
	  }

Compiler output:
a.cc: In function 'void solve()':
a.cc:110:19: error: invalid operands of types 'int' and '<unresolved overloaded function type>' to binary 'operator<<'
  110 |          cout<<x^1<<endl ;
      |                  ~^~~~~~
Language: C++

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

int main(){
 int s;
  cin>>s;
  if(s==1) cout<<"0";
  else cout<<"1"
}


Compiler output:
a.cc: In function 'int main()':
a.cc:8:17: error: expected ';' before '}' token
    8 |   else cout<<"1"
      |                 ^
      |                 ;
    9 | }
      | ~
Language: C++

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

#define ll long long
#define pb push_back
#define mod 1000000007
#define rep(i,a,n) for(int i=a;i<n;i++)
#define dbg(x) cout<<#x<<" = "<<x<<'\n';

ll isPrime(ll x) {ll i, flag = 1; if(x == 0 || x == 1) flag = 0; for(i = 2; i<=sqrt(x); i++) { if(x%i == 0) {flag = 0; break;}} return flag;}
ll power(ll x, ll y){ll res=1;x=x%mod;while(y>0){if(y&1)res=(res*x)%mod;y=y>>1;x=(x*x)%mod;}return res;}

void solve()
{
  int n;
  cin>>x;
  if(x==0)
    cout<<1<<endl;
  else
  {
    cout<<0<<endl;
  }
  
}  
   
 

int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);cout.tie(NULL);
  int tc;
  cin>>tc;
  while(tc--)
  {
    solve();
  }
  return 0;
}

Compiler output:
a.cc: In function 'void solve()':
a.cc:16:8: error: 'x' was not declared in this scope
   16 |   cin>>x;
      |        ^
Language: C++

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;

#define REP(i, init, n) for(int i = (int)(init); i < (int)(n); i++)

#define vi vector<int>
#define vl vector<long>
#define vvi vector<vector<int>>
#define vvl vector<vector<long>>
#define pint pair<int, int>
#define plong pair<long, long>

int main() {
    int x;
    cin>>x;
    cout << ((x == 0) ? 1 : 0) << endl;
}

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

#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
int main()
{
    int n;
    cin >> n;
    if(n == 1) cout << 0 << endl;
    else cout << 1 << endl;
}


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

#include <bits/stdc++.h>
#include <atcoder/all>
#define FOR(i, a, n) for(int (i) = (int)(a); (i) < (int)(n); ++(i))
#define FORe(i, a, n) for(int (i) = (int)(a); (i) <= (int)(n); ++(i))
#define rFOR(i, a, n) for(int (i) = (int)(n)-1; (i) >= (int)(a); --(i))
#define rFORe(i, a, n) for(int (i) = (int)(n); (i) >= (int)(a); --(i))
#define REP(i, n) FOR((i), 0, (n))
#define REPe(i, n) FORe((i), 1, (n))
#define REPo(i, n) FORe((i), 0, (n))
#define rREP(i, n) rFOR((i), 0, (n))
#define rREPe(i, n) rFORe((i), 1, (n))
#define rREPo(i, n) rFORe((i), 0, (n))
#define rep(i, n) FOR((i), 0, (n))
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define fi first
#define se second
#define dup(x, y) (((x)+(y)-1)/(y))
#define vc(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using pll = pair<ll,ll>;
using T = tuple<int,int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vs = vector<string>;
using vp = vector<P>;
using vt = vector<T>;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

int main() {
  int x;
  cin>>x;
  cout << !x << endl;

  return 0;
}

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

#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
const long long INF = 1ll << 60;



int main() {

  int x;cin x;
  if(x == 0) cout << 1 << endl;
  else cout << 0 << endl;
	return 0;
}



Compiler output:
a.cc: In function 'int main()':
a.cc:12:12: error: expected ';' before 'x'
   12 |   int x;cin x;
      |            ^~
      |            ;
Language: C++

#include<bits/stdc++.h>
using namespace std;
 #define MAX 1000000000005
 #define ll long long int
 int main()
 {
  ll t,k;
        ll c=0,d=0,e,n,sum=1,i,sum1=1,sum2=1,sum3=1,r,sum4=1,a,b,c;
          cin>>a;
           if(a==0)
            cout<<1;
           else
            cout<<0;
          
      
 }
        

Compiler output:
a.cc: In function 'int main()':
a.cc:8:66: error: redeclaration of 'long long int c'
    8 |         ll c=0,d=0,e,n,sum=1,i,sum1=1,sum2=1,sum3=1,r,sum4=1,a,b,c;
      |                                                                  ^
a.cc:8:12: note: 'long long int c' previously declared here
    8 |         ll c=0,d=0,e,n,sum=1,i,sum1=1,sum2=1,sum3=1,r,sum4=1,a,b,c;
      |            ^
Language: C

/* Author : Harshit Jain a.k.a. iharshit009 */
#include <bits/stdc++.h>
#define vi               vector<int>
#define pb(x)            push_back(x)
#define all(x)           x.begin(), x.end()
#define sortall(x)       sort(all(x))
#define sortrev(x)       sort(all(x), greater<int>())
#define debug(x)         cout << '>' << #x << ':' << x << endl;
#define int              long long
#define ld               long double
#define endl 			 "\n";
#define mp 				 make_pair
#define pii 			 <int, int>
#define lb 				 lower_bound
#define ub				 upper_bound
#define len(a)           int((a).size())
#define prec(n)          fixed<<setprecision(n)
#define cnt(n)           __builtin_popcountll(n)
#define pi               pair<int, int>
const int mod = 1000000007;
using namespace std;
using namespace std::chrono;
// const int N = 1e5 + 5; 
// int n;
// int a[N];



int32_t main(){
auto start = high_resolution_clock::now(); // starting clock
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t;
t = 1;
// cin >>t;
while(t--){


int n;
cin >> n;
if(n){
	cout << 1 << endl;
}
else{
	cout << 0 <<endl;
}







}
auto stop = high_resolution_clock::now(); // stop clock
auto duration = duration_cast<microseconds>(stop - start);  // printing duration
cerr << "Time taken by function: " << duration.count() << " milliseconds" << endl; 
return 0;
}

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

#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{   int t; cin>>t; if(x==0)cout<<1;
else cout<<0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:5:23: error: 'x' was not declared in this scope
    5 | {   int t; cin>>t; if(x==0)cout<<1;
      |                       ^
Language: C++

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

int main() {
    fastio
	ll t,i,j,x,k;
    cin>>n;
    
    if(n==0) cout<<"1";
    else cout<<"0";
    
	return 0;
}

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

#include<bits/stdc++.h>
using namespace std;
void solve(){
	cin>>n;
	cout<<n^1<<"\n";
}
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	long t=1;
//	cin>>t;
	while(t--)
		solve();
}

Compiler output:
a.cc: In function 'void solve()':
a.cc:4:14: error: 'n' was not declared in this scope; did you mean 'yn'?
    4 |         cin>>n;
      |              ^
      |              yn
a.cc:5:18: error: invalid operands of types 'int' and 'const char [2]' to binary 'operator<<'
    5 |         cout<<n^1<<"\n";
      |                 ~^~~~~~
      |                 |  |
      |                 |  const char [2]
      |                 int
Language: Java

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

public class Atcoder {

    public static void main(String[] args) {
        FastReader fs = new FastReader();
        int x = fs.nextInt();
        if (x == 1) System.out.println(0);
        else System.out.println(1);


    }


    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new
                    InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

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

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

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}


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

#include<bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define mp make_pair
#define ll long long
#define pb push_back

void solve()
{
  int x;
  cin>>x;
  
  cout<<1-x<<endl;
    
}

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

Compiler output:
a.cc: In function 'int main()':
a.cc:24:16: error: expected ';' before '}' token
   24 |         solve()
      |                ^
      |                ;
   25 |     }
      |     ~
Language: C

#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset>    // bitset
#include <deque>     // deque
#include <iomanip>   //setprecsion
#include <iostream>  // cout, endl, cin
#include <map>       // map
#include <queue>     // queue, priority_queue
#include <set>       // set
#include <stack>     // stack
#include <string>    // string, to_string, stoi
#include <tuple>     // tuple, make_tuple
#include <utility>   // pair, make_pair
#include <vector>    // vector

#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>  //sin, cos, tan

using namespace std;

#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef string str;

typedef vector<ll> vll;
typedef vector<ld> vd;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<str> vs;
typedef vector<vector<ll>> vvll;
typedef vector<vector<ld>> vvd;
typedef vector<vector<bool>> vvb;
typedef vector<vector<char>> vvc;
typedef vector<vector<str>> vvs;
typedef vector<pair<ll, ll>> vpll;

const ld PI = acos(-1.0);
const ll MAX = 9000000000000000000;
const ll MIN = -9000000000000000000;
const ll MOD = 1000000007;

template <typename T>
void fin(T a)
{
    cout << a << endl;
    exit(0);
}

void Main()
{
    ll x; cin >> x;
    if(x == 0) fin(1);
    else fin(0);

}

//前処理
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(10); //高精度少数表示
    Main();
    return 0;
}


Compiler output:
main.c:1:10: fatal error: algorithm: No such file or directory
    1 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
      |          ^~~~~~~~~~~
compilation terminated.
Language: C++

#include<bits/stdc++.h>

using namespace std;

int main(){
	int n;
	cin>>n;
	cout<<n^1<<endl;
	
}

Compiler output:
a.cc: In function 'int main()':
a.cc:8:18: error: invalid operands of types 'int' and '<unresolved overloaded function type>' to binary 'operator<<'
    8 |         cout<<n^1<<endl;
      |                 ~^~~~~~
Language: C++

#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define mp  make_pair
#define pb  push_back
#define endl "\n"
#define rep(i,a,n) for(int i=a;i<n;i++)
const int mod = 1e9 + 7;
void solve() {
	int n;
	cin >> n;
	if(x==0){
		cout<<1;
	}
	else{
		cout<<0;
	}
	
}
int32_t main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output1.txt", "w", stdout);
#endif
	int t;
	t=1;
	//cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}


Compiler output:
a.cc: In function 'void solve()':
a.cc:12:12: error: 'x' was not declared in this scope
   12 |         if(x==0){
      |            ^
Language: C++

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

typedef string str;
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef vector<int> vi;
typedef vector<bool> vb;

#define pb push_back
#define fi first
#define se second
#define in insert
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)

#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)

const int MID = 1e5 + 3;
const int INF = 1e9 + 5;
const int MOD = 1e9 + 7;

int main(){
	speed;
	int x;
	cin >> x;
	if(x){
		cout << 0;
	}
	else[
		cout << 1;
	]
}

Compiler output:
a.cc: In function 'int main()':
a.cc:39:17: warning: capture of variable 'std::cout' with non-automatic storage duration
   39 |                 cout << 1;
      |                 ^~~~
In file included from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:146,
                 from a.cc:2:
/usr/include/c++/14/iostream:63:18: note: 'std::ostream std::cout' declared here
   63 |   extern ostream cout;          ///< Linked to standard output
      |                  ^~~~
a.cc:39:21: error: expected ',' before '<<' token
   39 |                 cout << 1;
      |                     ^~~
      |                     ,
a.cc:39:22: error: expected identifier before '<<' token
   39 |                 cout << 1;
      |                      ^~
a.cc:39:26: error: expected ']' before ';' token
   39 |                 cout << 1;
      |                          ^
      |                          ]
a.cc: In lambda function:
a.cc:39:26: error: expected '{' before ';' token
a.cc: In function 'int main()':
a.cc:40:9: error: expected primary-expression before ']' token
   40 |         ]
      |         ^
Language: C++

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int x;
	cin>>x;
	cout<<1-x<<endl
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:7:24: error: expected ';' before 'return'
    7 |         cout<<1-x<<endl
      |                        ^
      |                        ;
    8 |         return 0;
      |         ~~~~~~
Language: C++

#include "atcoder/all"
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;

using namespace std;
using namespace atcoder;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}

#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VV(T, a, b, c) vector<vector<T>>(a, vector<T>(b, c))
#define VVVL(a, b, c, d)                                                       \
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define VVV(T, a, b, c, d)                                                     \
  vector<vector<vector<T>>>(a, vector<vector<T>>(b, vector<T>(c, d)))
#define SP(a) fixed << setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \
  do {                                                                         \
    sort(ALL((vec)));                                                          \
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \
  } while (0)

ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll N;
  vl A;
  cin >> N;
  cout << ((N + 1) % 2) << endl;

  return 0;
}


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

/*
auth - @sportykush
*/

#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp> 
// #include <ext/pb_ds/tree_policy.hpp> 
// typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set; 
// using namespace __gnu_pbds;

typedef long long int ll;
typedef long double ld;

//#define mp make_pair
#define bug(v)                    cerr<<#v<<" = "<<(v)<<endl;
#define bug2(v1,v2)               cerr<<#v1<<" = "<<(v1)<< ' ' << #v2<<" = "<<(v2)<<endl;
#define ERASE(x)                  x.erase(unique(x.begin(),x.end()),x.end())
#define pb                        emplace_back
#define vii                       vector<int>
#define vll                       vector<ll>
#define vpll                      vector< pair <ll,ll> >
#define pll                       pair <ll,ll>
#define pii                       pair <int,int>
#define pq                        priority_queue< int >
#define khtm                      "\n"
#define F                         first
#define S                         second
#define fr(i,a,n)                 for(i=a;i<n;i++)
#define mem(arr,l)                memset(arr,l,sizeof arr)
#define ALL(x)                    x.begin(), x.end()
#define frr(i,a,n)                for(i=n-1;i>=a;i--)
#define fast                      ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define testcase                  ll T; cin>>T; while(T--)


const double pi = 3.14159265359;
const int MAX = 1e6 +2;
const ll inf =  1e18;
const int N = 1010;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
//const ll mod = 998244353;
const ll mod = 1000000007;
inline ll add(ll a,ll b){a+=b;if(a>=mod)a-=mod;return a;}
inline ll mul(ll a,ll b){return (((a+mod)%mod)*(b+mod)%mod)%mod;}
inline ll power(ll a,ll b){ll rt=1;while(b>0){if(b&1)rt=mul(rt,a);a=mul(a,a);b>>=1;}return rt;}
inline ll modInverse(ll n, ll p){ return power(n, p-2)%p; }

/*
important builtin functions
__gcd(value1, value2)
__builtin_ffs(x)
  Number of leading zeroes: __builtin_clz(x)
  Number of trailing zeroes : __builtin_ctz(x)
  Number of set bits: __builtin_popcount(x)
*/
 
void stArt()
{
	#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
	#endif
}
void eNd()
{
	#ifndef ONLINE_JUDGE
  	cout<<"\nTime Elapsed : " << 1.0*clock() / CLOCKS_PER_SEC << " s";
  	#endif
}

//////////////////// start /////////////////////////////////
 

ll i,j,k,l,m,r,n;
ll a[MAX],b[MAX];


int main()
{
 
stArt();
fast
//cout << setprecision(15) << fixed;

cin >> x;
cout << x^1;
  
 eNd();
  return 0;
 
}

Compiler output:
a.cc: In function 'int main()':
a.cc:87:8: error: 'x' was not declared in this scope
   87 | cin >> x;
      |        ^