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

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

typedef complex<double> P;
typedef pair<double, P> C;
vector<C> circles;
#define FST first
#define SND second
typedef pair<P, P> S;

double dot(P a, P b) {
  return a.real()*b.real()+a.imag()*b.imag();
}

double cross(P a, P b) {
  return a.real()*b.imag()-a.imag()*b.real();
}

double distanceLP(S s, P a) {
  // d = |y||sin(th)| = |x||y|sin(th)/|x| = |cross(x, y)|/|x|
  return abs(cross(s.SND-s.FST, a-s.FST)) / abs(s.SND-s.FST);
}

double distanceSP(S s, P a) {
  // 2ベクトルのなす角が鈍角なら端点と１点との距離を返す
  if (dot(s.SND-s.FST, a-s.FST) < EPS) return abs(a-s.FST);
  if (dot(s.FST-s.SND, a-s.SND) < EPS) return abs(a-s.SND);
  
  return distanceLP(s, a);
}

int main() {
  int N;
  while(cin >> N && N) {
    circles.clear();
    circles.resize(N);
    for(int i=0; i<N; i++) {
      int x, y, r;
      cin >> x >> y >> r;
      circles[i] = C(r, P(x, y));
    }
    int Q; cin >> Q;
    while(Q--) {
      int x, y;
      cin >> x >> y; P taro(x, y);
      cin >> x >> y; P ogre(x, y);
      for(int i=0; i<N; i++) {
        if(distanceSP(S(taro, ogre), circles[i].SND) < circles[i].FST) {
          if(   abs(circles[i].SND-taro) > circles[i].FST
             || abs(circles[i].SND-ogre) > circles[i].FST) {
            cout << "Safe" << endl;
            goto EXIT;
          }
        }
      }
      
      cout << "Danger" << endl;
      
    EXIT:;
    }
  }
  
  return 0;
}

Compiler output:
a.cc: In function 'double distanceSP(S, P)':
a.cc:26:35: error: 'EPS' was not declared in this scope
   26 |   if (dot(s.SND-s.FST, a-s.FST) < EPS) return abs(a-s.FST);
      |                                   ^~~
a.cc:27:35: error: 'EPS' was not declared in this scope
   27 |   if (dot(s.FST-s.SND, a-s.SND) < EPS) return abs(a-s.SND);
      |                                   ^~~
Language: Java

gimport java.util.*;
import java.io.*;
import static java.lang.Math.*;

class Main {

    public static void main( final String[] args ) {

	final Scanner stdin = new Scanner( System.in );
	final int n = Integer.parseInt( stdin.nextLine() );

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

	    final String input = stdin.nextLine();
	    final char[] train = new char[53];
	    int index = 26;
	    train[index] = input.charAt( 0 );
	    
	    for ( int i = 1; i < ( input.length() + 2 ) / 3; i++ ) {
		if ( input.substring( i * 3 - 2, i * 3 ).equals( "->" ) ){
		    index++;
		} else {
		    index--;
		}
		train[index] = input.charAt( i * 3 );
	    }
	    
	    index = 0;
	    while ( train[index] == 0 ) {
		index++;
	    }
	    while ( train[index] > 0 ) {
		System.out.print( train[index] );
		index++;
	    }
	    System.out.println();
	}	
    }    
}

Compiler output:
Main.java:1: error: class, interface, enum, or record expected
gimport java.util.*;
^
Main.java:2: error: class, interface, enum, or record expected
import java.io.*;
^
Main.java:3: error: class, interface, enum, or record expected
import static java.lang.Math.*;
^
3 errors
Language: C++

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cstring>
#include <string>
#include <sstream>
#include <algorithm>
#include <iomanip>
using namespace std;

typedef vector<int> VI;
typedef vector<VI> VII;
typedef pair<int, int> PII;
typedef long long ll;

#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back;
#define MP make_pair
#define SIZE(a) int((a).size())
#define SORT(c) sort((c).begin(), (c).end())

const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = INT_MAX / 3;

int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, -1, 0, 1};

#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

string solve(string &input){
  string train(input, 0, 1);
  int f = 0, b = 0, n = 0;
  for(int i = 1; i < input.size(); i++){
    if(input[i] == '<') n++;
    else if(input[i] == '>') n--;
    else if(input[i] != '-' && n > f) { train.insert(train.begin(), input[i]); f = n;}
    else if(input[i] != '-' && n < b) { train.insert(train.end(), input[i]); b = n;}
  }
  return train;
}

int main(void){
  int n;
  cin >> n;
  for(int i = 0; i < n; i++){
    string input;
    cin >> input;
    cout << solve(input) << endl;
  }
  return 0;
}

Compiler output:
a.cc:32:17: error: 'INT_MAX' was not declared in this scope
   32 | const int INF = INT_MAX / 3;
      |                 ^~~~~~~
a.cc:16:1: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
   15 | #include <iomanip>
  +++ |+#include <climits>
   16 | using namespace std;
Language: C++

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

// int search(char[], char, int);
// void swap(char[], int, int);
void pre_connect(char[], char, int);

int main (){
    int n, i, j, count, idx;
    char str[1024], line[60], train;

    scanf("%d",&n);

    for(i=0;i<n;i++){
        scanf("%s",str);

        line[0] = str[0];
        count = 1;
        idx=0;
        for(j=2; j<strlen(str); j+=3){
            if(str[j] == '>'){
                if(line[idx+1] == str[j+1]){
                    idx++;
                } else {
                    line[count++] = str[j+1];
                    idx++;
                }
            } else {
                if(line[idx-1] == str[j+1]){
                    idx--;
                } else {
                    pre_connect(line, str[j+1], count);
                    count++;
                }
            }
        }
        line[count] = '\0';
        printf("%s\n", line);
    }
    return 0;
}

/* 
int search(char line[], char t, int count){
    int i;

    for(i=0; i<count; i++){
        if(line[i] == t){
            return i;
        }
    }
    return -1;
}

void swap(char line[], int i, int j){
    char tmp;
    tmp = line[i];
    line[i] = line[j];
    line[j] = tmp;
}
*/

void pre_connect(char line[], char t, int count){
    int i;
    char new[60];

    new[0] = t;

    for(i=1; i<=count; i++){
        new[i] = line[i-1];
    }
    new[i] = '\0';

    strcpy(line, new);
}

Compiler output:
a.cc: In function 'void pre_connect(char*, char, int)':
a.cc:65:10: error: expected unqualified-id before 'new'
   65 |     char new[60];
      |          ^~~
a.cc:67:8: error: expected type-specifier before '[' token
   67 |     new[0] = t;
      |        ^
a.cc:70:12: error: expected type-specifier before '[' token
   70 |         new[i] = line[i-1];
      |            ^
a.cc:72:8: error: expected type-specifier before '[' token
   72 |     new[i] = '\0';
      |        ^
a.cc:74:21: error: expected type-specifier before ')' token
   74 |     strcpy(line, new);
      |                     ^
Language: C++

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

int main(){
   int n;
   cin >>n;
 string s;
   cin >>s;
   for(int i=0;i<n;i++){
   int array[60];
    array[30]=s[0];
    int t=30;
   for(int i=0;i<s.length();i++){
   if(){
       t +=  1;
       array[t]=s[3*i];
   }else{
       t -= 1;
       array[t]=s[3*i];
   }
   }
   for(int i=0;i<60;i++){
       if(array[i]!=0){
           cout <<array[i];
       }
   }  
   cout <<endl;










   }
return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:14:7: error: expected primary-expression before ')' token
   14 |    if(){
      |       ^
Language: C++

#include<iostream>
#include<string>

void main(){
	int n;
	std::cin >> n;
	for (int i = 0; i < n; i++){
		char train[30];
		for (int j = 0; j < 30; j++)train[j] = '?';
		int it = 14;

		std::string str;
		std::cin >> str;

		train[it] = str[0];
		for (int j = 1; j < str.size(); j++){
			if (str[j] == '>'){
				it++;
				if (train[it] != str[j + 1])train[it] = str[j + 1];
			}
			else if (str[j] == '<'){
				it--;
				if (train[it] != str[j + 2])train[it] = str[j + 2];
			}
		}

		for (int j = 0; j < 30; j++){
			if (train[j] != '?')std::cout << train[j];
		}
		std::cout << std::endl;
	}
}

Compiler output:
a.cc:4:1: error: '::main' must return 'int'
    4 | void main(){
      | ^~~~
Language: Java

package nofill_nosubmit;
import java.util.Scanner;
public class AOJ_0131 
{
	static int a[][];
	static int light[][];
	static int first[];
	static boolean judge;
	public static void main(String[] args) 
	{
		Scanner in=new Scanner(System.in);
		int N=in.nextInt();
		while(N-->0)
		{
			a=new int[10][10];

			first=new int[10];
			judge=false;
			for(int i=0;i<10;i++)
				for(int j=0;j<10;j++)
					a[i][j]=in.nextInt();
			make(0,first);

			for(int i=0;i<10;i++)
			{
				for(int j=0;j<10;j++)
				{
					if(j!=9)
						System.out.print(light[i][j]+" ");
					else
						System.out.println(light[i][j]);
				}
			}
		}
	}

	static void make(int n, int first[])
	{
		if(judge)
			return;
		if(n==10)
		{
			light=new int[10][10];
			solve(first,light,a);
			if(judge)
				return;
		}
		else
		{
			first[n]=0;
			make(n+1,first);
			if(judge)
				return;
			first[n]=1;
			make(n+1,first);
			if(judge)
				return;
		}
	}
	static boolean solve(int first[],int light[][],int a[][])
	{
		for(int i=0;i<10;i++)
		{
			if(first[i]==1)
			{
				light[0][i]=1;

				if(a[0][i]==1)
					a[0][i]=0;
				else
					a[0][i]=1;

				if(i+1<10&&a[0][i+1]==1)
					a[0][i+1]=0;
				else if(i+1<10)
					a[0][i+1]=1;

				if(i-1>=0&&a[0][i-1]==1)
					a[0][i-1]=0;
				else if(i-1>=10)
					a[0][i-1]=1;

				if(a[1][i]==1)
					a[0][i]=0;
				else
					a[0][i]=1;
			}
		}

		for(int i=0;i<9;i++)
			for(int j=0;j<10;j++)
			{
				if(a[i][j]==1)
				{
					light[i+1][j]=1;
					lightOn(i+1,j);
				}
			}
		
		for(int i=0;i<10;i++)
		{
			for(int j=0;j<10;j++)
			{
				if(light[i][j]==0)
					judge=true;
				if(!judge)
					break;
			}
			if(!judge)
				break;
		}
		return judge;
	}

	static void lightOn(int i,int j)
	{
		if(a[i][j]==1)
			a[i][j]=0;
		else
			a[i][j]=1;

		if(j+1<10&&a[i][j+1]==1)
			a[i][j+1]=0;
		else if(j+1<10)
			a[i][j+1]=1;

		if(a[i-1][j]==1)
			a[i-1][j]=0;
		else
			a[i-1][j]=1;

		if(i+1<10&&a[i+1][j]==1)
			a[i+1][j]=0;
		else if(i+1<10)
			a[i+1][j]=1;

		if(j-1>=0&&a[i][j-1]==1)
			a[i][j-1]=0;
		else if(j-1>=0)
			a[i][j-1]=1;
	}
}

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

#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <fstream>
#include <sstream>
#include <math.h>
#include <queue>
#include <stack>
#include <math.h>


using namespace std;


void f(bool box[12][12]){
    for(int i=1; i<=10; i++){
        for(int j=1; j<=10; j++){
            cout<<box[i][j];
        }
        cout<<endl;
    }
    cout<<endl;
}

int main(){
    int n;
    while(cin>>n){
        
        bool box[12][12]={0};
        
        for(int i=1; i<=10; i++){
            for(int j=1; j<=10; j++){
                cin>>box[i][j];
            }
        }
        //cout<<"----------------------"<<endl;
        
        bool box2[12][12]={0};

        for(int i=0; i<(1<<10 - 1); i++){
            memcpy(box2, box, sizeof(box));
            int l[12][12]={0};
            for(int j=1; j<=10; j++){
                l[0][j]= (i>>j)%2;
            }
            
            for(int j=1; j<=10; j++){
                for(int k=1; k<=10; k++){
                    if(l[j-1][k]==1){
                        box2[j][k]=(box2[j][k]+1)%2;
                        box2[j][k+1]=(box2[j][k+1]+1)%2;
                        box2[j][k-1]=(box2[j][k-1]+1)%2;
                        box2[j-1][k]=(box2[j-1][k]+1)%2;
                        box2[j+1][k]=(box2[j+1][k]+1)%2;
                    }
                }
                
                for(int k=1; k<=10; k++){
                    l[j][k]=box2[j][k];
                }
            }
            
            bool end_flag=true;
            for(int i=1; i<=10; i++){
                if(l[10][i]==1){
                    end_flag=false;
                    break;
                }
            }
            
            
            if(end_flag){
                for(int i=1; i<=10; i++){
                    for(int j=1; j<=10; j++){
                        cout<<l[i][j];
                        if(j==10)break;
                        cout<<" ";
                    }
                    cout<<endl;
                }
                break;
            }
        }
        //cout<<"============================"<<endl;

        
        
    }
}

Compiler output:
a.cc: In function 'int main()':
a.cc:43:13: error: 'memcpy' was not declared in this scope
   43 |             memcpy(box2, box, sizeof(box));
      |             ^~~~~~
a.cc:12:1: note: 'memcpy' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
   11 | #include <math.h>
  +++ |+#include <cstring>
   12 |
Language: C++

#include <iostream>

using namespace std;

int main() {
    int n;
    cin >> n;
    int state[10][10];
    int ans[10][10];
    while (n --) {
        memset(state, 0, sizeof(state));
        memset(ans, 0, sizeof(ans));
        for (int i=0; i<10; ++i) {
            for (int j=0; j<10; ++j) {
                cin >> state[i][j];
            }
        }
        for (int i=0; i<10; ++i) {
            for (int j=0; j<10; ++j) {
                if (state[i][j] == 1) {
                    state[i][j]     = 1 - state[i][j];
                    state[i+1][j-1] = 1 - state[i+1][j-1];
                    state[i+1][j]   = 1 - state[i+1][j];
                    state[i+1][j+1] = 1 - state[i+1][j+1];
                    state[i+2][j]   = 1 - state[i+2][j];
                    ans[i+1][j] = 1;
                }
            }
        }
        for (int i=0; i<10; ++i) {
            for (int j=0; j<10; ++j) {
                cout << (j == 0 ? "" : " ") << ans[i][j];
            }
            cout << endl;
        }
    }
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:11:9: error: 'memset' was not declared in this scope
   11 |         memset(state, 0, sizeof(state));
      |         ^~~~~~
a.cc:2:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
    1 | #include <iostream>
  +++ |+#include <cstring>
    2 |
Language: C++

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int dx[] = {0, -1, 0, 1, 0};
const int dy[] = {-1, 0, 0, 0, 1};

int n;
int input[10][10], state[10][10], ans[10][10];

void pass(int y, int x) {
    for (int i=0; i<5; ++i) {
        if (0 <= y + dy[i] && y + dy[i] < 10 && 0 <= x + dx[i] && x + dx[i] < 10) {
            state[y + dy[i]][x + dx[i]] = !state[y + dy[i]][x + dx[i]];
        }
    }
    ans[y][x] = !ans[y][x];
}

int main() {
    cin >> n;
    while (n --) {
        for (int i=0; i<10; ++i) {
            for (int j=0; j<10; ++j) {
                cin >> input[i][j];
            }
        }
        for (int bt=0; bt<(1<<10); ++bt) {
            memcpy(state, input, sizeof(input));
            memset(ans, 0, sizeof(ans));
            for (int j=0; j<10; ++j) {
                if ((bt>>j) & 1) {
                    pass(0, j);
                }
            }
            for (int i=1; i<10; ++i) {
                for (int j=0; j<10; ++j) {
                    if (state[i-1][j] == 1) {
                        pass(i, j);
                    }
                }
            }
            if (accumulate(state[9], state[9] + 10, 0) == 0) break;
        }
        for (int i=0; i<10; ++i) {
            for (int j=0; j<10; ++j) {
                cout << (j == 0 ? "" : " ") << ans[i][j];
            }
            cout << endl;
        }
    }
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:45:17: error: 'accumulate' was not declared in this scope
   45 |             if (accumulate(state[9], state[9] + 10, 0) == 0) break;
      |                 ^~~~~~~~~~
Language: C++

#include <iostream>
#include <cstring>
#include <algorithm>
#include <functional>

using namespace std;

const int dx[] = {0, -1, 0, 1, 0};
const int dy[] = {-1, 0, 0, 0, 1};

int n;
int input[10][10], state[10][10], ans[10][10];

void pass(int y, int x) {
    for (int i=0; i<5; ++i) {
        if (0 <= y + dy[i] && y + dy[i] < 10 && 0 <= x + dx[i] && x + dx[i] < 10) {
            state[y + dy[i]][x + dx[i]] = !state[y + dy[i]][x + dx[i]];
        }
    }
    ans[y][x] = !ans[y][x];
}

int main() {
    cin >> n;
    while (n --) {
        for (int i=0; i<10; ++i) {
            for (int j=0; j<10; ++j) {
                cin >> input[i][j];
            }
        }
        for (int bt=0; bt<(1<<10); ++bt) {
            memcpy(state, input, sizeof(input));
            memset(ans, 0, sizeof(ans));
            for (int j=0; j<10; ++j) {
                if ((bt>>j) & 1) {
                    pass(0, j);
                }
            }
            for (int i=1; i<10; ++i) {
                for (int j=0; j<10; ++j) {
                    if (state[i-1][j] == 1) {
                        pass(i, j);
                    }
                }
            }
            if (accumulate(state[9], state[9] + 10, 0) == 0) break;
        }
        for (int i=0; i<10; ++i) {
            for (int j=0; j<10; ++j) {
                cout << (j == 0 ? "" : " ") << ans[i][j];
            }
            cout << endl;
        }
    }
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:46:17: error: 'accumulate' was not declared in this scope
   46 |             if (accumulate(state[9], state[9] + 10, 0) == 0) break;
      |                 ^~~~~~~~~~
Language: C++

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int dx[] = {0, -1, 0, 1, 0};
const int dy[] = {-1, 0, 0, 0, 1};

int n;
int input[10][10], state[10][10], ans[10][10];

void pass(int y, int x) {
    for (int i=0; i<5; ++i) {
        if (0 <= y + dy[i] && y + dy[i] < 10 && 0 <= x + dx[i] && x + dx[i] < 10) {
            state[y + dy[i]][x + dx[i]] = !state[y + dy[i]][x + dx[i]];
        }
    }
    ans[y][x] = !ans[y][x];
}

int main() {
    ios::sync_with_stdio(false);
    cin >> n;
    while (n --) {
        for (int i=0; i<10; ++i) {
            for (int j=0; j<10; ++j) {
                cin >> input[i][j];
            }
        }
        for (int bt=0; bt<(1<<10); ++bt) {
            memcpy(state, input, sizeof(input));
            memset(ans, 0, sizeof(ans));
            for (int j=0; j<10; ++j) {
                if ((bt>>j) & 1) {
                    pass(0, j);
                }
            }
            for (int i=1; i<10; ++i) {
                for (int j=0; j<10; ++j) {
                    if (state[i-1][j] == 1) {
                        pass(i, j);
                    }
                }
            }
            if (accumulate(state[9], state[9] + 10, 0) == 0) break;
        }
        for (int i=0; i<10; ++i) {
            for (int j=0; j<10; ++j) {
                cout << (j == 0 ? "" : " ") << ans[i][j];
            }
            cout << endl;
        }
    }
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:46:17: error: 'accumulate' was not declared in this scope
   46 |             if (accumulate(state[9], state[9] + 10, 0) == 0) break;
      |                 ^~~~~~~~~~
Language: C++

#include <vector>
#include <iostream>
#include <list>

std::list<int> dfs(std::vector<std::vector<bool>> &state, const int &idx = 1) {
	if (idx < 10) {
		int res = 0;
		for (auto i = 0; i < 10; ++i) {
			res <<= 1;
			if (state.at(idx - 1).at(i)) {
				res += 1;
				for (const auto &index : { i - 1, i, i + 1 }) {
					if (index >= 0 && index < 10) {
						state.at(idx).at(index) = !state.at(idx).at(index);
					}
				}
				if (idx != 9) {
					state.at(idx + 1).at(i) = !state.at(idx + 1).at(i);
				}
			}
		}
		auto list = dfs(state, idx + 1);
		if (list.size() + idx == 9) {
			list.push_front(res);
			return list;
		}
		else {
			return list;
		}
	}
	else {
		bool is_on = false;
		for (const auto &cell : state.at(9)) {
			is_on = is_on || cell;
		}
		if (is_on) {
			return std::list<int>{0};
		}
		else {
			return std::list<int>{};
		}
	}
}
std::list<int> solve(std::vector<std::vector<bool>> &state) {
	for (auto i = 0; i < 1023; ++i) {
		auto copy = state;
		for (auto j = 0; j < 10; ++j) {
			if ((i & (1 << j)) != 0) {
				for (const auto &idx : { j - 1, j, j + 1 }) {
					if (idx >= 0 && idx < 10) {
						copy.at(0).at(idx) = !copy.at(0).at(idx);
					}
				}
				copy.at(1).at(j) = !copy.at(1).at(j);
			}
		}
		auto list = dfs(copy);
		if (list.size() == 9) {
			list.push_front(i);
			return list;
		}
	}
	return std::list<int>{};
}
int main() {
	int n;
	for (std::cin >> n; n > 0; --n) {
		std::vector<std::vector<bool>> state(10, std::vector<bool>(10, false));
		bool input;
		for (auto &line : state) {
			for (auto &cell : line) {
				std::cin >> input;
				cell = input;
			}
		}
		auto res = solve(state);
		for (const auto &line : res) {
			for (auto i = 512; i > 0; i >>= 1) {
				std::cout << static_cast<int>((i & (line)) != 0) << ((i != 1) ? ' ' : '\n');
			}
		}
	}
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:71:43: error: cannot bind non-const lvalue reference of type 'std::_Bit_reference&' to an rvalue of type 'std::_Bit_iterator::reference'
   71 |                         for (auto &cell : line) {
      |                                           ^~~~
Language: C++

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<stack>
#include<functional>
#include<list>
using namespace std;

int c[10][10];
int f[10][10];
bool s[10][10];
int hanten[2] = { 1,0 };
int dx[5] = { -1,0,0,1,0 }, dy[5] = { 0,-1,1,0,0 };
int main() {
	int a; cin >> a;
	for (int b = 0; b < a; b++) {
		memset(s, false, sizeof(s));
		for (int d = 0; d < 10; d++) {
			for (int e = 0; e < 10; e++) {
				scanf("%d",&c[d][e]);
			}
		}
		for (int g = 0; g < 1024; g++) {
			for (int h = 0; h < 10; h++) {
				for (int i = 0; i < 10; i++) {
					f[h][i] = c[h][i];
				}
			}
			for (int h = 0; h < 10; h++) {
				if (g & (1 << h)) {
					s[0][h] = true;
					for (int i = 0; i < 5; i++) {
						int x = dx[i], y = h + dy[i];
						if (x >= 0 && x < 10 && y >= 0 && y < 10) {
							f[x][y] = hanten[f[x][y]];
						}
					}
				}
			}
			for (int h = 1; h < 10; h++) {
				for (int i = 0; i < 10; i++) {
					if (f[h - 1][i]) {
						s[h][i] = true;
						for (int j = 0; j < 5; j++) {
							int x = h+dx[j], y = i + dy[j];
							if (x >= 0 && x < 10 && y >= 0 && y < 10) {
								f[x][y] = hanten[f[x][y]];
							}
						}
					}
				}
			}
			bool K = true;
			for (int i = 0; i < 10; i++) {
				for (int j = 0; j < 10; j++) {
					if (f[i][j])K = false;
				}
			}
			if (K) {
				for (int i = 0; i < 10; i++) {
					for (int j = 0; j < 10; j++) {
						if (j)cout << " ";
						cout << s[i][j];
					}
					cout << endl;
				}
			}
		}
	}
}

Compiler output:
a.cc: In function 'int main()':
a.cc:21:17: error: 'memset' was not declared in this scope
   21 |                 memset(s, false, sizeof(s));
      |                 ^~~~~~
a.cc:11:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
   10 | #include<list>
  +++ |+#include <cstring>
   11 | using namespace std;
Language: C++

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

int c[10][10];
int f[10][10];
bool s[10][10];
int hanten[2] = { 1,0 };
int dx[5] = { -1,0,0,1,0 }, dy[5] = { 0,-1,1,0,0 };
int main() {
	int a; cin >> a;
	for (int b = 0; b < a; b++) {
		memset(s, false, sizeof(s));
		for (int d = 0; d < 10; d++) {
			for (int e = 0; e < 10; e++) {
				scanf("%d",&c[d][e]);
			}
		}
		for (int g = 0; g < 1024; g++) {
			for (int h = 0; h < 10; h++) {
				for (int i = 0; i < 10; i++) {
					f[h][i] = c[h][i];
				}
			}
			for (int h = 0; h < 10; h++) {
				if (g & (1 << h)) {
					s[0][h] = true;
					for (int i = 0; i < 5; i++) {
						int x = dx[i], y = h + dy[i];
						if (x >= 0 && x < 10 && y >= 0 && y < 10) {
							f[x][y] = hanten[f[x][y]];
						}
					}
				}
			}
			for (int h = 1; h < 10; h++) {
				for (int i = 0; i < 10; i++) {
					if (f[h - 1][i]) {
						s[h][i] = true;
						for (int j = 0; j < 5; j++) {
							int x = h+dx[j], y = i + dy[j];
							if (x >= 0 && x < 10 && y >= 0 && y < 10) {
								f[x][y] = hanten[f[x][y]];
							}
						}
					}
				}
			}
			bool K = true;
			for (int i = 0; i < 10; i++) {
				for (int j = 0; j < 10; j++) {
					if (f[i][j])K = false;
				}
			}
			if (K) {
				for (int i = 0; i < 10; i++) {
					for (int j = 0; j < 10; j++) {
						if (j)cout << " ";
						cout << s[i][j];
					}
					cout << endl;
				}
			}
		}
	}
}

Compiler output:
a.cc:1:23: warning: extra tokens at end of #include directive
    1 | #include<bits/stdc++>h>
      |                       ^
a.cc:1:9: fatal error: bits/stdc++>: No such file or directory
    1 | #include<bits/stdc++>h>
      |         ^~~~~~~~~~~~~~
compilation terminated.
Language: C++

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

int n,s,y,x,i;
int d[12][12],b[12][12],a[12][12];
int dx[] = { 0,0,0,1,-1};
int dy[] = {-1,1,0,0, 0};

void flip(x, y)
{
	a[y][x] = 1;
	for(i=0; i<5; i++)
	{
		b[y+dy[i]][x+dx[i]] = 1-b[y+dy[i]][x+dx[i]];
	}
}

int main()
{
	cin >> n;
	while(n--)
	{
		for(y=1; y<=10; y++)
		for(x=1; x<=10; x++)
		{
			cin >> d[y][x];
		}

		for(i=0; i<1024; i++)
		{
			memset(a,0,sizeof(a));
			memcpy(b,d,sizeof(d));

			for(y=1,x=1; x<=10; x++)
			{
				if((i>>(x-1))&1) flip(x,y);
			}

			for(y=2; y<=10; y++)
			for(x=1; x<=10; x++)
			{
				if(b[y-1][x]) flip(x,y);
			}

			for(y=10,x=1,s=0; x<=10; x++)
			{
				s+=b[y][x];
			}

			if(s==0) break;
		}

		for(y=1; y<=10; y++)
		{
			for(x=1; x<=10; x++)
			{
				cout << a[y][x] << (x==10?"":" ");
			}
			cout << endl;
		}
	}
}

Compiler output:
a.cc:10:6: error: variable or field 'flip' declared void
   10 | void flip(x, y)
      |      ^~~~
a.cc: In function 'int main()':
a.cc:37:50: error: 'flip' was not declared in this scope
   37 |                                 if((i>>(x-1))&1) flip(x,y);
      |                                                  ^~~~
a.cc:43:47: error: 'flip' was not declared in this scope
   43 |                                 if(b[y-1][x]) flip(x,y);
      |                                               ^~~~
Language: C++

#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class t>
using table = vector<vector<t>>;
const ld eps=1e-9;

//// < "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\a.txt"


vector<vector<int>>rotate(const vector<vector<int>>&field) {
	vector<vector<int>>newfield(field[0].size(), vector<int>(field.size()));
	for (int y = 0; y < field.size(); ++y) {
		for (int x = 0; x < field[0].size(); ++x) {
			newfield[y][x] = field[field[0].size() - x - 1][y];
		}
	}
	return newfield;
}
struct piece_ob {
	vector<vector<int>>pob;
	int ulx, uly;
	piece_ob(const vector<vector<int>>&pob_):pob(pob_) {
		for (int y = 0; y < pob.size(); ++y) {
			for (int x = 0; x < pob[0].size(); ++x) {
				if (pob[y][x]) {
					uly = y;
					ulx = x;
					return;
				}
			}
		}
	}
};
struct piece {
	vector<piece_ob>pis;
};
vector<piece>pieces;

bool check(const vector<vector<int>>&field,set<int>&rest) {
	for (int y = 0; y < field.size(); ++y) {
		for (int x = 0; x < field[0].size(); ++x) {
			if (!field[y][x]) {
				bool aok = true;
				for (auto r : rest) {
					for (int i = 0; i < 4; ++i) {
						piece_ob p(pieces[r].pis[i]);
						for (int dy = 0; dy < p.pob.size(); ++dy) {
							const int ay = y + dy - p.uly;
							for (int dx = 0; dx < p.pob[0].size(); ++dx) {
								const int ax = x + dx - p.ulx;
								if (p.pob[dy][dx]) {
									if(ay>=0&&a)
								}
							}
						}

					}

				}
			}
		}
	}
}

int main() {
	int H, W; cin >> H >> W;
	vector<vector<int>>base(H, vector<int>(W));
	for (int y = 0; y < H; ++y) {
		string st; cin >> st;
		for (int x = 0; x < W; ++x) {
			if (st[x] == '#')base[y][x] = true;

		}
	}
	int N; cin >> N;
	for (int i = 0; i < N; ++i) {
		int H,W; cin >> H >> W;
		vector<vector<int>>apiece(H, vector<int>(W));
		for (int y = 0; y < H; ++y) {
			string st; cin >> st;
			for (int x = 0; x < W; ++x) {
				if (st[x] == '#')apiece[y][x] = true;
			}
		}
		piece p;
		for (int j = 0; j < 4; ++j) {
			piece_ob ob(apiece);
			p.pis.push_back(ob);
			apiece = rotate(apiece);
		}
		pieces.push_back(p);
	}
	int P; cin >> P;
	for (int i = 0; i < P; ++i) {
		int K; cin >> K;
		for (int j = 0; j < K; ++j) {
			int a; cin >> a;
		}
	}
	return 0;
}

Compiler output:
a.cc: In function 'bool check(const std::vector<std::vector<int> >&, std::set<int>&)':
a.cc:56:83: error: 'a' was not declared in this scope; did you mean 'ax'?
   56 |                                                                         if(ay>=0&&a)
      |                                                                                   ^
      |                                                                                   ax
a.cc:57:65: error: expected primary-expression before '}' token
   57 |                                                                 }
      |                                                                 ^
a.cc:67:1: warning: no return statement in function returning non-void [-Wreturn-type]
   67 | }
      | ^
Language: C++

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

int H, W, h[10], w[10], n;
char f[21][21], c[10][21][21], a[21][21];
bool ok[10];
void rotate(int t) {
	rep(i, h[t])rep(j, w[t])a[i][j] = c[t][i][j];
	fill(c[t][0], c[t][21], 0);
	rep(i, w[t])rep(j, h[t])c[t][i][j] = a[h[t] - j - 1][i];
	swap(h[t], w[t]);
}
bool dfs(int p) {
	if (p == n) {
		rep(i, H)rep(j, W) {
			if (f[i][j] == '.')return false;
		}
		return true;
	}
	if (!ok[p])return dfs(p + 1);
	rep(l, 4) {
		rotate(p);
		rep(i, H - h[p] + 1)rep(j, W - w[p] + 1) {
			rep(k, h[p])rep(t, w[p]) {
				if (c[p][k][t] == '#'&&f[i + k][j + t] == '#')goto g;
			}
			rep(k, h[p])rep(t, w[p]) {
				if (c[p][k][t] == '#')f[i + k][j + t] = '#';
			}
			int ret = dfs(p + 1);
			rep(k, h[p])rep(t, w[p]) {
				if (c[p][k][t] == '#')f[i + k][j + t] = '.';
			}
			if (ret)return true;
		g:;
		}
	}
	return false;
}
int main() {
	while (scanf("%d%d", &H, &W), H) {
		rep(i, H)scanf("%s", f[i]);
		scanf("%d", &n);
		rep(i, n) {
			scanf("%d%d", &h[i], &w[i]);
			rep(j, h[i])scanf("%s", c[i][j]);
		}
		int p; scanf("%d", &p);
		rep(i, p) {
			int k; scanf("%d", &k);
			memset(ok, 0, sizeof(ok));
			rep(j, k) {
				int t; scanf("%d", &t); t--;
				ok[t] = 1;
			}
			puts(dfs(0) ? "YES" : "NO");
		}
	}
}

Compiler output:
a.cc: In function 'bool dfs(int)':
a.cc:36:17: error: jump to label 'g'
   36 |                 g:;
      |                 ^
a.cc:26:84: note:   from here
   26 |                                 if (c[p][k][t] == '#'&&f[i + k][j + t] == '#')goto g;
      |                                                                                    ^
a.cc:31:29: note:   crosses initialization of 'int ret'
   31 |                         int ret = dfs(p + 1);
      |                             ^~~
Language: C++

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

int H,W;

typedef vector<string> P;

P V;
vector<P> K;
vector<int> Ans;
int n;

bool same[20][20];

P fill(P All,int ny,int nx,int k,int r){

	int h=K[k].size(),w=K[k][0].size();
	P temp;
	if(r==0) temp=K[k];
	if(r==1){
		for(int x=w-1;x>=0;x--){
			string s="";
			for(int y=0;y<h;y++)
				s+=K[k][y][x];
			temp.push_back(s);
		}
	}
	if(r==2){
		for(int y=h-1;y>=0;y--){
			string s="";
			for(int x=w-1;x>=0;x--)
				s+=K[k][y][x];
			temp.push_back(s);
		}
	}
	if(r==3){
		for(int x=0;x<w;x++){
			string s="";
			for(int y=h-1;y>=0;y--)
				s+=K[k][y][x];
			temp.push_back(s);
		}
	}
	int sy=0,sx=0,count=0;
	while(temp[sy][sx]!='#'){count++;sx++;}
	nx-=count;

	for(int y=0;y<temp.size();y++)
		for(int x=0;x<temp[y].size();x++){
			if(ny+y<0 || nx+x<0 || ny+y>=H || nx+x>=W){return P(1,"");}
			if(temp[y][x]!='#') continue;
			if(All[ny+y][nx+x]=='#')  return P(1,"");
			All[ny+y][nx+x]='#';
		}

		return All;
}

void check(P All,int y,int x,int bit){
	if(All[y][x]=='#'){
		if(y==H-1 && x==W-1){Ans.push_back(bit); return;}
		if(x==W-1)check(All,y+1,0,bit);
		else check(All,y,x+1,bit);
	}
	else{
		for(int i=0;i<n;i++){
			int nb=1<<i;
			if(bit&nb) continue;

			bool ok=true;
			for(int j=0;j<i;j++)
				if(same[j][i] && !(bit&1<<j)){
					ok=false;
					break;
				}
			if(!ok) break;

			for(int r=0;r<4;r++){
				P next=fill(All,y,x,i,r);
				if(next[0].size()==0) continue;
				check(next,y,x,nb|bit);
			}
		}
	}
}


void solve()
{
	V.clear();
	V.resize(H);
	Ans.clear();
	memset(same,false,sizeof(same));
	for(int i=0;i<H;i++){
		string s; cin>>s; V[i]=s;
	}
	cin>>n; K.clear(); K.resize(n);
	for(int i=0;i<n;i++){
		int h,w; cin>>h>>w;
		string s;
		K[i].resize(h);
		for(int y=0;y<h;y++){cin>>s;K[i][y]=s;}
	}

	for(int i=0;i<n;i++)
		for(int j=i+1;j<n;j++){
			if(K[i]==K[j]){
				same[i][j]=true;
				same[j][i]=true;
			}
		}

	check(V,0,0,0);

	int T;cin>>T;
	for(int i=0;i<T;i++){
		int num;cin>>num;
		vector<int> test;
		int bit=0;
		for(int j=0;j<num;j++){int temp;cin>>temp;bit=bit|1<<(temp-1);}
		bool ok=false;
		for(int j=0;j<Ans.size();j++){
			if(Ans[j]==bit) ok=true;
		}
		if(ok) cout<<"YES\n";
		else cout<<"NO\n";
	}

}


int main()
{
	while(cin>>H>>W){
		if(H==0) break;
		solve();
	}
	return 0;
}

Compiler output:
a.cc: In function 'void solve()':
a.cc:95:9: error: 'memset' was not declared in this scope
   95 |         memset(same,false,sizeof(same));
      |         ^~~~~~
a.cc:4:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
    3 | #include<vector>
  +++ |+#include <cstring>
    4 | using namespace std;
Language: C

#include<stdio.h>

char MAP[8][9];//??????????????±
void rotate(){//????????????90????????¢
	char bM[8][9];
	memcpy(bM,MAP,72);
	for(int i=0;i<8;i++){
		for(int j=0;j<8;j++){
			MAP[i][j]=bM[7-j][i];
		}
	}
}
void showmap(){//??????????????????
	for(int i=0;i<8;i++){
		printf("%s\n",MAP[i]);
	}
}
int main(){
	for(int i=0;i<8;i++){
		scanf("%s",MAP[i]);
	}
	printf("90\n");
	rotate();
	showmap();
	printf("180\n");
	rotate();
	showmap();
	printf("270\n");
	rotate();
	showmap();
	return 0;
}

Compiler output:
main.c: In function 'rotate':
main.c:6:9: error: implicit declaration of function 'memcpy' [-Wimplicit-function-declaration]
    6 |         memcpy(bM,MAP,72);
      |         ^~~~~~
main.c:2:1: note: include '<string.h>' or provide a declaration of 'memcpy'
    1 | #include<stdio.h>
  +++ |+#include <string.h>
    2 | 
main.c:6:9: warning: incompatible implicit declaration of built-in function 'memcpy' [-Wbuiltin-declaration-mismatch]
    6 |         memcpy(bM,MAP,72);
      |         ^~~~~~
main.c:6:9: note: include '<string.h>' or provide a declaration of 'memcpy'
Language: C

#include"env.h"
char s[72],r[72];
R(){
	int x,y;
	memcpy(s,r,71);
	for(y=0;y<8;y++)
		for(x=0;x<8;x++)
			r[x+y*9]=s[y+(7-x)*9];
	puts(r);
}
main(i){
	read(0,r,71);
	for(i=1;i<=3;i++){
		printf("%d\n",90*i);
		R();
	}
	exit(0);
}

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

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

int rotate(char pat[8][9]) {
	char buf[8][9];
	int x,y;
	for(y=0;y<8;y++) {
		for(x=0;x<8;x++) {
			buf[x][8-y]=pat[y][x];
		}
	}
	memcpy(pat,buf,sizeof(pat));
}

int main(void) {
	char buf[8][9];
	int i;
	for(i=0;i<8;i++)scanf("%s",buf[i]);
	rotate(buf);
	puts("90");
	for(i=0;i<8;i++)printf("%s\n",buf[i]);
	rotate(buf);
	puts("180");
	for(i=0;i<8;i++)printf("%s\n",buf[i]);
	rotate(buf);
	puts("270");
	for(i=0;i<8;i++)printf("%s\n",buf[i]);
	return 0;
}

Compiler output:
main.c:2:2: error: invalid preprocessing directive #incldue; did you mean #include?
    2 | #incldue <string.h>
      |  ^~~~~~~
      |  include
main.c: In function 'rotate':
main.c:12:9: error: implicit declaration of function 'memcpy' [-Wimplicit-function-declaration]
   12 |         memcpy(pat,buf,sizeof(pat));
      |         ^~~~~~
main.c:2:1: note: include '<string.h>' or provide a declaration of 'memcpy'
    1 | #include <stdio.h>
  +++ |+#include <string.h>
    2 | #incldue <string.h>
main.c:12:9: warning: incompatible implicit declaration of built-in function 'memcpy' [-Wbuiltin-declaration-mismatch]
   12 |         memcpy(pat,buf,sizeof(pat));
      |         ^~~~~~
main.c:12:9: note: include '<string.h>' or provide a declaration of 'memcpy'
main.c:12:30: warning: 'sizeof' on array function parameter 'pat' will return size of 'char (*)[9]' [-Wsizeof-array-argument]
   12 |         memcpy(pat,buf,sizeof(pat));
      |                              ^
main.c:4:17: note: declared here
    4 | int rotate(char pat[8][9]) {
      |            ~~~~~^~~~~~~~~
Language: C

#include <stdio.h>
#include <conio.h>
#define N 8

int main(void)
{
	int i,j,k;
	char sq[N][N];
	char change[N][N];

	for(i=0; i<N; i++)
		for(j=0; j<N; j++)
			sq[i][j]=getche();
	for(k=1; k<=3; k++){
		printf("%d\n",90*k);
		for(i=0; i<N; i++)
			for(j=0; j<N; j++)
				change[i][j]=sq[i][j];	
		for(i=0; i<N; i++){
			for(j=0; j<N; j++){
				sq[i][j]=change[N-1-j][i];
				printf("%c",sq[i][j]);
			}
			puts("");
		}
	}

	return 0;
}

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

#include <iostream>
#include <map>
#include <cstdio>
using namespace std;

char MAP[8][9];//}bvîñ

void rotate(){//}bvð90xñ]
  char bM[8][9];
  memcpy(bM,MAP,72);
  for(int i = 0 ; i < 8 ; i++){
    for(int j = 0 ; j < 8 ; j++){
      MAP[i][j] = bM[7-j][i];
    }
  }
}
void showmap() {//}bvðoÍ
  for(int i = 0 ; i < 8 ; i++){
    printf("%s\n",MAP[i]);
  }
}
int main(){
  for(int i = 0 ; i < 8 ; i++){
    scanf("%s",MAP[i]);
  }
  for(int i = 1 ; i <= 3 ; i++) {
    printf("%d\n", 90*i);
    rotate();
    showmap();
  }
  return 0;
}

Compiler output:
a.cc: In function 'void rotate()':
a.cc:10:3: error: 'memcpy' was not declared in this scope
   10 |   memcpy(bM,MAP,72);
      |   ^~~~~~
a.cc:4:1: note: 'memcpy' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
    3 | #include <cstdio>
  +++ |+#include <cstring>
    4 | using namespace std;
Language: C++

#include <iostream>
using namespace std;

int main(){
  string mat[8][8];
  
  for(int i = 0 ; i < 8 ; i++)
    for(int j = 0 ; j < 8 ; j++)
      cin >> mat[i][j];

  cout << "90" << endl;
  for(int i = 0 ; i < 8 ; i++)
    for(int j = 0 ; j < 8 ; j++)
      cout << mat[8-i-1][j];

  cout << "180" << endl;
  for(int i = 0 ; i < 8 ; i++)
    for(int j = 0 ; j < 8 ; j++)
      cout << mat[8-i-1][8-j-1];

  cout << "270" << endl;
  for(int i = 0 ; i < 8 ; i++)
    for(int j = 0 ; j < 8 ; j++)
      cout << mat[i][8-j-1];



  retunrn 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:28:3: error: 'retunrn' was not declared in this scope
   28 |   retunrn 0;
      |   ^~~~~~~
Language: Java


import java.io.*;
import java.util.*;


// 2011/10/23

// 0134 oû²¸
public class Main {

	// C return falseÅ¨µÜ¢
	boolean main() throws IOException {

		int size = 0;
		try {
			size = readIntArray()[0];
		} catch(Exception e) {
			return false;
		}
		
		long sum = 0;
		for(int i = 0; i < size; i++) {
			sum += readIntArray()[0];
		}
		System.out.printf("%d\n", sum / size);
		
		return false;
		return true; // ³íI¹ Ö
	}
	

//	private final static boolean DEBUG = true;  // debug
	private final static boolean DEBUG = false; // release

	public static void main(String[] args) throws IOException {

		if (DEBUG) {
			log = System.out;
			
			String inputStr = "1:15:";

			inputStr = inputStr.replace(":", "\n");

			reader = new BufferedReader(new StringReader(inputStr)); 

		}
		else {
			log = new PrintStream(new OutputStream() { public void write(int b) {} } ); // «ÌÄ
			reader = new BufferedReader(new InputStreamReader(System.in)); // R\[©ç
		}
		
		int N = Integer.MAX_VALUE;
		//int N = readIntArray()[0];

		for(int i = 0; i < N; i++) {
			boolean b = new Main().main();
			if (!b)
				break;
		}		
		
		reader.close();
	}

	
	static PrintStream log;
	static BufferedReader reader;
	

	// WüÍæè1sªÌæØè¶æØèÅÌ®lðÇÞ
	// EOFÌêÍnullðÔ·
	private static int[] readIntArray() throws IOException {

		String s = null;
		for(;;) {
			s = reader.readLine();
//			log.printf("%s\n", s);
			if (s == null)
				return null;
			s = s.trim();
			if (s.length() != 0) // ¦¦¦@Ç¤àËRósðÇÞ±Æª éBÇÝòÎ·Æ¤Ü­¢­çµ¢BBBB
				break;
		}
		
		String[] sp = s.split("[ ,]"); // æØè¶ÍXy[X©J}
		int[] a = new int[sp.length];
		for(int i = 0; i < sp.length; i++) {
			a[i] = Integer.parseInt(sp[i]);
		}
		return a;
	}
		
}

Compiler output:
Main.java:28: error: unreachable statement
		return true; // ?????I?? ????
		^
1 error
Language: Java

public class Main{

    public static void main(String a[])
        throws java.io.IOException{
        Scanner scan = new Scanner(System.in);
        int n =scan.nextInt();
        long sum=0;
        while(scan.hasNext()){
            sum+=scan.nextInt();
    }
        System.out.println(sum/n);
    }
}

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

import java.util.Scanner;
public class AOJ0134 {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		long n = sc.nexint();
		long a = 0;
		for(int i=0;i<n;i++)a+=sc.nextint();
		System.out.println(a/n);
	}
}

Compiler output:
Main.java:2: error: class AOJ0134 is public, should be declared in a file named AOJ0134.java
public class AOJ0134 {
       ^
Main.java:6: error: cannot find symbol
		long n = sc.nexint();
		           ^
  symbol:   method nexint()
  location: variable sc of type Scanner
Main.java:8: error: cannot find symbol
		for(int i=0;i<n;i++)a+=sc.nextint();
		                         ^
  symbol:   method nextint()
  location: variable sc of type Scanner
3 errors
Language: Java

import java.util.Scanner;
public class AOJ0134 {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		long n = sc.nexｔint();
		long a = 0;
		for(int i=0;i<n;i++)a+=sc.nextint();
		System.out.println(a/n);
	}
}

Compiler output:
Main.java:2: error: class AOJ0134 is public, should be declared in a file named AOJ0134.java
public class AOJ0134 {
       ^
Main.java:6: error: cannot find symbol
		long n = sc.nex?int();
		           ^
  symbol:   method nex?int()
  location: variable sc of type Scanner
Main.java:8: error: cannot find symbol
		for(int i=0;i<n;i++)a+=sc.nextint();
		                         ^
  symbol:   method nextint()
  location: variable sc of type Scanner
3 errors
Language: Java

import java.util.Scanner;
public class AOJ0134 {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		long n = sc.nexｔdouble();
		long a = 0;
		for(int i=0;i<n;i++)a+=sc.nextdouble();
		System.out.println(a/n);
	}
}

Compiler output:
Main.java:2: error: class AOJ0134 is public, should be declared in a file named AOJ0134.java
public class AOJ0134 {
       ^
Main.java:6: error: cannot find symbol
		long n = sc.nex?double();
		           ^
  symbol:   method nex?double()
  location: variable sc of type Scanner
Main.java:8: error: cannot find symbol
		for(int i=0;i<n;i++)a+=sc.nextdouble();
		                         ^
  symbol:   method nextdouble()
  location: variable sc of type Scanner
3 errors
Language: Java

import java.util.Scanner;
public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		long n = sc.nextlong();
		long a = 0;
		for(int i=0) {
                   for(i<n;i++) {
                       a+=sc.nextlong();
		       System.out.println(a/n);
                    }
               }
	}
}

Compiler output:
Main.java:8: error: ';' expected
		for(int i=0) {
		           ^
Main.java:9: error: > or ',' expected
                   for(i<n;i++) {
                          ^
Main.java:9: error: not a statement
                   for(i<n;i++) {
                        ^
Main.java:9: error: ';' expected
                   for(i<n;i++) {
                              ^
4 errors
Language: Java

import java.util.Scanner;
public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		long n = sc.nextlong();
		long a = 0;
		for(int i=0;i<n;i++) {
                       a+=sc.nextlong();
		       System.out.println(a/n);
                    }
               }
	}
}

Compiler output:
Main.java:14: error: class, interface, enum, or record expected
}
^
1 error
Language: Java

import java.util.Scanner;
public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		long n = sc.nextlong();
		long a = 0;
		for(int i=0;i<n;i++) {
                       a+=sc.nextlong();
		    System.out.println(a/n);
               }
	}
}

Compiler output:
Main.java:6: error: cannot find symbol
		long n = sc.nextlong();
		           ^
  symbol:   method nextlong()
  location: variable sc of type Scanner
Main.java:9: error: cannot find symbol
                       a+=sc.nextlong();
                            ^
  symbol:   method nextlong()
  location: variable sc of type Scanner
2 errors
Language: Java

import java.util.Scanner;
public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		long n = sc.nextlong();
		long a = 0;
		for(int i=0;i<n;i++)a+=sc.nextlong();
		       System.out.println(a/n);
	}
}

Compiler output:
Main.java:6: error: cannot find symbol
		long n = sc.nextlong();
		           ^
  symbol:   method nextlong()
  location: variable sc of type Scanner
Main.java:8: error: cannot find symbol
		for(int i=0;i<n;i++)a+=sc.nextlong();
		                         ^
  symbol:   method nextlong()
  location: variable sc of type Scanner
2 errors