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

#include <algorithm>
#include <cstdio>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <queue>
#include <sstream>
#include <stack>
#include <time.h>
#include <vector>
#include <complex>
#include <map>
#include <set>
#include <iomanip>
#include <math.h>
#include <stdlib.h>
#include <list>
#include <utility>
#include <memory>
#include <cstring>
#include <fstream>
#include <numeric>
#include <assert.h>
#include <bitset>
#include <ios> 
#include <bits/stdc++.h>
using namespace std;
int main(){
	int n,ans=0;
	string s;
	ci>>s;
	n=s.size();
	for (int i=0;i<n;i++) if (s[i]=='x') ans++;
	if (15-ans>=8) cout<<"YES";
	else cout<<"NO";
}

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

#include <iostream>
using namespace std;
char s;
int main(){
cin>>n;
  n-=2;
  n*=180;
  cout<<n;
 
 
}

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

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

int main() {
	string S;
	cin >> S;
	int cnt = 0;
	for (int i = 0; i < S.length; i++) {
		if (S[i] == 'x')cnt++;
	}
	if (cnt < 8)cout << "YES" << endl;
	else cout << "NO" << endl;

	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:9:31: error: invalid use of member function 'std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::size_type std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::length() const [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>; size_type = long unsigned int]' (did you forget the '()' ?)
    9 |         for (int i = 0; i < S.length; i++) {
      |                             ~~^~~~~~
      |                                     ()
Language: C++

#include <iostream>
#include <string>
#include <functional>
#include <algorithm>

using namespace std;

int main()
{
	string n;
  int sum;
  cin>>n;
  for(int i=1;i<=15;i++){
    if(n.at(i)==o)
      sum++;}
  if(sum>7)
    cout<<"YES"<<endl;
  else
    cout<<"NO"<<endl;
  
    

}


Compiler output:
a.cc: In function 'int main()':
a.cc:14:17: error: 'o' was not declared in this scope
   14 |     if(n.at(i)==o)
      |                 ^
Language: C++

#include<bits\stdc++.h>
using namespace std;
int main(void)
{
    string S;
    cin >> S;

    int ans=0;
    for(int i=0;i<S.size();i++){
        if(S[i] == 'o'){
            ans++;
        }

    }

    if(ans >= 8){
        cout << "YES\n";
    }
    else{
        cout << "NO\n";
    }
    return 0;
}

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

#include <iostream>
using namespace std;

int main(){
	string s;
	cin >> s;
	int cnt=0;
	for (auto& i:s){
		if (i == 'o') ++cnt;
	}
	if (cnt+15-s.size() >= 8) cout << "YES";
	else cout << "NO";
	return 0;
}


Compiler output:
a.cc:11:31: error: extended character   is not valid in an identifier
   11 |         if (cnt+15-s.size() >= 8) cout << "YES";
      |                               ^
a.cc: In function 'int main()':
a.cc:11:31: error: '\U000000a08' was not declared in this scope
   11 |         if (cnt+15-s.size() >= 8) cout << "YES";
      |                               ^~
Language: C++

#inlude <iostream>
#inlude <string.h>
using namespace std;
int main(){
  int a=0, b=0;
  string s;
  cin>>s;
  for(char &c: s){a+= (c == 'x'); b+= (c == 'o');}
  cout<<(b>=8 ? 'YES' : 'NO');
}

Compiler output:
a.cc:1:2: error: invalid preprocessing directive #inlude; did you mean #include?
    1 | #inlude <iostream>
      |  ^~~~~~
      |  include
a.cc:2:2: error: invalid preprocessing directive #inlude; did you mean #include?
    2 | #inlude <string.h>
      |  ^~~~~~
      |  include
a.cc:9:17: warning: multi-character character constant [-Wmultichar]
    9 |   cout<<(b>=8 ? 'YES' : 'NO');
      |                 ^~~~~
a.cc:9:25: warning: multi-character character constant [-Wmultichar]
    9 |   cout<<(b>=8 ? 'YES' : 'NO');
      |                         ^~~~
a.cc: In function 'int main()':
a.cc:6:3: error: 'string' was not declared in this scope
    6 |   string s;
      |   ^~~~~~
a.cc:1:1: note: 'std::string' is defined in header '<string>'; this is probably fixable by adding '#include <string>'
  +++ |+#include <string>
    1 | #inlude <iostream>
a.cc:7:3: error: 'cin' was not declared in this scope
    7 |   cin>>s;
      |   ^~~
a.cc:1:1: note: 'std::cin' is defined in header '<iostream>'; this is probably fixable by adding '#include <iostream>'
  +++ |+#include <iostream>
    1 | #inlude <iostream>
a.cc:7:8: error: 's' was not declared in this scope
    7 |   cin>>s;
      |        ^
a.cc:9:3: error: 'cout' was not declared in this scope
    9 |   cout<<(b>=8 ? 'YES' : 'NO');
      |   ^~~~
a.cc:9:3: note: 'std::cout' is defined in header '<iostream>'; this is probably fixable by adding '#include <iostream>'
Language: C++

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

int main(){
    string s;
    cin >> s;
    int ans;
    int n=s.size();
    int ans=0;
    for(int i=0;i<n;i++){
        if(s[i]=='o'){
            ans++;
        }
    }
    ans+=15-n;
    if(ans>7){
        cout << "YES" << endl;
    }
    else{
        cout << "NO" << endl;
    }
}

Compiler output:
a.cc: In function 'int main()':
a.cc:9:9: error: redeclaration of 'int ans'
    9 |     int ans=0;
      |         ^~~
a.cc:7:9: note: 'int ans' previously declared here
    7 |     int ans;
      |         ^~~
Language: C++

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

int main (){
	string s;
	cin>>s;
	int n=s.strlen();int c=0;
	for (int i=0;i<n;i++)if(s[i]=='x')c++;
	if(c<=7)cout<<"YES\n";
	else cout<<"NO\n";
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:7:17: error: 'std::string' {aka 'class std::__cxx11::basic_string<char>'} has no member named 'strlen'
    7 |         int n=s.strlen();int c=0;
      |                 ^~~~~~
Language: C++

#include <bits/stdc++.h>
using namespace std;
int main () {
  string S;
  cin >> S;
  int count = 0;
  for(int i = 0; i < S.size(); i++){
    if(S.at(i) == 'o')count++;
  }
  if(15 - S.aize() + count >= 15)cout << "YES" << endl;
  else cout << "NO" << endl;
  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:10:13: error: 'std::string' {aka 'class std::__cxx11::basic_string<char>'} has no member named 'aize'; did you mean 'size'?
   10 |   if(15 - S.aize() + count >= 15)cout << "YES" << endl;
      |             ^~~~
      |             size
Language: C++

#include<bits/stdc++.h>

#define LL long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back

using namespace std;

LL gcd(LL a,LL b){return b?gcd(b,a%b):a;}
LL lcm(LL a,LL b){return a/gcd(a,b)*b;}
LL powmod(LL a,LL b,LL MOD){LL ans=1;while(b){if(b%2)ans=ans*a%MOD;a=a*a%MOD;b/=2;}return ans;}
const int N = 2e5 +11;
char a[N];
int main(){
	ios::sync_with_stdio(false);
	
	cin>>a+1;
	int cnt=0;
	int len=strlen(a+1);
	for(int i=1;i<=n;i++)cnt+=a[i]=='o';
	if(cnt>=8)cout<<"YES";
	else cout<<"NO";	
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:22:24: error: 'n' was not declared in this scope
   22 |         for(int i=1;i<=n;i++)cnt+=a[i]=='o';
      |                        ^
Language: C++

#include<bnits/stdc++.h>
using namespace std;
int main(){
  string s;cin>>s;
  int k=s.size(),a=0,b=0;
  for(int i=0;i<k;i++){
    if(s.at(i)=='o')a++;
    else b++;
  }
  if(a-b+15-k>0)cout<<"YES"<<endl;
  else cout<<"NO"<<endl;
}

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

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

int main(){
  string S;
  cin >> S;
  int cnt = 0;
  for(int i = 0;i < S.size();i++){
    if(S[i] == "o"){
      cnt++;
    }
  }
  
  if(cnt + 15 - S.size() > 8){
    cout << "YES" << endl;
  }else{
    cout << "NO" << endl;
  }
  
  return 0;
  
}

Compiler output:
a.cc: In function 'int main()':
a.cc:10:13: error: ISO C++ forbids comparison between pointer and integer [-fpermissive]
   10 |     if(S[i] == "o"){
Language: C++

#include <bits/stdc++.h>
#include <numeric>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

int main(){
    int n,a,b,c;
    cin >> n >> a >> b >> c;
    int c=0;
    for(int i=0;i<s.size();i++){
        if(s[i]=='o') c++;
    }
    cout << (c>=8?"YES":"NO") << endl;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:11:9: error: redeclaration of 'int c'
   11 |     int c=0;
      |         ^
a.cc:9:15: note: 'int c' previously declared here
    9 |     int n,a,b,c;
      |               ^
a.cc:12:19: error: 's' was not declared in this scope
   12 |     for(int i=0;i<s.size();i++){
      |                   ^
Language: C++

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

int main(){
    string s;
    cin >> s;
    int ans;
    int n=s.size();
    int ans=0;
    for(int i=0;i<n;i++){
        if(s[i]=='o'){
            ans++;
        }
    }
    ans+=15-n;
    if(ans>7){
        cout << 'YES' << endl;
    }
    else{
        cout << 'NO' << endl;
    }
}

Compiler output:
a.cc:17:17: warning: multi-character character constant [-Wmultichar]
   17 |         cout << 'YES' << endl;
      |                 ^~~~~
a.cc:20:17: warning: multi-character character constant [-Wmultichar]
   20 |         cout << 'NO' << endl;
      |                 ^~~~
a.cc: In function 'int main()':
a.cc:9:9: error: redeclaration of 'int ans'
    9 |     int ans=0;
      |         ^~~
a.cc:7:9: note: 'int ans' previously declared here
    7 |     int ans;
      |         ^~~
Language: C++

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

int main(){
  char a;
  int win;
  int lose;
  while(cin >> a){
    if(a == 'o'){
      win++;
    }else{
      lose++
    }
  }
  int kari = 15 - win - lose;
  if(win+kari > 7){
    cout << "YES" << endl;
  }else{
    cout << "NO" << endl;
  }
}


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

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> Pll;
typedef pair<P,P> PP;
#define rep(i,a,n) for(ll i = a;i < n;i++)
#define repr(i,a,n) for(ll i = n-1;i >= a;i--)
#define sort(x) sort(ALL(x))
#define ALL(v) v.begin(), v.end()
#define LINF (ll)1e17
#define INF (int)1e9
#define MOD (ll)1e9+7
#define sMOD 1e5
#define fs first
#define sc second

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

void YNout(bool check){
	if(check)cout << "Yes" << endl;
	else cout << "No" << endl;
	
	return;
}

void Yayout(bool check){
	if(check) cout << "Yay!" << endl;
	else cout << ":(" << endl;
	
	return;
}

/*
template <typename T>
void vecout(vector<T>& vecout_vec){
	
	rep(i,0,vecout_vec.size()){
		cout << vecout_vec.at(i) << endl;
	}
	
	return ;
}

template <typename T>
void vecin(vector<T>& vecin_vec, ll n){
	
	ll temp ;
	
	rep(i,0,n){
		cin >> temp;
		vecin_vec.push_back(temp);
		
	}
}

template <typename T>
void in(T& literal_in, T& literal_in2, ...){
	cin >> literal_in;
	in(literal_in2, ...);
	
	return;
}

template <typename T>
void in(T& literal_in){
	
	cin >> literal_in;
	
	return;
}

template <typename T>
void out(T& literal_out, T& literal_out2, ...){
	cout << literal_out << endl;
	out(literal_out2, ...);
	
	return;
}

template <typename T>
void out(T& literal_out){
	
	cout << literal_out << endl;
	
	return;
}
*/
signed main(){
	int cnt = 0;
	string s;
	cin >> s;
	rep(i,0,s.size()){
		if(s[i] == 'o')cnt++;
	}
	if(8 <=  15-n+cnt) cout << "YES" << endl;
	else cout << "NO" << endl;
	return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:99:21: error: 'n' was not declared in this scope
   99 |         if(8 <=  15-n+cnt) cout << "YES" << endl;
      |                     ^
Language: C++

#include<bits/stdc++.h>
using namespace std;
//define
#define int long long
#define rep(x,y) for(int i=x;i<y;i++)
#define REP(x,y) for(int j=x;j<y;j++)
#define Rep(x,y) for(int k=x;k<y;k++)
#define str string
#define vint vector<int>
#define vvint vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vool vector<bool>
#define vtr vector<str>
#define vvtr vector<vector<str>>
#define qint queue<int>
//pairdefine
#define pint pair<int,int>
#define pic pair<int,char>
#define pci pair<char,int>
#define pis pair<int,str>
#define psi pair<str,int>
#define pcc pair<char,char>
#define pss pair<str,str>
#define mp make_pair
//mapdefine
#define mint map<int,int>
#define mic map<int,char>
#define mci map<char,int>
#define mis map<int,str>
#define msi map<str,int>
#define pb() push_back()
#define all(x) x.begin(),x.end()
#define elif else if
//function
int W=30;
str Dir;
bool shizuku(double Dir);
//UnionFind
struct UnionFind{
  vint par;
  UnionFind(int N):par(N){
    rep(0,N)par[i]=i;
  }
  int root(int x){
    if(par[x]==x)return x;
    return par[x]=root(par[x]);
  }
  void unite(int x,int y){
    int rx=root(x);
    int ry=root(y);
    if(rx==ry)return;
    par[rx]=ry;
  }
  bool same(int x,int y){
    return root(x)==root(y);
  }
};

signed main(){
    int pow,N,M,X,count=0,count2=0,Deg;
    double Dis;
    int C='A'-'a';
    char op;
    str S,T;
    cin>>S;
    rep(0,S.size()){
      if(S[i]=='o')count+=1;
    }
    if(count>=8){
      cout<<"YES"<
    }
    else cout<<"NO"<<endl;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:72:5: error: expected primary-expression before '}' token
   72 |     }
      |     ^
Language: C++

#include <bits/stdc++.h>
#include <climits>
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define srep(i, begin, end) for (__typeof(end) i = begin; i != end; i++)
#define si(x) int x = scanInt();
#define sll(x) LL x = scanLong();
#define sci(x) int x; scanf("%d", &x);
#define scll(x) LL x; scanf("%lld", &x);
#define pi(x) printf("%d ", x)
#define pll(x) printf("%lld ", x)
#define nl printf("\n")
#define clr(a) memset(a, 0, sizeof(a))
#define PB push_back
#define MP make_pair
using namespace std;
typedef unsigned int UI; // 32 bit integer
typedef long int LI; // 32 bit integer
typedef unsigned long int ULI; // 32 bit unsigned integer
typedef long long int LL; // 64 bit integer
typedef unsigned long long int ULL; // 64 bit unsigned integer
typedef long double LD;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef deque<int> DI;
typedef deque<LL> DLL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
const LL MOD = 1e9+7;

/* Fast I/O */
inline int scanInt() {
	int n = 0;
	char ch = getchar();
	int sign = 1;
	while(ch < '0' || ch > '9') {
		if(ch == '-')	sign = -1;
		ch = getchar();
	}
	while(ch >= '0' && ch <= '9') {
		n = (n<<1)+(n<<3)+(int)(ch-'0');
		ch = getchar();
	}
	return n*sign;
}

inline LL scanLong() {
	LL n = 0;
	char ch = getchar();
	LL sign = 1;
	while(ch < '0' || ch > '9') {
		if(ch == '-')	sign = -1;
		ch = getchar();
	}
	while(ch >= '0' && ch <= '9') {
		n = (n<<1)+(n<<3)+(LL)(ch-'0');
		ch = getchar();
	}
	return n*sign;
}

int main() {
	string s; cin >> s;
	LL won = 0, remaining = 15 - s.length();
	rep(i, 0, s.length())	if(s[i] == 'o')	won++:
	if(won + remaining >= 8)	puts("YES");
	else	puts("NO");
}


Compiler output:
a.cc: In function 'int main()':
a.cc:64:54: error: expected ';' before ':' token
   64 |         rep(i, 0, s.length())   if(s[i] == 'o') won++:
      |                                                      ^
      |                                                      ;
Language: C++

#include <bits/stdc++.h>
#include <numeric>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

int main(){
    string s;
    cin >> s;
    int c=0;
    for(int i=0;i<s.size();i++){
        if(s[i]=='o') c++
    }
    cout << (c>=8?"YES":"NO") << endl;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:13:26: error: expected ';' before '}' token
   13 |         if(s[i]=='o') c++
      |                          ^
      |                          ;
   14 |     }
      |     ~
Language: C++

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

#define ll long long

using namespace std;

int main(){

    string s;
    cin >> s

    int count = 0;

    for(int i = 0; i < s.size(); i++){
        if(s[i] == 'x') count++;
    }

    if(count >= 8){
        cout << "NO" << endl;
    }else cout << "YES" << endl;
 
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:13:13: error: expected ';' before 'int'
   13 |     cin >> s
      |             ^
      |             ;
   14 | 
   15 |     int count = 0;
      |     ~~~      
a.cc:18:30: error: no post-increment operator for type
   18 |         if(s[i] == 'x') count++;
      |                              ^~
a.cc:21:14: error: invalid operands of types '<unresolved overloaded function type>' and 'int' to binary 'operator>='
   21 |     if(count >= 8){
      |        ~~~~~~^~~~
Language: C++

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

char s[20];

int main() {
  scanf("%s", s);
 	int rlt = 0;
  for (int i = 0; i < 15; i ++) if (s[i] == 'o') rlt ++;
  puts(rlt > 7 : "YES" : "NO");

    return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:10:15: error: expected ')' before ':' token
   10 |   puts(rlt > 7 : "YES" : "NO");
      |       ~       ^~
      |               )
a.cc:10:12: error: cannot convert 'bool' to 'const char*'
   10 |   puts(rlt > 7 : "YES" : "NO");
      |        ~~~~^~~
      |            |
      |            bool
In file included from /usr/include/c++/14/cstdio:42,
                 from /usr/include/c++/14/ext/string_conversions.h:45,
                 from /usr/include/c++/14/bits/basic_string.h:4154,
                 from /usr/include/c++/14/string:54,
                 from /usr/include/c++/14/bitset:52,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:52,
                 from a.cc:1:
/usr/include/stdio.h:714:30: note:   initializing argument 1 of 'int puts(const char*)'
  714 | extern int puts (const char *__s);
      |                  ~~~~~~~~~~~~^~~
Language: C++

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<numeric>
#include<queue>
#include<stack>
#define repp(i,a,b) for(int i=(int)a;i<(int)b;++i)
#define repm(i,a,b) for(int i=(int)a;i>(int)b;--i)
using ll=long long;
static const ll mod=1e9+7;
static const ll INF=1LL<<50;
using namespace std;

int main() {
	string s;
  cin>>s;
  int ans=15-s.size();
  repp(i,0,s.size())if(s[i]=='o')++ans;
  if(ans>=8)cout<<"YES<<endl;
    else cout<<"NO"<<endl;
}

Compiler output:
a.cc:24:19: warning: missing terminating " character
   24 |   if(ans>=8)cout<<"YES<<endl;
      |                   ^
a.cc:24:19: error: missing terminating " character
   24 |   if(ans>=8)cout<<"YES<<endl;
      |                   ^~~~~~~~~~~
a.cc: In function 'int main()':
a.cc:25:5: error: expected primary-expression before 'else'
   25 |     else cout<<"NO"<<endl;
      |     ^~~~
Language: C++

#include<string>
#include <cmath>
#include <limits>
#include <utility>
#include <map>
#include <iomanip>
#include <queue>
#include <cctype>
#include <stack>


#define rep(p,q) for(int i = p;i < q;i++)
#define ll long long

using namespace std;

//B
int main(void) {
	int count = 0;
	string s;
	cin >> s;
	rep(0, s.size()) {
		char c = s[i];
		if (c == 'o')count++;
	}
	if ((15 - s.size()) + count >= 8)cout << "YES" << endl;
	else cout << "NO" << endl;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:21:9: error: 'cin' was not declared in this scope
   21 |         cin >> s;
      |         ^~~
a.cc:10:1: note: 'std::cin' is defined in header '<iostream>'; this is probably fixable by adding '#include <iostream>'
    9 | #include <stack>
  +++ |+#include <iostream>
   10 | 
a.cc:26:42: error: 'cout' was not declared in this scope
   26 |         if ((15 - s.size()) + count >= 8)cout << "YES" << endl;
      |                                          ^~~~
a.cc:26:42: note: 'std::cout' is defined in header '<iostream>'; this is probably fixable by adding '#include <iostream>'
a.cc:27:14: error: 'cout' was not declared in this scope
   27 |         else cout << "NO" << endl;
      |              ^~~~
a.cc:27:14: note: 'std::cout' is defined in header '<iostream>'; this is probably fixable by adding '#include <iostream>'
Language: C++

#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int main() {
  int cnt=0
  string s;
  cin >> s;
  for(int i=0; i<s.size(); i++) {
    if(s[i]=='o') {
      cnt++;
    }
  }
  if(cnt>=8) {
    cout << "YES" << endl;
  }
  else {
    cout << "NO" << endl;
  }
}

Compiler output:
a.cc: In function 'int main()':
a.cc:7:3: error: expected ',' or ';' before 'string'
    7 |   string s;
      |   ^~~~~~
a.cc:8:10: error: 's' was not declared in this scope
    8 |   cin >> s;
      |          ^
Language: C++

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

int main(){
  string s;
  int cnt=0;
  cin >> s;
  for(char c: s){
    if(c=='o')cnt++;
  }
  cout << (cnt+(15-k)>=8 ? "Yes" : "No");
  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:12:20: error: 'k' was not declared in this scope
   12 |   cout << (cnt+(15-k)>=8 ? "Yes" : "No");
      |                    ^
Language: C++

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<list>
#include<set>
#include<string>
using namespace std;
int gcd(int a, int b) {
	int c = a % b;
	while (c != 0) {
		a = b;
		b = c;
		c = a % b;
	}
	return b;
}
struct UnionFind {
	vector<int> par; // par[i]:iの親の番号　(例) par[3] = 2 : 3の親が2

	UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化
		for (int i = 0; i < N; i++) par[i] = i;
	}

	int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
		if (par[x] == x) return x;
		return par[x] = root(par[x]);
	}

	void unite(int x, int y) { // xとyの木を併合
		int rx = root(x); //xの根をrx
		int ry = root(y); //yの根をry
		if (rx == ry) return; //xとyの根が同じ(=同じ木にある)時はそのまま
		par[rx] = ry; //xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
	}

	bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
		int rx = root(x);
		int ry = root(y);
		return rx == ry;
	}
};
typedef long long ll;

const ll M = 1000000007;

vector<ll> fac(300001); //n!(mod M)
vector<ll> ifac(300001); //k!^{M-2} (mod M)

ll mpow(ll x, ll n) {
	ll ans = 1;
	while (n != 0) {
		if (n & 1) ans = ans * x % M;
		x = x * x % M;
		n = n >> 1;
	}
	return ans;
}
ll comb(ll a, ll b) {
	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;
}
int main() {
	int count = 0;
	char s[22];
	cin >> s;
	for (int i = 0; s[i] != '\0')
		if (s[i] == 'x')
			count++;
	if (count < 8)
		cout << "YES" << endl;
	else
		cout << "NO" << endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:69:37: error: expected ';' before ')' token
   69 |         for (int i = 0; s[i] != '\0')
      |                                     ^
      |                                     ;
Language: C++

// -----------------------------------
// author   : MatsuTaku
// country  : Japan
// created  : 09/12/20 01:19:46
// -----------------------------------

#include <bits/stdc++.h>
#include "../../../library/include/combination.hpp"

using namespace std;
using ll = long long;
using Cmb = Combination<(int)1e9+7, (int)2e5>;

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

  Cmb cmb;
  using mint = Cmb::mint;
  int n,a,b,c; cin>>n>>a>>b>>c;
  mint pa = (mint) a / 100;
  mint pb = (mint) b / 100;
  mint pab = pa+pb;
  mint pc = (mint) c / 100;
  mint elen = ((mint)a+b+c) / ((mint)a+b);

  mint ans = 0;
  for (int i = 0; i < n; i++) {
    int m = n-1+i;
    mint p = (pow(pa/pab, n) * pow(pb/pab, i) + pow(pa/pab, i) * pow(pb/pab, n)) * cmb(m, i);
    auto el = ((mint) (m+1) * elen);
//    cerr<<p<<" "<<el<<" "<<p*el<<endl;
    ans += p * el;
  }
  cout << ans << endl;

  return 0;
}


Compiler output:
a.cc:8:10: fatal error: ../../../library/include/combination.hpp: No such file or directory
    8 | #include "../../../library/include/combination.hpp"
      |          ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
compilation terminated.
Language: C++

h>
using namespace std;
#define int long long 

//二項係数　MAXは適宜変更
//COMinit()で初期化忘れないこと


const int MAX = 4000010;
const int MOD = 1e9 + 7;
int 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;
        }
      }
 
   int 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 memo[MAX];

int fra(int a){ // a! % MODを返す
  // いちいち計算し直すのは大変なのでメモしておこう
  if( memo[a] != -1 ){ return memo[a];}
  
  return memo[a] = ( fra(a-1)*a ) % MOD;
}

int powe(int a, int b){ // a^b%MODを返す
 
  if( b == 0 ){ return 1LL;}
  else if( b == 1 ){ return a%MOD;}
  
  if( b % 2 == 0 ){ return ( powe(a,b/2)*powe(a,b/2) ) % MOD;}
  else{
    return ( ( ( powe(a,(b-1)/2 )*powe( a,(b-1)/2 ) )%MOD )*a )%MOD;
  }
}
    
  

signed main(void){
  
  int N,A,B,C; cin >> N >> A >> B >> C;
  COMinit();
  
  for(int i = 0; i < MAX; i++){ memo[i] = -1;}
  memo[0] = 1; memo[1] = 1; memo[2] = 2; memo[3] = 6;
  fra(MAX-1);
  
  int ans = 0;
  
  for(int M = N; M < 2*N; M++){ 
    
    int nume = fra(M-1);
        nume *= (100*M)%MOD;
        nume %= MOD;
    
    int res = (powe(A,N)*powe(B,M-N))%MOD + (powe(A,M-N)*powe(B,N))%MOD;
        res %= MOD;
        nume *= res; 
        nume %= MOD;
    
    int deno = ( fra(N-1) * fra(M-N) ) % MOD;
        res = powe(100,M);
        deno *= res;
        deno %= MOD;
        deno *= (100-C);
        deno %= MOD;
    
        nume *= powe(deno,MOD-2);
        nume %= MOD;
    
    ans += nume;
    ans %= MOD;
  }
  
  cout << ans << endl;
  
  return 0;
} 

Compiler output:
a.cc:1:1: error: 'h' does not name a type
    1 | h>
      | ^
a.cc: In function 'int main()':
a.cc:55:16: error: 'cin' was not declared in this scope
   55 |   int N,A,B,C; cin >> N >> A >> B >> C;
      |                ^~~
a.cc:89:3: error: 'cout' was not declared in this scope
   89 |   cout << ans << endl;
      |   ^~~~
a.cc:89:18: error: 'endl' was not declared in this scope
   89 |   cout << ans << endl;
      |                  ^~~~
Language: C++

mod = 10**9+7
N, A, B, C = map(int, input().split())
def make_fact(n):#0~nの階乗を求める
    fact = [1]*(n+1)
    for i in range(1, n+1):
        fact[i] = fact[i-1]*i%mod
    return fact
fact = make_fact(N*2) #＠
def make_fact_inv(n):#0~nの階乗のmodに関する逆元を求める
    fact_inv = [1]*(n+1)
    fact_inv[n] = pow(fact[n], mod-2, mod)#フェルマーの小定理
    for i in range(n, 0, -1):
        fact_inv[i-1] = fact_inv[i]*i%mod
    return fact_inv
fact_inv = make_fact_inv(N*2)#＠
def comb(n, k):#nCk
    return fact[n]*fact_inv[k]*fact_inv[n-k]%mod
res = 0
AB_inv = pow(A+B, mod-2, mod)
for m in range(N, N*2):
    res+=comb(m-1, N-1)*pow(A, N, mod)*pow(B, m-N, mod)*pow(AB_inv, m, mod)*m
    res+=comb(m-1, N-1)*pow(B, N, mod)*pow(A, m-N, mod)*pow(AB_inv, m, mod)*m
    res%=mod
res*=100*pow(100-C, mod-2, mod)
res%=mod
print(res)




Compiler output:
a.cc:3:18: error: stray '#' in program
    3 | def make_fact(n):#0~nの階乗を求める
      |                  ^
a.cc:8:23: error: stray '#' in program
    8 | fact = make_fact(N*2) #＠
      |                       ^
a.cc:9:22: error: stray '#' in program
    9 | def make_fact_inv(n):#0~nの階乗のmodに関する逆元を求める
      |                      ^
a.cc:11:43: error: stray '#' in program
   11 |     fact_inv[n] = pow(fact[n], mod-2, mod)#フェルマーの小定理
      |                                           ^
a.cc:15:30: error: stray '#' in program
   15 | fact_inv = make_fact_inv(N*2)#＠
      |                              ^
a.cc:16:16: error: stray '#' in program
   16 | def comb(n, k):#nCk
      |                ^
a.cc:1:1: error: 'mod' does not name a type
    1 | mod = 10**9+7
      | ^~~
Language: C++

#include <bits/stdc++.h>


using namespace std;

#define SZ(x) (int)(x.size())

using ll = long long;
#define int ll
#include "../lib/math/comb.hpp"
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const ll MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll<<50;

template<typename T>
void printv(const vector<T>& s) {
  for(int i=0;i<(int)(s.size());++i) {
    cout << s[i];
    if(i == (int)(s.size())-1) cout << endl;
    else cout << " ";
  }
}

template<typename T1, typename T2>
ostream& operator<<(ostream &os, const pair<T1, T2> p) {
  os << p.first << ":" << p.second;
  return os;
}

signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);

  Combination<MOD> comb(3000000);

  int n; ll a, b, c; cin >> n >> a >> b >> c;
  ll pa = a * comb.getinv(a + b) % MOD;
  ll pb = b * comb.getinv(a + b) % MOD;
  //cout << pa << " " << pb << endl;

  ll ans = 0;
  ll tmpa = 1;
  for(int i=0;i<n;++i) {
    tmpa *= pa;
    tmpa %= MOD;
  }
  ll nowx = 1;
  for(int i=0;i<n;++i) {
    ll m = i + n;
    ll now = tmpa * nowx % MOD * comb.C(m-1, n-1) % MOD * m % MOD;
    ans += now;
    ans %= MOD;
    nowx *= pb;
    nowx %= MOD;
  }
  //cout << ans << endl;
  ll tmpb = 1;
  for(int i=0;i<n;++i) {
    tmpb *= pb;
    tmpb %= MOD;
  }
  nowx = 1;
  for(int i=0;i<n;++i) {
    ll m = i + n;
    ll now = tmpb * nowx % MOD * comb.C(m-1, n-1) % MOD * m % MOD;
    ans += now;
    ans %= MOD;
    nowx *= pa;
    nowx %= MOD;
  }
  //cout << ans << endl;
  cout << ans * 100 % MOD * comb.getinv(100 - c) % MOD<< endl;

}


Compiler output:
a.cc:10:10: fatal error: ../lib/math/comb.hpp: No such file or directory
   10 | #include "../lib/math/comb.hpp"
      |          ^~~~~~~~~~~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, j, n) for (int i = (j); i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)



struct modCalc{
	int mod;
	int n;
	vector<int> fact,invfact;
	modCalc(){};

	modCalc(int _mod,int _n){
		mod=_mod,n=_n;
		fact.resize(n+1,1);
		invfact.resize(n+1,1);

		for(int i=0;i<n;i++)fact[i+1]=fact[i]*(i+1)%mod;
		invfact[n]=modinv(fact[n]);
		for(int i=n;i>1;i--)invfact[i-1]=invfact[i]*i%mod;
	};

	int modpow(int x,int n){
		int ret=1;
		while(n>0){
			if(n&1)(ret*=x)%=mod;
			(x*=x)%=mod;
			n>>=1;
		}
		return ret;
	}
	int modinv(int x){
		return modpow(x,mod-2);
	}
	int nCm(int x,int y){
		if(y==0)return 1;
		else return fact[x]*invfact[y]%mod*invfact[x-y]%mod;
	}
	int nPm(int x,int y){
		return fact[x]*invfact[x-y]%mod;
	}
};

	int n,a,b,c;
	int mod=1e9+7;

int prbM(int m){
	static modCalc mc(mod,max(2*n,100ll));
	int inv100=mc.modinv(100);
	int a0=a*modinv(a+b)%mod;
	int b0=b*modinv(a+b)%mod;
	int ret1=mc.nCm(m-1,n-1)*m %mod *(mc.modpow(a0,n)*mc.modpow(b0,m-n) %mod +mc.modpow(b0,n)*mc.modpow(a0,m-n)%mod)%mod;
	return ret1 *100 %mod * mc.modinv(100-c) % mod;

}


signed main() {
	cin>>n>>a>>b>>c;
	int ret=0;
	for(int m=n;m<=2*n-1;m++){(ret+=prbM(m))%=mod;}
	cout<<ret<<endl;



}


Compiler output:
a.cc: In function 'long long int prbM(long long int)':
a.cc:53:18: error: 'modinv' was not declared in this scope
   53 |         int a0=a*modinv(a+b)%mod;
      |                  ^~~~~~
Language: C++

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, j, n) for (int i = (j); i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)



struct modCalc{
	int mod;
	int n;
	vector<int> fact,invfact;
	modCalc(){};

	modCalc(int _mod,int _n){
		mod=_mod,n=_n;
		fact.resize(n+1,1);
		invfact.resize(n+1,1);

		for(int i=0;i<n;i++)fact[i+1]=fact[i]*(i+1)%mod;
		invfact[n]=modinv(fact[n]);
		for(int i=n;i>1;i--)invfact[i-1]=invfact[i]*i%mod;
	};

	int modpow(int x,int n){
		int ret=1;
		while(n>0){
			if(n&1)(ret*=x)%=mod;
			(x*=x)%=mod;
			n>>=1;
		}
		return ret;
	}
	int modinv(int x){
		return modpow(x,mod-2);
	}
	int nCm(int x,int y){
		if(y==0)return 1;
		else return fact[x]*invfact[y]%mod*invfact[x-y]%mod;
	}
	int nPm(int x,int y){
		return fact[x]*invfact[x-y]%mod;
	}
};

	int n,a,b,c;
	int mod=1e9+7;

int prbM(int m){
	static modCalc mc(mod,2*n);
	
	int ret1=mc.nCm(m-1,n-1)*m %mod *(mc.modpow(a,n)*mc.modpow(b,m-n) %mod +mc.modpow(b,n)*mc.modpow(a,n-m)%mod;
	int ret2=mc.modpow(100,m-1)*(100-c)%mod;
	return ret1*mc.modinv(ret2)%mod;
}


signed main() {
	cin>>n>>a>>b>>c;
	int ret=0;
	for(int m=n;m<=2*n-1;m++){ret+=prbM(m);}	
	cout<<ret<<endl;



}

Compiler output:
a.cc: In function 'long long int prbM(long long int)':
a.cc:53:116: error: expected ')' before ';' token
   53 |         int ret1=mc.nCm(m-1,n-1)*m %mod *(mc.modpow(a,n)*mc.modpow(b,m-n) %mod +mc.modpow(b,n)*mc.modpow(a,n-m)%mod;
      |                                          ~                                                                         ^
      |                                                                                                                    )
Language: C++

#include "bits/stdc++.h"

using namespace std;
using ll = long long int;
using pii = pair<int, int>;
using pil = pair<int, ll>;

#include "Modulo.h"
#define MOD 1000000007

int main() {
	int N, A, B, C;
	cin >> N >> A >> B >> C;
	set_mod(MOD);
	set_fact_mod(2 * N - 2);
	set_rev_fact_mod(2 * N - 2);

	Modint a = (Modint)A / 100, b = (Modint)B / 100, c = (Modint)C / 100;
	Modint na = a / (a + b), nb = b / (a + b);
	vector<Modint> gNj(N);
	vector<Modint> giN(N);

	for (int j = 0; j <= N - 1; j++)
		gNj[j] = (1 / (1 - c)) * N + (1 / (1 - c)) * j;
	for (int i = 0; i <= N - 1; i++)
		giN[i] = (1 / (1 - c)) * i + (1 / (1 - c)) * N;
	Modint ans = 0;
	for (int i = 0; i <= N - 1; i++)
		ans += gNj[i] * pow_mod(na, N) * pow_mod(nb, i) * combination_mod_precalculation(N - 1 + i, i)
		+ giN[i] * pow_mod(na, i) * pow_mod(nb, N) * combination_mod_precalculation(N - 1 + i, i);
	cout << ans << endl;
	return 0;
}


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

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<vector>
#include<queue>
#include<map>
#include<iomanip>
#include<set>
#include "bits/stdc++.h"
#define rep(index,num) for(int index=0;index<num;index++)
#define rep1(index,num) for(int index=1;index<=num;index++)
#define scan(argument) cin>>argument
#define prin(argument) cout<<argument<<endl
#define kaigyo cout<<endl
#define eps 1e-7
#define mp(a1,a2) make_pair(a1,a2)
typedef long long ll;
typedef long double ld;
using namespace std;
typedef pair<ll,ll> pll;
typedef pair<int,int> pint;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<pint> vpint;
typedef vector<pll> vpll;
ll INFl=1e+18+1;
int INF=1e+9+1;
const int MAX = 200000;
const int MOD = 1e+9+7;
ll 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(){
	COMinit();
	ll N,A,B,C;
	scan(N>>A>>B>>C);
	ll A100C[MAX],B100C[MAX];
	A100C[0]=1,B100C[0]=1;
	rep(i,N){
		A100C[i+1]=A100C[i]*A%MOD*inv[100-C]%MOD;
		B100C[i+1]=B100C[i]*B%MOD*inv[100-C]%MOD;
	}
	ll ans=0;
	for(int M=N;M<=2*N-1;M++){
		ans+=COM(M-1,N-1)*M%MOD*100%NOD*inv[100-C]%MOD*((A100C[N]*B100C[M-N]%MOD+A100C[M-N]*B100C[N]%MOD)%MOD)%MOD;
		ans%=MOD;
	}
	prin(ans);
	return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:62:45: error: 'NOD' was not declared in this scope; did you mean 'MOD'?
   62 |                 ans+=COM(M-1,N-1)*M%MOD*100%NOD*inv[100-C]%MOD*((A100C[N]*B100C[M-N]%MOD+A100C[M-N]*B100C[N]%MOD)%MOD)%MOD;
      |                                             ^~~
      |                                             MOD
Language: C++

#include "bits/stdc++.h"

using namespace std;
using ll = long long int;
using pii = pair<int, int>;
using pil = pair<int, ll>;

#include "Modulo.h"
#define MOD 1000000007

int main() {
	int N, A, B, C;
	cin >> N >> A >> B >> C;
	set_mod(MOD);
	Modint a = (Modint)A / 100, b = (Modint)B / 100, c = (Modint)C / 100;
	Modint na = a / (a + b), nb = b / (a + b);
	vector<vector<Modint>> g(N + 1, vector<Modint>(N + 1));
	set_fact_mod(2 * N - 1);
	set_rev_fact_mod(2 * N - 1);

	for (int j = 0; j <= N - 1; j++)
		g[N][j] = ((a / (1 - c) / (1 - c) * N + b / (1 - c) / (1 - c) * j)) / na;
	for (int i = 0; i <= N - 1; i++)
		g[i][N] = ((a / (1 - c) / (1 - c) * i + b / (1 - c) / (1 - c) * N)) / nb;
	Modint ans = 0;
	for (int i = 0; i <= N - 1; i++)
		ans += g[N][i] * pow_mod(na, N) * pow_mod(nb, i) * combination_mod_precalculation(N - 1 + i, i)
		+ g[i][N] * pow_mod(na, i) * pow_mod(nb, N) * combination_mod_precalculation(N - 1 + i, i);
	cout << ans << endl;
	return 0;
}

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

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

const ll MAX = 200010;
const ll MOD = 1e7LL;

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;
}

long long pow_mod(long long x, long long n) {
    long long a = 1, x2n = x;
    x2n %= MOD;
    while (n!=0) {
        if (n&1==1) {
            a *= x2n;
            a %= MOD;
        }
        x2n *= x2n;
        x2n %= MOD;
        n >>= 1;
    }
    return a;
}

ll mod_inv(ll a, ll m) {
    ll b = m, x = 1, y = 0, s, t;
    while ( b != 0 ) {
        s = y;
        y = x - ( a / b ) * y;
        x = s;
        t = b;
        b = a % b;
        a = t;
    }
    return (x % m + m) % m;
}

int main() {
    ll N, A, B, C;
    cin >> N >> A >> B >> C;

    COMinit();
    ll a = A * mod_inv(A+B, MOD) % MOD;
    ll b = B * mod_inv(A+B, MOD) % MOD;
    ll an = pow_mod(a, N);
    ll bn = pow_mod(b, N);
    ll ak = 1, bk = 1;
    ll sum =  0;
    for ( int i = 0; i < N; i++ ) {
        ll x = COM(N-1+i, N-1) * bk % MOD;
        x = x * an % MOD;
        x = x * (N+i) % MOD;
        sum += x;
        sum %= MOD;
        bk = bk * b % MOD;
    }
    for ( int i = 0; i < N; i++ ) {
        ll x = COM(N-1+i, N-1) * ak % MOD;
        x = x * bn % MOD;
        x = x * (N+i) % MOD;
        sum += x;
        sum %= MOD;
        ak = ak * a % MOD;
    }
    sum = sum * 100 % MOD;
    sum = sum * mod_inv(100-C, MOD) % MOD;
    ll ans = sum;
    cout << ans << '\n';
    return 0;
}

Compiler output:
a.cc:6:16: error: unable to find numeric literal operator 'operator""LL'
    6 | const ll MOD = 1e7LL;
      |                ^~~~~
Language: C++

#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <vector>
#include <cstdio>
#include <iomanip>
#define ll long long
#define rep2(i,a,b) for(int i=a;i<=b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define rep3(i,a,b) for(int i=a;i>=b;i--)
#define REP(e,v) for(auto e:v)
#define queint queue<int>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pq priority_queue<int>//大きい順
#define pqg priority_queue<int,vec,greater<int>>//小さい順
#define pb push_back
#define vec vector<int>
#define vecvec vector<vector<int>>
#define vecll vector<ll>
#define vecvecll vector<vector<ll>>
#define bs binary_search
#define All(c) (c).begin(),(c).end()
#define mp make_pair
using namespace std;
int in(){int x;scanf("%d",&x);return x;}
string stin(){string s;cin>>s;return s;}
ll lin(){ll x;scanf("%lld",&x);return x;}

ll mod=1000000007;
vecll per(200010);
ll pw(ll a,ll p){
    if(p==0)return 1;
    if(p%2==0){
        ll d=pw(a,p/2);
        return d*d%mod;
    }
    return a*pw(a,p-1)%mod;
}
void f(){
    per[0]=1;
    rep2(i,1,200009){
        per[i]=per[i-1]*i%mod;
    }
    return;
}

ll divide(ll a,ll b){
    return a*(ll)pw(b,mod-2)%mod;
}
ll comb(ll a,ll b){
    return divide(per[a],per[b]*per[a-b]%mod);
}
int main(){
    int n=in(),a=in(),b=in(),c=in();
    f();
    if(a<b)swap(a,b);
    ll cnt=0;
    rep2(k,n,2*n-1){
        cnt+=k*divide(comb(k-1,n-1)*((pw(a,n)*pw(b,k-n)%mod+pw(b,n)*pw(a,k-n)%mod)%mod)%mod,(pw(100,k-1)*(100-c)%mod)%mod;
        cnt%=mod;
    }
    cout<<cnt<<endl;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:66:122: error: expected ')' before ';' token
   66 |         cnt+=k*divide(comb(k-1,n-1)*((pw(a,n)*pw(b,k-n)%mod+pw(b,n)*pw(a,k-n)%mod)%mod)%mod,(pw(100,k-1)*(100-c)%mod)%mod;
      |                      ~                                                                                                   ^
      |                                                                                                                          )
Language: C++

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

/* #pragma */
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
*/

/*alias*/
#define F first
#define S second

#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define itn int

/*template*/
template<class T>inline bool amax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>inline bool amin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }

/* func */
int GCD(int a,int b){return b?GCD(b,a%b):a;}
long long GCD(long long a, long long b){return b ? GCD(b, a%b) : a;}
int LCM(int a, int b){return a * b / GCD(a, b);}
long long LCM(long long a, long long b){return a * b / GCD(a, b);}

/*struct*/
struct aaa {
	aaa() {
		cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20);
	};
}aaaaaaa;

/* const */
const int INF = 1001001001;
const long long LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7; //10^9
const double EPS = 1e-9;
const int dx[] = { 1, 1, 0, -1, -1, -1, 0, 1 }, dy[] = { 0, 1, 1, 1, 0, -1, -1, -1 };
//const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
//Counterclockwise from the 6o'clock direction
//Take the x-axis downward and the y-axis right

#define int long long

//g++ -std=c++14 -Wall --pedantic-errors -o template template.cpp
//chcp 65001

signed main()
{
	int q; cin >> q;

	for(int i = 0, i_len = (int)q; i < i_len; ++i){
		int a,d,n; cin >> a >> d >> n;
			int p = 1;
   	 for (int j = 1; j <= n; j++)
    	{
			int tmp = d*(j-1);
			if(tmp % 1000003LL) != 0){
			if(tmp > 0) tmp %= 1000003LL;}
        	int m = a + tmp;//(d * (i - 1));
			if(m % 1000003LL) != 0){
			if(m > 0)m %= 1000003LL;}
        	p *= (m);//%1000003);
			//p %= 1000003;
    	}    
		cout << p << endl;
	}

	return 0;
}
/*	int n,a,b,c;cin>>n>>a>>b>>c;

	if(a >= b){

	}
	else{
		
	}*/

	//(a/100)^n*(b/100)^()
/*
期待値E = 試行回数N*(a/100);


*/

//n回勝つまで終わらない、N回目の試行
/*
aとbの中で大きいほうの確立とあいこと小さいほうの二項分布
*/
/*
	if(a > b){
		while(n >= N){
			int E = N*(a/100);
		}
	}
	else{
		int E = n*(b/100);
	}*/

Compiler output:
a.cc: In function 'int main()':
a.cc:64:45: error: expected primary-expression before '!=' token
   64 |                         if(tmp % 1000003LL) != 0){
      |                                             ^~
a.cc:67:43: error: expected primary-expression before '!=' token
   67 |                         if(m % 1000003LL) != 0){
      |                                           ^~
Language: C++

#include <bits/stdc++.h>
#include <numeric>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

int modinv(int a,int m){
    int b=m,u=1,v=0;
    while(b){
        int t=a/b;
        a-=t*b;
        swap(a,b);
        u-=t*v;
        swap(u,v);
    }
    u%=m;
    if(u<0) u+=m;
    return u;
}

int main(){
    int n,a,b,c,r,mod=1000000007,x=0,y=0;
    cin >> n >> a >> b >> c;

    a%=mod;
    b%=mod;

    if(a*moinv(b,mod)%mod>b*modinv(a,mod)%mod){
        r=a*moinv(b,mod)%mod;
    }
    else{
        r=b*moinv(a,mod)%mod;
    }
    cout << r << endl;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:29:10: error: 'moinv' was not declared in this scope; did you mean 'modinv'?
   29 |     if(a*moinv(b,mod)%mod>b*modinv(a,mod)%mod){
      |          ^~~~~
      |          modinv
Language: C++

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define MOD 1000000007

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define all(i) (i).begin(), (i).end() å
#define rall(i) (i).begin(), (i).end(), greater<int>()

#define elif else if
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define fst first
#define sec second
template <typename T>
void print(T x)
{
    std::cout << x << '\n';
}

//typedef long long ll;
#define TENNINE 1000000005
#define TENFIVE 100005
//#define int long long

int n, a, b, c;
int d;

double dp[100001][TENNINE] = {-1}; //[a][b]:a回勝っているb回め

double fun_dp(int i, int j)
{
    if (i == 0 && j == 0)
    {
        dp[0][0] = 1;
        return 1;
    }
    else if (i == 0 && j == 1)
    {
        dp[i][j] = (double)(c / 100);
        return dp[i][j];
    }
    else if (i == 1 && j == 1)
    {
        dp[i][j] = (double)(d / 100);
        return dp[i][j];
    }

    if (dp[i][j] != -1)
    {
        return dp[i][j];
    }

    else
    {
        dp[i][j] = fun_dp(i, j - 1) * (double)(c / 100) + fun_dp(i - 1, j) * (double)((d) / 100);
    }
    return dp[i][j];
}

signed main()
{

    cin >> n >> a >> b >> c;
    d = a + b;

    int sum = 0;

    while (1)
    {
        int j = n;

        if (j * fun_dp(n, j) < 1)
        {
            break;
        }

        sum += j * fun_dp(n, j);

        if (sum > MOD)
        {
            sum %= MOD;
        }
        j++;
    }

    cout << sum << endl;

    return 0;
}


Compiler output:
g++: internal compiler error: File size limit exceeded signal terminated program as
Please submit a full bug report, with preprocessed source (by using -freport-bug).
See <file:///usr/share/doc/gcc-14/README.Bugs> for instructions.
Language: C++

#include<iostream>
using namespace std;
int f(int N,int A,int B,int C,int n,int a,int b){
  if(a >= N || b >= N){return n}
  return f(N,A,B,C,n+1,a+1,b) * A/100 + f(N,A,B,C,n+1,a,b+1) * B/100 
    + f(N,A,B,C,n+1,a,b) * C/100;
int main(void){
  int A,B,C,N;
  cin >> N >> A >> B >> C;
  int a,b;
  cout << f(N,A,B,C,0,0,0);
}


    

  

Compiler output:
a.cc: In function 'int f(int, int, int, int, int, int, int)':
a.cc:4:32: error: expected ';' before '}' token
    4 |   if(a >= N || b >= N){return n}
      |                                ^
      |                                ;
a.cc:7:15: error: a function-definition is not allowed here before '{' token
    7 | int main(void){
      |               ^
a.cc:12:2: error: expected '}' at end of input
   12 | }
      |  ^
a.cc:3:49: note: to match this '{'
    3 | int f(int N,int A,int B,int C,int n,int a,int b){
      |                                                 ^