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

#include<iostream>
#include<stdio.h>
#include<cstring>
using namespace std;
int main()
{
	char a[201][201];
	int n;
	cin>>n;
	getchar();
	for(int i=0;i<n;i++)
	gets(a[i]);
	int t=0,flag=0;
	for(int i=0;i<n;i++)
	{
		int m=strlen(a[i]);
		for(int j=0;j<m;j++)
		{
			if(a[i][j]=='(')
			t++;
			else if(a[i][j]==')')
			t--;
			if(t<0)
			{
				flag=1;
				break;
			}
		}
	}
	if(t!=0)
	flag=1;
	if(flag)
	cout<<"No"<<endl;
	else
	cout<<"Yes"<<endl;
	return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:12:9: error: 'gets' was not declared in this scope; did you mean 'getw'?
   12 |         gets(a[i]);
      |         ^~~~
      |         getw
Language: C++

#include<iostream>
#include<cstring>
#include<cstdio>
#include<string>
using namespace std;
int main()
{
	int n,sum1=0,sum2=0,flog=0;
	cin>>n;
	getchar();
	while(n--)
	{
		char s[105];
		gets(s);
		int len=strlen(s);
		for(int i=0;i<len;i++)
		{
			if(s[i]=='(') sum1++;
			if(s[i]==')')
			{
				sum2++;
				if(sum1<sum2) flog=1;
			}
		}
	}
	if(sum1==sum2&&flog==0) cout<<"Yes\n";
	else cout<<"No\n";
	return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:14:17: error: 'gets' was not declared in this scope; did you mean 'getw'?
   14 |                 gets(s);
      |                 ^~~~
      |                 getw
Language: C++

#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<cstring>
using namespace std;
#define MAX 101

int strval[MAX];

int main(){
    //freopen("input.txt","r",stdin);

    int n;
    char a[101];
    while(~scanf("%d",&n)){
    memset(strval,0,sizeof(strval));
    for(int i=0;i<n;i++){
        gets(a);
        int alength=strlen(a);
        for(int i=0;i<alength;i++)
        if(a[i]=='(')strval[i]++;
        else strval[i]--;
    }
    int sum=0;
    for(int i=0;i<n;i++)sum+=strval[i];
    if(sum)printf("No\n");
    else printf("Yes\n");
    }

    return 0;
}



Compiler output:
a.cc: In function 'int main()':
a.cc:18:9: error: 'gets' was not declared in this scope; did you mean 'getw'?
   18 |         gets(a);
      |         ^~~~
      |         getw
Language: C++

#include<cstdio>
#include<stack>
using namespace std;
char s[11000] = "()";int n;char ss[105];
bool is_match(const string &str)
{
    size_t len = str.length();
    stack<char> s;
    int i;
    int cnt = 0; 
    for (i = 0; i < len; ++i) {
        if (str[i] == '(') {
            s.push(str[i]);
            ++cnt; 
            continue;
        }
        if (str[i] == ')') {
            ++cnt; 
            if (!s.empty() && s.top() == '(') {
                s.pop();
                continue;
            }
        }
    }

    if (!s.empty()) {
        return false;
    }
    if (cnt % 2 != 0) {
        return false; 
    }
    return true;
}
int main(){
        
        while(~scanf("%d",&n))
        {
            getchar();
            for(int i=1;i<=n;i++)
            {gets(ss);strcat(s,ss);}
            if(is_match(s))
                printf("Yes\n");
            else
                printf("No\n");
        }
    return 0;
}


Compiler output:
a.cc:5:21: error: 'string' does not name a type; did you mean 'stdin'?
    5 | bool is_match(const string &str)
      |                     ^~~~~~
      |                     stdin
a.cc: In function 'bool is_match(const int&)':
a.cc:7:22: error: request for member 'length' in 'str', which is of non-class type 'const int'
    7 |     size_t len = str.length();
      |                      ^~~~~~
a.cc:12:16: error: invalid types 'const int[int]' for array subscript
   12 |         if (str[i] == '(') {
      |                ^
a.cc:13:23: error: invalid types 'const int[int]' for array subscript
   13 |             s.push(str[i]);
      |                       ^
a.cc:17:16: error: invalid types 'const int[int]' for array subscript
   17 |         if (str[i] == ')') {
      |                ^
a.cc: In function 'int main()':
a.cc:40:14: error: 'gets' was not declared in this scope; did you mean 'getw'?
   40 |             {gets(ss);strcat(s,ss);}
      |              ^~~~
      |              getw
a.cc:40:23: error: 'strcat' was not declared in this scope
   40 |             {gets(ss);strcat(s,ss);}
      |                       ^~~~~~
a.cc:3:1: note: 'strcat' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
    2 | #include<stack>
  +++ |+#include <cstring>
    3 | using namespace std;
a.cc:41:25: error: invalid conversion from 'char*' to 'int' [-fpermissive]
   41 |             if(is_match(s))
      |                         ^
      |                         |
      |                         char*
a.cc:5:29: note:   initializing argument 1 of 'bool is_match(const int&)'
    5 | bool is_match(const string &str)
      |               ~~~~~~~~~~~~~~^~~
Language: C++

#include<cstdio>
#include<stack>
#include<cstring>
using namespace std;
char s[11000] = "()";int n;char ss[105];
bool is_match(const string &str)
{
    size_t len = str.length();
    stack<char> s;
    int i;
    int cnt = 0; 
    for (i = 0; i < len; ++i) {
        if (str[i] == '(') {
            s.push(str[i]);
            ++cnt; 
            continue;
        }
        if (str[i] == ')') {
            ++cnt; 
            if (!s.empty() && s.top() == '(') {
                s.pop();
                continue;
            }
        }
    }

    if (!s.empty()) {
        return false;
    }
    if (cnt % 2 != 0) {
        return false; 
    }
    return true;
}
int main(){
        
        while(~scanf("%d",&n))
        {
            getchar();
            for(int i=1;i<=n;i++)
            {gets(ss);strcat(s,ss);}
            if(is_match(s))
                printf("Yes\n");
            else
                printf("No\n");
        }
    return 0;
}


Compiler output:
a.cc:6:21: error: 'string' does not name a type; did you mean 'stdin'?
    6 | bool is_match(const string &str)
      |                     ^~~~~~
      |                     stdin
a.cc: In function 'bool is_match(const int&)':
a.cc:8:22: error: request for member 'length' in 'str', which is of non-class type 'const int'
    8 |     size_t len = str.length();
      |                      ^~~~~~
a.cc:13:16: error: invalid types 'const int[int]' for array subscript
   13 |         if (str[i] == '(') {
      |                ^
a.cc:14:23: error: invalid types 'const int[int]' for array subscript
   14 |             s.push(str[i]);
      |                       ^
a.cc:18:16: error: invalid types 'const int[int]' for array subscript
   18 |         if (str[i] == ')') {
      |                ^
a.cc: In function 'int main()':
a.cc:41:14: error: 'gets' was not declared in this scope; did you mean 'getw'?
   41 |             {gets(ss);strcat(s,ss);}
      |              ^~~~
      |              getw
a.cc:42:25: error: invalid conversion from 'char*' to 'int' [-fpermissive]
   42 |             if(is_match(s))
      |                         ^
      |                         |
      |                         char*
a.cc:6:29: note:   initializing argument 1 of 'bool is_match(const int&)'
    6 | bool is_match(const string &str)
      |               ~~~~~~~~~~~~~~^~~
Language: C++

#include <iostream>
#include <vector>
#include <climits>
#include <queue>
#include <string>

using namespace std;

int main() {
	int n;
	cin >> n;
	vector<string> s(n);
	for (int i = 0; i < n; ++i) cin >> s[i];

	vector<pair<int, int>> v(n);
	for (int i = 0; i < n; ++i) {
		int tmp = 0;
		for (int j = 0; j < s[i].size(); ++j) {
			if (s[i][j] == '(') tmp++;
			else tmp--;
			v[i].second = min(v[i].second, tmp);
		}
		v[i].first = tmp;
	}

	vector<pair<int, int>> v1, v2, v3;
	for (int i = 0; i < n; ++i) {
		if (v[i].second >= 0) v1.push_back(v[i]);
		else if (v[i].first >= 0) v2.push_back(v[i]);
		else v3.push_back(v[i]);
	}

	int now = 0;
	for (auto i : v1) {
		now += i.first;
	}
	
	vector<bool> used(n, false);
	bool update = true;
	while (update) {
		update = false;
		for (int i = 0; i < v2.size(); ++i) {
			if (used[i]) continue;
			if (-v2[i].second <= now) {
				now += v2[i].first;
				used[i] = true;
				update = true;
			}
		}
	}
	// cout << now << " " << v2.size() << endl;

	for (int i = 0; i < v2.size(); ++i) {
		if (!used[i]) {
			cout << "No" << endl;
			return 0;
		}
	}

	vector<vector<int>> x;
	for (auto i : v3) x.push_back({ i.first - i.second, i.first, i.second });
	sort(x.begin(), x.end());
	reverse(x.begin(), x.end());

	for (auto i : x) {
		// cout << now << " " << i[2] << endl;
		if (-i[2] > now) {
			cout << "No" << endl;
			return 0;
		}
		now += i[1];
	}
	cout << "Yes" << endl;

	return 0;
}


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

#include<bits/stdc++.h>
using namespace std;
#pragma warning(disable:4996)
//FILE *in = freopen("input.txt", "r", stdin);
int H, W, X, Y, tate[600][600], yoko[600][600], dp[600][600][2][2], dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
struct State { int s1, s2, s3, s4; };
bool operator<(State u1, State u2) {
	if (u1.s1 < u2.s1)return true;
	if (u1.s1 == u2.s1 && u1.s2 < u2.s2)return true;
	if (u1.s1 == u2.s1 && u1.s2 == u2.s2 && u1.s3 < u2.s3)return true;
	if (u1.s1 == u2.s1 && u1.s2 == u2.s2 && u1.s3 == u2.s3 && u1.s4 < u2.s4)return true;
	return false;
}
map<State, int>M;
int into(int p1, int p2, int p3, int p4) {
	if (p1 == p3)return tate[p1][max(p2, p4)];
	if (p2 == p4)return yoko[max(p1, p3)][p4];
}
int solve(int p, int q, int r, int turn, int depth) {
	if (p == 0 || p == H + 1 || q == 0 || q == W + 1) { M[State{ p, q, r, turn }]--; return 1; }
	if (M[State{ p, q, r, turn }] >= 2) { M[State{ p, q, r, turn }]--; return 0; }
	if (dp[p][q][r][turn] >= 0)return dp[p][q][r][turn];
	if (turn == 0) {
		//Alice's turn
		int maxn = 0;
		for (int i = 0; i < 4; i++) {
			if (into(p, q, p + dx[i], q + dy[i]) != r)continue;
			M[State{ p + dx[i], q + dy[i], r, 1 - turn }]++;
			maxn = max(maxn, solve(p + dx[i], q + dy[i], r, 1 - turn, depth + 1));
		}
		M[State{ p, q, r, turn }]--;
		dp[p][q][r][turn] = maxn;
		return maxn;
	}
	if (turn == 1) {
		//Bob's turn
		int maxn = 1;
		int r1 = 0; M[State{ p, q, 0, 1 - turn }]++; r1 = solve(p, q, 0, 1 - turn, depth + 1);
		int r2 = 0; M[State{ p, q, 1, 1 - turn }]++; r2 = solve(p, q, 1, 1 - turn, depth + 1);
		maxn = min(maxn, min(r1, r2));
		M[State{ p, q, r, turn }]--;
		dp[p][q][r][turn] = maxn;
		return maxn;
	}
}
int main() {
	__asm__ volatile("mov %%rsp, %0" : "=r"(eord));
	__asm__ volatile("mov %0, %%rsp" : : "r"(enew));
	while (true) {
		cin >> H >> W >> X >> Y; M.clear(); M[State{ X, Y, 0, 0 }]++; if (H + W + X + Y == 0)break;
		for (int i = 0; i <= H + 1; i++) { for (int j = 0; j <= W + 1; j++) { for (int k = 0; k < 4; k++)dp[i][j][k / 2][k % 2] = -1; } }
		for (int i = 2; i < H * 2 + 3; i++) {
			if (i % 2 == 0) { for (int j = 1; j <= W; j++)cin >> yoko[i / 2][j]; }
			if (i % 2 == 1) { for (int j = 1; j <= W + 1; j++)cin >> tate[i / 2][j]; }
		}
		int ret = solve(X, Y, 0, 0, 0);
		if (ret == 0)cout << "No" << endl;
		else cout << "Yes" << endl;
	}
	__asm__ volatile("mov %0, %%rsp" : : "r"(eord));
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:47:49: error: 'eord' was not declared in this scope
   47 |         __asm__ volatile("mov %%rsp, %0" : "=r"(eord));
      |                                                 ^~~~
a.cc:48:50: error: 'enew' was not declared in this scope
   48 |         __asm__ volatile("mov %0, %%rsp" : : "r"(enew));
      |                                                  ^~~~
a.cc: In function 'int into(int, int, int, int)':
a.cc:18:1: warning: control reaches end of non-void function [-Wreturn-type]
   18 | }
      | ^
a.cc: In function 'int solve(int, int, int, int, int)':
a.cc:45:1: warning: control reaches end of non-void function [-Wreturn-type]
   45 | }
      | ^
Language: C++

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Ti = tuple<int, int, int>;
using Tl = tuple<ll, ll, ll>;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
#define Get(t, i) get<(i)>((t))
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define reps(i, f, n) for(int i = (int)(f); i < (int)(n); i++)
#define each(a, b) for(auto& a : b)

const int inf = 1 << 25;
const ll INF = 1LL << 55;

using P = pair<char, int>;

void input(vector<P>& v)
{
  char c; int l;
  while(cin >> c, c != '$') {
    cin >> l;
    v.emplace_back(c, l);
  }
}

int main()
{
  vector<P> A; input(A);
  vector<P> B; input(B);
  vector<P> C; input(C);

  rep(i, A.size()-B.size()+1) {
    if(A[i].F == B[0].F && A[i].S >= B[i].S &&
       A[i+B.size()-1].F == B[B.size()-1].F &&
       A[i+B.size()-1].S >= B[B.size()-1].S) {
      bool flag = true;
      reps(j, 1, B.size()-1) {
	flag &= (A[i+j].F == B[j].F && A[i+j].S == B[j].S);
      }
      if(flag) {
	int Abofst = (A[i].S > B[0].S);
	int Aeofst = (A[i+B.size()-1].S > B[B.size()-1].S);
	if(Abofst) A[i].S -= B[0].S;
	if(Aeofst) A[i+B.size()-1].S -= B[B.size()-1].S;
	int Cbofst = (A[i-!Abofst].F == C[0].F);
	int Ceofst = (A[i+B.size()-1+!Aeofst].F == C[C.size()-1].F);
	if(Cbofst) A[i-!Abofst].S += C[0].S;
	if(Ceofst) A[i+B.size()-1+!Aeofst].S += C[C.size()-1].S;
	A.erase(A.begin()+i+Abofst, A.begin()+B.size()-Aeofst);
	vector<P> D;
	reps(j, Cbofst, C.size()-Ceofst) D.push_back(C[j]);
	A.insert(A.begin()+i+Abofst, D.begin(), D.end());
	rep(j, A.size()) {
	  if(j + 1 < A.size() && A[j].F == A[j+1].F) {
	    cout << A[j].F << " " << A[j].S+A[j].S-C[0].S << " ";
	    j++;
	  } else {
	    cout << A[j].F << " " << A[j].S << " ";
	  }
	}
	cout << "$" << endl;
	return 0;
      }
    }
  }
  rep(i, A.size()) {
    cout << A[j].F << " " << A[j].S << " ";
  }
  cout << "$" << endl;
  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:78:15: error: 'j' was not declared in this scope
   78 |     cout << A[j].F << " " << A[j].S << " ";
      |               ^
Language: C++

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


typedef long long ll;

int N,M;
ll F[3000005];
ll T3[1000005];
ll T2[1000005];
const ll mod = 1000000009LL;
ll extgcd(ll a, ll b, ll &x, ll &y){
  ll g = a;
  x = 1;
  y = 0;
  if(b != 0){
    g = extgcd(b, a%b, y, x);
    y -= (a / b) * x;
  }
  return g;
}
ll modinv(ll a, ll m=mod){
  ll x,y;
  if(extgcd(a,m,x,y) == 1) return (x + m) % m;
  return -1; 
}

struct uni {
  int d[40];
  int n;
  uni(int n):n(n){
    fill( d,d+n,-1 );
  }
  int find(int a){ return (d[a]<0?a:(d[a]=find(d[a]))); }
  void merge(int a,int b){
    a = find(a); b = find(b);
    if( a == b ) return;
    if( d[a] > d[b] ) swap( a, b );
    d[a] += d[b]; d[b] = a;
  }
  bool same(int a,int b){
    return find(a) == find(b);
  }
  vector<int> size(){
    vector<int> vs;
    for(int i=0;i<n;i++)
      if( i == find(d[i]) )
        vs.emplace_back( -d[i] );
    return vs;
  }
};

vector<int> A,B,C;
int zatsu(){
  vector<int> xs;
  for(int i=0;i<M;i++){
    xs.emplace_back( A[i] );
    xs.emplace_back( B[i] );
  }
  sort( xs.begin(), xs.end() );
  xs.erase( unique( xs.begin(), xs.end() ), xs.end() );
  for(int i=0;i<M;i++){
    A[i] = find( xs.begin(), xs.end(), A[i] ) - xs.begin();
    B[i] = find( xs.begin(), xs.end(), B[i] ) - xs.begin();
  }
  return xs.size();
}

void add(ll &a, ll b){
  a += b;
  a %= mod;
}
ll mult( ll a, ll b ){
  return a * b % mod;
}

int main(){
  cin >> N >> M;
  F[0] = 1LL;
  for(int i=1;i<=3*N;i++)
    F[i] = F[i-1] * (ll)i;
  T2[0] = T3[0] = 1LL;
  ll mod_tw = modinv( F[2] );
  ll mod_th = modinv( F[3] );
  for(int i=1;i<=N;i++){
    T2[i] = T2[i-1] * mod_tw;
    T3[i] = T3[i-1] * mod_th;
  }

  A.resize(M); B.resize(M); C.resize(M);
  for(int i=0;i<M;i++)
    cin >> A[i] >> B[i] >> C[i];
  int n = zatsu();

  ll res = 0LL;
  for(int st=0;st<(1<<M);st++){
    uni U(n);
    for(int i=0;i<M;i++)
      if( st & (1<<i) )
        U.merge( A[i], B[i] );

    bool valid = true;
    for(int i=0;i<N;i++){
      if( C[i] == 0 && !U.same(A[i],B[i]) ) valid = false;
      if( C[i] == 1 && U.same(A[i],B[i]) ) valid = false;        
    }
    vector<int> sz = U.size();
    int b[4]={};
    for( int s : sz ){
      if( s > 3 ) valid = false;
      b[s]++;
    }

    if( valid ){
      ll num = N - n;
      ll xros = 1LL;
      ll b2 = b[2];
      xros = mult( xros, mult( F[num], modinv(F[num-b2]) ) );
      num -= b2;
      ll b1 = b[1];
      xros = mult( xros, mult( mult( F[num], modinv(F[num-b1*2LL]) ), T2[b1] ) );
      num -= b1;
      xros = mult( xros, mult( mult( F[num], T3[num/3LL] ) ) );
      add( res, xros );
    }
        
  }
  cout << res << endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:123:30: error: too few arguments to function 'll mult(ll, ll)'
  123 |       xros = mult( xros, mult( mult( F[num], T3[num/3LL] ) ) );
      |                          ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
a.cc:73:4: note: declared here
   73 | ll mult( ll a, ll b ){
      |    ^~~~
Language: Java

import java.util.Scanner;

public class ACM2 {
	
	public static double distance(double d,double plan) {
		
		double y,min=101.0,tmp=0.0;
		int i;
		for(i=0;i<(int)d;i++) {
			
			y = d-i;
			tmp = Math.sqrt(Math.pow(y, 2.0)+Math.pow(i, 2.0));
			tmp -= plan;
			tmp = Math.abs(tmp);
			
			if(tmp<min) {
				min = tmp;
			}
			
		}
		
		return tmp;
	}

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		int i;
		double d,p;
		
		while(true) {
			d = sc.nextDouble();
			p = sc.nextDouble();
			
			if(p == 0.0 && d == 0.0) break;
			
			System.out.println(distance(d,p));
		}

	}

}


Compiler output:
Main.java:3: error: class ACM2 is public, should be declared in a file named ACM2.java
public class ACM2 {
       ^
1 error
Language: Java

import java.util.Scanner;

public class ACM2 {
	
	public static double distance(double d,double plan) {
		
		double y,min=101.0,tmp=0.0;
		int i;
		for(i=0;i<(int)d;i++) {
			
			y = d-i;
			tmp = Math.sqrt(Math.pow(y, 2.0)+Math.pow(i, 2.0));
			tmp -= plan;
			tmp = Math.abs(tmp);
			
			if(tmp<min) {
				min = tmp;
			}
			
		}
		
		return min;
	}

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		int i;
		double d,p;
		
		while(true) {
			d = sc.nextDouble();
			p = sc.nextDouble();
			
			if(p == 0.0 && d == 0.0) break;
			
			System.out.println(distance(d,p));
		}

	}

}


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

include<stdio.h>
#include<math.h>

int main(){
  int D,E;
  double min;
  int i,j;
  while(scanf("%d%d",&D,&E),D+E){

    min=fabs(sqrt(D*D)-E);

    for(i=0,j=D;j>=0;i++,j--)
      if( min > fabs((sqrt(i*i+j*j)-E)) )
        min=(sqrt(i*i+j*j)-E);

    printf("%.10f\n",min);
  }

  return 0;
}

Compiler output:
main.c:1:8: error: expected '=', ',', ';', 'asm' or '__attribute__' before '<' token
    1 | include<stdio.h>
      |        ^
main.c: In function 'main':
main.c:8:9: error: implicit declaration of function 'scanf' [-Wimplicit-function-declaration]
    8 |   while(scanf("%d%d",&D,&E),D+E){
      |         ^~~~~
main.c:3:1: note: include '<stdio.h>' or provide a declaration of 'scanf'
    2 | #include<math.h>
  +++ |+#include <stdio.h>
    3 | 
main.c:8:9: warning: incompatible implicit declaration of built-in function 'scanf' [-Wbuiltin-declaration-mismatch]
    8 |   while(scanf("%d%d",&D,&E),D+E){
      |         ^~~~~
main.c:8:9: note: include '<stdio.h>' or provide a declaration of 'scanf'
main.c:16:5: error: implicit declaration of function 'printf' [-Wimplicit-function-declaration]
   16 |     printf("%.10f\n",min);
      |     ^~~~~~
main.c:16:5: note: include '<stdio.h>' or provide a declaration of 'printf'
main.c:16:5: warning: incompatible implicit declaration of built-in function 'printf' [-Wbuiltin-declaration-mismatch]
main.c:16:5: note: include '<stdio.h>' or provide a declaration of 'printf'
Language: C++

#include <cmath>
#include <cstdio>
#include <algorithm>
int D, E;
int main() {
	while (scanf("%d%d", &D, &E), D) {
		double ret = 1e10;
		for (int i = 0; i <= D; i++) ret = std::min(ret, abs(hypot(i, D - i) - E));
		printf("%.9f\n", ret);
	}
}

Compiler output:
a.cc: In function 'int main()':
a.cc:8:60: error: no matching function for call to 'min(double&, int)'
    8 |                 for (int i = 0; i <= D; i++) ret = std::min(ret, abs(hypot(i, D - i) - E));
      |                                                    ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/14/bits/specfun.h:43,
                 from /usr/include/c++/14/cmath:3906,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_algobase.h:233:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::min(const _Tp&, const _Tp&)'
  233 |     min(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:233:5: note:   template argument deduction/substitution failed:
a.cc:8:60: note:   deduced conflicting types for parameter 'const _Tp' ('double' and 'int')
    8 |                 for (int i = 0; i <= D; i++) ret = std::min(ret, abs(hypot(i, D - i) - E));
      |                                                    ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algobase.h:281:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare)'
  281 |     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:281:5: note:   candidate expects 3 arguments, 2 provided
In file included from /usr/include/c++/14/algorithm:61,
                 from a.cc:3:
/usr/include/c++/14/bits/stl_algo.h:5686:5: note: candidate: 'template<class _Tp> constexpr _Tp std::min(initializer_list<_Tp>)'
 5686 |     min(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5686:5: note:   candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_algo.h:5696:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::min(initializer_list<_Tp>, _Compare)'
 5696 |     min(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5696:5: note:   template argument deduction/substitution failed:
a.cc:8:60: note:   mismatched types 'std::initializer_list<_Tp>' and 'double'
    8 |                 for (int i = 0; i <= D; i++) ret = std::min(ret, abs(hypot(i, D - i) - E));
      |                                                    ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Language: C++

#include <cmath>
#include <cstdio>
#include <algorithm>
int D, E;
int main() {
	while (scanf("%d%d", &D, &E), D) {
		double ret = 1e10;
		for (int i = 0; i <= D; i++) ret = std::min(ret, abs(hypot(1.0 * i, 1.0 * D - i) - E));
		printf("%.9f\n", ret);
	}
}

Compiler output:
a.cc: In function 'int main()':
a.cc:8:60: error: no matching function for call to 'min(double&, int)'
    8 |                 for (int i = 0; i <= D; i++) ret = std::min(ret, abs(hypot(1.0 * i, 1.0 * D - i) - E));
      |                                                    ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/14/bits/specfun.h:43,
                 from /usr/include/c++/14/cmath:3906,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_algobase.h:233:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::min(const _Tp&, const _Tp&)'
  233 |     min(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:233:5: note:   template argument deduction/substitution failed:
a.cc:8:60: note:   deduced conflicting types for parameter 'const _Tp' ('double' and 'int')
    8 |                 for (int i = 0; i <= D; i++) ret = std::min(ret, abs(hypot(1.0 * i, 1.0 * D - i) - E));
      |                                                    ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algobase.h:281:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare)'
  281 |     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:281:5: note:   candidate expects 3 arguments, 2 provided
In file included from /usr/include/c++/14/algorithm:61,
                 from a.cc:3:
/usr/include/c++/14/bits/stl_algo.h:5686:5: note: candidate: 'template<class _Tp> constexpr _Tp std::min(initializer_list<_Tp>)'
 5686 |     min(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5686:5: note:   candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_algo.h:5696:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::min(initializer_list<_Tp>, _Compare)'
 5696 |     min(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5696:5: note:   template argument deduction/substitution failed:
a.cc:8:60: note:   mismatched types 'std::initializer_list<_Tp>' and 'double'
    8 |                 for (int i = 0; i <= D; i++) ret = std::min(ret, abs(hypot(1.0 * i, 1.0 * D - i) - E));
      |                                                    ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Language: C++

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

int main(){
	int d, e;
	while (1){
		cin >> d >> e;
		double min = 100000;
		if (d == 0 && e == 0) break;
		for (int i = 0; i <= d; i++){

			for (int j = i; j <= d; j++){
				if (i + j == d){
					double cost = sqrt(i*i + j*j);
					double gap = sqrt((cost - e) * (cost - e));

					if (gap < min){
						min = gap;
					}
				}
			}

		}
		cout << min << endl;
	}

	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:17:55: error: 'sqrt' was not declared in this scope
   17 |                                         double cost = sqrt(i*i + j*j);
      |                                                       ^~~~
Language: C++

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

double Abv(double a,double b){
  double Abv =a-b;
  if(Abv<0){
    Abv =b-a;
  }
  if(Abv>0){
    Abv =a-b;
  }
  return Abv;
}

int main(){

  double D,E;
  while(1){
  cin >> D >> E;
  if(D==0&&E==0){
    return 0;
  }

  for(int i=0;i<D;i++){
    double A;
    A=i*i+(D-i)*(D-i);

    Abv(double sqrt(A),E);  

    cout << Abv << endl;
  }
  }
  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:29:9: error: expected primary-expression before 'double'
   29 |     Abv(double sqrt(A),E);
      |         ^~~~~~
Language: C++

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

double Abv(double a,double b){
  double Abv =a-b;
  if(Abv<0){
    Abv =b-a;
  }
  if(Abv>0){
    Abv =a-b;
  }
  return Abv;
}

int main(){

  double D,E;
  while(1){
  cin >> D >> E;
  if(D==0&&E==0){
    return 0;
  }

  for(int i=0;i<D;i++){
    double A;
    A=double sqrt(i*i+(D-i)*(D-i));

    Abv(A,E);  

    cout << Abv << endl;
  }
  }
  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:27:7: error: expected primary-expression before 'double'
   27 |     A=double sqrt(i*i+(D-i)*(D-i));
      |       ^~~~~~
Language: C++

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

double Abv(double a,double b){
  double Abv =a-b;
  if(Abv<0){
    Abv =b-a;
  }
  if(Abv>0){
    Abv =a-b;
  }
  return Abv;
}

int main(){

  string gomi=" ";
  double D,E;
  while(1){
    cin >> D >> gomi >> E;
  if(D==0&&E==0){
    break;
  }

  for(int i=0;i<D;i++){
    double A;
    A=(i*i+(D-i)*(D-i));  

    cout << setprecision(10) << Abv(sqrt(A),E) << endl;
  }
  }
  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:31:13: error: 'setprecision' was not declared in this scope
   31 |     cout << setprecision(10) << Abv(sqrt(A),E) << endl;
      |             ^~~~~~~~~~~~
a.cc:3:1: note: 'std::setprecision' is defined in header '<iomanip>'; this is probably fixable by adding '#include <iomanip>'
    2 | #include<cmath>
  +++ |+#include <iomanip>
    3 | #include<string>
Language: C++

#include <cstdio>
#include <algorithm>
#include <math>
#include <map>

using namespace std;

int main()
{
	double d, e;
	double mp[105][105];
	int i, j;
	double dis;
	double dd;
	for (i = 0; i < 101; i++){
		for (j = 0; j < 101; j++){
			mp[i][j] = sqrt(pow(i, 2.0) + pow(j, 2.0));
		}
	}
	
	i = j = 0;
	while(scanf("%lf %lf", &d, &e), d != 0 && e != 0){
		dis = 1000000;
		for (i = 0; i + j <= d; i++){
			for (j = 0; i + j <= d; j++){
				if (i + j == d){
				if (mp[i][j] > e) dd = mp[i][j] - e;
				else dd = e - mp[i][j];
				//printf(" %lf %d %d\n", mp[i][j], i, j);
				if (dis > dd) dis = dd;
				}
			}
			j = 0;
		}
		
		printf("%lf\n", dis);
	}
}

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

#include <iostream>
#include<cstdlib>
#include<queue>
#include<set>
#include<vector>
#include<string>
#include<algorithm>
#include<sstream>
#include<stack>
#include<map>
#include<cstdio>
using namespace std;
#define rep(i,a) for(int i=0;i<a;i++)
#define mp make_pair
#define pb push_back
#define P pair<int,int>
#define ll __int64

int d;
double e;
int main(){
while(cin>>d>>e,d||e){
double ans=10000.0;
for(int i=0;i<=d;i++){
	double x=i;
	double y=d-i;
	double k=sqrt(x*x+y*y)-e;
	if(k<0)k*=-1;
	ans=min(ans,k);
}
printf("%.10lf\n",ans);
}
	return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:27:18: error: 'sqrt' was not declared in this scope
   27 |         double k=sqrt(x*x+y*y)-e;
      |                  ^~~~
Language: C++

#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;

int main(){
 int d,e,x,y;
 while(cin >> d >> e && d){
  float ans;
  ans = 1e6;
  for(x=0;x<=d;x++){
   y = d-x;
   ans = min(fabs(sqrt(x*x+y*y)-e),ans);
  }
  cout << ans << endl;
 }
 return 0;
}
   


Compiler output:
a.cc: In function 'int main()':
a.cc:13:13: error: no matching function for call to 'min(double, float&)'
   13 |    ans = min(fabs(sqrt(x*x+y*y)-e),ans);
      |          ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/14/string:51,
                 from /usr/include/c++/14/bits/locale_classes.h:40,
                 from /usr/include/c++/14/bits/ios_base.h:41,
                 from /usr/include/c++/14/ios:44,
                 from /usr/include/c++/14/ostream:40,
                 from /usr/include/c++/14/iostream:41,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_algobase.h:233:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::min(const _Tp&, const _Tp&)'
  233 |     min(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:233:5: note:   template argument deduction/substitution failed:
a.cc:13:13: note:   deduced conflicting types for parameter 'const _Tp' ('double' and 'float')
   13 |    ans = min(fabs(sqrt(x*x+y*y)-e),ans);
      |          ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algobase.h:281:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare)'
  281 |     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:281:5: note:   candidate expects 3 arguments, 2 provided
In file included from /usr/include/c++/14/algorithm:61,
                 from a.cc:3:
/usr/include/c++/14/bits/stl_algo.h:5686:5: note: candidate: 'template<class _Tp> constexpr _Tp std::min(initializer_list<_Tp>)'
 5686 |     min(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5686:5: note:   candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_algo.h:5696:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::min(initializer_list<_Tp>, _Compare)'
 5696 |     min(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5696:5: note:   template argument deduction/substitution failed:
a.cc:13:13: note:   mismatched types 'std::initializer_list<_Tp>' and 'double'
   13 |    ans = min(fabs(sqrt(x*x+y*y)-e),ans);
      |          ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
Language: Java

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.NoSuchElementException;

import java.util.HashSet;

public class AOJ_2700 {
	
	int N;
	char[] B = {'a','i','u','e','o'};
	public void solve() {
		while(true){
			N = nextInt();
			if(N == 0)break;
			String[] S = new String[N];
			for(int i = 0;i < N;i++){
				String s = next();
				StringBuilder sb = new StringBuilder();
				boolean preB = false;
				for(int j = 0;j < s.length();j++){
					if(j == 0 || preB){
						if(preB)preB = false;
						sb.append(s.charAt(j));
					}
					
					for(int k = 0;k < B.length;k++){
						if(B[k] == s.charAt(j)){
							preB = true;
						}
					}
				}
				
				S[i] = sb.toString();
			}
			
			
			boolean isAns = false;
			for(int i = 1;i <= 50;i++){
				HashSet<String> set = new HashSet<String>();
				boolean ok = true;
				for(int j = 0;j < N;j++){
					if(set.contains(S[j].substring(0,Math.min(S[j].length(),i)))){
						ok = false;
						break;
					}else{
						set.add(S[j].substring(0,Math.min(S[j].length(),i)));
					}
				}
				
				if(ok){
					out.println(i);
					isAns = true;
					break;
				}
			}
			
			if(!isAns){
				out.println(-1);
			}
		}
	}

	public static void main(String[] args) {
		out.flush();
		new AOJ_2700().solve();
		out.close();
	}

	/* Input */
	private static final InputStream in = System.in;
	private static final PrintWriter out = new PrintWriter(System.out);
	private final byte[] buffer = new byte[2048];
	private int p = 0;
	private int buflen = 0;

	private boolean hasNextByte() {
		if (p < buflen)
			return true;
		p = 0;
		try {
			buflen = in.read(buffer);
		} catch (IOException e) {
			e.printStackTrace();
		}
		if (buflen <= 0)
			return false;
		return true;
	}

	public boolean hasNext() {
		while (hasNextByte() && !isPrint(buffer[p])) {
			p++;
		}
		return hasNextByte();
	}

	private boolean isPrint(int ch) {
		if (ch >= '!' && ch <= '~')
			return true;
		return false;
	}

	private int nextByte() {
		if (!hasNextByte())
			return -1;
		return buffer[p++];
	}

	public String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = -1;
		while (isPrint((b = nextByte()))) {
			sb.appendCodePoint(b);
		}
		return sb.toString();
	}

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

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

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

Compiler output:
Main.java:8: error: class AOJ_2700 is public, should be declared in a file named AOJ_2700.java
public class AOJ_2700 {
       ^
1 error
Language: Java

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


public class toi1 {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String str;
		while((str = br.readLine())!=null){
			int num = Integer.parseInt(str);
			ArrayList<String> read_str = new ArrayList<String>();
			int max_length = 0;
			for(int i = 0; i<num; i++){
				String read = br.readLine();
				if(read.length()>max_length){
					max_length = read.length();
				}
				read_str.add(read);
			}
			System.out.println(check_state(max_length, read_str));
		}
	}

	public static int check_state(int length, ArrayList<String> read_list){
		char boin[] = {'a','i','u','e','o'};
		String str;
		int max_k = 0;
		ArrayList<String> list = new ArrayList<String>();
		for(int i= 0; i<read_list.size(); i++){
			StringBuilder build = new StringBuilder();
			char array[] = read_list.get(i).toCharArray();
			boin_add(array, boin , build,length);
			str = new String(build);
			if(str.length()>max_k){
				max_k = str.length();
			}
			list.add(str);
		}

		for(int i = 1; i<max_k; i++){
			ArrayList<String> check_list = new ArrayList<String>();
			for(int j = 0; j<list.size(); j++){
				if(i > list.get(j).length()){
					str = list.get(j).substring(0, list.get(j).length());
				}else{
					str = list.get(j).substring(0, i);
				}
				if(check_list.indexOf(str) != -1){
					break;
				}
				check_list.add(str);
			}
			if(check_list.size()==list.size()){
				return i;
			}
		}

		return -1;
	}

	public static void  boin_add(char array[], char boin[], StringBuilder build,int length){
		build.append(array[0]);
		for(int s = 0; s<length; s++){
			for(int j = 0; j<boin.length; j++){
				if(s>=array.length-1){
					return;
				}
				if(array[s] == boin[j]){
					build.append(array[s+1]);
				}
			}
		}
	}
}

Compiler output:
Main.java:7: error: class toi1 is public, should be declared in a file named toi1.java
public class toi1 {
       ^
1 error
Language: Java

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


public class toi1 {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String str;
		while((str = br.readLine())!=null){
			int num = Integer.parseInt(str);
			if(num == 0){
				break;
			}
			ArrayList<String> read_str = new ArrayList<String>();
			int max_length = 0;
			for(int i = 0; i<num; i++){
				String read = br.readLine();
				if(read.length()>max_length){
					max_length = read.length();
				}
				read_str.add(read);
			}
			System.out.println(check_state(max_length, read_str));
		}
	}

	public static int check_state(int length, ArrayList<String> read_list){
		char boin[] = {'a','i','u','e','o'};
		String str;
		int max_k = 0;
		ArrayList<String> list = new ArrayList<String>();
		for(int i= 0; i<read_list.size(); i++){
			StringBuilder build = new StringBuilder();
			char array[] = read_list.get(i).toCharArray();
			boin_add(array, boin , build,length);
			str = new String(build);
			if(str.length()>max_k){
				max_k = str.length();
			}
			list.add(str);
		}

		for(int i = 1; i<max_k; i++){
			ArrayList<String> check_list = new ArrayList<String>();
			for(int j = 0; j<list.size(); j++){
				if(i > list.get(j).length()){
					str = list.get(j).substring(0, list.get(j).length());
				}else{
					str = list.get(j).substring(0, i);
				}
				if(check_list.indexOf(str) != -1){
					break;
				}
				check_list.add(str);
			}
			if(check_list.size()==list.size()){
				return i;
			}
		}
		return -1;
	}

	public static void  boin_add(char array[], char boin[], StringBuilder build,int length){
		build.append(array[0]);
		for(int s = 0; s<length; s++){
			for(int j = 0; j<boin.length; j++){
				if(s>=array.length-1){
					return;
				}
				if(array[s] == boin[j]){
					build.append(array[s+1]);
				}
			}
		}
	}
}

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

#include<stdio.h>
#include<string.h>
#define rep(i,n) for(i=0;i<n;i++)
int max(int a,int b){
    return a>b?a:b;
}

int main(void){
    int n,m,i,j,k,l,f;
    char s[50][51],t[50][51];
    while(scanf(“%d”,&n,),n){
        l=0;
        rep(i,n){
            scanf(“%s”,s[i]);
            l=max(l,strlen(s[i]));
        }
        memset(t,0,sizeof(t));
        rep(k,l+1){
            rep(i,n){
                t[i][0]=s[i][0];
                j=1;
                m=0;
                while(s[i][m]&&j<k){
                    if(strchr(“aiueo”,s[i][m])!=NULL)){
                        t[i][j++]=s[i][m];
                    }
                    m++;
                }
                t[i][j]=0;
            }
            f=1;
            rep(i,n){
                rep(j,n){
                    if(i!=j&&strcmp(t[i],t[j])==0){
                        f=0;
                    }
                }
            }
            if(f)break;
        }
        printf(“%d\n”,f?k:-1);
    }
    return 0;
}


Compiler output:
main.c: In function 'main':
main.c:11:17: error: stray '\342' in program
   11 |     while(scanf(<U+201C>%d<U+201D>,&n,),n){
      |                 ^~~~~~~~
main.c:11:18: error: expected expression before '%' token
   11 |     while(scanf(“%d”,&n,),n){
      |                  ^
main.c:11:20: error: stray '\342' in program
   11 |     while(scanf(<U+201C>%d<U+201D>,&n,),n){
      |                           ^~~~~~~~
main.c:14:19: error: stray '\342' in program
   14 |             scanf(<U+201C>%s<U+201D>,s[i]);
      |                   ^~~~~~~~
main.c:14:20: error: expected expression before '%' token
   14 |             scanf(“%s”,s[i]);
      |                    ^
main.c:14:22: error: stray '\342' in program
   14 |             scanf(<U+201C>%s<U+201D>,s[i]);
      |                             ^~~~~~~~
main.c:24:31: error: stray '\342' in program
   24 |                     if(strchr(<U+201C>aiueo<U+201D>,s[i][m])!=NULL)){
      |                               ^~~~~~~~
main.c:24:37: error: stray '\342' in program
   24 |                     if(strchr(<U+201C>aiueo<U+201D>,s[i][m])!=NULL)){
      |                                            ^~~~~~~~
main.c:24:32: error: 'aiueo' undeclared (first use in this function)
   24 |                     if(strchr(“aiueo”,s[i][m])!=NULL)){
      |                                ^~~~~
main.c:24:32: note: each undeclared identifier is reported only once for each function it appears in
main.c:24:54: error: expected statement before ')' token
   24 |                     if(strchr(“aiueo”,s[i][m])!=NULL)){
      |                                                      ^
main.c:41:16: error: stray '\342' in program
   41 |         printf(<U+201C>%d\n<U+201D>,f?k:-1);
      |                ^~~~~~~~
main.c:41:17: error: expected expression before '%' token
   41 |         printf(“%d\n”,f?k:-1);
      |                 ^
main.c:41:19: error: stray '\' in program
   41 |         printf(“%d\n”,f?k:-1);
      |                   ^
main.c:41:21: error: stray '\342' in program
   41 |         printf(<U+201C>%d\n<U+201D>,f?k:-1);
      |                            ^~~~~~~~
Language: C

#include<stdio.h>
#include<string.h>
#define rep(i,n) for(i=0;i<n;i++)
int max(int a,int b){
    return a>b?a:b;
}

int main(void){
    int n,m,i,j,k,l,f;
    char s[50][51],t[50][51];
    while(scanf(”%d”,&n,),n){
        l=0;
        rep(i,n){
            scanf(”%s”,s[i]);
            l=max(l,strlen(s[i]));
        }
        memset(t,0,sizeof(t));
        rep(k,l+1){
            rep(i,n){
                t[i][0]=s[i][0];
                j=1;
                m=0;
                while(s[i][m]&&j<k){
                    if(strchr(“aiueo”,s[i][m])!=NULL)){
                        t[i][j++]=s[i][m];
                    }
                    m++;
                }
                t[i][j]=0;
            }
            f=1;
            rep(i,n){
                rep(j,n){
                    if(i!=j&&strcmp(t[i],t[j])==0){
                        f=0;
                    }
                }
            }
            if(f)break;
        }
        printf(“%d\n”,f?k:-1);
    }
    return 0;
}


Compiler output:
main.c: In function 'main':
main.c:11:17: error: stray '\342' in program
   11 |     while(scanf(<U+201D>%d<U+201D>,&n,),n){
      |                 ^~~~~~~~
main.c:11:18: error: expected expression before '%' token
   11 |     while(scanf(”%d”,&n,),n){
      |                  ^
main.c:11:20: error: stray '\342' in program
   11 |     while(scanf(<U+201D>%d<U+201D>,&n,),n){
      |                           ^~~~~~~~
main.c:14:19: error: stray '\342' in program
   14 |             scanf(<U+201D>%s<U+201D>,s[i]);
      |                   ^~~~~~~~
main.c:14:20: error: expected expression before '%' token
   14 |             scanf(”%s”,s[i]);
      |                    ^
main.c:14:22: error: stray '\342' in program
   14 |             scanf(<U+201D>%s<U+201D>,s[i]);
      |                             ^~~~~~~~
main.c:24:31: error: stray '\342' in program
   24 |                     if(strchr(<U+201C>aiueo<U+201D>,s[i][m])!=NULL)){
      |                               ^~~~~~~~
main.c:24:37: error: stray '\342' in program
   24 |                     if(strchr(<U+201C>aiueo<U+201D>,s[i][m])!=NULL)){
      |                                            ^~~~~~~~
main.c:24:32: error: 'aiueo' undeclared (first use in this function)
   24 |                     if(strchr(“aiueo”,s[i][m])!=NULL)){
      |                                ^~~~~
main.c:24:32: note: each undeclared identifier is reported only once for each function it appears in
main.c:24:54: error: expected statement before ')' token
   24 |                     if(strchr(“aiueo”,s[i][m])!=NULL)){
      |                                                      ^
main.c:41:16: error: stray '\342' in program
   41 |         printf(<U+201C>%d\n<U+201D>,f?k:-1);
      |                ^~~~~~~~
main.c:41:17: error: expected expression before '%' token
   41 |         printf(“%d\n”,f?k:-1);
      |                 ^
main.c:41:19: error: stray '\' in program
   41 |         printf(“%d\n”,f?k:-1);
      |                   ^
main.c:41:21: error: stray '\342' in program
   41 |         printf(<U+201C>%d\n<U+201D>,f?k:-1);
      |                            ^~~~~~~~
Language: C

#include<stdio.h>
#include<string.h>
#define rep(i,n) for(i=0;i<n;i++)
int max(int a,int b){
    return a>b?a:b;
}

int main(void){
    int n,m,i,j,k,l,f;
    char s[50][51],t[50][51];
    while(scanf("%d"&n,),n){
        l=0;
        rep(i,n){
            scanf("%s",s[i]);
            l=max(l,strlen(s[i]));
        }
        memset(t,0,sizeof(t));
        rep(k,l+1){
            rep(i,n){
                t[i][0]=s[i][0];
                j=1;
                m=0;
                while(s[i][m]&&j<k){
                    if(strchr("aiueo"[i][m])!=NULL)){
                        t[i][j++]=s[i][m];
                    }
                    m++;
                }
                t[i][j]=0;
            }
            f=1;
            rep(i,n){
                rep(j,n){
                    if(i!=j&&strcmp(t[i],t[j])==0){
                        f=0;
                    }
                }
            }
            if(f)break;
        }
        printf("%d\n",f?k:-1);
    }
    return 0;
}


Compiler output:
main.c: In function 'main':
main.c:11:21: error: invalid operands to binary & (have 'char *' and 'int')
   11 |     while(scanf("%d"&n,),n){
      |                 ~~~~^
      |                 |
      |                 char *
main.c:11:24: error: expected expression before ')' token
   11 |     while(scanf("%d"&n,),n){
      |                        ^
main.c:24:41: error: subscripted value is neither array nor pointer nor vector
   24 |                     if(strchr("aiueo"[i][m])!=NULL)){
      |                                         ^
main.c:24:24: error: too few arguments to function 'strchr'
   24 |                     if(strchr("aiueo"[i][m])!=NULL)){
      |                        ^~~~~~
In file included from main.c:2:
/usr/include/string.h:246:14: note: declared here
  246 | extern char *strchr (const char *__s, int __c)
      |              ^~~~~~
main.c:24:52: error: expected statement before ')' token
   24 |                     if(strchr("aiueo"[i][m])!=NULL)){
      |                                                    ^