criyle/codenet-compile-errors huggingface dataset:
Language: Java

import java.util.*;

public class main{
    public static void main(String [] args)throws Exception{
                 int x = 0;
                     while(x < 100){
                     x++;     
                     System.out.println('rank up!!');
                  }
            }
}



Compiler output:
Main.java:8: error: unclosed character literal
                     System.out.println('rank up!!');
                                        ^
Main.java:8: error: ';' expected
                     System.out.println('rank up!!');
                                                ^
Main.java:8: error: unclosed character literal
                     System.out.println('rank up!!');
                                                  ^
3 errors
Language: Java

import java.util.*;
 
public class main{
    public static void main(String [] args)throws Exception{
                 int n = 0;
                     while(n < 10){
                     x++;     
                     System.out.println('kedarui');
                  }
            }
}


Compiler output:
Main.java:8: error: unclosed character literal
                     System.out.println('kedarui');
                                        ^
Main.java:8: error: unclosed character literal
                     System.out.println('kedarui');
                                                ^
Main.java:8: error: not a statement
                     System.out.println('kedarui');
                                          ^
3 errors
Language: C

#include<stdio.h>
#include<algorithm>
using namespace std;

int main()
{
    int n, a[10000+5];
    while(1)
    {
        scanf("%d",&n);
        if(n==0) return 0;
        int i, j, sum=0;
        for(i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            sum+=a[i];
        }
        float t=float(sum)/n;
        int m=0;
        for(i=1;i<=n;i++)
        {
            if(a[i]<=t) m++;
        }
        printf("%d\n",m);
    }
}



Compiler output:
main.c:2:9: fatal error: algorithm: No such file or directory
    2 | #include<algorithm>
      |         ^~~~~~~~~~~
compilation terminated.
Language: C

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<stack>

#define MOD 10000000
using namespace std; 
typedef long long LL;

long long quickpow(long long n, long long base) {
    long long res = 1;
    while(n) {
        if(n & 1) {
            res = res * base % MOD;
        }
        n >>= 1;
        base = base * base % MOD;
    }
    return res;
}//¿ìËÙÃÝ 
float A[10050];
int main()
{
	int n;
	int flag=1;
	cin>>n;
	 while(n)
	 {
	 	float sum=0;
 		for(int i=1;i<=n;i++)
 		{
		  cin>>A[i];
 		  sum+=A[i];
 		}
 		int ans=0;
 		float ave=sum/n;
 		for(int i=1;i<=n;i++)
 		{
		 	if(A[i]<=ave)
		 	ans++;
	    }
	    cout<<ans<<endl;
 		cin>>n;
 	}
} 













Compiler output:
main.c:1:9: fatal error: iostream: No such file or directory
    1 | #include<iostream>
      |         ^~~~~~~~~~
compilation terminated.
Language: C

#include <bits/stdc++.h>
#define test(a) printf("(%3d)", a)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;

const int MAXN = 5e4 + 10;

int n, a[MAXN];

int main (void) {
    while (~scanf("%d", &n) & n) {
        ll sum = 0, ans = 0;
        for (int i = 1; i <= n; i++) {
            scanf("%d", &a[i]);
            sum += a[i];
        }
        for (int i = 1; i <= n; i++) {
            ans += (a[i] * n <= sum);
        }
        printf("%lld\n", ans);
    }
    return 0;
}


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

//#include<bits/stdc++.h>
#include<iostream>
#include<stdio.h>
#include<conio.h>
#define pi 3.141592653897932384626
#define abs(x) ((x)>0?(x):(-(x)))
#define eps (double)(0.0000001)
#define fs first
#define se second
//freopen("in.txt","r",stdin);freopen("out.txt","w",stdout);
using namespace std;
long a[1000];
int main()
{
    long n;
    cin>>n;
    while(n){
        long s=0,x=0;
        for(long i=0;i<n;++i){scanf("%ld",&a[i]);s+=a[i];}
        s/=n;
        for(long i=0;i<n;++i){if(a[i]<=s)++x;}
        cout<<x<<endl;
        cin>>n;
    }
    return 0;
}



Compiler output:
main.c:2:9: fatal error: iostream: No such file or directory
    2 | #include<iostream>
      |         ^~~~~~~~~~
compilation terminated.
Language: C++

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }

int N, A[10101];
//---------------------------------------------------------------------------------------------------
void _main() {
	while (cin >> N) {
		if (N == 0) return;
		rep(i, 0, N) cin >> A[i];

		int sm = 0;
		rep(i, 0, N) sm += A[i];

		int ans = 0;
		rep(i, 0, N) if (A[i] * N <= sm) ans++;
		printf("%d\n", ans);
	}




Compiler output:
a.cc: In function 'void _main()':
a.cc:24:10: error: expected '}' at end of input
   24 |         }
      |          ^
a.cc:13:14: note: to match this '{'
   13 | void _main() {
      |              ^
Language: C++


//---------------------------------------------------------------------------------------------------
void _main() {
	while (cin >> N) {
		if (N == 0) return;
		rep(i, 0, N) cin >> A[i];

		int sm = 0;
		rep(i, 0, N) sm += A[i];

		int ans = 0;
		rep(i, 0, N) if (A[i] * N <= sm) ans++;
		printf("%d\n", ans);
	}
}




Compiler output:
a.cc: In function 'void _main()':
a.cc:4:16: error: 'cin' was not declared in this scope
    4 |         while (cin >> N) {
      |                ^~~
a.cc:4:23: error: 'N' was not declared in this scope
    4 |         while (cin >> N) {
      |                       ^
a.cc:6:21: error: 'i' was not declared in this scope
    6 |                 rep(i, 0, N) cin >> A[i];
      |                     ^
a.cc:6:17: error: 'rep' was not declared in this scope
    6 |                 rep(i, 0, N) cin >> A[i];
      |                 ^~~
a.cc:13:17: error: 'printf' was not declared in this scope
   13 |                 printf("%d\n", ans);
      |                 ^~~~~~
a.cc:1:1: note: 'printf' is defined in header '<cstdio>'; this is probably fixable by adding '#include <cstdio>'
  +++ |+#include <cstdio>
    1 |
Language: C

#include <stdio.h>

#define MAX 500 //配列の大きさは500*500で十分です。

using namespace std;

int main(void){
	while(1){
		//問題ではn, m, t, pとして与えられますが、
		//nはw、mはhとして変数を用意します。
		int w, h, t, p; 
		scanf(" %d %d %d %d", &w, &h, &t, &p);
		if(!w && !h && !t && !p) break;

		//2次元配列は行列のように、i行j列(kami[i][j])として考えます。
		//そのため、座標(x, y)は kami[y][x] となります。
		int kami[MAX][MAX] = {0};
		for(int i=0; i<h; i++){
			for(int j=0; j<w; j++){
				kami[i][j] = 1;//折り紙が存在する部分を1で初期化
			}
		}

		int origin_x = 0, origin_y =0; //折り紙左上の角の座標を原点として記憶(kami[origin_y][origin_x])
		for(int k=0; k<t; k++){
			int d, c;
			scanf(" %d %d", &d, &c);

			if(d == 1){
				//もし d が 1 なら，左端から c だけ右側を通る垂直の折り線の左側を右側に折り重ねる．
				int dist = 1; //distは折られる前の座標と、折る先の座標の差の絶対値。
				for(int j=origin_x+c; j<origin_x+(2*c); j++){	//折られる先のx座標
					for(int i=origin_y; i<MAX; i++){	//垂直方向に折るループ
						kami[i][j] += kami[i][j-dist];
					}
					dist += 2;
				}
				origin_x += c;
			} else{
				//このプログラムの場合は、上下を入れ替えています。
				//	→もし d が 2 なら，上端から c だけ下側を通る水平の折り線の上側を下側に折り重ねる。
				int dist = 1; //distは折られる前の座標と、折る先の座標の差の絶対値。
				for(int i=origin_y+c; i<origin_y+(2*c); i++){	//折られる先のy座標
					for(int j=origin_x; j<MAX; j++){	//水平方向に折るループ
						kami[i][j] += kami[i-dist][j];
					}
					dist += 2;
				}
				origin_y += c;
			}
		}

		for(int k=0; k<p; k++){
			int x, y;
			scanf(" %d %d", &x, &y);
			printf("%d\n", kami[origin_y+y][origin_x+x]);
		}
	}

	return 0;
}


Compiler output:
main.c:5:1: error: unknown type name 'using'
    5 | using namespace std;
      | ^~~~~
main.c:5:17: error: expected '=', ',', ';', 'asm' or '__attribute__' before 'std'
    5 | using namespace std;
      |                 ^~~
Language: C++

//#include <bits/stdc++.h>
#include <cstdio>
#include <algorithm>
#include <cstring>

using namespace std;

int sum[600][600] = {};

int solve(){
  int h, w, n, m;

  memset(sum, 0, sizeof(sum));
  
  scanf("%d%d%d%d", &w, &h, &n, &m);

  if(!h)return false;
  
  for(int i=0;i<h;i++)
    for(int j=0;j<w;j++)
      sum[i][j] = 1;

  int l = 0, u = 0;

  for(int i=0;i<n;i++){
    int d, c;

    scanf("%d%d", &d, &c);
    
    if(d == 1){
      c += l;
      for(int j=l;j<c;j++){
        for(int k=u;k<u+32;k++){
          sum[k][c+(c-j-1)] += sum[k][j];
          sum[k][j] = 0;
        }
      }
    }else{
      c += u;
      for(int j=u;j<c;j++){
        for(int k=l;k<l+32;k++){
          sum[c+(c-j-1)][k] += sum[j][k];
          sum[j][k] = 0;
        }
      }
    }

    int l2 = l, u2 = u;
    
    l = -1;
    for(int i=u2;i<u2+32;i++){
      for(int j=l2;j<l2+32;j++){
        if(sum[i][j]){
          l = j; u = i;
          break;
        }
      }
      if(l != -1) break;
    }
  }


  assert(l != -1);
  
  for(int i=0;i<m;i++){
    int x, y;

    scanf("%d%d", &x, &y);

    printf("%d\n", sum[y+u][x+l]);
  }

  return 1;
}

int main(){
  while(solve());
}



Compiler output:
a.cc: In function 'int solve()':
a.cc:63:3: error: 'assert' was not declared in this scope
   63 |   assert(l != -1);
      |   ^~~~~~
a.cc:5:1: note: 'assert' is defined in header '<cassert>'; this is probably fixable by adding '#include <cassert>'
    4 | #include <cstring>
  +++ |+#include <cassert>
    5 |
Language: C++

#include <iostream>
//#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <Cstdio>
using namespace std;
typedef long long ll;
int n,m,t,p;
int type,c;
int main()
{
    while(~scanf("%d%d%d%d",&m,&n,&t,&p)&&(m+n+t+p))
    {
        vector<vector<ll> >q(50);
        for(int i=0; i<n; i++)
        {
            for(int j=0; j<m; j++)
            {
                q[i].push_back(1ll);
            }
        }
        while(t--)
        {
            scanf("%d%d",&type,&c);
            if(type==1)
            {
                for(int j=0; j<n; j++)
                {
                    for(int i=0; i<=c-1; i++)
                        q[j][2*c-1-i]+=q[j][i];
                }
                for(int i=0; i<n; i++)
                    for(int j=0; j<m-c; j++)
                        q[i][j]=q[i][j+c];
            }
            else if(type==2)
            {
                for(int j=0; j<m; j++)
                    for(int i=0; i<=c-1; i++)
                    {
                        q[2*c-1-i][j]+=q[i][j];
                    }
                q.erase(q.begin(),q.begin()+c);
            }
        }
        int x,y;
        ll ans=0;
        while(p--)
        {
            scanf("%d%d",&x,&y);
            printf("%lld\n",q[y][x]);
        }
    }
    return 0;
}


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

#include<std/c++.h>
using namespace std;
#define ll long long
ll n;
int main()
{
	while (1) {
		scanf("%d", &n);
		if (n == 0)break;
		ll st = min(n, (ll)1e5);
		for (ll i = st; i >= 1; i--)
		{
			if ((n * 2 - (1 + i)*i>=0)&&(n * 2 - (1 + i)*i + 2 * i) % (2 * i) == 0)
			{
				printf("%lld %lld\n", ((n*2 - (1 + i)*i) / (2 * i)) + 1, i);
				break;
			}
		}
	}
	system("pause");
	return 0;
}


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

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

using ll = long long;

ll b;
vector<ll> A;
pair<ll, ll> ans;

ll f(ll n) { return n*(n+1)/2; }

void solve() {
   for (ll i = 0; i < sqrt(1e10); i++) { // 右側を決める
      ll key = f(i) - b;
      auto p = lower_bound(A.begin(), A.end(), key);
      if (p == A.end()) continue;

      ll j = p - A.begin(); // 左側が決まる
      // 条件に当てはまるなら値を更新する
      if (f(i) - f(j) == b && i - j > ans.second) {
         ans.first = j + 1;
         ans.second = i - j;
      }
   }
   printf("%lld %lld\n", ans.first, ans.second);
}


int main() {
   // lower_boundを使うために最初に求めておく
   for (int i = 0; i < sqrt(1e10); i++) {
      A.push_back(f(i));
   }

   while (1) {
      cin >> b;
      if (b == 0) break;
      // 答えを初期化！
      ans.first = ans.second = 0;
      // solve()に丸投げ！！
      solve();
   }

   return 0;
}


Compiler output:
a.cc:1:2: error: stray '#' in program
    1 | v#include <bits/stdc++.h>
      |  ^
a.cc:1:1: error: 'v' does not name a type
    1 | v#include <bits/stdc++.h>
      | ^
a.cc:7:1: error: 'vector' does not name a type
    7 | vector<ll> A;
      | ^~~~~~
a.cc:8:1: error: 'pair' does not name a type
    8 | pair<ll, ll> ans;
      | ^~~~
a.cc: In function 'void solve()':
a.cc:13:23: error: 'sqrt' was not declared in this scope
   13 |    for (ll i = 0; i < sqrt(1e10); i++) { // 右側を決める
      |                       ^~~~
a.cc:15:28: error: 'A' was not declared in this scope
   15 |       auto p = lower_bound(A.begin(), A.end(), key);
      |                            ^
a.cc:15:16: error: 'lower_bound' was not declared in this scope
   15 |       auto p = lower_bound(A.begin(), A.end(), key);
      |                ^~~~~~~~~~~
a.cc:20:39: error: 'ans' was not declared in this scope
   20 |       if (f(i) - f(j) == b && i - j > ans.second) {
      |                                       ^~~
a.cc:25:26: error: 'ans' was not declared in this scope
   25 |    printf("%lld %lld\n", ans.first, ans.second);
      |                          ^~~
a.cc:25:4: error: 'printf' was not declared in this scope
   25 |    printf("%lld %lld\n", ans.first, ans.second);
      |    ^~~~~~
a.cc:1:1: note: 'printf' is defined in header '<cstdio>'; this is probably fixable by adding '#include <cstdio>'
  +++ |+#include <cstdio>
    1 | v#include <bits/stdc++.h>
a.cc: In function 'int main()':
a.cc:31:24: error: 'sqrt' was not declared in this scope
   31 |    for (int i = 0; i < sqrt(1e10); i++) {
      |                        ^~~~
a.cc:32:7: error: 'A' was not declared in this scope
   32 |       A.push_back(f(i));
      |       ^
a.cc:36:7: error: 'cin' was not declared in this scope
   36 |       cin >> b;
      |       ^~~
a.cc:39:7: error: 'ans' was not declared in this scope
   39 |       ans.first = ans.second = 0;
      |       ^~~
Language: C

#include <iostream>

using namespace std;

int n, m, ans, table[9][9];

int chack(){
	for(int i=0; i<n; i++){
		int tmp=0;
		for(int j=0; j<n; j++) tmp += table[i][j];
		if(tmp) return 0;
	}
	return 1;
}


void dfs(int x, int y){
	if(x < n-1) x++;
	else if(y < n-1){
		x=0;
		y++;
	} else{
		ans += chack();
		return;
	}

	if(x==0 && 0<y){
		int tmp =0;
		for(int i=0; i<n; i++) tmp += table[y-1][i];
		if(tmp) return;
	}

	if(table[y][x] == 0 && y != x){
		table[y][x] = 1;
		table[x][y] = -1;
		dfs(x, y);

		table[y][x] = -1;
		table[x][y] = 1;
		dfs(x, y);

		table[y][x] = table[x][y] = 0;
	} else dfs(x, y);
}


int main(void) {
	while(1) {
		cin >> n;
		if(!n) break;
		fill(table[0], table[8], 0);
		cin >> m;
		for(int i=0; i<m; i++){
			int x, y; cin >> x >> y;
			x--; y--;
			table[x][y] = 1;
			table[y][x] = -1;
		}

		ans = 0;
		dfs(0, 0);
		cout << ans << endl;
	}
	return 0;
}


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

#include<bits/stdc++.h>

#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)

using namespace std;

int n,m,mp[9][9],win[9],border,cnt;

int dfs(int x,int y) {
  if( y >= n ) return ++cnt; 
  
  int nx = x + 1, ny = y;
  if( nx >= ny ) nx = 0, ++ny;

  if( mp[x][y] != -1 ) return dfs(nx,ny);

  int c[2] = {x,y};
  rep(i,2) {
    mp[c[i]][c[(i+1)%2]] = 0, mp[c[(i+1)%2]][c[i]] = 1, ++win[c[i]];
    if( win[c[i]] <= border ) dfs(nx,ny);
    --win[c[i]];
  }

  mp[x][y] = mp[y][x] = -1;
  
}

int main() {
  while( cin >> n, n ) {
    memset(mp,-1,sizeof mp);
    memset(win,0,sizeof win);
    border = ( n * n - n ) / ( n * 2 );
    cnt = 0;
    cin >> m;
    int x,y;
    rep(i,m) {
      cin >> x >> y;
      --x, --y;
      mp[x][y] = 1, mp[y][x] = 0, ++win[x];
    }



Compiler output:
a.cc: In function 'int main()':
a.cc:41:6: error: expected '}' at end of input
   41 |     }
      |      ^
a.cc:30:24: note: to match this '{'
   30 |   while( cin >> n, n ) {
      |                        ^
a.cc:41:6: error: expected '}' at end of input
   41 |     }
      |      ^
a.cc:29:12: note: to match this '{'
   29 | int main() {
      |            ^
a.cc: In function 'int dfs(int, int)':
a.cc:25:12: warning: control reaches end of non-void function [-Wreturn-type]
   25 |   mp[x][y] = mp[y][x] = -1;
      |   ~~~~~~~~~^~~~~~~~~~~~~~~
Language: C++

#include <bits/stdc++.h>

using namespace std;

#ifdef DEBUG_MODE
	#define DBG(n) n;
#else
	#define DBG(n) ;
#endif
#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v,n) {for(int W = 0;W < (n);W++)cerr << v[W] << ' ';cerr << endl << endl;}
#define SHOW2d(v,i,j) {for(int aaa = 0;aaa < i;aaa++){for(int bbb = 0;bbb < j;bbb++)cerr << v[aaa][bbb] << ' ';cerr << endl;}cerr << endl;}
#define ALL(v) v.begin(),v.end()
#define Decimal fixed<<setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000
#define MOD 1000000007

typedef long long ll;
typedef pair<ll,ll> P;

int ans = 0;
int n;
char win[10];
char mp[10][10];

void dfs(int a,int b){
		
	while(a == b || mp[a][b] != '-'){
		b++;
		if(a == n-1 && b == n-1){
			ans++;
			return;
		}
		if(b == n){b = 0;a++;}
	}
	
	else{
		if(win[a] < (n-1) / 2){
			mp[a][b] = 'o';
			mp[b][a] = 'x';
			win[a]++;
			dfs(a,b+1);
			win[a]--;
			mp[a][b] = '-';
			mp[b][a] = '-';			
		}
		if(win[b] < (n-1) / 2){
			mp[a][b] = 'x';
			mp[b][a] = 'o';
			win[b]++;
			dfs(a,b+1);
			win[b]--;
			mp[a][b] = '-';
			mp[b][a] = '-';
		}
	}
}

void solve(){
	ans = 0;
	REP(i,10){
		win[i] = 0;
		REP(j,10){
			mp[i][j] = '-';
		}
	}
	int m;cin >> m;
	REP(i,m){
		int a,b;cin >> a >> b;
		a--;b--;
		mp[a][b] = 'o';
		mp[b][a] = 'x';
		win[a]++;
	}
	
	REP(i,n){
		if(win[i] > (n-1) / 2){
			cout << 0 << endl;
			return;
		}
	}
	
	dfs(0,0);
	
	cout << ans << endl;
}

int main(){
	
	while(cin >> n,n){
		solve();
	}
	
	return 0;
}


Compiler output:
a.cc: In function 'void dfs(int, int)':
a.cc:42:9: error: 'else' without a previous 'if'
   42 |         else{
      |         ^~~~
Language: C++

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

int memo[10][10] = {0};
int wl[10][3] = {0};
int n, m, x, y, ans = 0, hal;

void solve(int now, int riv);
void check();
int main() {
  int i, j;
  while(1) {
    cin >> n;
    if(n == 0) break;
    for(i = 1; i <= n; i++)
      for(j = 0; j < 2; j++) wl[i][j] = 0;
    for(i = 1; i <= n; i++)
      for(j = 1; j <= n; j++) memo[i][j] = 0;
    cin >> m;
    for(i = 0; i < m; i++) {
      cin >> x >> y;
      memo[x][y] = 1;
      memo[y][x] = 2;
      wl[x][0]++;
      wl[y][1]++;
    }
    hal = (n - 1) / 2;
    ans = 0;
    solve(1, 2);
    cout << ans << endl;
    ;
  }
  return 0;
}

void solve(int now, int riv) {
  int nnow, nriv;
  if(now == n && riv == n + 1) {
    check();
    return;
  }
  if(riv < n) {
    nnow = now;
    nriv = riv + 1;
  }
  else {
    nnow = now + 1;
    nriv = nnow + 1;
  }
  if(now == riv || memo[now][riv] != 0)
    solve(nnow, nriv);
  else {
    if(hal > wl[now][0]) {
      ++wl[now][0];
      ++wl[riv][1];
      memo[now][riv] = 1;
      memo[riv][now] = 2;
      solve(nnow, nriv);
      --wl[now][0];
      --wl[riv][1];
    }
    if(hal > wl[now][1]) {
      ++wl[now][1];
      ++wl[riv][0];
      memo[now][riv] = 2;
      memo[riv][now] = 1;
      solve(nnow, nriv);
      --wl[now][1];
      --wl[riv][0];
    }
    memo[now][riv] = 0;
    memo[riv][now] = 0;
  }
}

void check() {
  int i, j;
 cout << " " << wl[i][0];
  cout << endl << endl;*/
  for(i = 1; i <= n; ++i)
    if(wl[i][0] != hal || wl[i][1] != hal) return;

  ++ans;
}


Compiler output:
a.cc: In function 'void check()':
a.cc:79:25: error: expected primary-expression before '/' token
   79 |   cout << endl << endl;*/
      |                         ^
a.cc:80:3: error: expected primary-expression before 'for'
   80 |   for(i = 1; i <= n; ++i)
      |   ^~~
a.cc:80:25: error: expected ';' before ')' token
   80 |   for(i = 1; i <= n; ++i)
      |                         ^
      |                         ;
Language: C++

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }

int N, M, A[9][9];

//---------------------------------------------------------------------------------------------------
int answer = 0;
void dfs(int cu) {
    int x = cu % N;
    int y = cu / N;

    if (cu == N * N) {
        answer++;
        return;
    }

    if (x == y or 0 <= A[y][x]) {
        if (check(y)) dfs(cu + 1);
        return;
    }
    
    A[y][x] = 1; A[x][y] = 0;
    if(check(y)) dfs(cu + 1);

    A[y][x] = 0; A[x][y] = 1;
    if (check(y)) dfs(cu + 1);

    A[y][x] = A[x][y] = -1;
}
//---------------------------------------------------------------------------------------------------
int check(int y) {
    int win = 0, lose = 0;
    rep(x, 0, N) {
        if (A[y][x] == 1) win++;
        else if (A[y][x] < 0 and y != x) lose++;
    }
    return win <= (N - 1) / 2 and (N - 1) / 2 <= win + lose;
}
//---------------------------------------------------------------------------------------------------

void _main() {
    while (cin >> N) {
        if (N == 0) return;
        cin >> M;
        rep(i, 0, N) rep(j, 0, N) A[i][j] = -1;
        rep(i, 0, M) {
            int a, b; cin >> a >> b;
            a--; b--;
            A[a][b] = 1;
            A[b][a] = 0;
        }

        answer = 0;
        dfs(0);
        printf("%d\n", answer);
    }
}




Compiler output:
a.cc: In function 'void dfs(int)':
a.cc:25:13: error: 'check' was not declared in this scope
   25 |         if (check(y)) dfs(cu + 1);
      |             ^~~~~
a.cc:30:8: error: 'check' was not declared in this scope
   30 |     if(check(y)) dfs(cu + 1);
      |        ^~~~~
a.cc:33:9: error: 'check' was not declared in this scope
   33 |     if (check(y)) dfs(cu + 1);
      |         ^~~~~
Language: Java


public class Main {
    public static void main(String[] args) {
	Scanner in = new Scanner(System.in);
	int n;
	while ((n = in.nextInt()) != 0) {
	    int[][] map = new int[21][21];
	    for (int i = 0; i < n; i++) {
		map[in.nextInt()][in.nextInt()] = 1;
	    }
	    int m = in.nextInt();
	    int x = 10;
	    int y = 10;
	    int count = 0;
	    for (int i = 0; i < m; i++) {
		if (count != n) {
		    char c = in.next().charAt(0);
		    int l = in.nextInt();
		    int dx = 0;
		    int dy = 0;
		    if (c == 'N') {
			dy = 1;
		    } else if (c == 'E') {
			dx = 1;
		    } else if (c == 'S') {
			dy = -1;
		    } else if (c == 'W') {
			dx = -1;
		    }
		    for (int j = 0; j < l; j++) {
			count -= map[x][y];
			map[x][y] = 0;
			x += dx;
			y += dy;
		    }
		    count -= map[x][y];
		    map[x][y] = 0;
		} else {
		    in.next();
		    in.next();
		}
	    }
	    if (count == n) {
		System.out.println("Yes");
	    } else {
		System.out.println("No");
	    }
	}
    }
}

Compiler output:
Main.java:4: error: cannot find symbol
	Scanner in = new Scanner(System.in);
	^
  symbol:   class Scanner
  location: class Main
Main.java:4: error: cannot find symbol
	Scanner in = new Scanner(System.in);
	                 ^
  symbol:   class Scanner
  location: class Main
2 errors
Language: Java

package volume_20;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class No_2000 {

	public static void main(String[] args) {
		// TODO ?????????????????????????????????????????????
		Scanner sc = new Scanner(System.in);
		while (true) {
			String line = sc.nextLine();
			int n = Integer.parseInt(line);
			if (n == 0) {
				break;
			} else {
				List<Point> treasure = new ArrayList<>();
				for (int i = 0; i < n; i++) {
					line = sc.nextLine();
					String[] lineAry = line.split(" ");
					treasure.add(new Point(Integer.parseInt(lineAry[0]), Integer.parseInt(lineAry[1])));
				}
				line = sc.nextLine();
				int m = Integer.parseInt(line);
				int trecount = 0;
				Point mypoint = new Point(10, 10);
				for (int i = 0; i < m; i++) {
					line = sc.nextLine();
					String[] lineAry = line.split(" ");
					int d = Integer.parseInt(lineAry[1]);
					if (lineAry[0].equals("N")) {
						for (int j = 0; j < d; j++) {
							mypoint.setY(mypoint.getY() + 1);
							for (Point tmp : treasure) {// tresure?????????????????´????????????????????????????´¢
								if (tmp.getX() == mypoint.getX() && tmp.getY() == mypoint.getY()) {
									trecount++;
									treasure.remove(tmp);
									break;
								}
							}
						}
					}
					if (lineAry[0].equals("E")) {
						for (int j = 0; j < d; j++) {
							mypoint.setX(mypoint.getX() + 1);
							for (Point tmp : treasure) {// tresure?????????????????´????????????????????????????´¢
								if (tmp.getX() == mypoint.getX() && tmp.getY() == mypoint.getY()) {
									trecount++;
									treasure.remove(tmp);
									break;
								}
							}
						}
					}
					if (lineAry[0].equals("S")) {
						for (int j = 0; j < d; j++) {
							mypoint.setY(mypoint.getY() - 1);
							for (Point tmp : treasure) {// tresure?????????????????´????????????????????????????´¢
								if (tmp.getX() == mypoint.getX() && tmp.getY() == mypoint.getY()) {
									trecount++;
									treasure.remove(tmp);
									break;
								}
							}
						}
					}
					if (lineAry[0].equals("W")) {
						for (int j = 0; j < d; j++) {
							mypoint.setX(mypoint.getX() - 1);
							for (Point tmp : treasure) {// tresure?????????????????´????????????????????????????´¢
								if (tmp.getX() == mypoint.getX() && tmp.getY() == mypoint.getY()) {
									trecount++;
									treasure.remove(tmp);
									break;
								}
							}
						}
					}
					System.out.println(mypoint.getX() + ", " + mypoint.getY() + " : " + trecount);
				}
				if (trecount == n) {
					System.out.println("Yes");
				} else {
					System.out.println("No");
				}
			}
		}
	}
}

class Point {
	private int x;
	private int y;

	public void setX(int inX) {
		x = inX;
	}

	public void setY(int inY) {
		y = inY;
	}

	public int getX() {
		return x;
	}

	public int getY() {
		return y;
	}

	public Point() {
		x = 0;
		y = 0;
	}

	public Point(int inX, int inY) {
		x = inX;
		y = inY;
	}
}

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

public static void main(String[] args) {
		Scanner sc  = new Scanner(System.in);
		while(true){
			int N =sc.nextInt();

		if(N == 0){
			break;
		}
		// ???????????????
		boolean[][] map = new boolean[21][21];

		for (int n = 0; n<N; n++){
			int x = sc.nextInt();
			int y = sc.nextInt();
			// ??\??????????????????
			map[y][x] = true;

			show(map);


		}
		// ????????????????????£?????¨?????????????????????????????????????????????
		// ??????????????°???????????????????????????????????£?????¨?????????false?????????
		// ??????????????°???????????????
		
		int commandNum =sc.nextInt();

		// robot????????¨??°
		int roboX = 10;
		int roboY = 10;
		
		
		for (int n = 0; n<commandNum; n++ ){
			String Command = sc.next();//??????????????????????????????
			int stepCount = sc.nextInt();//????????????????????°?????????
			for (int m = 0; m<stepCount; m++){
			switch (Command) {
		    case "N"://y+a
		    	roboY = roboY+1;
		        break;
		    case "E"://x+a
		    	roboX = roboX+1;
		        break;
		    case "W"://x-a
		    	roboX = roboX-1;
		        break;
		    case "S"://y-a
		    	roboY = roboY-1;
		        break;
			}
			map[roboY][roboX] = true;
			}

		}
		
		answer(map);


		}

	}

	private static int answer(boolean[][] map) {
		int count = 0;//?????£??????????????°?????°??????
		for (int i=map.length-1; i<0; i--){
			for (int j=0; j<map[i].length; j++){
				if(map[i][j]){
					count ++;
				}
			}
			if(count == 0){
				System.out.println("Yes");
			}
			System.out.println("No");
		}
		return count;
	}

		public static void show (boolean[][] map){


for (int i=map.length-1; i<0; i--){
	for (int j=0; j<map[i].length; j++){
		System.out.print(map[i][j]);
		System.out.print("  ");

	}
}
}

Compiler output:
Main.java:1: error: unnamed classes are a preview feature and are disabled by default.
public static void main(String[] args) {
              ^
  (use --enable-preview to enable unnamed classes)
1 error
Language: Java

import java.util.Scanner;

public class MAIN {

	public static void main(String[] args) {
		Scanner sc  = new Scanner(System.in);
		while(true){
			int N =sc.nextInt();

			if(N == 0){
				break;
			}
			// ???????????????
			boolean[][] map = new boolean[21][21];

			for (int n = 0; n<N; n++){
				// int x = sc.nextInt();
				//int y = sc.nextInt();
				// ??\??????????????????
				int x = sc.nextInt();
				int y = sc.nextInt();
				map[y][x] = true;

			}
			// ????????????????????£?????¨?????????????????????????????????????????????
			// ??????????????°???????????????????????????????????£?????¨?????????false?????????
			// ??????????????°???????????????

			int commandNum =sc.nextInt();

			// robot????????¨??°
			int roboX = 10;
			int roboY = 10;


			for (int n = 0; n<commandNum; n++ ){
				String Command = sc.next();//??????????????????????????????
				int stepCount = sc.nextInt();//????????????????????°?????????
				for (int m = 0; m<stepCount; m++){
					switch (Command) {
					case "N"://y+a
						roboY = roboY+1;
						break;
					case "E"://x+a
						roboX = roboX+1;
						break;
					case "W"://x-a
						roboX = roboX-1;
						break;
					case "S"://y-a
						roboY = roboY-1;
						break;
					}
					map[roboY][roboX] = true;
				}

			}


			int count = 0;//?????£??????????????°?????°??????
			for (int i=0; i<map.length; i++){
				for (int j=0; j<map[i].length; j++){
					if(map[i][j]){
						count ++;
					}
				}
				if(count == 0){
					System.out.println("Yes");
				}
				System.out.println("No");
			}


		}

	}


}

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

import java.util.Scanner;

public class solve2000 {

	public static void main(String[] args) {
		Scanner sc  = new Scanner(System.in);
		while(true){
			int N =sc.nextInt();//??????????????°

			if(N == 0){
				break;
			}
			// ???????????????
			boolean[][] map = new boolean[21][21];

			for (int n = 0; n<N; n++){
				// int x = sc.nextInt();
				//int y = sc.nextInt();
				// ??\??????????????????
				int x = sc.nextInt();
				int y = sc.nextInt();
				map[y][x] = true;

			}
			// ????????????????????£?????¨?????????????????????????????????????????????
			// ??????????????°???????????????????????????????????£?????¨?????????false?????????
			// ??????????????°???????????????

			int commandNum =sc.nextInt();

			// robot????????¨??°
			int roboX = 10;
			int roboY = 10;

			String Command = sc.next();//??????????????????????????????
			int stepCount = sc.nextInt();//????????????????????°?????????

			for (int n = 0; n<commandNum; n++ ){

				for (int m = 0; m<stepCount; m++){
					switch (Command) {
					case "N"://y+a
						roboY++;
						map[roboY][roboX]=false;
						break;
					case "E"://x+a
						roboX++;
						map[roboY][roboX]=false;
						break;
					case "W"://x-a
						roboX--;
						map[roboY][roboX]=false;
						break;
					case "S"://y-a
						roboY--;
						map[roboY][roboX]=false;
						break;
					}

				}

			}


			boolean result = true;//??????????????£?????????????????????
			for (int i=0; i<map.length; i++){
				for (int j=0; j<map[i].length; j++){
					if(map[i][j] == true){
						result = false;//??????????????£?????????
					}
				}
				System.out.println(result ? "Yes" : "No");
			}


		}

	}


}

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

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {

		int numOfGemsCollected = 0;

		Robo robo = new Robo();

		Scanner scan = new Scanner(System.in);
		int numOfGems = scan.nextInt();

		while (numOfGems != 0) {
			Gem[] gemArray = new Gem[numOfGems];

			for (int i = 0; i < numOfGems; i++) {
				Gem gem = new Gem();
				int xOfGem = scan.nextInt();
				int yOfGem = scan.nextInt();

				gem.setX(xOfGem);
				gem.setY(yOfGem);

				gemArray[i] = gem;
			}

			//動く回数を読み込み
			int numOfMoves = scan.nextInt();

			//動く回数分だけ、方向読み込み→距離読み込みを繰り返し
			for (int m = 0; m < numOfMoves; m++) {
				String direction = scan.next();
				int distance = scan.nextInt();

				//東ならX座標を＋１
				if (direction.equals("E")) {
					for (int j = 0; j <= distance; j++) {
						robo.forwardX();
						for (int i = 0; i < numOfGems; i++) {
							if ((robo.getX() == gemArray[i].getX()) && (robo.getY() == gemArray[i].getY())) {
								numOfGemsCollected++;
							}
						}
					}
				}

				//西ならX座標をー１
				if (direction.equals("W")) {
					for (int j = 0; j < distance; j++) {
						robo.backwardX();
						for (int i = 0; i < numOfGems; i++) {
							if ((robo.getX() == gemArray[i].getX()) && (robo.getY() == gemArray[i].getY())) {
								numOfGemsCollected++;
							}
						}
					}
				}

				//北ならY座標を＋１
				if (direction.equals("N")) {
					for (int j = 0; j < distance; j++) {
						robo.forwardY();
						for (int i = 0; i < numOfGems; i++) {
							if ((robo.getX() == gemArray[i].getX()) && (robo.getY() == gemArray[i].getY())) {
								numOfGemsCollected++;
							}
						}
					}
				}

				//南ならY座標をー１
				if (direction.equals("S")) {
					for (int j = 0; j < distance; j++) {
						robo.backwardY();
						for (int i = 0; i < numOfGems; i++) {
							if ((robo.getX() == gemArray[i].getX()) && (robo.getY() == gemArray[i].getY())) {
								numOfGemsCollected++;
							}
						}
					}
				}
			}

			if (numOfGems == numOfGemsCollected) {
				System.out.println("Yes");
			} else {
				System.out.println("No");
			}
		}
	}
}



Compiler output:
Main.java:8: error: cannot find symbol
		Robo robo = new Robo();
		^
  symbol:   class Robo
  location: class Main
Main.java:8: error: cannot find symbol
		Robo robo = new Robo();
		                ^
  symbol:   class Robo
  location: class Main
Main.java:14: error: cannot find symbol
			Gem[] gemArray = new Gem[numOfGems];
			^
  symbol:   class Gem
  location: class Main
Main.java:14: error: cannot find symbol
			Gem[] gemArray = new Gem[numOfGems];
			                     ^
  symbol:   class Gem
  location: class Main
Main.java:17: error: cannot find symbol
				Gem gem = new Gem();
				^
  symbol:   class Gem
  location: class Main
Main.java:17: error: cannot find symbol
				Gem gem = new Gem();
				              ^
  symbol:   class Gem
  location: class Main
6 errors
Language: Java

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {

		int numOfGemsCollected = 0;

		Robo robo = new Robo();

		Scanner scan = new Scanner(System.in);
		int numOfGems = scan.nextInt();

		while (numOfGems != 0) {
			Gem[] gemArray = new Gem[numOfGems];

			for (int i = 0; i < numOfGems; i++) {
				Gem gem = new Gem();
				int xOfGem = scan.nextInt();
				int yOfGem = scan.nextInt();

				gem.setX(xOfGem);
				gem.setY(yOfGem);

				gemArray[i] = gem;
			}

			//動く回数を読み込み
			int numOfMoves = scan.nextInt();

			//動く回数分だけ、方向読み込み→距離読み込みを繰り返し
			for (int m = 0; m < numOfMoves; m++) {
				String direction = scan.next();
				int distance = scan.nextInt();

				//東ならX座標を＋１
				if (direction.equals("E")) {
					for (int j = 0; j <= distance; j++) {
						robo.forwardX();
						for (int i = 0; i < numOfGems; i++) {
							if ((robo.getX() == gemArray[i].getX()) && (robo.getY() == gemArray[i].getY())) {
								numOfGemsCollected++;
							}
						}
					}
				}

				//西ならX座標をー１
				if (direction.equals("W")) {
					for (int j = 0; j < distance; j++) {
						robo.backwardX();
						for (int i = 0; i < numOfGems; i++) {
							if ((robo.getX() == gemArray[i].getX()) && (robo.getY() == gemArray[i].getY())) {
								numOfGemsCollected++;
							}
						}
					}
				}

				//北ならY座標を＋１
				if (direction.equals("N")) {
					for (int j = 0; j < distance; j++) {
						robo.forwardY();
						for (int i = 0; i < numOfGems; i++) {
							if ((robo.getX() == gemArray[i].getX()) && (robo.getY() == gemArray[i].getY())) {
								numOfGemsCollected++;
							}
						}
					}
				}

				//南ならY座標をー１
				if (direction.equals("S")) {
					for (int j = 0; j < distance; j++) {
						robo.backwardY();
						for (int i = 0; i < numOfGems; i++) {
							if ((robo.getX() == gemArray[i].getX()) && (robo.getY() == gemArray[i].getY())) {
								numOfGemsCollected++;
							}
						}
					}
				}
			}

			if (numOfGems == numOfGemsCollected) {
				System.out.println("Yes");
			} else {
				System.out.println("No");
			}
		}
		scan.close();
	}
}



Compiler output:
Main.java:8: error: cannot find symbol
		Robo robo = new Robo();
		^
  symbol:   class Robo
  location: class Main
Main.java:8: error: cannot find symbol
		Robo robo = new Robo();
		                ^
  symbol:   class Robo
  location: class Main
Main.java:14: error: cannot find symbol
			Gem[] gemArray = new Gem[numOfGems];
			^
  symbol:   class Gem
  location: class Main
Main.java:14: error: cannot find symbol
			Gem[] gemArray = new Gem[numOfGems];
			                     ^
  symbol:   class Gem
  location: class Main
Main.java:17: error: cannot find symbol
				Gem gem = new Gem();
				^
  symbol:   class Gem
  location: class Main
Main.java:17: error: cannot find symbol
				Gem gem = new Gem();
				              ^
  symbol:   class Gem
  location: class Main
6 errors
Language: Java

import java.util.Scanner;



public class Main{

	class Treasure
	{
		int x;
		int y;
		boolean isTreasure;
		
		public Treasure(int x,int y)
		{
			this.x = x;
			this.y = y;
			this.isTreasure = false;
		}
		
		public void isTreasure(Robot pri_r,Robot aft_r)
		{
			if(pri_r.x == aft_r.x)
			{
				if(pri_r.y < aft_r.y)
				{
					for(int i = pri_r.y; i <= aft_r.y;i++)
					{
						this.isTreasure(pri_r.x, i);
					}
				}
				else
				{
					for(int i = aft_r.y; i <= pri_r.y;i++)
					{
						this.isTreasure(pri_r.x, i);
					}
				}
			}
			if(pri_r.y == aft_r.y)
			{
				if(pri_r.x < aft_r.x)
				{
					for(int i = pri_r.x; i <= aft_r.x;i++)
					{
						this.isTreasure(i, pri_r.y);
					}
				}
				else
				{
					for(int i = aft_r.x; i <= pri_r.x;i++)
					{
						this.isTreasure(i,pri_r.y);
					}
				}
			}
		}
		
		public void isTreasure(int x,int y)
		{
			if(this.x == x && this.y == y)
			{
				if(this.isTreasure == false)
				{
					this.isTreasure = true;
				}
			}
		}
		
	}

	class Robot
	{
		int x;
		int y;
		public Robot()
		{
			this.x = 10;
			this.y = 10;
		}
		
		public void move(char mes,int distance)
		{
			switch(mes)
			{
				case('N'):
					this.y += distance;
					break;
				case('S'):
					this.y -= distance;
					break;
				case('E'):
					this.x += distance;
					break;
				case('W'):
					this.x -= distance;
					break;
			}
		}
		
		public void printRobot()
		{
			System.out.println("(" + x + "," + y + ")");
		}
	}

	class Run
	{
		Robot aft_robot = new Robot();
		Robot pri_robot = new Robot();
		Treasure[] treasure;
		Scanner sc = new Scanner(System.in);
		int N;
		int M;
		
		public void run()
		{
			while(true)
			{
				N = sc.nextInt();
				treasure = new Treasure[N];
				if(N == 0)break;
				for(int i = 0; i < N; i++)
				{
					int x = sc.nextInt();
					int y = sc.nextInt();
					treasure[i] = new Treasure(x,y);
				}
				M = sc.nextInt();
				for(int i = 0; i < M; i++)
				{
					char mes = sc.next().charAt(0);
					int distance = sc.nextInt();
					aft_robot.move(mes,distance);
					for(int j = 0; j < N; j++)
					{
						treasure[j].isTreasure(pri_robot, aft_robot);
					}
					pri_robot.x = aft_robot.x;
					pri_robot.y = aft_robot.y;
				}
				
				boolean check = true;
				for(int i = 0; i <N; i++)
				{
					if(treasure[i].isTreasure == false) check = false;
				}
				if(check == false) System.out.println("No");
				else System.out.println("Yes");
			}
		}
	}
	
	public static void main(String[] args)
	{
		Main.run.run();
	}

}

Compiler output:
Main.java:155: error: cannot find symbol
		Main.run.run();
		    ^
  symbol:   variable run
  location: class Main
1 error
Language: Java

import java.util.Scanner;
public class vaa {
	public static void main(String[] args){
		int[][] field = new int[21][21];
		Scanner sc = new Scanner(System.in);
		while(true){
			int nowx = 10;
			int nowy = 10;
			for(int i=0;i<21;i++){
				for(int j=0;j<21;j++){
					field[i][j] = 0;
				}
			}
			int n = sc.nextInt();
			if(n == 0) break;
			for(int i=0;i<n;i++){
				int x = sc.nextInt();
				int y = sc.nextInt();
				field[x][y] = 1;
			}
			int m = sc.nextInt();
			for(int i=0;i<m;i++){
				String h = sc.next();
				int l = sc.nextInt();
				switch(h){
				case "N":
					for(int j=0;j<l;j++){
						nowy++;
						if(field[nowx][nowy] == 1){
							n--;
							field[nowx][nowy] = 0;
						}
					}
					break;
				case "S":
					for(int j=0;j<l;j++){
						nowy--;
						if(field[nowx][nowy] == 1){
							n--;
							field[nowx][nowy] = 0;
						}
					}
					break;
				case "E":
					for(int j=0;j<l;j++){
						nowx++;
						if(field[nowx][nowy] == 1){
							n--;
							field[nowx][nowy] = 0;
						}
					}
					break;
				case "W":
					for(int j=0;j<l;j++){
						nowx--;
						if(field[nowx][nowy] == 1){
							n--;
							field[nowx][nowy] = 0;
						}
					}
					break;
				}
			}
			if(n == 0) System.out.println("Yes");
			else System.out.println("No");
		}
	}
}

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

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

int main() {

  int x[21][21] = {2};
  int r[21][21] = {3};

 

  int m, n,i,j,k,l;
  int a,b,c,d,e;
  char ch[5];

  while (1) {
    k = 0;
    c = d = 9;

  for(j=0; j<20 ; j++) {
      for(i=0; i<20 ; i++) {
	x[i][j] = 2;
	r[i][j] =3;
      }
      }


  scanf("%d",&n);
  if(n == 0) {
    break;
  }


  for(i=0; i<n; i++ ) {
    scanf("%d %d",&a,&b);
    x[a-1][b-1] = 1;
    // printf("x[%d][%d] = 1",a-1,b-1);
  }

  scanf("%d",&m);

  for(l=0;l<m;l++) {

    scanf("%s %d",ch,&e);
    //  printf("ch%c  e%d\n",ch[0], e);

      if(ch[0] == 'N') {
	for(i = 1; i<=e ;i++){
	    r[c][d+i] = 1;
	    // printf("r[%d][%d] = 1\n",c, d+i);

	}
	d = d+e;
  
      } else if(ch[0] =='E') {
	for(i=1; i<=e;i++) {
	  r[c+i][d] = 1;
	  // printf("r[%d][%d] = 1\n",c+1, d);
	}
	c = c + e;
      } else if(ch[0] == 'S') {
	for(i=1;i<=e;i++) {
	  r[c][d-i] = 1;
	}
	 d = d - e;
      } else if(ch[0] == 'W') {
	for(i = 1; i<=e;i++) {
	  r[c-i][d] = 1;
	}
	
	c = c - e;
      }
  }
      for(j=0; j<20 ; j++) {
      for(i=0; i<20 ; i++) {
	if(r[i][j] == x[i][j]){
	  // printf("r=%d x = %d\n",r[i][j], x[i][j]);
	  k = k +1;
	}
      }

Compiler output:
main.c: In function 'main':
main.c:79:7: error: expected declaration or statement at end of input
   79 |       }
      |       ^
main.c:79:7: error: expected declaration or statement at end of input
main.c:79:7: error: expected declaration or statement at end of input
Language: C

#include <stdio.h>
int main(){
  int s=0,n,m,k,i,j,rx=10,ry=10,tx,ty,ta[21][21],z;
  char d;
  while(1){

    scanf("%d",&n);
    if(n==0){
      break;
    }

    for(i=0;i<=20;i++){
      for(j=0;j<=20;j++){
        ta[i][j]=0;
      }
    }

    テ」ツ??」ツ??or(i=0;i<n;i++){
      scanf("%d%d",&tx,&ty);
      ta[tx][ty]=1;
    }


    scanf("%d",&m);
    テ」ツ??」ツ??or(i=0;i<m;i++){
      scanf("%c%d",d,&z);
      ta[10][10]=0;
      switch(d){
      case 'N':
        for(j=0;j<z;ry++,j++){

          ta[rx][ry]=0;
        }
        break;

      case 'S':
        for(j=0;j<z;ry--,j++){

          ta[rx][ry]=0;
        }
        break;

      case 'E':
        for(j=0;j<z;rx++,j++){

          ta[rx][ry]=0;
        }
        break;

      case 'W':
        for(j=0;j<z;rx--,j++){

          ta[rx][ry]=0;
        }
        break;

      }

    }
        k=0;
        for(i=0;i<=20;i++){
          for(j=0;j<=20;j++){
            if(ta[i][j]=1){
              k=1;
            }
          }
        }

        if(k==1){
          printf("YES\n");
        }else{
          printf("NO\n");
        }

  }

        return 0;
}

Compiler output:
main.c: In function 'main':
main.c:18:7: error: stray '\343' in program
   18 |     <U+30C6><U+300D><U+30C4>??<U+300D><U+30C4>??or(i=0;i<n;i++){
      |             ^~~~~~~~
main.c:18:5: error: unknown type name '\U000030c6'
   18 |     テ」ツ??」ツ??or(i=0;i<n;i++){
      |     ^~
main.c:18:11: error: expected '=', ',', ';', 'asm' or '__attribute__' before '?' token
   18 |     テ」ツ??」ツ??or(i=0;i<n;i++){
      |           ^
main.c:18:13: error: stray '\343' in program
   18 |     <U+30C6><U+300D><U+30C4>??<U+300D><U+30C4>??or(i=0;i<n;i++){
      |                               ^~~~~~~~
main.c:18:33: error: expected ';' before ')' token
   18 |     テ」ツ??」ツ??or(i=0;i<n;i++){
      |                                 ^
      |                                 ;
main.c:18:33: error: expected statement before ')' token
main.c:25:7: error: stray '\343' in program
   25 |     <U+30C6><U+300D><U+30C4>??<U+300D><U+30C4>??or(i=0;i<m;i++){
      |             ^~~~~~~~
main.c:25:5: error: unknown type name '\U000030c6'
   25 |     テ」ツ??」ツ??or(i=0;i<m;i++){
      |     ^~
main.c:25:11: error: expected '=', ',', ';', 'asm' or '__attribute__' before '?' token
   25 |     テ」ツ??」ツ??or(i=0;i<m;i++){
      |           ^
main.c:25:13: error: stray '\343' in program
   25 |     <U+30C6><U+300D><U+30C4>??<U+300D><U+30C4>??or(i=0;i<m;i++){
      |                               ^~~~~~~~
main.c:25:33: error: expected ';' before ')' token
   25 |     テ」ツ??」ツ??or(i=0;i<m;i++){
      |                                 ^
      |                                 ;
main.c:25:33: error: expected statement before ')' token
Language: C

#include <stdio.h>
int main(){
  int s=0,n,m,k,i,j,rx=10,ry=10,tx,ty,ta[21][21],z;
  char d;
  while(1){

    scanf("%d",&n);
    if(n==0){
      break;
    }

    for(i=0;i<=20;i++){
      for(j=0;j<=20;j++){
        ta[i][j]=0;
      }
    }

    ??????for(i=0;i<n;i++){
      scanf("%d%d",&tx,&ty);
      ta[tx][ty]=1;
    }


    scanf("%d",&m);
    ??????for(i=0;i<m;i++){
      scanf("%c%d",d,&z);
      ta[10][10]=0;
      switch(d){
      case 'N':
        for(j=0;j<z;ry++,j++){

          ta[rx][ry]=0;
        }
        break;

      case 'S':
        for(j=0;j<z;ry--,j++){

          ta[rx][ry]=0;
        }
        break;

      case 'E':
        for(j=0;j<z;rx++,j++){

          ta[rx][ry]=0;
        }
        break;

      case 'W':
        for(j=0;j<z;rx--,j++){

          ta[rx][ry]=0;
        }
        break;

      }

    }
        k=0;
        for(i=0;i<=20;i++){
          for(j=0;j<=20;j++){
            if(ta[i][j]=1){
              k=1;
            }
          }
        }

        if(k==1){
          printf("YES\n");
        }else{
          printf("NO\n");
        }

  }

        return 0;
}

Compiler output:
main.c: In function 'main':
main.c:18:5: error: expected expression before '?' token
   18 |     ??????for(i=0;i<n;i++){
      |     ^
main.c:25:5: error: expected expression before '?' token
   25 |     ??????for(i=0;i<m;i++){
      |     ^