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

/*----------------by syr----------------*/
/*

         iii                  ii
     rBQBBBBBBE       BBR iBBBBQBBL     XBBBBBBQBBBBB
   iBBQJ    7BBB      BBsSBBr   BBQ      i      cBBB
  rBBU       iBBw     BBBQi     HBBi           KBBi
  BBH         BB5    iBBB       isL          wBB5
 GBB         iBBi    6BB                   iBBB
 BBQ         BQB     BBD                  QBBi
 BBB        BQB     iQBi                1BBv
 sBBg     wBBB      QBB               iBBB
  7BBBBBBBBBi       BBR              wBBBBBBBBBBBBB
     irvi           ii               ii    i i iii
                i5U
               BBB
               BB7
              1BB
      iPBBBBBKBBR    JBR1       rQBO   BR  UBQP  iBBQi
    7BBBGs7sXBBBi     QBBr     gBBE   rBB BB2BB7HBZQBB
   QBBi      sBQ       BBB   iBBB     SQBBR  BBBB  cBQ
  gBQ        BBg        BBB KBBi      MBBH   BBB   BBs
 iBBv       iBBi         QBBBL        BBR   pBB   iBB
 pBB        BBB         iBBBB        iBB    BBL   KBB
 MBB       BBBR        BBB JBBi      DBR   iBQ    BBL
 GBB     7BBBB2      PBBH   BBBi     BQr   DBB   iBB
  BQBXwgBBP BB7    1BBB      BBQ7   1BB    BBc   BBB
   2BBBBw   BB    EBBS        QBBi  HBa   iBB    BB7
*/
#include<bits/stdc++.h>

using namespace std;

#define PH push
#define MP make_pair
#define PB push_back
#define fst first
#define snd second
#define FOR(i, x, y) for(int i = (x); i < (y); ++i)
#define REP(i, x, y) for(int i = (x); i <= (y); ++i)
#define x0 x0123456789
#define y0 y0123456789
#define x1 x1234567890
#define y1 y1234567890
#define x2 x2345678901
#define y2 y2345678901
typedef double db;
typedef long long ll;
typedef long double ldb;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int INF = 1e9 + 7;
const int maxn = 2005;
const int maxm = 1e6 + 5;
const int maxk = 1e4 + 5;
const int sigma = 65;

int n, k, tot = 0;
int beg[maxn], l[maxn];
int dp[maxn][maxk];
char str[maxm], ans[maxk];
char s[maxn][maxk];
bitset<maxm> segt[sigma];

int query(bitset<maxm> cur){
	int u;
	for(u = 1; u < 32; ){
		if(!(cur & segt[u << 1]).none()) u <<= 1;
		else (u <<= 1) += 1;
	}
	return u - 32;
}

int main(){
	scanf("%d%d", &n, &k);
	FOR(i, 0, n){
		scanf("%s", s[i]);
		l[i] = strlen(s[i]);
	}
	dp[n][0] = 1;
	for(int i = n - 1; i >= 0; --i) FOR(j, 0, k){
		dp[i][j] |= dp[i + 1][j];
		if(l[i] <= j) dp[i][j] |= dp[i + 1][j - l[i]];
	}
	//puts("ok");
	FOR(i, 0, n){
		beg[i] = tot;
		FOR(j, 0, l[i]){
			segt[s[i][j] - 'a' + 32].set(tot);
			str[tot++] = s[i][j];
		}
		//printf("%d\n", beg[i]);
	}
	beg[n] = l;
	for(int i = 31; i; --i) segt[i] = segt[i << 1] | segt[i << 1 | 1];
	bitset<maxm> cur;
	cur.set(0);
	//puts("ok");
	FOR(i, 0, k){
		FOR(j, 0, n) if(cur[beg[j]]) cur.set(beg[j + 1]);
		FOR(j, 0, n) if(!dp[j + 1][k - i - l[j]]) cur.reset(beg[j]);
		int nxt = query(cur);
		//printf("nxt = %d\n", nxt);
		cur &= segt[nxt + 32];
		cur <<= 1;
		ans[i] = nxt + 'a';
	}
	puts(ans);
	return 0;
}



Compiler output:
a.cc: In function 'int main()':
a.cc:96:18: error: invalid conversion from 'int*' to 'int' [-fpermissive]
   96 |         beg[n] = l;
      |                  ^
      |                  |
      |                  int*
Language: C++

#include <cstdio>
#include <vector>
#include <cstring>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
#define ULL unsigned long long

int n,k;
int dp[2005][10005];
vector < string > s;
vector < int > low;
int ra[2005];
char inp[10005];
vector < int > rmq[2005];
ULL po[5005];
ULL mo = 1e9 + 7;

bool vs[2005][100005];
vector < string > dp2[2005];

bool cmp( int a, int b ){
	if ( s[a] + s[b] == s[b] + s[a] ) return a < b;
	return s[a] + s[b] <  s[b] + s[a];
}

bool cmprank( int a, int b ){
	return ra[a] < ra[b];
}

int dfs( int pos, int sz ){
	if ( sz > k ) return false;
	if ( sz == k ) return true;
	if ( pos == n ) return false;
	int &ans = dp[pos][sz];
	if ( ans != -1 ) return ans;
	ans = dfs(pos+1,sz);
	if ( sz + s[pos].size() <= k ) ans = max( ans, dfs(pos+1, sz + s[pos].size()));
	return ans;
}

string getstr( int pos, int sz ){
	if ( pos >= n ) return "";
	if ( sz == k ) return  "";
	int len = rmq[pos].size();
	string ans = "";
	for ( int i = 0; i < len; i++ ){
		int id = rmq[pos][i];
		if ( dfs(id+1, sz + s[id].size()) ) {
			string tmp;
			tmp = s[id] + getstr(id+1, sz + s[id].size() );
			return tmp;
		}
	}
	assert(1==2);
}

int main(){

	po[0] = 1;
	for ( int i = 1; i <= 5000; i++ ) po[i] = po[i-1] * mo;
	
	memset(dp,-1,sizeof(dp));
	scanf("%d%d",&n,&k);
	for ( int i = 0; i < n; i++ ){
		// scanf("%s",&inp);
		// string t = inp;
		string t = "";
		for ( int j = 0; j < 500; j++ ) t += (char)((i%26)+'a');
		s.push_back(t);
		low.push_back(i);
	}
	sort(low.begin(),low.end(),cmp);
	for ( int i = 0; i < n; i++ ) ra[low[i]] = i;

	for ( int i = 0; i < n; i++ ){
		for ( int j = i ; j < n; j++ ) rmq[i].push_back(j);
		sort(rmq[i].begin(),rmq[i].end(),cmprank);
	}
	
	string ans = getstr(0,0);
	cout << ans << endl;
	return 0;
}

Compiler output:
a.cc: In function 'std::string getstr(int, int)':
a.cc:56:9: error: 'assert' was not declared in this scope
   56 |         assert(1==2);
      |         ^~~~~~
a.cc:7:1: note: 'assert' is defined in header '<cassert>'; this is probably fixable by adding '#include <cassert>'
    6 | #include <algorithm>
  +++ |+#include <cassert>
    7 | using namespace std;
a.cc:57:1: warning: control reaches end of non-void function [-Wreturn-type]
   57 | }
      | ^
Language: C++

#include <cstdio>
#include <vector>
#include <cstring>
#include <string>
#include <iostream>
using namespace std;

int n,k;
int dp[2005][10005];
bool vs[2005][10005];
string dp2[2005][10005];
vector < string > s;
vector < int > low;
int ra[2005];
char inp[10005];
vector < int > rmq[2005];

bool cmp( int a, int b ){
	return s[a] < s[b];
}

bool cmprank( int a, int b ){
	return ra[a] < ra[b];
}

int dfs( int pos, int sz ){
	if ( sz > k ) return false;
	if ( sz == k ) return true;
	if ( pos == n ) return false;
	int &ans = dp[pos][sz];
	if ( ans != -1 ) return ans;
	ans = dfs(pos+1,sz);
	if ( sz + s[pos].size() <= k ) ans = max( ans, dfs(pos+1, sz + s[pos].size()));
	return ans;
}

string getstr( int pos, int sz ){
	if ( pos >= n ) return "";
	if ( sz == k ) return  "";

	if ( vs[pos][sz] ) return dp2[pos][sz];
	int len = rmq[pos].size();
	vs[pos][sz] = true;

	string ans = "";
	for ( int i = 0; i < len; i++ ){
		int id = rmq[pos][i];
		if ( dfs(id+1, sz + s[id].size()) ) {
			string tmp;
			tmp = s[id] + getstr(id+1, sz + s[id].size() );
			if ( ans == "" || tmp < ans ) ans = tmp;
			if ( tmp >= ans ) break;
		}
	}
	return dp2[pos][sz] = ans;
}

int main(){
	memset(dp,-1,sizeof(dp));
	scanf("%d%d",&n,&k);
	for ( int i = 0; i < n; i++ ){
		scanf("%s",&inp);
		string t = inp;
		s.push_back(t);
		low.push_back(i);
	}
	sort(low.begin(),low.end(),cmp);
	for ( int i = 0; i < n; i++ ) ra[low[i]] = i;

	for ( int i = 0; i < n; i++ ){
		for ( int j = i ; j < n; j++ ) rmq[i].push_back(j);
		sort(rmq[i].begin(),rmq[i].end(),cmprank);
	}
	
	string ans = "";
	for ( int i = 0; i < n; i++ ){
		int id = rmq[0][i];
		if ( dfs(id+1, s[id].size()) ){
			string tmp = s[id] + getstr(id+1, s[id].size());
			if ( ans == "" || tmp < ans ) ans = tmp;
			if ( tmp >= ans ) break;
		}
	}
	cout << ans << endl;
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:67:9: error: 'sort' was not declared in this scope; did you mean 'short'?
   67 |         sort(low.begin(),low.end(),cmp);
      |         ^~~~
      |         short
Language: C++

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

int n,k;
int dp[2005][10005];
vector < string > s;
vector < int > low;
int rank[2005];
char inp[1000005];
vector < int > rmq[2005];

bool cmp( int a, int b ){
	return s[a] < s[b];
}

bool cmprank( int a, int b ){
	return rank[a] < rank[b];
}

int dfs( int pos, int sz ){
	if ( sz > k ) return false;
	if ( sz == k ) return true;
	if ( pos == n ) return false;
	int &ans = dp[pos][sz];
	if ( ans != -1 ) return ans;
	ans = dfs(pos+1,sz);
	ans = max( ans, dfs(pos+1, sz + s[pos].size()));
	return ans;
}

string getstr( int pos, int sz ){
	if ( pos >= n ) return "";
	if ( sz == k ) return  "";
	int len = rmq[pos].size();
	for ( int i = 0; i < len; i++ ){
		int id = rmq[pos][i];
		if ( dfs(id, sz + s[id].size()) ) return s[id] + getstr(id+1, sz + s[id].size() );
	}
	assert(1==2);
}

int main(){
	
	memset(dp,-1,sizeof(dp));
	scanf("%d%d",&n,&k);
	for ( int i = 0; i < n; i++ ){
		scanf("%s",&inp);
		string t = inp;
		s.push_back(t);
		low.push_back(i);
	}
	sort(low.begin(),low.end(),cmp);
	for ( int i = 0; i < n; i++ ) rank[low[i]] = i;

	for ( int i = 0; i < n; i++ ){
		for ( int j = i ; j < n; j++ ) rmq[i].push_back(j);
		sort(rmq[i].begin(),rmq[i].end(),cmprank);
	}
	
	string ans = "";
	for ( int i = 0; i < n; i++ ){
		int id = rmq[0][i];
		if ( dfs(id, s[id].size()) ){
			ans = s[id] + getstr(id+1, s[id].size());
			break;
		}
	}
	cout << ans << endl;
	return 0;
}

Compiler output:
a.cc: In function 'bool cmprank(int, int)':
a.cc:17:16: error: reference to 'rank' is ambiguous
   17 |         return rank[a] < rank[b];
      |                ^~~~
In file included from /usr/include/c++/14/bits/stl_pair.h:60,
                 from /usr/include/c++/14/bits/stl_algobase.h:64,
                 from /usr/include/c++/14/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51,
                 from a.cc:1:
/usr/include/c++/14/type_traits:1437:12: note: candidates are: 'template<class> struct std::rank'
 1437 |     struct rank
      |            ^~~~
a.cc:8:5: note:                 'int rank [2005]'
    8 | int rank[2005];
      |     ^~~~
a.cc:17:26: error: reference to 'rank' is ambiguous
   17 |         return rank[a] < rank[b];
      |                          ^~~~
/usr/include/c++/14/type_traits:1437:12: note: candidates are: 'template<class> struct std::rank'
 1437 |     struct rank
      |            ^~~~
a.cc:8:5: note:                 'int rank [2005]'
    8 | int rank[2005];
      |     ^~~~
a.cc: In function 'int main()':
a.cc:53:39: error: reference to 'rank' is ambiguous
   53 |         for ( int i = 0; i < n; i++ ) rank[low[i]] = i;
      |                                       ^~~~
/usr/include/c++/14/type_traits:1437:12: note: candidates are: 'template<class> struct std::rank'
 1437 |     struct rank
      |            ^~~~
a.cc:8:5: note:                 'int rank [2005]'
    8 | int rank[2005];
      |     ^~~~
Language: C++

N,K=map(int,input().strip().split())
s=[]
kazu=[]
for i in range(N):
    s.append(input())
    kazu.append(len(s[i]))
for z in range(N):
    for x in range(N):
        if z==x:
            break
        if kazu[x]+kazu[z]==K:
            print(s[x]+s[z])
            exit()

Compiler output:
a.cc:1:1: error: 'N' does not name a type
    1 | N,K=map(int,input().strip().split())
      | ^
Language: C++

#include<cstdio>
#include<iostream>
#include<cstring>
#include<bitset>
#define mp(a,b) make_pair(a,b)
using namespace std;
bitset<10010> can[2010];
pair<int,int> vis[2][10010];
char s[2010][10010],ans[1000010];
int len[2010],n,k,cnt,ncnt;
int main()
{
    scanf("%d%d",&n,&k);
    for (int i=1;i<=n;i++) scanf("%s",s[i]),len[i]=strlen(s[i]);
    can[n+1][0]=1;
    for (int i=n;i>=1;i--)
        can[i]=can[i+1]|(can[i+1]<<len[i]);
    for (int i=1;i<=n;i++)
        if (can[i+1][k-len[i]]) vis[0][++cnt]=mp(i,0);
    int ii=0;
    for (int i=0;i<k;i++)
    {
        char minc='z';
        for (int j=1;j<=cnt;j++) minc=min(minc,s[vis[ii][j].first][vis[ii][j].second]);
        ans[i]=minc;
        int minid=n+1;
        ncnt=0;
        for (int j=1;j<=cnt;j++)
        {
            int nid=vis[ii][j].first,nlen=vis[ii][j].second;
            if (s[nid][nlen]!=minc) continue;
            if (nlen+1==len[nid]) minid=min(minid,nid);
            else vis[ii^1][++ncnt]=mp(nid,nlen+1);
        }
        for (int j=minid+1;j<=n;j++)
            if (k-len[j]-i-1>=0&&can[j+1][k-len[j]-i-1]) vis[ii^1][++ncnt]=mp(j,0);
        ii^=1;
        cnt=ncnt;
    }
    printf("%s",ans);
}

---------------------

本文来自 Fizzmy 的CSDN 博客 ，全文地址请点击：https://blog.csdn.net/charlie_jilei/article/details/79274652?utm_source=copy 

Compiler output:
a.cc:43:1: error: expected unqualified-id before '--' token
   43 | ---------------------
      | ^~
Language: C++

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<bitset>
#include<iostream>
using namespace std;
typedef long long ll;
const int N=2005;
const int L=1e6+5;
struct node{
    string s;
    int pos;
}p[N];
bool cmp(node a,node b){
    return a.s<b.s;
}
char s[L];
int sum[N];
bitset<10000005> vis[N];
int now,pl;int n,k;
void dfs(){
    if(now==0)
        return ;
    for(int i=1;i<=n;i++){
        if(p[i].pos<=pl)
            continue ;
        int sz=p[i].s.length();
        if(vis[p[i].pos+1][now-sz]){
            cout<<p[i].s;
            now-=sz;
            pl=p[i].pos;
            dfs();
            return ;
        }
    }
}
int main()
{
    scanf("%d%d",&n,&k);
    now=k;
    for(int i=1;i<=n;i++){
        scanf("%s",s);
        p[i].s=string(s);
        p[i].pos=i;
    }
    for(int i=n;i>=1;i--)
        sum[i]=sum[i+1]+p[i].s.length();
    //vis[n+1][0]=1;
    vis[n+1].set(0);
    for(int i=n;i>=1;i--){
        for(int j=min(sum[i],L-5),sz=p[i].s.length();j>=sz;j--)
            if(vis[i+1][j-sz])
                //vis[i][j]=1;
                vis[i].set(j);
        //vis[i][0]=1;
        vis[i].set(0);
    }
    sort(p+1,p+n+1,cmp);
    dfs();
}


Compiler output:
/tmp/ccbWbdwj.o: in function `dfs()':
a.cc:(.text+0x30): relocation truncated to fit: R_X86_64_PC32 against symbol `now' defined in .bss section in /tmp/ccbWbdwj.o
a.cc:(.text+0x6b): relocation truncated to fit: R_X86_64_PC32 against symbol `pl' defined in .bss section in /tmp/ccbWbdwj.o
a.cc:(.text+0xda): relocation truncated to fit: R_X86_64_PC32 against symbol `now' defined in .bss section in /tmp/ccbWbdwj.o
a.cc:(.text+0x143): relocation truncated to fit: R_X86_64_PC32 against symbol `now' defined in .bss section in /tmp/ccbWbdwj.o
a.cc:(.text+0x14c): relocation truncated to fit: R_X86_64_PC32 against symbol `now' defined in .bss section in /tmp/ccbWbdwj.o
a.cc:(.text+0x173): relocation truncated to fit: R_X86_64_PC32 against symbol `pl' defined in .bss section in /tmp/ccbWbdwj.o
a.cc:(.text+0x185): relocation truncated to fit: R_X86_64_PC32 against symbol `n' defined in .bss section in /tmp/ccbWbdwj.o
/tmp/ccbWbdwj.o: in function `main':
a.cc:(.text+0x1a7): relocation truncated to fit: R_X86_64_PC32 against symbol `k' defined in .bss section in /tmp/ccbWbdwj.o
a.cc:(.text+0x1b1): relocation truncated to fit: R_X86_64_PC32 against symbol `n' defined in .bss section in /tmp/ccbWbdwj.o
a.cc:(.text+0x1ce): relocation truncated to fit: R_X86_64_PC32 against symbol `k' defined in .bss section in /tmp/ccbWbdwj.o
a.cc:(.text+0x1d4): additional relocation overflows omitted from the output
collect2: error: ld returned 1 exit status
Language: C++

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pp;
typedef pair<ll,ll> pll;
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define eb emplace_back
#define x first
#define y second

bitset<10010> ok[2010];
int n, k;
string s[2010];
char ans[10010];
vector<int> pts;

int fail[10010];
int self[10010];
int match[10010];

int an;

int main()
{
	cin>>n>>k;
	for(int i=1; i<=n; ++i) cin>>s[i];
	ok[n+1][0]=1;
	for(int i=n; 1<=i; --i) ok[i] = ok[i+1] | (ok[i+1]<<(s[i].length()));
	pts.pb(0);
	for(int i=1; i<=n; ++i){
		const char* p = s[i].c_str();
		int l = s[i].length();
		
		fill(fail, fail+l, 0);
		fill(self, self+l, 0);
		fill(match, match+an+1, 0);
		
		for(int i=1; i<l; ++i){
			int j=fail[i-1];
			while(j && p[j] != p[i]) j=fail[j-1];
			if(p[j] == p[i]) ++j;
			fail[i]=j;
			if(j) self[i-j+1]=max(self[i-j+1], j);
		}
		for(int i=0; i<l; ++i){
			int& m=self[i];
			while(m<l-i && p[m]==p[i+m]) ++m;
			if(m){
				int& t=self[i+m-fail[m-1]];
				t=max(t, fail[m-1]);
			}
		}
		
		for(int i=0, ml=0; i<ans; ++i){
			while(ml && p[ml] != ans[i]) ml=fail[ml-1];
			if(p[ml] == ans[i]) ++ml;
			if(ml) match[i-ml+1] = max(match[i-ml+1], ml);
		}
		
		for(int i=0; i<an; ++i){
			int& m=match[i];
			while(m<l && ans[i+m] == p[m]) ++m;
			if(m>=2){
				int& t=match[i+m-fail[m-1]];
				t=max(t, fail[m-1]);
			}
		}
		
		int cmp = -1;
		for(int st:pts){
			if(k<(st+l) || !ok[i+1][k-(st+l)]) continue;
			if(cmp == -1){
				if(match[st]<l && (st+match[st]==an || p[match[st]]<ans[st+match[st]])){
					cmp = st;
				}
			} else if(cmp+l <= st) break;
			else {
				int sa = st-cmp;
				if(match[cmp] >= sa){
					if(self[sa] == l-sa || p[self[sa]]<p[sa+self[sa]]) cmp=st;
				}
			}
		}
		
		int lm = an;
		if(cmp != -1){
			lm = cmp + match[cmp], an = cmp+l;
			for(int i=0; i<l; ++i) ans[cmp+i]=p[i]; ans[an]=0;
		}
		vector<int> nv;
		for(int st:pts){
			if(k<(st+l) || !ok[i+1][k-(st+l)]) continue;
			if((match[st]==l && (cmp==-1 || st+match[st]<=cmp)) || match[st]>=cmp-st && self[cmp-st]==l-(cmp-st)){
				nv.pb(st+l);
			}
		}
		vector<int> fn;
		for(int i=0,j=0; i<pts.size() || j<nv.size();){
			if(j==nv.size() || (i<pts.size() && j<nv.size() && pts[i]<nv[j])){
				if(pts[i]<=lm){
					if(fn.empty() || fn.back() != pts[i])
						fn.pb(pts[i]);
				}
				++i;
			} else {
				if(fn.empty() || fn.back() != nv[j]) fn.pb(nv[j]);
				++j;
			}
		}
		swap(pts, fn);
	}
	puts(ans);
	return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:55:37: error: ISO C++ forbids comparison between pointer and integer [-fpermissive]
   55 |                 for(int i=0, ml=0; i<ans; ++i){
      |                                    ~^~~~
Language: C++

# include <bits/stdc++.h>

using namespace std;

# define REP(i, a, b) for(int i = a; i <= b; ++ i)
# define CLR(i, a) memset(i, a, sizeof(i))
# define REPD(i, a, b) for(int i = a; i >= b; -- i)
# define OUT(x) cout << #x << ": " << x << " "

const int N = 2e3 + 5;

int k, n, stk[N], tp, f[N][(int)(1e4 + 5)], tot, g[N];
string s[N];
int vis[N];

# define QAQ puts("**")

inline int cmp(const int a, const int b) { return s[a] < s[b]; }

int main() {
	CLR(vis, -1);
	scanf("%d%d", &n, &k);

	REP(i, 1, n) cin >> s[i], tot += s[i].size(), g[i] = i;
	sort(g + 1, g + n + 1, cmp);
	REP(i, 1, n + 1) f[i][0] = 1;
	REPD(i, n, 1) {
		REPD(j, min(tot, (int)1e4), s[i].size()) {
			f[i][j] |= f[i + 1][j - s[i].size()];
//			OUT(i), OUT(j), OUT(f[i][j]), puts("");
		}
	}
	int tmp = k, cur = 0;
	while(tmp) {
		int x;
		REP(j, 1, n) { 
			if(g[j] > cur && tmp >= s[g[j].size()]) { 
				if(f[g[j] + 1][tmp - s[g[j]].size()]) {
					tmp -= s[g[j]].size();
					stk[++ tp] = g[j];
					cur = g[j];
					break;
				}
			} 
		}
//		OUT(x), OUT(tmp), cout<<f[x + 1][tmp - s[x].size()]<<endl;
//		system("pause");
		
//		OUT(cur), puts("");
	}
	REP(i, 1, tp) cout << s[stk[i]];
	puts("");
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:37:56: error: request for member 'size' in 'g[j]', which is of non-class type 'int'
   37 |                         if(g[j] > cur && tmp >= s[g[j].size()]) {
      |                                                        ^~~~
Language: C++

#include <iostream>
#include <string>
#include <algorithm>
#include <bitset>

using namespace std;

#define MAXN 2000
#define MAXK 10000

bitset <MAXK+1> d[MAXN+1];
int r[MAXN+1];
string s[MAXN+1];

vector <int> u[MAXN+1];

char ans[MAXN+1];
int a[MAXN+1], b[MAXN+1];
int st[MAXN+1];

bool g[MAXN+1][MAXN+1];

bool cmp(const int &a, const int &b){
    return s[a]<s[b];
}

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

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

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

    sort(a+1, a+n+1, cmp);

    int q=1;
    b[a[1]]=1;
    for(int i=2; i<=n; i++){
        q+=(s[a[i]]!=s[a[i-1]]);
        b[a[i]]=q;
    }

    int vf=1;
    st[1]=a[1];
    for(int i=2; i<=n; i++){
        int j=0, p=1;
        while((p<=vf)&&(j<(int)s[a[i]].size())&&(s[a[i]][j]==s[st[p]][j])){
            j++;
            while((p<=vf)&&(j==(int)s[st[p]].size()))
                p++;
        }
        st[p]=a[i];
        vf=p;
        for(int j=1; j<p; j++)
            g[a[i]][st[j]]=g[st[j]][a[i]]=1;
    }

    d[n+1][0]=1;
    for(int i=n; i>0; i--)
        d[i]=d[i+1]|(d[i+1]<<s[i].size());

    r[0]=1;
    int t=0;
    for(int i=0; i<k; i++) if(r[i]>0){
        int left=q+1, right=0;
        for(int j=r[i]; j<=n; j++)
            if((k-i-(int)s[j].size()>=0)&&(d[j+1][k-i-(int)s[j].size()]))
                u[b[j]].push_back(j), left=min(left, b[j]), right=max(right, b[j]);

        r[i]=0;

        vf=0;
        for(int j=left; j<=right; j++){
            for(auto x:u[j])
                if((vf==0)||(g[st[vf]][x]))
                    st[++vf]=x;
            u[j].clear();
        }

        int p=0, j=1;
        while((i+p<t)&&(j<=vf)&&(ans[i+p]==s[st[vf]][p])){
            p++;
            while((j<=vf)&&((int)s[st[j]].size()==p)){
                if((r[i+p]==0)||(st[j]+1<r[i+p]))
                    r[i+p]=st[j]+1;
                j++;
            }
        }

        if((j<=vf)&&((i+p==t)||(s[st[vf]][p]<ans[i+p]))){
            while(j<=vf){
                ans[i+p]=s[st[vf]][p];
                p++;
                r[i+p]=0;
                while((j<=vf)&&((int)s[st[j]].size()==p)){
                    if((r[i+p]==0)||(st[j]+1<r[i+p]))
                        r[i+p]=st[j]+1;
                    j++;
                }
            }
            while(i+p<t){
                p++;
                r[i+p]=0;
            }

            t=i+p;
        }
    }

    for(int i=0; i<k; i++)
        cout << ans[i];

    return 0;
}


Compiler output:
a.cc:15:1: error: 'vector' does not name a type
   15 | vector <int> u[MAXN+1];
      | ^~~~~~
a.cc: In function 'int main()':
a.cc:71:17: error: 'u' was not declared in this scope
   71 |                 u[b[j]].push_back(j), left=min(left, b[j]), right=max(right, b[j]);
      |                 ^
a.cc:77:24: error: 'u' was not declared in this scope
   77 |             for(auto x:u[j])
      |                        ^
a.cc:80:13: error: 'u' was not declared in this scope
   80 |             u[j].clear();
      |             ^
Language: C++

#include <fstream>
#include <iostream>
#include <functional>
#include <algorithm>
#include <cstring>
#include <vector>
#include <string>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <deque>
#include <ctime>
#include <list>
#include <set>
#include <map>
using namespace std;
 
typedef long long ll;
#define eps 1e-5
#define LL_INF 0x3fffffffffffffff
#define INF 0x3f3f3f3f
#define mem(a, b) memset(a, b, sizeof(a))
#define pper(i,n,m) for(int i = n;i >= m; i--)
#define repp(i, n, m) for (int i = n; i <= m; i++)
#define rep(i, n, m) for (int i = n; i < m; i++)
#define sa(n) scanf("%d", &(n))
#define mp make_pair
#define ff first
#define ss second
#define pb push_back

const int maxn = 2e3+2;
const ll mod = 1e9+7;
const double PI = acos(-1.0);
ll po(ll a,ll b) {ll res=1;a%=mod;for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}

int n,k;
int vis[maxn];
string val[maxn];
bool get[maxn][10001];
bool dp[maxn][10001];
int loc[2][1000005][2];

void solve()
{
	int i,j;
	sa(n),sa(k);

	repp(i,1,n)
	{
		cin>>val[i];
	}
	
	mem(dp,false);	
	dp[n+1][0] = false;
	
	for(i=n;i>=1;i--)
	{
		for(j=0;j<=k;j++)
		{
			if(dp[i+1][j])
			{
				dp[i][j] = true;
			}
			if(dp[i+1][j] && j + val[i].length() <= k)
			{
				dp[i][j+val[i].length] = true;
			}
		}
	}
	int now=0,pre=1;
	for(i=1;i<=n;i++)
	{
		if(dp[])
		loc[now][]
	}
}

int main()
{
#ifndef ONLINE_JUDGE
    freopen("/Users/2997ms/Desktop/eve/algorithm/algorithm/i.txt", "r", stdin);
    //freopen("/Users/2997ms/Desktop/eve/algorithm/algorithm/o.txt", "w", stdout);
#endif 
    solve();
	return 0;
}


Compiler output:
a.cc: In function 'void solve()':
a.cc:68:48: 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 '()' ?)
   68 |                                 dp[i][j+val[i].length] = true;
      |                                         ~~~~~~~^~~~~~
      |                                                      ()
a.cc:75:23: error: expected primary-expression before ']' token
   75 |                 if(dp[])
      |                       ^
a.cc:76:26: error: expected primary-expression before ']' token
   76 |                 loc[now][]
      |                          ^
Language: C++

#include<bits/stdc++.h>

using namespace std;
int n, k;
const int maxn = 2005;
const int maxk = 10005;
const int maxc = 1e6 + 20;
int len[maxn];
int start[maxn];

bitset<maxk> can[maxn];
int ss[maxc];
int critical[maxc];

int loc[2][maxc];

int main(){
  memset(critical, -1, sizeof(critical));
  scanf("%d%d\n", &n, &k);
  int tt = 0;
  vector<bool> appr(26);
  for(int i=0;i<n;i++){
    //string s; getline(cin, s);
    cin >> s;
    len[i] = s.length();
    start[i] = tt;
    critical[tt] = i;
    for(int e=0;e<s.length();e++){
      int c = s[e] - 'a';
      appr[c] = true;
      ss[tt] = c;
      tt++;
    }
  }
  int numappr = 0;
  for(int i=0;i<26;i++)if(appr[i]) numappr++;
  if(numappr == 1){
    for(int i=0;i<26;i++){
      if(appr[i]){
	cout << string(k, (i + 'a')) << "\n";
	return 0;
      }
    }
  }
  
  can[n][0] = true;
  for(int i=n-1;i>=0;i--){
    can[i] = can[i+1] | (can[i+1]<<len[i]);
  }

  int q = 0;
  int cnt = 0;
  
  for(int i=0;i<n;i++){
    if(can[i+1][k-len[i]]) loc[q][cnt++] = start[i];
  }
  string ans = "";

  
  for(int eee = 0; eee < k; eee++){
    int mn = 1e9;
    for(int i=0;i<cnt;i++){
      int x = loc[q][i];
      mn = min(mn, ss[x]);
    }
    ans.push_back(mn + 'a');
    int mnn = 1e9;
    int ncnt = 0;
    for(int i=0;i<cnt;i++){
      int x = loc[q][i];
      if(ss[x] != mn) continue;
      if(critical[x+1] != -1){
	mnn = min(mnn, critical[x+1]);
      }
      else{
	loc[q ^ 1][ncnt++] = x + 1;
      }
    }
    if(mnn != 1e9){
      for(int i = mnn; i < n; i++){
	if(k-eee-1-len[i]>=0 && can[i+1][k-eee-1-len[i]]) loc[q ^ 1][ncnt++] = start[i];
      }
    }

    q ^= 1;
    cnt = ncnt;
  }
  cout << ans << "\n";
}


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

#include<stdio.h>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;
int R=3;
string s[2100];
char in[11000];
typedef unsigned long long wolf;
wolf rj[11000];
wolf ks=1000000007;
char rd[2010][10010];
char dp[2010][10010];
char st[2010][10010];
vector<wolf> Hash[2010];
wolf cur[10010];
unsigned int st=114514;
inline bool eq(int a,int b,int c){
	int len=b-a;
//	printf("%d %d %d: %llu %llu %llu %llu\n",a,b,c,cur[b]-cur[a],Hash[c][len],rj[a],Hash[c][len]*rj[a]);
	if(cur[b]-cur[a]!=Hash[c][len]*rj[a])return false;
	for(int i=0;i<min(len,R);i++){
		int at=i;
		if(st[c][a+at]!=s[c][at])return false;
	}
	return true;
}
inline int cmp(int a,int b){
	int left=a-1;
	int right=a+s[b].size();
	while(left+1<right){
		int M=(left+right)/2;
		if(eq(a,M+1,b)){
			left=M;
		}else right=M;
	}
	//printf("%d\n",right);
	if(right==a+s[b].size())return 0;
	if(s[b][right-a]<st[b][right])return 1;
	return -1;
}
int main(){
	int a,b;
	scanf("%d%d",&a,&b);
	for(int i=0;i<a;i++){
		scanf("%s",in);
		s[i]=in;
	}
	rj[0]=1;
	for(int i=1;i<11000;i++)rj[i]=rj[i-1]*ks;
	rd[a][b]=1;
	for(int i=a;i;i--){
		for(int j=0;j<=b;j++){
			if(rd[i][j]&&j>=s[i-1].size()){
				rd[i-1][j-(int)(s[i-1].size())]=1;
			}
			if(rd[i][j])rd[i-1][j]=1;
		}
	}
	for(int i=0;i<a;i++){
		Hash[i]=vector<wolf>(s[i].size()+1);
		wolf now=0;
		wolf tt=1;
		for(int j=0;j<s[i].size();j++){
			now+=tt*s[i][j];
			tt*=ks;
			Hash[i][j+1]=now;
	//		printf("%llu ",now);
		}
	//	printf("\n");
	}
	dp[0][0]=1;
	for(int i=0;i<b;i++)st[0][i]='z';
	for(int i=0;i<a;i++){
		wolf now=0;
		wolf tt=1;
		for(int j=0;j<b;j++){
			now+=tt*st[i][j];
			tt*=ks;
			cur[j+1]=now;
		//	printf("%llu ",now);
		}
		//printf("\n");
		for(int j=0;j<=b;j++)st[i+1][j]=st[i][j];
		//printf("%s\n",st[i]);
		for(int j=0;j<=b;j++){
			if(!dp[i][j])continue;
	//		printf("%d %d\n",i,j);
			if(rd[i+1][j])dp[i+1][j]=1;
			if(j+s[i].size()<=b&&rd[i+1][j+s[i].size()]){
				int tmp=cmp(j,i);
		//		printf("%d\n",tmp);
				if(tmp>=0){
					dp[i+1][j+s[i].size()]=1;
					if(tmp){
						bool flag=false;
						for(int k=j;k<j+s[i].size();k++){
							if(s[i][k-j]!=st[i+1][k])flag=true;
							st[i+1][k]=s[i][k-j];
							if(flag&&k!=j+s[i].size()-1)dp[i+1][k+1]=0;
						}
						for(int k=j+s[i].size();k<b;k++){
							st[i+1][k]='z';
							dp[i+1][k+1]=0;
						}
						break;
					}
				}
			}
		}
	}
	printf("%s\n",st[a]);
}

Compiler output:
a.cc:17:14: error: conflicting declaration 'unsigned int st'
   17 | unsigned int st=114514;
      |              ^~
a.cc:14:6: note: previous declaration as 'char st [2010][10010]'
   14 | char st[2010][10010];
      |      ^~
Language: C++

#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
if((a==5 && b==5) && c==7)
cout<<"YES";
else if((b==5 && c==5) && a==7)
cout<<YES";
else if((a==5 && c==5) && b==7)
cout<<"YES"
else
cout<<"NO";
return 0;
}


Compiler output:
a.cc:10:10: warning: missing terminating " character
   10 | cout<<YES";
      |          ^
a.cc:10:10: error: missing terminating " character
   10 | cout<<YES";
      |          ^~
a.cc: In function 'int main()':
a.cc:10:7: error: 'YES' was not declared in this scope
   10 | cout<<YES";
      |       ^~~
Language: Java

Scanner input = new Scanner (System.in);
		int A,B,C;
		A = input.nextInt();
		B = input.nextInt();
		C = input.nextInt();
	if ((A==5&&B==5&& C== 7)|| (A==5&&B==7&& C== 5) || (A==7&&B==5&& C== 5) )
 { System.out.println("YES");}		
		else { System.out.println("NO");}

				
	}

}


Compiler output:
Main.java:1: error: unnamed classes are a preview feature and are disabled by default.
Scanner input = new Scanner (System.in);
^
  (use --enable-preview to enable unnamed classes)
Main.java:2: error: class, interface, enum, or record expected
		int A,B,C;
		^
Main.java:3: error: class, interface, enum, or record expected
		A = input.nextInt();
		^
Main.java:4: error: class, interface, enum, or record expected
		B = input.nextInt();
		^
Main.java:5: error: class, interface, enum, or record expected
		C = input.nextInt();
		^
Main.java:6: error: class, interface, enum, or record expected
	if ((A==5&&B==5&& C== 7)|| (A==5&&B==7&& C== 5) || (A==7&&B==5&& C== 5) )
	^
Main.java:7: error: class, interface, enum, or record expected
 { System.out.println("YES");}		
                             ^
Main.java:8: error: class, interface, enum, or record expected
		else { System.out.println("NO");}
		                                ^
8 errors
Language: C++

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


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

#include <iostream>
#include <vector>
#include <cstdio>

using namespace std;


class Solution{

public:
    bool isHaiku(vector<int>& lines){

        sort(lines.begin(), lines.end());
        return lines[0] == 5 && lines[1] == 5 && lines[2] == 7;
    }
};

int main() {
    
    vector<int> lines(3);
    for(int i = 0; i < 3; i ++)
        scanf("%d", &lines[i]);
    
    printf("%s\n", Solution().isHaiku(lines) ? "YES" : "NO");
    
    return 0;
}


Compiler output:
a.cc: In member function 'bool Solution::isHaiku(std::vector<int>&)':
a.cc:13:9: error: 'sort' was not declared in this scope; did you mean 'short'?
   13 |         sort(lines.begin(), lines.end());
      |         ^~~~
      |         short
Language: C++

#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int arr[3];
  cin>>arr[0]>>arr[1]>>arr[2];
  sort(arr,arr+n)
    if(arr[0]==5 && arr[1]==5 && arr[2]==7)
    {
      cout<<"YES"<<endl;
    }
  else
  {
    cout<<"NO"<<endl;
  }
  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:11:16: error: 'n' was not declared in this scope; did you mean 'yn'?
   11 |   sort(arr,arr+n)
      |                ^
      |                yn
a.cc:16:3: error: 'else' without a previous 'if'
   16 |   else
      |   ^~~~
Language: C++

#include<bits/stdc++.h>
using namespace std;
int main()
{
  int arr[3];
  cin>>arr[0]>>arr[1]>>arr[2];
  sort(arr,arr+3)
    if(arr[0]==5 && arr[1]==5 & arr[2]==7)
    {
      cout<<"YES"<<endl;
    }
  else
  {
    cout<<"NO"<<endl;
  }
  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:7:18: error: expected ';' before 'if'
    7 |   sort(arr,arr+3)
      |                  ^
      |                  ;
    8 |     if(arr[0]==5 && arr[1]==5 & arr[2]==7)
      |     ~~            
a.cc:12:3: error: 'else' without a previous 'if'
   12 |   else
      |   ^~~~
Language: C++

    #include<bits/stdc++.h>
    using namespace std;
    int main()
    {
      int arr[3];
      cin>>arr[0]>>arr[1]>>arr[2];
      sort(arr,arr+3);
      if(arr[0]==5 && arr[1]=5 && arr[2]=7)
      {
        cout<<"YES"<<endl;
      }
      else
      {
        cout<<"NO"<<endl;
      }
      return 0;
    }

Compiler output:
a.cc: In function 'int main()':
a.cc:8:32: error: lvalue required as left operand of assignment
    8 |       if(arr[0]==5 && arr[1]=5 && arr[2]=7)
      |                              ~~^~~~~~~~~
Language: C++

#include<bits/stdc++.h>
using namespace std;
int main()
{
  int arr[3];
  cin>>arr[0]>>arr[1]>>arr[2];
  sort(arr,arr+3);
  if(arr[0]==5 && arr[1]=5 && arr[2]=7)
  {
    cout<<"YES"<<endl;
  }
  else
  {
    cout<<"NO"<<endl;
  }

Compiler output:
a.cc: In function 'int main()':
a.cc:8:28: error: lvalue required as left operand of assignment
    8 |   if(arr[0]==5 && arr[1]=5 && arr[2]=7)
      |                          ~~^~~~~~~~~
a.cc:15:4: error: expected '}' at end of input
   15 |   }
      |    ^
a.cc:4:1: note: to match this '{'
    4 | {
      | ^
Language: C++

#include<bits/stdc++.h>
using namespace std;
int main()
{
  int arr[3];
  cin>>arr[0]>>arr[1]>>arr[2];
  sort(arr,arr+3);
  if(arr[0]==5 && arr[1]=5 && arr[c]=7)
  {
    cout<<"YES"<<endl;
  }
  else
  {
    cout<<"NO"<<endl;
  }
  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:8:35: error: 'c' was not declared in this scope
    8 |   if(arr[0]==5 && arr[1]=5 && arr[c]=7)
      |                                   ^
Language: C++

#include<bits/stdc++.h>
using namespace std;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n,l;
    cin>>n>>l;
    vector<string>s(n);
    for(int i=0;i<n;i++)
    {
    cin>>s[i};
           }
    sort(s.begin(),s.end());
    for(int i=0;i<n;i++)
           {
    cout<<s[i];
           }
    return 0;
}




Compiler output:
a.cc: In function 'int main()':
a.cc:12:13: error: expected ']' before '}' token
   12 |     cin>>s[i};
      |             ^
      |             ]
a.cc:12:13: error: expected ';' before '}' token
   12 |     cin>>s[i};
      |             ^
      |             ;
a.cc: At global scope:
a.cc:14:9: error: expected constructor, destructor, or type conversion before '(' token
   14 |     sort(s.begin(),s.end());
      |         ^
a.cc:15:5: error: expected unqualified-id before 'for'
   15 |     for(int i=0;i<n;i++)
      |     ^~~
a.cc:15:17: error: 'i' does not name a type
   15 |     for(int i=0;i<n;i++)
      |                 ^
a.cc:15:21: error: 'i' does not name a type
   15 |     for(int i=0;i<n;i++)
      |                     ^
a.cc:19:5: error: expected unqualified-id before 'return'
   19 |     return 0;
      |     ^~~~~~
a.cc:20:1: error: expected declaration before '}' token
   20 | }
      | ^
Language: C

#include<stdio.h>
int main()
{
    int a,b,c
    while(scanf("%d%d%d",&a,&b,&c)==3)
    {
        if(a==5&&b==5&&c==7)
            printf("YES\n");
        else if(a==5&&b==7&&c==5)
            printf("YES\n");
        else if(a==7&&b==5&&c==5)
            printf("YES\n");
        else
            printf("NO\n");
    }
    return 0;
}


Compiler output:
main.c: In function 'main':
main.c:5:5: error: expected '=', ',', ';', 'asm' or '__attribute__' before 'while'
    5 |     while(scanf("%d%d%d",&a,&b,&c)==3)
      |     ^~~~~
Language: C++

#include <bits/stdc++.h>
#include <iostream>
#include<math.h>
#include<cmath>
#include<string>
#include<iomanip>
#include <numeric>
#include <limits>
using namespace std;
 
int main()
{
int a,b,c; cin>>a>>b>>c;
if((a+b+c)==17)cout<<"YES";
{
    if(a==7||b==7||c==7){
        if(a==5||b==5||c==5)
         cout<<"YES";
         else cout<<"NO"; }
    else cout<<"NO";
}
else cout<<"NO";
return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:22:1: error: 'else' without a previous 'if'
   22 | else cout<<"NO";
      | ^~~~
Language: C++

#include <bits/stdc++.h>
#include <iostream>
#include<math.h>
#include<cmath>
#include<string>
#include<iomanip>
#include <numeric>
#include <limits>
using namespace std;

int main()
{
int a,b,c; cin>>a>>b>>c;
if((a+b+c)==17)cout<<"YES";
{
    if(a==7||b==7||c==7)
        if(a==5||b==5||c==5)
         cout<<"YES";
         else cout<<"NO";
    else cout<<"NO";
}
else cout<<"NO";
return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:22:1: error: 'else' without a previous 'if'
   22 | else cout<<"NO";
      | ^~~~
Language: C++

#include<iostream>
using namespace std;
int main(){
  vector<int> num(3);
  for(int i=0;i<3;i++){
  cin>>num[i];
    int a=0;
    int b=0;
  if(num[i]==5){a++;}
  if(num[i]==7){b++;}}
  if(a==2 && b==1){cout<<"YES";}
  else cout<<"NO";
return 0;}

Compiler output:
a.cc: In function 'int main()':
a.cc:4:3: error: 'vector' was not declared in this scope
    4 |   vector<int> num(3);
      |   ^~~~~~
a.cc:2:1: note: 'std::vector' is defined in header '<vector>'; this is probably fixable by adding '#include <vector>'
    1 | #include<iostream>
  +++ |+#include <vector>
    2 | using namespace std;
a.cc:4:10: error: expected primary-expression before 'int'
    4 |   vector<int> num(3);
      |          ^~~
a.cc:6:8: error: 'num' was not declared in this scope; did you mean 'enum'?
    6 |   cin>>num[i];
      |        ^~~
      |        enum
a.cc:11:6: error: 'a' was not declared in this scope
   11 |   if(a==2 && b==1){cout<<"YES";}
      |      ^
a.cc:11:14: error: 'b' was not declared in this scope
   11 |   if(a==2 && b==1){cout<<"YES";}
      |              ^
Language: C++

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

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

 if(A*B*C==175){
   cout << "YES" << endl;
 }
if else{
  cout << "NO" << endl;
  }
}

Compiler output:
a.cc: In function 'int main()':
a.cc:11:4: error: expected '(' before 'else'
   11 | if else{
      |    ^~~~
      |    (
Language: C++

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

int main(A,B,C) {
  int A,B,C,r;
 cin >> A >> B >> C;
 r==A*B*C;
 if(r==175){
   cout << "YES" << endl;
 }
if else{
  cout << "NO" << endl;
  }
}

Compiler output:
a.cc:4:5: error: cannot declare '::main' to be a global variable
    4 | int main(A,B,C) {
      |     ^~~~
a.cc:4:10: error: 'A' was not declared in this scope
    4 | int main(A,B,C) {
      |          ^
a.cc:4:12: error: 'B' was not declared in this scope
    4 | int main(A,B,C) {
      |            ^
a.cc:4:14: error: 'C' was not declared in this scope
    4 | int main(A,B,C) {
      |              ^
a.cc:4:15: error: expression list treated as compound expression in initializer [-fpermissive]
    4 | int main(A,B,C) {
      |               ^
Language: C++

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

int main() {
  int A,B,C,r;
 cin >> A >> B >> C;
 r==A*B*C;
 if(r==175){
   cout << "YES" << endl;
 }
if else{
  cout << "NO" << endl;
  }
}

Compiler output:
a.cc: In function 'int main()':
a.cc:11:4: error: expected '(' before 'else'
   11 | if else{
      |    ^~~~
      |    (
Language: C++

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

int main() {
  int A,B,C,r;
 cin >> A >> B >> C;
 r==A*B*C
 if(r==175){
   cout << "YES" << endl;
 }
if else{
  cout << "NO" << endl;
  }
}

Compiler output:
a.cc: In function 'int main()':
a.cc:7:10: error: expected ';' before 'if'
    7 |  r==A*B*C
      |          ^
      |          ;
    8 |  if(r==175){
      |  ~~       
a.cc:11:4: error: expected '(' before 'else'
   11 | if else{
      |    ^~~~
      |    (
Language: C++

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

int main() {
  int A,B,C;
 cin >> A >> B >> C;
 r==A*B*C
 if(r==175){
   cout << "YES" << endl;
 }
else{
  cout << "NO" << endl;
  }
}

Compiler output:
a.cc: In function 'int main()':
a.cc:7:2: error: 'r' was not declared in this scope
    7 |  r==A*B*C
      |  ^
a.cc:11:1: error: 'else' without a previous 'if'
   11 | else{
      | ^~~~
Language: C++

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

int main() {
  int A,B,C;
 cin >> A >> B >> C;
 r=A*B*C
 if(r==175){
   cout << "YES" << endl;
 }
else {
  cout << "NO" << endl;
  }
}

Compiler output:
a.cc: In function 'int main()':
a.cc:7:2: error: 'r' was not declared in this scope
    7 |  r=A*B*C
      |  ^
a.cc:11:1: error: 'else' without a previous 'if'
   11 | else {
      | ^~~~
Language: C++

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

int main() {
  int A,B,C;
 cin >> A >> B >> C;
 r=A*B*C
 if(r=145){
   cout << "YES" << endl;
 }
else {cout << "NO" << endl;}
}

Compiler output:
a.cc: In function 'int main()':
a.cc:7:2: error: 'r' was not declared in this scope
    7 |  r=A*B*C
      |  ^
a.cc:11:1: error: 'else' without a previous 'if'
   11 | else {cout << "NO" << endl;}
      | ^~~~
Language: Java

pbulic boolean canMake575(String str){
	String[] strArray = str.split(" ");
	int countFive = 0;
	int countSeven = 0;
  	for (int i = 0; i < strArray.length, i++) {
		if (strArray.equals("5")) {
          	countFive++;
        } else if (strArray.equals("7")) {
          	countSeven++;
        }
    }

	if (countFive == 2 && countSeven == 1) {
    	return true;
    }
  	return false;
}

Compiler output:
Main.java:1: error: class, interface, enum, or record expected
pbulic boolean canMake575(String str){
^
Main.java:3: error: unnamed classes are a preview feature and are disabled by default.
	int countFive = 0;
	^
  (use --enable-preview to enable unnamed classes)
Main.java:5: error: class, interface, enum, or record expected
  	for (int i = 0; i < strArray.length, i++) {
  	^
Main.java:5: error: class, interface, enum, or record expected
  	for (int i = 0; i < strArray.length, i++) {
  	                ^
Main.java:8: error: class, interface, enum, or record expected
        } else if (strArray.equals("7")) {
        ^
Main.java:10: error: class, interface, enum, or record expected
        }
        ^
Main.java:15: error: class, interface, enum, or record expected
    }
    ^
Main.java:17: error: class, interface, enum, or record expected
}
^
8 errors
Language: Java

// Created By Jefferson Samuel on 02/09/20 at 1:02 AM

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;

import static java.lang.Integer.parseInt;
import static java.lang.Long.parseLong;
import static java.lang.System.exit;

public class C {


static ArrayList<String> lis = new ArrayList<>();
static void spacing(String sofar , String orig)
{
if(orig.length() ==0){
    lis.add(sofar.trim());
    }
else
{

        sofar += orig.charAt(0);
        spacing(sofar + " ", orig.substring(1));
        spacing(sofar, orig.substring(1));
        sofar = "";

}
}
    static void solve() throws Exception {

    int fc = 0 ,sc = 0;
    for(int i = 0 ; i < 3;i++)
    {
        int f = scanInt();
        if(f == 5) fc++;
        else if(f == 7) sc ++;
    }
    out.println(fc == 2 && sc == 1 ? "YES":"NO");


    }






    //Dont touch this side
    static int scanInt() throws IOException {
        return parseInt(scanString());
    }

    static long scanLong() throws IOException {
        return parseLong(scanString());
    }
    static  String scanFullString() throws  IOException{
        return in.readLine();
    }

    static String scanString() throws IOException {
        while (tok == null || !tok.hasMoreTokens()) {
            tok = new StringTokenizer(in.readLine());
        }
        return tok.nextToken();
    }
    static long pow(int a,  int b)
    {
        if(b == 0) return 1;
        long tmp  = pow(a,b/2);
        return  tmp*tmp * (b%2 == 0 ? 1 : a);
    }

    static BufferedReader in;
    static PrintWriter out;
    static StringTokenizer tok;

    public static void main(String[] args) {
        try {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
            solve();
            in.close();
            out.close();
        } catch (Throwable e) {
            e.printStackTrace();
            exit(1);
        }
    }
}

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

#include<iostream>
using namespace std;
int main(){
  int a[3];
  int d=0,e=0;
  
  for(int i=0;i<3;i++){
    cin>>a[i];
    if(a[i]==5)
      d++;
    else
      e++;
  }
  if(d==2&&e==1)
    cout<<"YES";
  eles
    cout<<"NO";
  
  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:16:3: error: 'eles' was not declared in this scope
   16 |   eles
      |   ^~~~
Language: C++

#include <iostream>
using namespace std;

int main() {
  int a;
  int c5, c7 = 0;
  for (int i=0;i<3;++i) {
    cin >> a;
    a == 5 ? c5++ : a == 7 ? c7++ : 0;
  }
  cout << (a5 == 2 && a7 == 1 ? "YES" : "NO") << endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:11:12: error: 'a5' was not declared in this scope; did you mean 'c5'?
   11 |   cout << (a5 == 2 && a7 == 1 ? "YES" : "NO") << endl;
      |            ^~
      |            c5
a.cc:11:23: error: 'a7' was not declared in this scope; did you mean 'c7'?
   11 |   cout << (a5 == 2 && a7 == 1 ? "YES" : "NO") << endl;
      |                       ^~
      |                       c7
Language: C++

#include <iostream>
using namespace std;

int main() {
  int a;
  int c5, c7 = 0;
  for (int i=0;i<3;++i) {
    cin >> a;
    a == 5 ? ++c5 : a == 7 ? ++c7 : 0;
  }
  cout << (a5 == 2 && a7 == 1 ? "YES" : "NO") << endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:11:12: error: 'a5' was not declared in this scope; did you mean 'c5'?
   11 |   cout << (a5 == 2 && a7 == 1 ? "YES" : "NO") << endl;
      |            ^~
      |            c5
a.cc:11:23: error: 'a7' was not declared in this scope; did you mean 'c7'?
   11 |   cout << (a5 == 2 && a7 == 1 ? "YES" : "NO") << endl;
      |                       ^~
      |                       c7
Language: C++

#include <iostream>
using namespace std;

int main() {
  int a;
  int c5, c7 = 0;
  for (int i=0;i<3;++i) {
    cin >> a;
    a == 5 ? ++c5 : a == 7 ? ++c7 : 0;
  }
  cout << a5 == 2 && a7 == 1 ? "YES" : "NO" << endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:11:11: error: 'a5' was not declared in this scope; did you mean 'c5'?
   11 |   cout << a5 == 2 && a7 == 1 ? "YES" : "NO" << endl;
      |           ^~
      |           c5
a.cc:11:22: error: 'a7' was not declared in this scope; did you mean 'c7'?
   11 |   cout << a5 == 2 && a7 == 1 ? "YES" : "NO" << endl;
      |                      ^~
      |                      c7
a.cc:11:45: error: invalid operands of types 'const char [3]' and '<unresolved overloaded function type>' to binary 'operator<<'
   11 |   cout << a5 == 2 && a7 == 1 ? "YES" : "NO" << endl;
      |                                        ~~~~~^~~~~~~
Language: C++

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

int main() {
  char a,b,c;
  cin >> a >> b >> c;
  string s = a+b+c;
  if(s=="557" || s=="575" || s=="755")
    cout << "YES" << endl;
  else
    cout << "NO" <<endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:7:17: error: conversion from 'int' to non-scalar type 'std::string' {aka 'std::__cxx11::basic_string<char>'} requested
    7 |   string s = a+b+c;
      |              ~~~^~