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

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = 1000000007;

long long modpow(long long a, long long n, long long mod) {
  long long res = 1;
  while (n > 0) {
    if (n & 1) res = res * a % MOD;
    a = a * a % MOD;
    n >>= 1;
  }
  return res;
}

int comb( int N, int K ){
  int X = 1; //分子
  int Y = 1; //分母
  for( int i = N; i > N-K; i-- ){
    X = (X*i)%MOD;
  }
  for( int i = 1; i <= K; i++ ){
    Y = (Y*i)%MOD;
  }
  return X/Y;
}


signed main() {
  int N, A, B;
  cin >> N >> A >> B;
  
  int ans = modpow(2, N, MOD);
  ans = (ans - 1 + MOD) % MOD;
  ans = (ans - comb(N,A) + MOD) % MOD;
  ans = (ans - comb(N,B) + MOD) % MOD
  cout << ans << endl;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:36:38: error: expected ';' before 'cout'
   36 |   ans = (ans - comb(N,B) + MOD) % MOD
      |                                      ^
      |                                      ;
   37 |   cout << ans << endl;
      |   ~~~~
Language: C++

def choose(n, r, M):
    x = 1
    y = 1

    for i in range(r):
        x = x * (n - i) % M
        y = y * (i + 1) % M
    res = x * pow(y, M-2, M) % M
    return res

n, a, b = map(int, input().split())
M = 10 ** 9 + 7

print((pow(2, n, M) - 1 - choose(n, a, M) - choose(n, b, M)) % M)


Compiler output:
a.cc:1:1: error: 'def' does not name a type
    1 | def choose(n, r, M):
      | ^~~
Language: C++

#include <iostream>
#include <vector>

using CombArray = std::vector<__int64>;
using SquareCombArray = std::vector<CombArray>;

// http://caprest.hatenablog.com/entry/2016/05/29/181102
void MakeComb(SquareCombArray& v) {
    for (int i = 0; i < v.size(); i++) {
        v[i][0] = 1;
        v[i][i] = 1;
    }
    for (int k = 1; k < v.size(); k++) {
        for (int j = 1; j < k; j++) {
            v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]);
        }
    }
}

int main()
{
    int kindCount = 0;
    std::cin >> kindCount;

    int hateNum1 = 0;
    std::cin >> hateNum1;

    int hateNum2 = 0;
    std::cin >> hateNum2;

    SquareCombArray comb(kindCount + 1, CombArray(kindCount + 1, 0));
    MakeComb(comb);

    __int64 total = 0;
    for (auto pick = 1; pick <= kindCount; ++pick)
    {
        if (pick == hateNum1 || pick == hateNum2)
        { 
            continue;
        }
        total += comb[kindCount][pick];
    }

    constexpr auto modifier = __int64(10e9) + 7;

    std::cout << total % modifier;
    return 0;
}

Compiler output:
a.cc:4:31: error: '__int64' was not declared in this scope; did you mean '__int64_t'?
    4 | using CombArray = std::vector<__int64>;
      |                               ^~~~~~~
      |                               __int64_t
a.cc:4:38: error: template argument 1 is invalid
    4 | using CombArray = std::vector<__int64>;
      |                                      ^
a.cc:4:38: error: template argument 2 is invalid
a.cc:5:37: error: 'CombArray' was not declared in this scope
    5 | using SquareCombArray = std::vector<CombArray>;
      |                                     ^~~~~~~~~
a.cc:5:46: error: template argument 1 is invalid
    5 | using SquareCombArray = std::vector<CombArray>;
      |                                              ^
a.cc:5:46: error: template argument 2 is invalid
a.cc:8:6: error: variable or field 'MakeComb' declared void
    8 | void MakeComb(SquareCombArray& v) {
      |      ^~~~~~~~
a.cc:8:15: error: 'SquareCombArray' was not declared in this scope
    8 | void MakeComb(SquareCombArray& v) {
      |               ^~~~~~~~~~~~~~~
a.cc:8:32: error: 'v' was not declared in this scope
    8 | void MakeComb(SquareCombArray& v) {
      |                                ^
a.cc: In function 'int main()':
a.cc:31:5: error: 'SquareCombArray' was not declared in this scope
   31 |     SquareCombArray comb(kindCount + 1, CombArray(kindCount + 1, 0));
      |     ^~~~~~~~~~~~~~~
a.cc:32:14: error: 'comb' was not declared in this scope; did you mean 'wctomb'?
   32 |     MakeComb(comb);
      |              ^~~~
      |              wctomb
a.cc:32:5: error: 'MakeComb' was not declared in this scope
   32 |     MakeComb(comb);
      |     ^~~~~~~~
a.cc:34:5: error: '__int64' was not declared in this scope; did you mean '__int64_t'?
   34 |     __int64 total = 0;
      |     ^~~~~~~
      |     __int64_t
a.cc:41:9: error: 'total' was not declared in this scope
   41 |         total += comb[kindCount][pick];
      |         ^~~~~
a.cc:46:18: error: 'total' was not declared in this scope
   46 |     std::cout << total % modifier;
      |                  ^~~~~
Language: C++

#include<bits/stdc++.h>
using namespace std;
#define long long ll;
const int mod =1e9+7;
ll ksm(ll a,ll b) {ll res=1;a%=MOD; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%MOD;a=a*a%MOD;}return res;}
long Con(int n,int k){
  long x=1,y=1;
  for(int i=1;i<=k;i++){
    x = x*(n-i+1)%mod;
    y = y*i;
  }
  return x*ksm(y,mod-2)%mod;
}
int main(){
  long n,a,b;
  cin>>n>> a>> b;
  long ans = ksm(2,n);
  ans -=Con(n,a);
  ans -=Con(n,b);
  ans--;
  cout<<(ans%mod+mod)%mod<<endl;
  return 0; 
}

Compiler output:
a.cc:5:1: error: 'll' does not name a type
    5 | ll ksm(ll a,ll b) {ll res=1;a%=MOD; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%MOD;a=a*a%MOD;}return res;}
      | ^~
a.cc:6:6: error: ISO C++ forbids declaration of 'Con' with no type [-fpermissive]
    6 | long Con(int n,int k){
      |      ^~~
a.cc: In function 'int Con(int, int)':
a.cc:7:8: error: 'x' was not declared in this scope
    7 |   long x=1,y=1;
      |        ^
a.cc:7:12: error: 'y' was not declared in this scope
    7 |   long x=1,y=1;
      |            ^
a.cc:12:12: error: 'ksm' was not declared in this scope
   12 |   return x*ksm(y,mod-2)%mod;
      |            ^~~
a.cc: In function 'int main()':
a.cc:15:8: error: 'n' was not declared in this scope; did you mean 'yn'?
   15 |   long n,a,b;
      |        ^
      |        yn
a.cc:15:10: error: 'a' was not declared in this scope
   15 |   long n,a,b;
      |          ^
a.cc:15:12: error: 'b' was not declared in this scope
   15 |   long n,a,b;
      |            ^
a.cc:3:19: error: redeclaration of 'long int ll'
    3 | #define long long ll;
      |                   ^~
a.cc:17:3: note: in expansion of macro 'long'
   17 |   long ans = ksm(2,n);
      |   ^~~~
a.cc:3:19: note: 'long int ll' previously declared here
    3 | #define long long ll;
      |                   ^~
a.cc:15:3: note: in expansion of macro 'long'
   15 |   long n,a,b;
      |   ^~~~
a.cc:17:8: error: 'ans' was not declared in this scope; did you mean 'abs'?
   17 |   long ans = ksm(2,n);
      |        ^~~
      |        abs
a.cc:17:14: error: 'ksm' was not declared in this scope
   17 |   long ans = ksm(2,n);
      |              ^~~
Language: C++

#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef pair<int,int> P;

ll C = (1 << 30);
ll CR = C % mo;



std::vector<std::vector<long long>> comb(int n, int r) {
  std::vector<std::vector<long long>> v(n + 1,std::vector<long long>(n + 1, 0));
  for (int i = 0; i < v.size(); i++) {
    v[i][0] = 1;
    v[i][i] = 1;
  }
  for (int j = 1; j < v.size(); j++) {
    for (int k = 1; k < j; k++) {
      v[j][k] = (v[j - 1][k - 1] + v[j - 1][k]);
    }
  }
  return v;
}

const ll M = mo;


//a,bの範囲的にこれだけ配列を用意していけば十分

ll mpow(ll x, ll n){ //x^n(mod mo) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
    ll ans = 1;
    while(n != 0){
        if(n&1) ans = ans*x % mo;
        x = x*x % mo;
        n = n >> 1;
    }
    return ans;
}
ll combi(ll n, ll r) {
  if ( r * 2 > n ) r = n - r;
  ll dividend = 1;
  ll divisor  = 1;
  for ( ll i = 1; i <= r; ++i ) {
    dividend *= (n-i+1);
    dividend %= mo;
    divisor  *= i;
    divisor %= mo;
  }
  return (dividend * mpow(divisor, mo-2)) % mo;
}
/*
ll comb(ll a, ll b){ //aCbをmod計算
    vector<ll> fac(1000000000); //n!(mod M)
    vector<ll> ifac(1000000000); //k!^{M-2} (mod M)
    if(a == 0 && b == 0)return 1;
    if(a < b || a < 0)return 0;
    ll tmp = ifac[a-b]* ifac[b] % M;
    return tmp * fac[a] % M;
}

ll solve(ll n, ll a, ll b){
    ll nn = n/2;
    if(n == 0){
        return 1;
    }
    if(n % 2 == 0){
        ll s = solve(nn);
        return s*s % mo;
    } else{
        ll s = solve(nn);
        return s*s*2 % mo;
    }
}*/

int main(){
    ll n,a,b;
    cin >> n >> a >> b;
    ll q = n / 30;
    ll r = n % 30;

    ll res=1;
    for(int i = 0; i<q; i++){
        res *= CR;
        res %= mo; 
    }
    for(int i = 0; i<r; i++){
        res *= 2;
        res %= mo;
    }
    //cout << res << endl;
    //ll tmp1 = comb(n, a)[n][a];
    //ll tmp2 = comb(n, b)[n][b];
    ll tmp1 = combi(n, a);
    ll tmp2 = combi(n, b);
    //cout << tmp1 << endl;
    tmp1 %= mo;
    tmp2 %= mo;

    res = res - 1 - tmp1 - tmp2
    while(res < 0) res += mo;
    cout << res % mo << endl;

}


Compiler output:
a.cc: In function 'int main()':
a.cc:101:32: error: expected ';' before 'while'
  101 |     res = res - 1 - tmp1 - tmp2
      |                                ^
      |                                ;
  102 |     while(res < 0) res += mo;
      |     ~~~~~
Language: C++

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD=1e9+7ll;
int n,a,b,ans;

inline pow(int a,int n)
{
	int res=1ll;
	while (n)
	{
		if (n&1ll) res=res*a%MOD;
		a=a*a%MOD;
		n>>=1ll;
	}
	return res%MOD;
}

inline int C(int n,int m)
{
	if (n<m) return 0ll;
	if (m<n-m) m=n-m;
	int a=1ll;
	for (register int i=m+1; i<=n; ++i) a=a*i%MOD;
	int b=1ll;
	for (register int i=1; i<=n-m; ++i) b=b*i%MOD;
	return a*pow(b,MOD-2ll)%MOD;
}

inline int Lucas(int n,int m)
{
	if (n<m) return 0ll;
	if (n==m && !m) return 1ll;
	return C(n/MOD,m/MOD)*C(n%MOD,m%MOD)%MOD;
}

signed main(){
	scanf("%lld%lld%lld",&n,&a,&b);
	ans=((pow(2ll,n)-Lucas(n,a)-Lucas(n,b)-1ll)%MOD+MOD)%MOD;
	printf("%lld\n",ans);
return 0;	
}

Compiler output:
a.cc:7:8: error: ISO C++ forbids declaration of 'pow' with no type [-fpermissive]
    7 | inline pow(int a,int n)
      |        ^~~
a.cc: In function 'long long int C(long long int, long long int)':
a.cc:24:27: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   24 |         for (register int i=m+1; i<=n; ++i) a=a*i%MOD;
      |                           ^
a.cc:26:27: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   26 |         for (register int i=1; i<=n-m; ++i) b=b*i%MOD;
      |                           ^
Language: C++

#include<bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
const lint mod=1e9+7;

lint mod_nCr(lint _n, lint _r){
    if(_r*2 > _n) _r = _n - _r;
    vector<lint> _r_num(_r);
    REP(i,_r) tmp[i] = _r-i;
    lint cnt = 1;
    lint flg = 0;
    REP(i,_r){
        cnt *= _n;
        REP(i,_r){
            if(flg == _r) break;
            if(tmp[i] != 0 && cnt%tmp[i] == 0){
                cnt /= tmp[i];
                tmp[i] = 0;
                flg++;
            }
        }
        cnt = cnt%mod;
        _n--;
    }

    return cnt;
}

int main()
{
    lint n, a, b;
    cin >> n >> a >> b;

    lint cnt = 0;
    REP(i,n/2){
        cnt += mod_nCr(n, i+1);
        cnt = cnt%mod;
    }
    cnt *= 2;
    cnt = cnt%mod;
    if(n%2 == 1) cnt += mod_nCr(n, n/2+1);
    cnt = cnt%mod;
    cnt -= mod_nCr(n, a);
    cnt = cnt%mod;
    cnt -= mod_nCr(n, b);
    cnt = cnt%mod;
    
    cout << cnt << "\n";
    return 0;
}


Compiler output:
a.cc: In function 'lint mod_nCr(lint, lint)':
a.cc:19:15: error: 'tmp' was not declared in this scope; did you mean 'tm'?
   19 |     REP(i,_r) tmp[i] = _r-i;
      |               ^~~
      |               tm
a.cc:26:16: error: 'tmp' was not declared in this scope; did you mean 'tm'?
   26 |             if(tmp[i] != 0 && cnt%tmp[i] == 0){
      |                ^~~
      |                tm
Language: C++

#include <iostream>
using namespace std;
const int MAX = 1000000010;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];

void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (long long i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}

long long COM(long long n, long long k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

int main() {
    int n; cin >> n;
    int a, b; cin >> a >> b;
    COMinit();
    long long ans = 0;
    for (int i = 1; i <= n; i++) {
        if (i != a && i != b) ans += COM(n, i) % MOD;
    }
    cout << ans << endl;
}

Compiler output:
/tmp/cccqsNY7.o: in function `COMinit()':
a.cc:(.text+0x20): relocation truncated to fit: R_X86_64_PC32 against symbol `finv' defined in .bss section in /tmp/cccqsNY7.o
a.cc:(.text+0x2b): relocation truncated to fit: R_X86_64_PC32 against symbol `finv' defined in .bss section in /tmp/cccqsNY7.o
a.cc:(.text+0x32): relocation truncated to fit: R_X86_64_PC32 against symbol `finv' defined in .bss section in /tmp/cccqsNY7.o
a.cc:(.text+0x39): relocation truncated to fit: R_X86_64_PC32 against symbol `inv' defined in .bss section in /tmp/cccqsNY7.o
a.cc:(.text+0xd0): relocation truncated to fit: R_X86_64_PC32 against symbol `inv' defined in .bss section in /tmp/cccqsNY7.o
a.cc:(.text+0x130): relocation truncated to fit: R_X86_64_PC32 against symbol `inv' defined in .bss section in /tmp/cccqsNY7.o
a.cc:(.text+0x14b): relocation truncated to fit: R_X86_64_PC32 against symbol `finv' defined in .bss section in /tmp/cccqsNY7.o
a.cc:(.text+0x162): relocation truncated to fit: R_X86_64_PC32 against symbol `inv' defined in .bss section in /tmp/cccqsNY7.o
a.cc:(.text+0x1af): relocation truncated to fit: R_X86_64_PC32 against symbol `finv' defined in .bss section in /tmp/cccqsNY7.o
/tmp/cccqsNY7.o: in function `COM(long long, long long)':
a.cc:(.text+0x22c): relocation truncated to fit: R_X86_64_PC32 against symbol `finv' defined in .bss section in /tmp/cccqsNY7.o
a.cc:(.text+0x247): additional relocation overflows omitted from the output
collect2: error: ld returned 1 exit status
Language: C++

#include<iostream>
#include<vector>
#include <cstdint>
#include <math.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
ll m, p, q;
const int MAX = 1000000000;
const int MOD = 1000000007;

long long fac[MAX], finv[MAX], inv[MAX];

// テーブルを作る前処理
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}

// 二項係数計算
long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

int main() {
    cin >> m >> p >> q;
    if (m == 0) {
        cout << 0 << endl;
    }
    COMinit();
    ll al = COM(m, p);
    ll bl = COM(m, q);
    ll c = (pow(2, m) - 1);
    ll ans = c % MOD - al - bl;
    cout << ans << endl;
}

Compiler output:
/tmp/ccUx9AGl.o: in function `COMinit()':
a.cc:(.text+0x20): relocation truncated to fit: R_X86_64_PC32 against symbol `finv' defined in .bss section in /tmp/ccUx9AGl.o
a.cc:(.text+0x2b): relocation truncated to fit: R_X86_64_PC32 against symbol `finv' defined in .bss section in /tmp/ccUx9AGl.o
a.cc:(.text+0x32): relocation truncated to fit: R_X86_64_PC32 against symbol `finv' defined in .bss section in /tmp/ccUx9AGl.o
a.cc:(.text+0x39): relocation truncated to fit: R_X86_64_PC32 against symbol `inv' defined in .bss section in /tmp/ccUx9AGl.o
a.cc:(.text+0xd4): relocation truncated to fit: R_X86_64_PC32 against symbol `inv' defined in .bss section in /tmp/ccUx9AGl.o
a.cc:(.text+0x135): relocation truncated to fit: R_X86_64_PC32 against symbol `inv' defined in .bss section in /tmp/ccUx9AGl.o
a.cc:(.text+0x150): relocation truncated to fit: R_X86_64_PC32 against symbol `finv' defined in .bss section in /tmp/ccUx9AGl.o
a.cc:(.text+0x168): relocation truncated to fit: R_X86_64_PC32 against symbol `inv' defined in .bss section in /tmp/ccUx9AGl.o
a.cc:(.text+0x1b7): relocation truncated to fit: R_X86_64_PC32 against symbol `finv' defined in .bss section in /tmp/ccUx9AGl.o
/tmp/ccUx9AGl.o: in function `COM(int, int)':
a.cc:(.text+0x22e): relocation truncated to fit: R_X86_64_PC32 against symbol `finv' defined in .bss section in /tmp/ccUx9AGl.o
a.cc:(.text+0x249): additional relocation overflows omitted from the output
collect2: error: ld returned 1 exit status
Language: C++

#include "Header.h"
//#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
long long modinv(long long a, long long m) {
    long long b = m, u = 1, v = 0;
    while (b) {
        long long t = a / b;
        a -= t * b; swap(a, b);
        u -= t * v; swap(u, v);
    }
    u %= m;
    if (u < 0) u += m;
    return u;
}
long long bai(long long a, long long b) {
    long long ans = 1;
    for (long long i = b; i <= a; i++)
    {
        ans *= i;
        ans %= mod;
    }
    return ans;
}

using ll = long long int;
ll count_prs = 0;
ll PowMod_RepeatSquaring(ll N, ll P, ll M) {
    ++count_prs;
    if (P == 0) return 1;
    if (P % 2 == 0) {
        ll t = PowMod_RepeatSquaring(N, P / 2, M);
        return t * t % M;
    }
    return N * PowMod_RepeatSquaring(N, P - 1, M);
}
int main() {
	long long n,a,b,ans=1;
	cin >> n >> a >> b;
    ans = PowMod_RepeatSquaring(2, n, mod);
    ans -= (bai(n, max(n - a + 1, a + 1)) % mod * modinv(bai(min(a, n - a), 1), mod) % mod)%mod;
    ans -= (bai(n, max(n - b + 1, b + 1)) % mod * modinv(bai(min(b, n - b), 1), mod) % mod)%mod;
    //cout << bai(n, max(n - b + 1, b + 1)) % mod * modinv(bai(min(b, n - b), 1), mod) % mod;
    ans--;
    if(ans<=0)ans += mod;
    cout << ans%mod;
}
//BABABA
/*
BBB
ABAB
BABA
BABA
*/

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

#include<stdio.h>

long long combination(long long n, long long r)
{
    if (r == 0 || r == n)
        return (1);
    else if (r == 1)
        return (n);
    return (combination(n - 1, r - 1) + combination(n - 1, r));
}

int main(){
  long long int i,j,k,ans,tmp,N,a,b;
  
  scanf("%lld %lld %lld", &N,&a,&b);
  
  for(i=1;i<=N;i++){
    if(i != a && i != b){
      tmp=combination(N,i)%(10e9+7);
      ans+=tmp;
    }
  }
  
  ans%=(10e9+7);
  prinf("%lld\n",ans);
  return 0;
}

Compiler output:
main.c: In function 'main':
main.c:19:27: error: invalid operands to binary % (have 'long long int' and 'double')
   19 |       tmp=combination(N,i)%(10e9+7);
      |           ~~~~~~~~~~~~~~~~^~~~~~~~~
      |           |                     |
      |           long long int         double
main.c:24:6: error: invalid operands to binary % (have 'long long int' and 'double')
   24 |   ans%=(10e9+7);
      |      ^~~~~~~~~~
      |             |
      |             double
main.c:25:3: error: implicit declaration of function 'prinf'; did you mean 'printf'? [-Wimplicit-function-declaration]
   25 |   prinf("%lld\n",ans);
      |   ^~~~~
      |   printf
Language: C++

#include<bits/stdc++.h>
 
using namespace std;
 
long　long fac(long long n){
  if(n == 0) return 0;
  else return n*fac(n-1);
}
 
int main(){
  long long n, a, b;
  cin >> n >> a >> b;
  long long sum = 0;
  
  for (int i = 1; i <= n; i++){
    
    if(i == a || i == b) {continue;}
    else{
    sum += (long long)fac(n)/(fac(n-i)*fac(i))% (pow(10,9) + 7);
  }
  
  cout << sum % ((long )pow(10,9) + 7) << endl;
  
  return 0;
}

Compiler output:
a.cc:5:1: error: extended character 　 is not valid in an identifier
    5 | long　long fac(long long n){
      | ^
a.cc:5:1: error: 'long\U00003000long' does not name a type
    5 | long　long fac(long long n){
      | ^~~~~~~~~~
a.cc: In function 'int main()':
a.cc:19:23: error: 'fac' was not declared in this scope
   19 |     sum += (long long)fac(n)/(fac(n-i)*fac(i))% (pow(10,9) + 7);
      |                       ^~~
a.cc:25:2: error: expected '}' at end of input
   25 | }
      |  ^
a.cc:10:11: note: to match this '{'
   10 | int main(){
      |           ^
Language: C++

#include<bits/stdc++.h>
 
using namespace std;
 
long　long fac(long long n){
  if(n == 0) return 0;
  else return n*fac(n-1);
}
 
int main(){
  long long n, a, b;
  cin >> n >> a >> b;
  long long sum = 0;
  
  for (int i = 1; i <= n; i++){
    
    if(i == a || i == b) {continue;}
    else{
    sum += (long long)fac(n)/(fac(n-i)*fac(i))% (pow(10,9) + 7);}
  }
  
  cout << sum % ((long )pow(10,9) + 7) << endl;
  
  return 0;
}

Compiler output:
a.cc:5:1: error: extended character 　 is not valid in an identifier
    5 | long　long fac(long long n){
      | ^
a.cc:5:1: error: 'long\U00003000long' does not name a type
    5 | long　long fac(long long n){
      | ^~~~~~~~~~
a.cc: In function 'int main()':
a.cc:19:23: error: 'fac' was not declared in this scope
   19 |     sum += (long long)fac(n)/(fac(n-i)*fac(i))% (pow(10,9) + 7);}
      |                       ^~~
Language: C++

#include<bits/stdc++.h>
 
using namespace std;
 
long　long fac(long long n){
  if(n == 0) return 0;
  else returm n*fac(n-1);
}
 
int main(){
  long long n, a, b;
  cin >> n >> a >> b;
  long long sum = 0;
  
  for (int i = 1; i <= n; i++){
    
    if(i == a || i == b) {continue;}
    else{
    sum += (long long)fac(n)/(fac(n-i)*fac(i))% (pow(10,9) + 7);}
  }
  
  cout << sum % ((long )pow(10,9) + 7) << endl;
  
  return 0;
}

Compiler output:
a.cc:5:1: error: extended character 　 is not valid in an identifier
    5 | long　long fac(long long n){
      | ^
a.cc:5:1: error: 'long\U00003000long' does not name a type
    5 | long　long fac(long long n){
      | ^~~~~~~~~~
a.cc: In function 'int main()':
a.cc:19:23: error: 'fac' was not declared in this scope
   19 |     sum += (long long)fac(n)/(fac(n-i)*fac(i))% (pow(10,9) + 7);}
      |                       ^~~
Language: Java

import java.util.Scanner;
public class Main{
  public static void main(String[] args){
	Scanner sc = new Scanner(System.in);
    long n = sc.nextLong();
    long a = sc.nextLong();
    long b = sc.nextLong();
    long scoreA=0,scoreB=0,score=0;before=1;
    
    for(int i=1; i<=a; i++){
    	score = before * (a-i+1)/i;
        before = score;
    }
    scoreA = score;
    
    score =0; before = 1;
    for(int i=1; i<=b; i++){
    	score = before * (b-i+1)/i;
        before = score;      
    }
    scoreB = score;
    
    long x = (long)Math.pow(2,n) - 1;
    long ans = (x - (scoreA + scoreB)) % (long)(Math.pow(10,9) + 7);
    System.out.println(ans);
  
  }
}


Compiler output:
Main.java:8: error: cannot find symbol
    long scoreA=0,scoreB=0,score=0;before=1;
                                   ^
  symbol:   variable before
  location: class Main
Main.java:11: error: cannot find symbol
    	score = before * (a-i+1)/i;
    	        ^
  symbol:   variable before
  location: class Main
Main.java:12: error: cannot find symbol
        before = score;
        ^
  symbol:   variable before
  location: class Main
Main.java:16: error: cannot find symbol
    score =0; before = 1;
              ^
  symbol:   variable before
  location: class Main
Main.java:18: error: cannot find symbol
    	score = before * (b-i+1)/i;
    	        ^
  symbol:   variable before
  location: class Main
Main.java:19: error: cannot find symbol
        before = score;      
        ^
  symbol:   variable before
  location: class Main
6 errors
Language: Java

import java.util.Scanner;
public class Main{
  public static void main(String[] args){
	Scanner sc = new Scanner(System.in);
    long n = sc.nextLong();
    long a = sc.nextLong();
    long b = sc.nextLong();
    long scoreA=0, scoreB=0;
    long score = 0;
    long before = 1;
    
    for(int i=1; i<=a; i++){
    	score = before * (a-i+1)/i;
        before = score;
    }
    scoreA = score;
    score =0; before = 1;
    for(int i=1; i<=b; i++){
    	score = before * (b-i+1)/i;
        before = score;      
    }
    long x = Math.pow(2,n) - 1;
    long ans = x - (scoreA + scoreB) % 1000000007;
    System.out.println(ans);
  
  }
}


Compiler output:
Main.java:22: error: incompatible types: possible lossy conversion from double to long
    long x = Math.pow(2,n) - 1;
                           ^
1 error
Language: Java

import java.util.Scanner;
public class Main{
  public static void main(String[] args){
	Scanner sc = new Scanner(System.in);
    long n = sc.nextLong();
    long a = sc.nextLong();
    long b = sc.nextLong();
    long scoreA=0, scoreB=0;
    long score = 0;
    long before = 1;
    
    for(int i=1; i<=a; i++){
    	score = before * (a-i+1)/i;
        before = score;
    }
    scoreA = score;
    score =0; before = 1;
    fore(int i=1; i<=b; i++){
    	score = before * (b-i+1)/i;
        before = score;      
    }
    long x = Math.pow(2,n) - 1;
    long ans = x - (scoreA + scoreB) % 1000000007;
    System.out.println(ans);
  
  }
}

Compiler output:
Main.java:18: error: '.class' expected
    fore(int i=1; i<=b; i++){
             ^
Main.java:18: error: not a statement
    fore(int i=1; i<=b; i++){
                   ^
Main.java:18: error: ';' expected
    fore(int i=1; i<=b; i++){
                           ^
3 errors
Language: C++

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
ll a, b, n;





ll pow_mod(ll b,ll e){
  ll ac = 1;
  ll x = e;
  ll apow=b;
  while(x){
    if(x%2 == 1){
      ac = (ac*apow)%mod;
    }
    x>>=1;
    apow = (apow*apow)%mod;
  }
  return ac;
}

ll C(ll n, ll k) {
    ll res = 1;
    for (int i = n - k + 1; i <= n; ++i)
        res = (res * i) % mod;
    for (int i = 2; i <= k; ++i)
        res = (res * pow_mod(i, mod - 2)) % mod;
}

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

  cout << ((pow_mod(2, n) - 1 - C(a, k) - C(b, k)) % mod + mod) % mod << '\n'; 
}

Compiler output:
a.cc: In function 'll C(ll, ll)':
a.cc:31:1: warning: no return statement in function returning non-void [-Wreturn-type]
   31 | }
      | ^
a.cc: In function 'int main()':
a.cc:36:38: error: 'k' was not declared in this scope
   36 |   cout << ((pow_mod(2, n) - 1 - C(a, k) - C(b, k)) % mod + mod) % mod << '\n';
      |                                      ^
Language: C++

#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define ll long long
#define dd double
#define MOD 1000000007
#define nl cout<<endl
#define rt int Q[100005]={0}
#define mp make_pair
#define test() int t;cin>>t;while(t--)
#define pb push_back
#define ff first    
#define ss second
#define all(v) v.begin(),v.end()
#define s(ar,n) sort(ar,ar+n)
#define rs(ar,n) sort(ar, ar+n, greater<int>()) 
#define oa(a,n) for(int i=0;i<n;i++)cout<<a[i]<<" ";nl
#define cn(a,n) for(int i=0;i<n;i++)cin>>a[i];
#define ov(a,n) for(int i=n-1;i>=0;i--)cout<<a[i]<<" ";nl
#define ovp(a,n) for(int i=0;i<n;i++)cout<<a[i].ff<<" "<<a[i].ss<<endl;
#define maxa(ar,N) *max_element(ar,ar+N)
#define mina(ar,N) *min_element(ar,ar+N)
#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
typedef pair<int,int> pii;
ll powe(ll n,ll m){if(m==0)return 1;ll t=powe(n,m/2);if(m%2==0)return (t*t);return (((t*t))*n);}
ll mpowe(ll n,ll m){if(m==0)return 1;ll t=mpowe(n,m/2);t%=MOD;if(m%2==0)return (t*t)%MOD;return (((t*t)%MOD)*n)%MOD;}
int logtwo(int n){if(n==1)return 0;return logtwo(n/2)+1;}
vector <int> v[200005] ;   //Vector for maintaining adjacency list explained above
int level[200005];
bool vis[200005]; //Mark the node if visited 
void bfs(int s) 
{
    queue <int> q;
    q.push(s);
    level[ s ] = 0 ;  //Setting the level of the source node as 0
    vis[ s ] = true;
    while(!q.empty())
    {
        int p = q.front();
        q.pop();
        for(int i = 0;i < v[ p ].size() ; i++)
        {
            if(vis[ v[ p ][ i ] ] == false)
            {
        //Setting the level of each node with an increment in the level of parent node
                level[ v[ p ][ i ] ] = level[ p ]+1;                 
                 q.push(v[ p ][ i ]);
                 vis[ v[ p ][ i ] ] = true;
            }
        }
    }
}
int main()
{
    fastio();
   /* #ifndef ONLINE_JUDGE
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);*/
    #endif
    ll n,a,b;
    cin>>n>>a>>b;
    ll na=1,nrn=1;
    for(ll i=1;i<=a;i++)
    {
        na=(na*i)%MOD;
    }
    for(ll i =n;i>=n-a+1;i--)
    {
        nrn = (nrn*i)%MOD;
    }
    ll nca = (nrn*mpowe(na,MOD-2)%MOD)%MOD;
    na =1;
    nrn=1;
    for(ll i=1;i<=b;i++)
    {
        na=(na*i)%MOD;
    }
    for(ll i =n;i>=n-b+1;i--)
    {
        nrn = (nrn*i)%MOD;
    }
    ll ncb = (nrn*mpowe(na,MOD-2)%MOD)%MOD;
    //cout<<ncb<<endl;
    ll ans = (mpowe(2,n)-1-nca-ncb+2*MOD)%MOD;
    cout<<ans<<endl;
}
 

Compiler output:
a.cc:60:6: error: #endif without #if
   60 |     #endif
      |      ^~~~~
Language: Java

import java.io.*;
import java.math.BigInteger;
import java.util.*;

public class Rough {

	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; 
        } 
    } 
	static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
	public static long mod = (long) (1e9+7);
	public static long[] fac,inv;
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		FastReader sc = new FastReader();
	    int n = sc.nextInt();
	    int a = sc.nextInt();
	    int b = sc.nextInt();
	    long total = pow(2,n)-1;
	    long waste = (ncr(n,a) + ncr(n,b))%mod;
	    long ans = (total - waste + mod)%mod; 
	    out.print(ans);
		out.close();

	}
	private static long ncr(int n, int r) {
		long a = 1, b = 1;
		for(long i=0; i<r; ++i){
			a = (a*(n-i))% mod;
			b = (b*(r-i))% mod;
		}
		return (a * pow(b,mod-2))%mod;
	}
	
			 
	private static long pow(long a, long b) {
		return BigInteger.valueOf(a).modPow(BigInteger.valueOf(b), BigInteger.valueOf(mod)).longValue();
	}
	

}


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

#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
using namespace std;
#define rep(i,a,n) for(ll i=(a);i<(n);i++)
#define ll long long
#define llint long long int
#define sort(s) sort(s.begin(),s.end())
#define reverse(v)  reverse(v.begin(), v.end());
#define Yes(ans) if(ans)cout<<"Yes"<<endl; else cout<<"No"<<endl;
#define YES(ans) if(ans)cout<<"YES"<<endl; else cout<<"NO"<<endl;
#define hei(a) vector<a>
#define whei(a) vector<vector<int>>
constexpr auto mod = llint(1e9 + 7);
//フィボナッチ数列のx番目を求めるよ！
int f(int x,vector<int> s) {
	if (x == 0)return 0;
	if (x == 1)return 1;
	if (s[x] != 0)return s[x];
	s[x] = f(x - 1,s) + f(x - 2,s);
	return s[x];
}
//aとｂの最大公約数を求めるよ！
int gcd(int a, int b) {
	if (a < b)swap(a, b);
	if (b == 0)return a;
	return gcd(b, a % b);
}
//2のn乗を求めるよ！(二分累乗法)
int tow(ll n) {
	if (n == 0)return 1;
	ll x = tow( n / 2);
	x *= x;
	if (n % 2 == 1)x =x * 2;
	return x;
} 
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
	long long res = 1;
	while (n > 0) {
		if (n & 1) res = res * a % mod;
		a = a * a % mod;
		n >>= 1;
	}
	return res;
}
// mod. m での a の逆元 a^{-1} を計算するよ！
long long modinv(long long a, long long m) {
	long long b = m, u = 1, v = 0;
	while (b) {
		long long t = a / b;
		a -= t * b; swap(a, b);
		u -= t * v; swap(u, v);
	}
	u %= m;
	if (u < 0) u += m;
	return u;
}


//aCbをmod.mで割った余りを求める
ll int c(ll int a, ll int b,ll int m) {
	ll int ans = 1;
	for (ll int i = 0; i < b; i++) {
		ans *= a - i;
		ans %= m;
	}
	for (ll int i = 1; i <= b; i++) {
		ans *= modinv(i, m);
		ans %= m;
	}
	return ans;
}

int main() {
	int n, a, b;
	cin >> n >> a >> b;
	ll int ans = modpow(2,n,mod) - 1;
	while (ans < 0)ans += mod;
	ans %= mod;
	ans -= c(n, a,mod);
	while (ans < 0)ans += mod;
	ans %= mod;
	ans -= c(n, b,mod);
	while (ans < 0)ans += mod;
	ans %= mod;
	cout << ans << endl;
	return 0;
}


Compiler output:
a.cc:17:15: error: expected primary-expression before 'long'
   17 | #define llint long long int
      |               ^~~~
a.cc:24:22: note: in expansion of macro 'llint'
   24 | constexpr auto mod = llint(1e9 + 7);
      |                      ^~~~~
Language: C++

#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
using namespace std;
#define rep(i,a,n) for(ll i=(a);i<(n);i++)
#define ll long long
#define sort(s) sort(s.begin(),s.end())
#define reverse(v)  reverse(v.begin(), v.end());
#define Yes(ans) if(ans)cout<<"Yes"<<endl; else cout<<"No"<<endl;
#define YES(ans) if(ans)cout<<"YES"<<endl; else cout<<"NO"<<endl;
#define hei(a) vector<a>
#define whei(a) vector<vector<int>>
constexpr auto mod = ll int(1e9 + 7);
//フィボナッチ数列のx番目を求めるよ！
int f(int x,vector<int> s) {
	if (x == 0)return 0;
	if (x == 1)return 1;
	if (s[x] != 0)return s[x];
	s[x] = f(x - 1,s) + f(x - 2,s);
	return s[x];
}
//aとｂの最大公約数を求めるよ！
int gcd(int a, int b) {
	if (a < b)swap(a, b);
	if (b == 0)return a;
	return gcd(b, a % b);
}
//2のn乗を求めるよ！(二分累乗法)
int tow(ll n) {
	if (n == 0)return 1;
	ll x = tow( n / 2);
	x *= x;
	if (n % 2 == 1)x =x * 2;
	return x;
} 
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
	long long res = 1;
	while (n > 0) {
		if (n & 1) res = res * a % mod;
		a = a * a % mod;
		n >>= 1;
	}
	return res;
}
// mod. m での a の逆元 a^{-1} を計算するよ！
long long modinv(long long a, long long m) {
	long long b = m, u = 1, v = 0;
	while (b) {
		long long t = a / b;
		a -= t * b; swap(a, b);
		u -= t * v; swap(u, v);
	}
	u %= m;
	if (u < 0) u += m;
	return u;
}


//aCbをmod.mで割った余りを求める
ll int c(ll int a, ll int b,ll int m) {
	ll int ans = 1;
	for (ll int i = 0; i < b; i++) {
		ans *= a - i;
		ans %= m;
	}
	for (ll int i = 1; i <= b; i++) {
		ans *= modinv(i, m);
		ans %= m;
	}
	return ans;
}

int main() {
	int n, a, b;
	cin >> n >> a >> b;
	ll int ans = modpow(2,n,mod) - 1;
	while (ans < 0)ans += mod;
	ans %= mod;
	ans -= c(n, a,mod);
	while (ans < 0)ans += mod;
	ans %= mod;
	ans -= c(n, b,mod);
	while (ans < 0)ans += mod;
	ans %= mod;
	cout << ans << endl;
	return 0;
}


Compiler output:
a.cc:16:12: error: expected primary-expression before 'long'
   16 | #define ll long long
      |            ^~~~
a.cc:23:22: note: in expansion of macro 'll'
   23 | constexpr auto mod = ll int(1e9 + 7);
      |                      ^~
Language: C++

#include <stdio.h>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#include <algorithm>
#include <iomanip>

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

const ll MAX = 2*100000;
const ll MOD = 1000000007;

ll power(ll a, ll n, ll m)
{
        ll ret = 1;
        for (; n > 0; n >>= 1, a = a * a % m)
        {
                if (n % 2 == 1)
                {
                        ret = ret * a % m;
                }
        }
        return ret;
}

ll COM(ll N, ll K) {
    ll X=1, Y=1;
    for (int i = 1; i <= K; i++){
        X = X*(N-i+1)%MOD; // *=にするとmodされた後に掛け算なのでダメ
        Y = Y*i%MOD;
    }
    ll Y_p = power(Y,MOD-2,MOD);
    // あまりのせいでYが大きくなるとX/Yがうまく計算されないため逆元を用いる
    // cout << X << " " << power(Y,MOD-2,MOD) << " " << Y_p << endl;
    return X*Y_p%MOD;
}

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

  ll ans = power(2, N, MOD) - 1;
  ll a_c = COM(N, a);
  ll b_c = COM(N, b);
  ans -= a_c%MOD;
  ans -= b_c%MOD;
  cout<<(ans%mod+mod)%mod<<endl;
}

}


Compiler output:
a.cc: In function 'int main()':
a.cc:52:14: error: 'mod' was not declared in this scope; did you mean 'modf'?
   52 |   cout<<(ans%mod+mod)%mod<<endl;
      |              ^~~
      |              modf
a.cc: At global scope:
a.cc:55:1: error: expected declaration before '}' token
   55 | }
      | ^
Language: C++

#include <stdio.h>

using namespace std;


long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

const int MAX = 1000000000;
const int MOD = 1000000007;

long long fac[MAX], finv[MAX], inv[MAX];

// テーブルを作る前処理
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}

// 二項係数計算
long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

int main()
{
    long long int n, a, b;
    long long int mod = 1000000007;
    scanf("%lld %lld %lld", &n, &a, &b);
    COMinit();
    printf("%lld\n", modpow(2, n, mod) -1 - COM(n,a) - COM(n,b));
    return 0;
}

Compiler output:
/tmp/ccEQIqeE.o: in function `COMinit()':
a.cc:(.text+0x7c): relocation truncated to fit: R_X86_64_PC32 against symbol `finv' defined in .bss section in /tmp/ccEQIqeE.o
a.cc:(.text+0x87): relocation truncated to fit: R_X86_64_PC32 against symbol `finv' defined in .bss section in /tmp/ccEQIqeE.o
a.cc:(.text+0x8e): relocation truncated to fit: R_X86_64_PC32 against symbol `finv' defined in .bss section in /tmp/ccEQIqeE.o
a.cc:(.text+0x95): relocation truncated to fit: R_X86_64_PC32 against symbol `inv' defined in .bss section in /tmp/ccEQIqeE.o
a.cc:(.text+0x130): relocation truncated to fit: R_X86_64_PC32 against symbol `inv' defined in .bss section in /tmp/ccEQIqeE.o
a.cc:(.text+0x191): relocation truncated to fit: R_X86_64_PC32 against symbol `inv' defined in .bss section in /tmp/ccEQIqeE.o
a.cc:(.text+0x1ac): relocation truncated to fit: R_X86_64_PC32 against symbol `finv' defined in .bss section in /tmp/ccEQIqeE.o
a.cc:(.text+0x1c4): relocation truncated to fit: R_X86_64_PC32 against symbol `inv' defined in .bss section in /tmp/ccEQIqeE.o
a.cc:(.text+0x213): relocation truncated to fit: R_X86_64_PC32 against symbol `finv' defined in .bss section in /tmp/ccEQIqeE.o
/tmp/ccEQIqeE.o: in function `COM(int, int)':
a.cc:(.text+0x28a): relocation truncated to fit: R_X86_64_PC32 against symbol `finv' defined in .bss section in /tmp/ccEQIqeE.o
a.cc:(.text+0x2a5): additional relocation overflows omitted from the output
collect2: error: ld returned 1 exit status
Language: C++

#include<bits/stdc++.h>
#define int long long int
#define ldouble long double
#define vin vector<int>
#define pqueue priority_queue
#define rep(a,n) for(int i=(a);i<(n);i++)
#define INF (int)1000000007

//setprecision()<<

using namespace std;

void fin(int n,vin &a){
    rep(0,n){
        cin>>a.at(i);
    }
}

int RepSq(int x,int n){
    if(n==0) return 1;
    if(n%2==0){
        int t=RepSq(x,n/2);
        return t*t%INF;
    }
    return x*RepSq(x,n-1);
}

//逆元を用いたnCrの方法 nが大きくてもよい(~10^9)　ただしrが小さくないといけない(~10^5)
const int MAX_K=200001;
const int N=1000000007;
const int MOD=INF;
long long COM[MAX_K]; //nCkを格納しておく(nが固定値の場合)
long long inv[MAX_K],finv[MAX_K],fac[MAX_K]; //facはn*...n-k+1
void bigCOMinit(){
    //逆元計算
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    //fac[0]=N % MOD,fac[1]=(N % MOD)*((N-1) % MOD) % MOD;
    for (int i = 2; i < MAX_K; i++){
        //fac[i] = fac[i - 1] * (N - i) % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;

    }

    // COM[0]=1;
    // for(int i=1;i<MAX_K;i++){
    //     COM[i]=fac[i-1] * finv[i] % MOD;
    // }
}


signed main(){
    typedef pair<int,int> P;
    int sum=1;
    int n,a,b;
    cin>>n>>a>>b;
    bigCOMinit();
    //MAX=n;
    long long tcom[MAX_K];
    fac[0]=n % MOD,fac[1]=(n % MOD)*((n-1) % MOD) % MOD;
    for (int i = 2; i < MAX_K; i++){
        fac[i] = fac[i - 1] * (n - i) % MOD;
    }

    tcom[0]=1;
    for(int i=1;i<MAX_K;i++){
        tcom[i]=fac[i-1] * finv[i] % MOD;
    }
    //cout<<finv[1]<<endl;

    int sum=RepSq(2,n)-1-tcom[a]-tcom[b];
    while(sum<0){
        sum+=MOD;
        sum%=MOD;
    }
    cout<<sum<<endl;
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:72:9: error: redeclaration of 'long long int sum'
   72 |     int sum=RepSq(2,n)-1-tcom[a]-tcom[b];
      |         ^~~
a.cc:55:9: note: 'long long int sum' previously declared here
   55 |     int sum=1;
      |         ^~~
Language: C++

M = int(1e9 + 7)

def C(n , r):
    res = 1
    if r > n - r:
        r = n - 1
    for i in range(r):
        res = (res*(n - i)) % M
        res = (res * pow(i + 1 , M - 2 , M))%M
    return res

n  , a , b = map(int , input().split())

ans = pow(2 , n , M) - 1;
ans -= C(n , a)
ans -= C(n , b)
ans += 2 * M
print(ans%M)


Compiler output:
a.cc:1:1: error: 'M' does not name a type
    1 | M = int(1e9 + 7)
      | ^
a.cc:15:1: error: 'ans' does not name a type
   15 | ans -= C(n , a)
      | ^~~
Language: C++

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

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef vector<pdd> vdd;

#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define mem(a,b) memset(a, b, sizeof(a) )
#define all(x) (x).begin(),(x).end()
#define INF 1000000000000
#define MOD 1000000007
#define PB push_back
#define MP make_pair
#define F first
#define S second

inline void normal(ll &a) { a %= MOD; (a < 0) && (a += MOD); }
inline ll modMul(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a*b)%MOD; }
inline ll modAdd(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a+b)%MOD; }
inline ll modSub(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); a -= b; normal(a); return a; }
inline ll modPow(ll b, ll p) { ll r = 1; while(p) { if(p&1) r = modMul(r, b); b = modMul(b, b); p >>= 1; } return r; }
inline ll modInverse(ll a) { return modPow(a, MOD-2); }
inline ll modDiv(ll a, ll b) { return modMul(a, modInverse(b)); }

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

int main(){
    ll n,a,b;
    cin>>n>>a>>b;
    ll c=modPow(2,n);
    ll d=1;
    rep(i,a){
        d=d*modInverse(a-i);
        d%=MOD;
    }
    rep(i,a){
        d=d*(n-i);
        d%=MOD;
    }
    ll e=1;
    rep(i,b){
        e=e*modInverse(b-i);
        e%=MOD;
    }
    rep(i,b){
        e=e*(n-i);
        e%=MOD;
    }
  　ll ans=c-1-d-e;
    while(ans<0)ans+=MOD;
    cout<<ans%MOD;
}

Compiler output:
a.cc:61:3: error: extended character 　 is not valid in an identifier
   61 |   　ll ans=c-1-d-e;
      |   ^
a.cc: In function 'int main()':
a.cc:61:3: error: '\U00003000ll' was not declared in this scope
   61 |   　ll ans=c-1-d-e;
      |   ^~~~
a.cc:62:11: error: 'ans' was not declared in this scope; did you mean 'abs'?
   62 |     while(ans<0)ans+=MOD;
      |           ^~~
      |           abs
a.cc:63:11: error: 'ans' was not declared in this scope; did you mean 'abs'?
   63 |     cout<<ans%MOD;
      |           ^~~
      |           abs
Language: C++

#include<iostream>
#include<math.h>
using namespace std;
 
int main(void){
  long long n;
  int a,b;
  double kind = 0;
  double p=1;
  cin>>n>>a>>b;
  
  for(int i=n; i>=2; i--){
    p *= i/(n+1-i);
    if(i!=a && i!=b){
      	kind+=p;
    }
  }
  
  int ans = round(kind)
  cout<<ans%1000000007<<endl;
  return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:20:3: error: expected ',' or ';' before 'cout'
   20 |   cout<<ans%1000000007<<endl;
      |   ^~~~
Language: C++

#include<iostream>
#include<math.h>
using namespace std;
 
int main(void){
  long long n;
  int a,b;
  double kind = 0;
  double p=1;
  cin>>n>>a>>b;
  
  for(int i=n; i>=2; i--){
    p *= i/(n+1-i);
    if(i!=a && i!=b){
      	kind+=p;
    }
  }
  
  cout<<round(kind)%1000000007<<endl;
  return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:19:20: error: invalid operands of types 'double' and 'int' to binary 'operator%'
   19 |   cout<<round(kind)%1000000007<<endl;
      |         ~~~~~~~~~~~^~~~~~~~~~~
      |              |      |
      |              double int
Language: C++

#include<iostream>
#include<math.h>
using namespace std;
 
double comb(int a, int b){
  double p = 0;
  if(a=>b){
  	p=1;
  	for(int i=0; i<b; i++){
  		p *= (a-i);
  	}
  	for(int i=0; i<b; i++){
   		p /= (b-i);
 	}
  }
  return p;
}
 
int main(void){
  long long n;
  int a,b;
  int kind = 0;
  cin>>n>>a>>b;
  
  for(int i=2; i<=n; i++){
    if(i!=a && i!=b){
      kind+=comb(n,i);
    }
  }
  
  cout<<kind%1000000007<<endl;
  return 0;
}


Compiler output:
a.cc: In function 'double comb(int, int)':
a.cc:7:8: error: expected primary-expression before '>' token
    7 |   if(a=>b){
      |        ^
Language: C++

#include<iostream>
#include<math.h>
using namespace std;
 
double comb(int a, int b){
  if(a=>b){
  	double p=1;
  	for(int i=0; i<b; i++){
  		p *= (a-i);
  	}
  	for(int i=0; i<b; i++){
   		p /= (b-i);
 	}
    return p;
  }else{
    return 0;
  }
}
 
int main(void){
  long long n;
  int a,b;
  int kind = 0;
  cin>>n>>a>>b;
  
  for(int i=2; i<=n; i++){
    if(i!=a && i!=b){
      kind+=comb(n,i);
    }
  }
  
  cout<<kind%1000000007<<endl;
  return 0;
}


Compiler output:
a.cc: In function 'double comb(int, int)':
a.cc:6:8: error: expected primary-expression before '>' token
    6 |   if(a=>b){
      |        ^
a.cc:18:1: warning: control reaches end of non-void function [-Wreturn-type]
   18 | }
      | ^
Language: C++

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

using namespace std;

const int K = pow(10, 9) + 7;
void comb(vector<vector <long long int> >& v) {
	for (int i = 0; i < v.size(); i++) {
		v[i][0] = 1;
		v[i][i] = 1;
	}
	for (int k = 1; k < v.size(); k++) {
		for (int j = 1; j < k; j++) {
			v[k][j] = ((v[k - 1][j - 1] + v[k - 1][j])) % K;

		}
	}
}

int main() {
	int n, a, b;
	long long int ans = 1;
	
	cin >> n >> a >> b;

	for (int i = 0; i < n; i++) {
		ans *= 2;
		ans %= K;
	}

	vector<vector<long long int> > v(n + 1, vector<long long int>(n + 1, 0));
	comb(v);
	ans -= v[n][a];
	vector<vector<long long int> > w(n + 1, vector<long long int>(n + 1, 0));
	comb(w);
	ans -= w[n][b];

	ans -= 1;
	ans %= K;

	cout << ans << endl;

	return 0;
}

Compiler output:
a.cc:7:15: error: 'pow' was not declared in this scope
    7 | const int K = pow(10, 9) + 7;
      |               ^~~