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

#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <string>
#include <functional>
#include <array>
#include <stack>
#include <queue>
#include <chrono>
#include <numeric>
#include <memory.h>
#include <map>
#include <math.h>
#include <utility>
#include <set>

#pragma warning(disable:4996)
using namespace std;
#define REP(i,n) for(int i = 0 ; i < n ; ++i)
typedef long long Int;
const double PI = 3.141592653589793238;
const Int INF = 999999999999;
typedef pair<int, int> P;

int S[3][3] = {
		{ 0, 1, 0 },
		{ 1, 1, 1 },
		{ 0, 1, 0 },
};
int M[3][3] = {
		{ 1, 1, 1 },
		{ 1, 1, 1 },
		{ 1, 1, 1 },
};
int L[5][5] = {
		{ 0, 0, 1, 0, 0 },
		{ 0, 1, 1, 1, 0 },
		{ 1, 1, 1, 1, 1 },
		{ 0, 1, 1, 1, 0 },
		{ 0, 0, 1, 0, 0 },
};

int tile[10][10];

int main()
{
	int x, y, size;
	while (scanf_s("%d,%d,%d",&x,&y,&size)){
		int xt = x;
		int yt = y;
		if (size == 1){
			while (xt - 1 < 0)++xt;
			while (yt - 1 < 0)++yt;
			while (xt + 2 > 9)--xt;
			while (yt + 2 > 9)--yt;

			for (int i = yt - 1; i < yt + 2; ++i){
				for (int j = xt - 1; j < xt + 2; ++j){
					tile[i][j] += S[i + 1 - yt][j + 1 - xt];
				}
			}
		}
		if (size == 2){
			while (xt - 1 < 0)++xt;
			while (yt - 1 < 0)++yt;
			while (xt + 2 > 9)--xt;
			while (yt + 2 > 9)--yt;

			for (int i = yt - 1; i < yt + 2; ++i){
				for (int j = xt - 1; j < xt + 2; ++j){
					tile[i][j] += M[i + 1 - yt][j + 1 - xt];
				}
			}

		}
		if (size == 3){
			while (xt - 1 < 0)++xt;
			while (yt - 1 < 0)++yt;
			while (xt + 3 > 9)--xt;
			while (yt + 3  > 9)--yt;

			for (int i = yt - 2; i < yt + 3; ++i){
				for (int j = xt - 2; j < xt + 3; ++j){
					tile[i][j] += L[i + 2 - yt][j + 2 - xt];
				}
			}

		}
	}
	int white = 0;
	int max_ = -1;

	REP(i, 10){
		REP(j, 10){
			if (!tile[i][j])
				++white;
			max_ = max(tile[i][j], max_);
		}
	}

	cout << white << endl << max_ << endl;

	return 0;

}

Compiler output:
a.cc: In function 'int main()':
a.cc:49:16: error: 'scanf_s' was not declared in this scope; did you mean 'scanf'?
   49 |         while (scanf_s("%d,%d,%d",&x,&y,&size)){
      |                ^~~~~~~
      |                scanf
Language: C++

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int field[10][10];
int sx[]={-1,0,0,0,1},sy[]={0,-1,0,1,0};
int bx[]={-2,-1,-1,-1,0,0,0,0,0,1,1,1,2},by[]={0,-1,0,1,-2,-1,0,1,2,-1,0,1,0};
void small(int x,int y){
	for(int i=0;i<5;i++){
		field[x+sx][y+sy]++;
	}
}
void middle(int x,int y){
	for(int i=-1;i<=1;i++){
		for(int j=-1;j<=1;j++){
			field[x+i][y+j]++;
}
void big(int x,int y){
	for(int i=0;i<13;i++){
		field[x+bx][y+by]++;
	}
} 
int main(){
	int x,y,size,ans=0,count=0;
	for(int i=0;i<10;i++){
		for(int j=0;j<10;j++){
			field[i][j]=0;
		}
	}
	while(cin>>x>>y>>size){
		if(size==1)small(x,y);
		else if(size==2)middle(x,y);
		else big(x,y);
	}
	for(int i=0;i<10;i++){
		for(int j=0;j<10;j++){
			if(field[i][j]==0)count++;
			else ans=max(ans,field[i][j]);
		}
	}
	cout<<count<<endl<<ans<<endl;
	return 0;
}

Compiler output:
a.cc: In function 'void small(int, int)':
a.cc:10:22: error: invalid types 'int [10][10][int*]' for array subscript
   10 |                 field[x+sx][y+sy]++;
      |                      ^
a.cc: In function 'void middle(int, int)':
a.cc:18:22: error: a function-definition is not allowed here before '{' token
   18 | void big(int x,int y){
      |                      ^
a.cc:23:9: warning: empty parentheses were disambiguated as a function declaration [-Wvexing-parse]
   23 | int main(){
      |         ^~
a.cc:23:9: note: remove parentheses to default-initialize a variable
   23 | int main(){
      |         ^~
      |         --
a.cc:23:9: note: or replace parentheses with braces to value-initialize a variable
a.cc:23:11: error: a function-definition is not allowed here before '{' token
   23 | int main(){
      |           ^
a.cc:43:2: error: expected '}' at end of input
   43 | }
      |  ^
a.cc:14:31: note: to match this '{'
   14 |         for(int i=-1;i<=1;i++){
      |                               ^
a.cc:43:2: error: expected '}' at end of input
   43 | }
      |  ^
a.cc:13:25: note: to match this '{'
   13 | void middle(int x,int y){
      |                         ^
Language: C++

#include<stdio.h>

static int map[11][11];

void small(int x,int y){
	map[y][x]+=1;
	map[y][x+1]+=1;
	map[y][x-1]+=1;
	map[y+1][x]+=1;
	map[y-1][x]+=1;
}

void midium(int x,int y){
	small(x,y);
	map[y+1][x+1]+=1;
	map[y-1][x-1]+=1;
	map[y-1][x+1]+=1;
	map[y+1][x-1]+=1;
}

void big(int x,int y){
	medium(x,y);
	map[y][x+2]+=1;
	map[y][x-2]+=1;
	map[y+2][x]+=1;
	map[y-2][x]+=1;
}


int main(){
	int x[1000],y[1000],select[1000];
	int i,j;
	int space=0,max=0;
	
	for(i=0;i<11;i++){
		for(j=0;j<11;j++)map[i][j]=0;
	}
	
	i=0;
	while(scanf("%d,%d,%d",&x[i],&y[i],&select[i])!=EOF){
		switch(select[i]){
		case 1:
			small(x[i]+1,y[i]+1);
			break;
		case 2:
			medium(x[i]+1,y[i]+1);
			break;
		case 3:
			big(x[i]+1,y[i]+1);
			break;
		}
		i++;
	}
	
	for(i=1;i<11;i++){
		for(j=1;j<11;j++){
			if(map[i][j]==0)space++;
			if(max<map[i][j])max=map[i][j];
		}
	}
	
	printf("%d\n%d\n",space,max);
	
	return 0;
}

Compiler output:
a.cc: In function 'void big(int, int)':
a.cc:22:9: error: 'medium' was not declared in this scope; did you mean 'midium'?
   22 |         medium(x,y);
      |         ^~~~~~
      |         midium
a.cc: In function 'int main()':
a.cc:46:25: error: 'medium' was not declared in this scope; did you mean 'midium'?
   46 |                         medium(x[i]+1,y[i]+1);
      |                         ^~~~~~
      |                         midium
Language: C++

#include <iostream>
#include <cmath>
#include <vector>
#include <cstdio>
#include <algorithm>
using namespace std;
int main ()
{
	int m[18][18] = {};
	int x, y, s;
	int dx1[4] = {0, 1, 0, -1}, dy1[4] = {1, 0, -1, 0};
	int dx2[8] = {0, 1, 1, 1, 0, -1, -1, -1}, dy2[8] = {1, 1, 0, -1, -1, -1, 0, 1};
	int dx3[12] = {0, -1, 0, 1, -2, -1, 1, 2, -1, 0, 1, 0}, dy3[12] = {2, 1, 1, 1, 0, 0, 0, 0, -1, -1, -1, -2};
	while (scanf("%d,%d,%d", &x, &y, &s) != EOF)
	{
		x += 3;
		y += 3;
		m[x][y]++;
		switch (s)
		{
		case 1:
			for (int i = 0; i < 4; i++)m[x + dx1[i]][y + dy1[i]]++;
			break;
		case 2:B
			for (int i = 0; i < 8; i++)m[x + dx2[i]][y + dy2[i]]++;
			break;
		case 3:
			for (int i = 0; i < 12; i++)m[x + dx3[i]][y + dy3[i]]++;
			break;
		}
	}
	int ans1 = 0, ans2 = 0;
	for (int x = 3; x <13; x++)
	{
		for (int y = 3; y < 13; y++)
		{
			if (m[x][y] == 0)ans1++;
			ans2 = max(ans2, m[x][y]);
			cout<<m[y][x];
		}
		cout<<endl;
	}
	cout << ans1 << endl << ans2 << endl;
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:24:24: error: 'B' was not declared in this scope
   24 |                 case 2:B
      |                        ^
a.cc:25:41: error: 'i' was not declared in this scope
   25 |                         for (int i = 0; i < 8; i++)m[x + dx2[i]][y + dy2[i]]++;
      |                                         ^
Language: C++

#include<iostream>
using namespace std;
int main()
{
    int ma[10][10];
    int x,y,d;
    char c;
    memset(ma,0,sizeof(ma));
    //while(cin>>x>>c>>y>>c>>d){
    for(int i=0;i<6;i++){
        
        cin>>x>>c>>y>>c>>d;
        
        ma[y][x]++;
        if(d==1){
            if(x>0){
                ma[y][x-1]++;
            }
            if(x<9){
                ma[y][x+1]++;
            }
            if(y>0){
                ma[y-1][x]++;
            }
            if(y<9){
                ma[y+1][x]++;
            }
        }
        else if(d==2){
            if(x>0){
                ma[y][x-1]++;
            }
            if(x<9){
                ma[y][x+1]++;
            }
            if(y>0){
                ma[y-1][x]++;
            }
            if(y<9){
                ma[y+1][x]++;
            }
            if(x>0&&y<9){
                ma[y+1][x-1]++;
            }
            if(x<9&&y>0){
                ma[y-1][x+1]++;
            }
            if(x>0&&y>0){
                ma[y-1][x-1]++;
            }
            if(x<9&&y<9){
                ma[y+1][x+1]++;
            }
        }
        else{
            if(x>0){
                ma[y][x-1]++;
            }
            if(x<9){
                ma[y][x+1]++;
            }
            if(y>0){
                ma[y-1][x]++;
            }
            if(y<9){
                ma[y+1][x]++;
            }
            if(x>0&&y<9){
                ma[y+1][x-1]++;
            }
            if(x<9&&y>0){
                ma[y-1][x+1]++;
            }
            if(x>0&&y>0){
                ma[y-1][x-1]++;
            }
            if(x<9&&y<9){
                ma[y+1][x+1]++;
            }
            if(x>1){
                ma[y][x-2]++;
            }
            if(x<8){
                ma[y][x+2]++;
            }
            if(y>1){
                ma[y-2][x]++;
            }
            if(y<8){
                ma[y+2][x]++;
            }
        }
    }
    int em=0,m=0;
    for(int i=0;i<10;i++){
        for(int j=0;j<10;j++){
            if(ma[i][j]==0)em++;
            m=max(m,ma[i][j]);
        }
    }
    cout<<em<<endl<<m<<endl;
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:8:5: error: 'memset' was not declared in this scope
    8 |     memset(ma,0,sizeof(ma));
      |     ^~~~~~
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 | using namespace std;
Language: C++

#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#include<complex>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define CC puts("-------ok--------");
#define all(in) in.begin(), in.end()
#define bv vector<bool>
using namespace std;
typedef pair<int, int>PA;
using namespace std;
#define MAX 1e7
int sx[] = {0,0,-1,1};
int sy[] = {1,-1,0,0};
int my[] = {0,0,1,1,1,-1,-1,-1};
int mx[] = {1,-1,0,1,-1,0,1,-1};
int lx[] = {0,0,0,0,1,1,1,2,-1,-1,-1,-2};
int ly[] = {1,-1,2,-2,0,1,-1,0,0,-1,1,0};
int  main(){
    
    vvi v(12,vi(12,0));
    vi x(100,0); vi y(100,0); vi ink(100,0);
    int i =0; char c,d;
    while(cin >> x[i] >>c>>y[i] >>d >> ink[i]){
        v[y[i]][x[i]]+=1;
        if(ink[i] == 1){
            rep(j,4){
                int tx =x[i]+sx[j]; int ty = y[i]+sy[j];
                if(0<=tx && tx<10 && 0<=ty && ty<10)
                    v[ty][tx]+=1;
            }
        }else if(ink[i] == 2){
            rep(j,8){
                int tx =x[i]+mx[j]; int ty = y[i]+my[j];
                if(0<=tx && tx<10 && 0<=ty && ty<10)
                    v[ty][tx]+=1;
                }
        }else if(ink[i] == 3){
                rep(j,12){
                    int tx =x[i]+lx[j]; int ty = y[i]+ly[j];
                    if(0<=tx && tx<10 && 0<=ty && ty<10)
                        v[ty][tx]+=1;
                }
        }
        i++;
    }
        int ans1 = -INF; int ans2 = 0;
        rep(i,10) rep(j,10){
            ans1 = max(ans1,v[i][j]);
            if(v[i][j]  == 0)
                ans2++;
        }
    cout << ans2<< endl;
    cout << ans1<< endl;
        
    return 0;

Compiler output:
a.cc: In function 'int main()':
a.cc:71:14: error: expected '}' at end of input
   71 |     return 0;
      |              ^
a.cc:34:12: note: to match this '{'
   34 | int  main(){
      |            ^
Language: C++

#include <iostream>
#include <cstdio>

#define scanf scanf_s
#define SIZE 10

using namespace std;

int format[3][12][2] = { { { 0,1 },{ 1,0 },{ 0,-1 },{ -1,0 } },
						 { { 0,1 },{ 1,1 },{ 1,0 },{ 1,-1 },{ 0,-1 },{ -1,-1 },{ -1,0 },{ -1,1 } },
						 { { 0,1 },{ 1,1 },{ 1,0 },{ 1,-1 },{ 0,-1 },{ -1,-1 },{ -1,0 },{ -1,1 },{ 0,2 },{ 2,0 },{ 0,-2 },{ -2,0 } } };

int main() {
	int dx, dy, x, y, s, count, most, map[SIZE][SIZE], num[3] = { 4,9,12 };

	count = 100;
	most = 0;
	while (scanf("%d,%d,%d", &x, &y, &s)) {
		x--;
		y--;
		s--;

		for (int i = 0; i < num[s]; i++) {
			dx = x + format[s][i][0];
			dy = y + format[s][i][1];

			if (dx < 0 || dx >= SIZE || dy < 0 || dy >= SIZE) {
				continue;
			}

			map[dx][dy]++;
			if (map[dx][dy] == 1) {
				count--;
			}

			if (map[dx][dy] > most) {
				most = map[dx][dy];
			}
		}
	}

	cout << count << endl << most << endl;
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:4:15: error: 'scanf_s' was not declared in this scope; did you mean 'scanf'?
    4 | #define scanf scanf_s
      |               ^~~~~~~
a.cc:18:16: note: in expansion of macro 'scanf'
   18 |         while (scanf("%d,%d,%d", &x, &y, &s)) {
      |                ^~~~~
Language: C++

#include <iostream>
#include <cstdio>

#define scanf scanf_s
#define SIZE 10

using namespace std;

int map[SIZE][SIZE];

void drop(int x, int y) {
	if (x < 0 || y < 0 || x >= SIZE || y >= SIZE) return;

	map[x][y]++;
}

int main() {
	int x, y, s, count = 0, most = 0;

	while (scanf("%d,%d,%d", &x, &y, &s)) {
		x--;
		y--;
		drop(x, y);
		drop(x, y + 1);
		drop(x + 1, y);
		drop(x, y - 1);
		drop(x - 1, y);

		if (s > 1) {
			drop(x + 1, y + 1);
			drop(x + 1, y - 1);
			drop(x - 1, y - 1);
			drop(x - 1, y + 1);

			if (s > 2) {
				drop(x, y + 2);
				drop(x, y - 2);
				drop(x + 2, y);
				drop(x - 2, y);
			}
		}
	}

	for (int i = 0; i < SIZE; i++) {
		for (int j = 0; j < SIZE; j++) {
			if (map[i][j] > most) {
				most = map[i][j];
			}

			if (map[i][j] == 0) {
				count++;
			}
		}
	}

	cout << count << endl << most << endl;
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:4:15: error: 'scanf_s' was not declared in this scope; did you mean 'scanf'?
    4 | #define scanf scanf_s
      |               ^~~~~~~
a.cc:20:16: note: in expansion of macro 'scanf'
   20 |         while (scanf("%d,%d,%d", &x, &y, &s)) {
      |                ^~~~~
Language: C++

#include <iostream>
#include <algorithm>
int main()
{		int x, y, n;
		char a, b;
	int a = 0;
	int s = 100;
	int xy[10][10] = {};
	while (std::cin >>x>> a >> y >> b >> n) {
		switch (n)
		{
		case 1: {
			if (x != 0) {
				++xy[x - 1][y];
			}
			++xy[x + 1][y];
			if (y != 0) {
				++xy[x][y - 1];
			}
			++xy[x][y + 1];
			break;
		}
		case 2: {
			if (x != 0) {
				++xy[x - 1][y];
				++xy[x - 1][y - 1];
				++xy[x - 1][y + 1];
			}
			if (y != 0) {
				++xy[x][y - 1];
				++xy[x + 1][y - 1];
			}
			++xy[x + 1][y];
			++xy[x][y + 1];
			++xy[x + 1][y + 1];
			break;
		}
		case 3: {
			if (x != 0) {
				++xy[x - 1][y];
				++xy[x - 1][y - 1];
				++xy[x - 1][y + 1];
			}
			if (y != 0) {
				++xy[x][y - 1];
				++xy[x + 1][y - 1];
			}
			++xy[x + 1][y];
			++xy[x][y + 1];
			++xy[x + 1][y + 1];
			if (x != 2) { ++xy[x - 2][y]; }
			++xy[x + 2][y];
			if (y != 2) {
				++xy[x][y - 2];
			}
			++xy[x][y + 2];
			break;
		}
		}
	}

	for (int i = 0; i < 10; ++i) {
		for (int j = 0; j < 10; ++j) {
			if (xy[i][j] > 0) {
				--s;
			}
		}
	}
	a = xy[0][0];
	for (int i = 0; i < 10; ++i) {
		for (int j = 0; j < 10; ++j) {
			if (a < xy[i][j]) {
				a = xy[i][j];
			}
		}
	}
	std::cout << s-1 << std::endl;
	std::cout << a << std::endl;
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:6:13: error: conflicting declaration 'int a'
    6 |         int a = 0;
      |             ^
a.cc:5:22: note: previous declaration as 'char a'
    5 |                 char a, b;
      |                      ^
Language: C++

#include<iostream>
#include<stdio.h>
#define DROP(x,y) if(x>=0&&y>=0&&x<10&&y<10)++cloth[x][y]
using namespace std;
??
int main(){
??
????????int x, y, size;
????????int cloth[10][10];
????????int count, max;
??????????
????????for (int i = 0; i < 10; ++i)
????????for (int j = 0; j < 10; ++j)
????????????????cloth[i][j] = 0;
??
????????while (scanf("%d,%d,%d", &x, &y, &size) + 1){
????????????????if (size == 1){
????????????????????????DROP(x, y);
????????????????????????DROP(x + 1, y);
????????????????????????DROP(x, y + 1);
????????????????????????DROP(x - 1, y);
????????????????????????DROP(x, y - 1);
????????????????}
??
????????????????else if (size == 2){
????????????????????????DROP(x, y);
????????????????????????DROP(x, y - 1);
????????????????????????DROP(x, y + 1);
????????????????????????DROP(x - 1, y - 1);
????????????????????????DROP(x - 1, y);
????????????????????????DROP(x - 1, y + 1);
????????????????????????DROP(x + 1, y - 1);
????????????????????????DROP(x + 1, y);
????????????????????????DROP(x + 1, y + 1);
????????????????}
??
????????????????else if (size == 3){
????????????????????????DROP(x, y);
????????????????????????DROP(x, y - 1);
????????????????????????DROP(x, y + 1);
????????????????????????DROP(x - 1, y - 1);
????????????????????????DROP(x - 1, y);
????????????????????????DROP(x - 1, y + 1);
????????????????????????DROP(x + 1, y - 1);
????????????????????????DROP(x + 1, y);
????????????????????????DROP(x + 1, y + 1);
????????????????????????DROP(x + 2, y);
????????????????????????DROP(x - 2, y);
????????????????????????DROP(x, y + 2);
????????????????????????DROP(x, y - 2);
????????????????}
????????}
??
????????for (int i = 0; i < 10; ++i)
????????for (int j = 0; j < 10; ++j){
????????????????if (cloth[i][j] == 0)++count;
????????????????if (cloth[i][j] > max)max = cloth[i][j];
????????}
??
????????cout << count << endl << max << endl;
??
??????????
??
??
??
}

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

#include<iostream>
int main(){
  int paper[10][10],x,y,a,max=0;
  std::string s;
  for(x=0; x<10; x++)
    for(y=0; y<10; y++)
      paper[x][y]=0;

  while(std::cin>>s){
    x=s.at(0)-'0';
    y=s.at(2)-'0';
    a=s.at(4)-'0';
      paper[x][y]++;
      if(x>0) paper[x-1][y]++;
      if(x<9) paper[x+1][y]++;
      if(y>0) paper[x][y-1]++;
      if(y<9) paper[x][y+1]++;

    if(a>1){
      if(x>0&&y>0) paper[x-1][y-1]++;
      if(x<9&&y>0) paper[x+1][y-1]++;
      if(x>0&&y<9) paper[x-1][y+1]++;
      if(x<9&&y<9) paper[x+1][y+1]++;
    }
    if(a>2){
      if(x>1)paper[x-2][y]++;
      if(y>1)paper[x][y-2]++;
      if(x<8)paper[x+2][y]++;
      if(y<8)paper[x][y+2]++;
    }
  }

  for(x=0,a=0;x<10;x++)
    for(y=0;y<10;y++){
      paper[x][y]==0 ? a++:,
      paper[x][y]>max ? max=paper[x][y]:;
    }
      std::cout<<a<<"\n"<<max<<"\n";
}

Compiler output:
a.cc: In function 'int main()':
a.cc:35:28: error: expected primary-expression before ',' token
   35 |       paper[x][y]==0 ? a++:,
      |                            ^
a.cc:36:41: error: expected primary-expression before ';' token
   36 |       paper[x][y]>max ? max=paper[x][y]:;
      |                                         ^
Language: C++

#include <stdio.h>
#define TIMES 6

/* http://rose.u-aizu.ac.jp/onlinejudge/ProblemSet/description.jsp?id=0026&lang=jp */

int main(void)
{
	int paper[10][10] = {0} ;
	int blank = 0;
	int maxdk = 0;
	int x = 0 ;
	int y = 0 ;
	int size = 0 ;
	
	for ( ; i < TIMES ; i++ ){
	scanf("%d",&x) ;
	scanf(",%d",&y) ;
	scanf(",%d",&size) ;
	
	if(size >= 1){
		if (x+1<10)
			paper[x+1][y]++;
		if (x-1>=0)
			paper[x-1][y]++;
		if (y+1<10)
			paper[x][y+1]++;
		if (y-1>=0)
			paper[x][y-1]++;
		}
		
	if(size >= 2){
		if (x+1<10 && y+1<10)
			paper[x+1][y+1]++;
		if (x-1>=0 && y+1<10)
			paper[x-1][y+1]++;
		if (x-1>=0 && y-1>=0)
			paper[x-1][y-1]++;
		if (x+1<10 && y-1>=0)
			paper[x+1][y-1]++;
		}
		
	if(size >= 3){
		if (x+2<10)
			paper[x+2][y]++;
		if (x-2>=0)
			paper[x-2][y]++;
		if (y+2<10)
			paper[x][y+2]++;
		if (y-2>=0)
			paper[x][y-2]++;
		}
		
/*		printf("%d,",x); printf("%d,",y); printf("%d\n",size);	*/
		
		}
		
		
		for( y = 0 ; y < 10 ; y++ ){
			for( x = 0 ; x < 10 ; x++ ){
				if(paper[x][y] == 0)
				blank++;
				if(paper[x][y] > maxdk)
				maxdk = paper[x][y] ;
			}
		}
		
		printf("----------------\n");
		printf("BLANK:%d\n",blank);
		printf("MAX:%d\n",maxdk);
		
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:15:17: error: 'i' was not declared in this scope
   15 |         for ( ; i < TIMES ; i++ ){
      |                 ^
Language: C++

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

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

int paper[10][10];
const int dx[] = {0,0,1,-1};
const int dy[] = {1,-1,0,0};
const int diax[] = {1,1,-1,-1};
const int diay[] = {-1,1,1,-1};

void dai(int x, int y){
	REP(z,1,3)rep(k,4){
		int tx = x+dx[k]*z , ty = y+dy[k]*z;
		if( tx<0 || ty<0 || tx>=10 || ty>=10 )continue;
		paper[ty][tx]++;
	}
	rep(k,4){
		int tx = x+diax[k] , ty = y+diay[k];
		if( tx<0 || ty<0 || tx>=10 || ty>=10 )continue;
		paper[ty][tx]++;
	}
}
void chuu(int x, int y){
	rep(k,4){
		int tx = x+dx[k] , ty = y+dy[k];
		if( tx<0 || ty<0 || tx>=10 || ty>=10 )continue;
		paper[ty][tx]++;
	}
	rep(k,4){
		int tx = x+diax[k] , ty = y+diay[k];
		if( tx<0 || ty<0 || tx>=10 || ty>=10 )continue;
		paper[ty][tx]++;
	}
}
void shou(int x, int y){
	rep(k,4){
		int tx = x+dx[k] , ty = y+dy[k];
		if( tx<0 || ty<0 || tx>=10 || ty>=10 )continue;
		paper[ty][tx]++;
	}
}

int main(){
	int x,y,sz;
	memset(paper,0,sizeof(paper));
	while(~scanf("%d,%d,%d",&x,&y,&sz)){
		if( sz==3 )      dai(x,y);
		else if( sz==2 ) chuu(x,y);
		else             shou(x,y);
	}
	int nasi = 0, ari = 0;
	rep(i,10)rep(j,10){
		if( paper[i][j]==0 )nasi++;
		else{
			ari = max(ari,paper[i][j]);
		}
	}
	printf("%d\n%d\n",nasi,ari);
	return 0;
}

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

#include <iostream>
using namespace std;

int main(){
  int x,y,size;
  int canvas[10][10];
  int empty_num, max_val;
  int i, j;

  for(i=0; i<10; i++)
    for(j=0; j<10; j++) canvas[i][j]=0;
  while(cin>>x){
    cin>>y; cin>>size;

    for(i=-1; i<=1; i=i+2)
      if(x+i>=0 && x+i<10) canvas[x+i][y]++;
    for(i=-1; i<=1; i=i+2)
      if(y+i>=0 && y+i<10) canvas[x][y+i]++;
    if(size>1){
      for(i=-1; i<=1; i=i+2){
        for(j=-1; j<=1; j=j+2)
          if(x+i>=0 && x+i<10 && y+j>=0 && y+j<10) canvas[x+i][y+j]++;
      }
    }
    if(size>2){
      for(i=-2; i<=2; i=i+4)
        if(x+i>=0 && x+i<10) canvas[x+i][y]++;
      for(i=-2; i<=2; i=i+4)
        if(y+i>=0 && y+i<10) canvas[x][y+i]++;
      }
    }

    empty_num=0; max_val=0;
    for(i=0; i<10; i++){
      for(j=0; j<10; j++){
        if(canvas[i][j]>max_val) max_val=canvas[i][j];
        else if(canvas[i][j]==0) empty_num++;
      }
    }

    printf("%d\n%d\n", empty_num, max_val);
  }
  return 0;
}

Compiler output:
a.cc:43:3: error: expected unqualified-id before 'return'
   43 |   return 0;
      |   ^~~~~~
a.cc:44:1: error: expected declaration before '}' token
   44 | }
      | ^
Language: C++

#include <iostream>
#include <string>
#include <map>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <iomanip>
using namespace std;
int main(){
  int x,y,size,m[14][14]={0},max=0,none=0;
  while(scanf("%d,%d,%d",&x,&y,&size)!=EOF{
    if(size>=1){
      m[x+2][y+2]++;
      m[x+2][y+1]++;
      m[x+2][y+3]++;
      m[x+1][y+2]++;
      m[x+3][y+2]++;
    }
    if(size>=2){
      m[x+1][y+1]++;
      m[x+1][y+3]++;
      m[x+3][y+1]++;
      m[x+3][y+3]++;
    }
    if(size==3){
      m[x+2][y]++;
      m[x+2][y+4]++;
      m[x][y+2]++;
      m[x+4][y+2]++;
    }
    for(y=0;y<14;y++){
      for(x=0;x<14;x++){
	cout<<m[x][y];
	(x==13)?cout<<endl:cout<<" ";
      }
    }
  }
  for(y=0;y<10;y++){
    for(x=0;x<10;x++){
      if(m[x+2][y+2]>max)max=m[x+2][y+2];
      if(!m[x+2][y+2])none++;
    }
  }
  cout<<none<<endl<<max<<endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:12:43: error: expected ')' before '{' token
   12 |   while(scanf("%d,%d,%d",&x,&y,&size)!=EOF{
      |        ~                                  ^
Language: C++

void dfs1(int x, int y) {
  field[y][x] += 1;
  for(int dx = -1 ; dx <= 1 ; dx++) {
    int nx = x + dx;
    if(0 <= nx && nx < 10 && nx != x) field[y][nx] += 1;
  }
  for(int dy = -1 ; dy <= 1 ; dy++) {
    int ny = y + dy;
    if(0 <= ny && ny < 10 && ny != y) field[ny][x] += 1;
  }
}

void dfs2(int x, int y) {
  field[y][x] += 1;
  if(y+1 < 10) field[y+1][x] += 1;
  if(y-1 >= 0) field[y-1][x] += 1;
  if(x+1 < 10) field[y][x+1] += 1;
  if(x-1 >= 0) field[y][x-1] += 1;
  for(int dx = -1 ; dx <= 1 ; dx++) {
    for(int dy = -1 ; dy <= 1 ; dy++) {
      int nx = x + dx, ny = y + dy;
      if(0 <= nx && nx < 10 && 0 <= ny && ny < 10 && nx != x && ny != y) field[ny][nx] += 1;
    }
  }
}

void dfs3(int x, int y) {
  field[y][x] += 1;
  if(y+2 < 10) field[y+2][x] += 1;
  if(y-2 >= 0) field[y-2][x] += 1;
  if(x+2 < 10) field[y][x+2] += 1;
  if(x-2 >= 0) field[y][x-2] += 1;
  if(y+1 < 10) field[y+1][x] += 1;
  if(y-1 >= 0) field[y-1][x] += 1;
  if(x+1 < 10) field[y][x+1] += 1;
  if(x-1 >= 0) field[y][x-1] += 1;
  for(int dx = -1 ; dx <= 1 ; dx++) {
    for(int dy = -1 ; dy <= 1 ; dy++) {
      int nx = x + dx, ny = y + dy;
      if(0 <= nx && nx < 10 && 0 <= ny && ny < 10 && nx != x && ny != y) field[ny][nx] += 1;
    }
  }
}

int main(void) {
  int x, y, size;
  char c1, c2;
  int max=0;
  int white=0;
  while(cin >> x >> c1  >> y >> c2 >> size) {
    if(size == 1) dfs1(x, y);
    if(size == 2) dfs2(x, y);
    if(size == 3) dfs3(x, y);
  }
  /*for(int i = 0 ; i < 10 ; i++) {
    for(int j = 0 ; j < 10 ; j++) {
      cout << field[i][j] << ' ';
    }
    cout << endl;
    }*/
  for(int i = 0 ; i < 10 ; i++) {
    for(int j = 0 ; j < 10 ; j++) {
      if(field[i][j] > max) max = field[i][j];
      if(field[i][j] == 0) white++;
    }
  }
  cout << white << endl;
  cout << max << endl;
  return 0;
}

Compiler output:
a.cc: In function 'void dfs1(int, int)':
a.cc:2:3: error: 'field' was not declared in this scope; did you mean 'friend'?
    2 |   field[y][x] += 1;
      |   ^~~~~
      |   friend
a.cc: In function 'void dfs2(int, int)':
a.cc:14:3: error: 'field' was not declared in this scope; did you mean 'friend'?
   14 |   field[y][x] += 1;
      |   ^~~~~
      |   friend
a.cc: In function 'void dfs3(int, int)':
a.cc:28:3: error: 'field' was not declared in this scope; did you mean 'friend'?
   28 |   field[y][x] += 1;
      |   ^~~~~
      |   friend
a.cc: In function 'int main()':
a.cc:50:9: error: 'cin' was not declared in this scope
   50 |   while(cin >> x >> c1  >> y >> c2 >> size) {
      |         ^~~
a.cc:63:10: error: 'field' was not declared in this scope; did you mean 'friend'?
   63 |       if(field[i][j] > max) max = field[i][j];
      |          ^~~~~
      |          friend
a.cc:64:10: error: 'field' was not declared in this scope; did you mean 'friend'?
   64 |       if(field[i][j] == 0) white++;
      |          ^~~~~
      |          friend
a.cc:67:3: error: 'cout' was not declared in this scope
   67 |   cout << white << endl;
      |   ^~~~
a.cc:67:20: error: 'endl' was not declared in this scope
   67 |   cout << white << endl;
      |                    ^~~~
Language: C++

#include <iostream>

using namespace std;

int small_x[4] = {-1,  0, 0, 1};
int small_y[4] = { 0, -1, 1, 0};

int medium_x[8] = {-1, -1, -1,  0, 0,  1, 1, 1};
int medium_y[8] = {-1,  0,  1, -1, 1, -1, 0, 1};

int large_x[12] = {-2, -1, -1, -1,  0,  0, 0, 0,  1, 1, 1, 2};
int large_y[12] = { 0, -1,  0,  1, -2, -1, 1, 2, -1, 0, 1, 0};

void solve()
{
	int Field[14][14];
	memset(Field, 0, sizeof(Field));
	int a, b, c;
	while(scanf("%d,%d,%d", &a, &b, &c))
	{
		++Field[b + 2][a + 2];
		if(c == 1)
		{
			for(int i = 0; i < 4; ++i)
			{
				++Field[b + 2 + small_y[i]][a + 2 + small_x[i]];
			}
		}
		else if(c == 2)
		{
			for(int i = 0; i < 8; ++i)
			{
				++Field[b + 2 + medium_y[i]][a + 2 + medium_x[i]];
			}
		}
		else if(c == 3)
		{
			for(int i = 0; i < 12; ++i)
			{
				++Field[b + 2 + large_y[i]][a + 2 + large_x[i]];
			}
		}
	}
	int count = 0;
	int Max = 0;
	for(int i = 2; i < 12; ++i)
	{
		for(int j = 2; j < 12; ++j)
		{
			if(Field[i][j] == 0)
			{
				++count;
			}
			if(Max < Field[i][j])
			{
				Max = Field[i][j];
			}
		}
	}
	cout << count << endl;
	cout << Max << endl;
}

int main()
{
	solve();
	return(0);
}

Compiler output:
a.cc: In function 'void solve()':
a.cc:17:9: error: 'memset' was not declared in this scope
   17 |         memset(Field, 0, sizeof(Field));
      |         ^~~~~~
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++


import java.util.Scanner;

public class Main {
 static int     max   = 0;
 static int     count = 100;
 static int[][] p     = new int[10][10];

 public static void main(String[] args) {
	Scanner in = new Scanner(System.in)
	  .useDelimiter("[^0-9]+");
	max = 0;
	count = 100;
	for (int i = 0; i < p.length; i++) {
	 for (int j = 0; j < p[i].length; j++) {
		p[i][j] = 0;
	 }
	}
	while (in.hasNextLine()) {
	 ink(in.nextInt(), in.nextInt(), in.nextInt());
	}
	System.out.println(count);
	System.out.println(max);

 }

 static void ink(int x, int y, final int size) {
	if (size >= 3) {
	 pi(x + 2, y);
	 pi(x - 2, y);
	 pi(x, y + 2);
	 pi(x, y - 2);
	}
	if (size >= 2) {
	 pi(x + 1, y + 1);
	 pi(x + 1, y - 1);
	 pi(x - 1, y + 1);
	 pi(x - 1, y - 1);
	}
	if (size >= 1) {
	 pi(x + 1, y);
	 pi(x - 1, y);
	 pi(x, y + 1);
	 pi(x, y - 1);
	}
	pi(x, y);
 }

 static void pi(int x, int y) {
	if (0 <= x && x < 10 && 0 <= y && y < 10) {
	 if (p[x][y] == 0) {
		count--;
	 }
	 p[x][y]++;
	 max = Math.max(max, p[x][y]);
	}
 }
}

Compiler output:
a.cc:2:1: error: 'import' does not name a type
    2 | import java.util.Scanner;
      | ^~~~~~
a.cc:2:1: note: C++20 'import' only available with '-fmodules-ts'
a.cc:4:1: error: expected unqualified-id before 'public'
    4 | public class Main {
      | ^~~~~~
Language: C++

import java.util.Scanner;
 
public class Main {
 static int     max   = 0;
 static int     count = 100;
 static int[][] p     = new int[10][10];
 
 public static void main(String[] args) {
    Scanner in = new Scanner(System.in)
      .useDelimiter("[^0-9]+");
    max = 0;
    count = 100;
    for (int i = 0; i < p.length; i++) {
     for (int j = 0; j < p[i].length; j++) {
        p[i][j] = 0;
     }
    }
    while (in.hasNextLine()) {
     ink(in.nextInt(), in.nextInt(), in.nextInt());
    }
    System.out.println(count);
    System.out.println(max);
 
 }
 
 static void ink(int x, int y, final int size) {
    if (size >= 3) {
     pi(x + 2, y);
     pi(x - 2, y);
     pi(x, y + 2);
     pi(x, y - 2);
    }
    if (size >= 2) {
     pi(x + 1, y + 1);
     pi(x + 1, y - 1);
     pi(x - 1, y + 1);
     pi(x - 1, y - 1);
    }
    if (size >= 1) {
     pi(x + 1, y);
     pi(x - 1, y);
     pi(x, y + 1);
     pi(x, y - 1);
    }
    pi(x, y);
 }
 
 static void pi(int x, int y) {
    if (0 <= x && x < 10 && 0 <= y && y < 10) {
     if (p[x][y] == 0) {
        count--;
     }
     p[x][y]++;
     max = Math.max(max, p[x][y]);
    }
 }
}

Compiler output:
a.cc:1:1: error: 'import' does not name a type
    1 | import java.util.Scanner;
      | ^~~~~~
a.cc:1:1: note: C++20 'import' only available with '-fmodules-ts'
a.cc:3:1: error: expected unqualified-id before 'public'
    3 | public class Main {
      | ^~~~~~
Language: C++

//インクを落とす
#include<cstdio>

using namespace std;

int main(void){
	int pa[10][10];
	int i,j;	//ループカウンタ
	int x,y,size,da=0,not=0;
	
	//二次元配列の初期化
	for(i=0;i<10;i++){
		for(j=0;j<10;j++)
			pa[i][j]=0;
	}

	while(scanf("%d,%d,%d",&x,&y,&size)==3){
		switch(size){
			case 1:	//小
				pa[x][y]++;
				pa[x-1][y]++;
				pa[x+1][y]++;
				pa[x][y-1]++;
				pa[x][y+1]++;
				break;
			case 2:	//中
				for(i=-1;i<=1;i++){
					for(j=-1;j<=1;j++)
						pa[x+i][y+j]++;
				}
				break;
			case 3:	//大
				for(i=-1;i<=1;i++){
					for(j=-1;j<=1;j++)
						pa[x+i][y+j]++;
				}
				pa[x-2][y]++;
				pa[x+2][y]++;
				pa[x][y-2]++;
				pa[x][y+2]++;
				break;
		}
	}
	for(i=0;i<10;i++){
		for(j=0;j<10;j++){
			if(pa[i][j]==0)
				not++;
		}
	}
	for(i=0;i<10;i++){
		for(j=0;j<10;j++){
			if(pa[i][j]>da)
				da=pa[i][j];
		}
	}
	printf("%d\n%d\n",not,da);

	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:9:27: error: expected unqualified-id before 'not' token
    9 |         int x,y,size,da=0,not=0;
      |                           ^~~
a.cc:47:38: error: expected primary-expression before ';' token
   47 |                                 not++;
      |                                      ^
a.cc:56:30: error: expected primary-expression before ',' token
   56 |         printf("%d\n%d\n",not,da);
      |                              ^
Language: C++

//インクを落とす
#include<cstdio>

using namespace std;

int main(void){
	int pa[10][10];
	int i,j;	//ループカウンタ
	int x,y,size,da=0,not=0;
	
	//二次元配列の初期化
	for(i=0;i<10;i++){
		for(j=0;j<10;j++)
			pa[i][j]=0;
	}

	while(scanf("%d,%d,%d",&x,&y,&size)!=EOF){
		switch(size){
			case 1:	//小
				pa[x][y]++;
				pa[x-1][y]++;
				pa[x+1][y]++;
				pa[x][y-1]++;
				pa[x][y+1]++;
				break;
			case 2:	//中
				for(i=-1;i<=1;i++){
					for(j=-1;j<=1;j++)
						pa[x+i][y+j]++;
				}
				break;
			case 3:	//大
				for(i=-1;i<=1;i++){
					for(j=-1;j<=1;j++)
						pa[x+i][y+j]++;
				}
				pa[x-2][y]++;
				pa[x+2][y]++;
				pa[x][y-2]++;
				pa[x][y+2]++;
				break;
		}
	}
	for(i=0;i<10;i++){
		for(j=0;j<10;j++){
			if(pa[i][j]==0)
				not++;
		}
	}
	for(i=0;i<10;i++){
		for(j=0;j<10;j++){
			if(pa[i][j]>da)
				da=pa[i][j];
		}
	}
	printf("%d\n%d\n",not,da);

	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:9:27: error: expected unqualified-id before 'not' token
    9 |         int x,y,size,da=0,not=0;
      |                           ^~~
a.cc:47:38: error: expected primary-expression before ';' token
   47 |                                 not++;
      |                                      ^
a.cc:56:30: error: expected primary-expression before ',' token
   56 |         printf("%d\n%d\n",not,da);
      |                              ^
Language: C++

//インクを落とす
#include<cstdio>

using namespace std;

int main(){
	int pa[10][10];
	int i,j;	//ループカウンタ
	int x,y,size,da=0,not=-1;
	
	//二次元配列の初期化
	for(i=0;i<10;i++){
		for(j=0;j<10;j++)
			pa[i][j]=0;
	}

	while(scanf("%d,%d,%d",&x,&y,&size)!=EOF){
		switch(size){
			case 1:	//小
				pa[x][y]++;
				pa[x-1][y]++;
				pa[x+1][y]++;
				pa[x][y-1]++;
				pa[x][y+1]++;
				break;
			case 2:	//中
				for(i=-1;i<=1;i++){
					for(j=-1;j<=1;j++)
						pa[x+i][y+j]++;
				}
				break;
			case 3:	//大
				for(i=-1;i<=1;i++){
					for(j=-1;j<=1;j++)
						pa[x+i][y+j]++;
				}
				pa[x-2][y]++;
				pa[x+2][y]++;
				pa[x][y-2]++;
				pa[x][y+2]++;
				break;
		}
	}
	for(i=0;i<10;i++){
		for(j=0;j<10;j++){
			if(pa[i][j]==0)
				not++;
		}
	}
	for(i=0;i<10;i++){
		for(j=0;j<10;j++){
			if(pa[i][j]>da)
				da=pa[i][j];
		}
	}
	printf("%d\n%d\n",not,da);

	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:9:27: error: expected unqualified-id before 'not' token
    9 |         int x,y,size,da=0,not=-1;
      |                           ^~~
a.cc:47:38: error: expected primary-expression before ';' token
   47 |                                 not++;
      |                                      ^
a.cc:56:30: error: expected primary-expression before ',' token
   56 |         printf("%d\n%d\n",not,da);
      |                              ^
Language: C++

//インクを落とす
#include<cstdio>

using namespace std;

int main(void){
	int pa[10][10];
	int i,j;	//ループカウンタ
	int x,y,size,da=0,not=0;
	
	//二次元配列の初期化
	for(i=0;i<10;i++){
		for(j=0;j<10;j++)
			pa[i][j]=0;
	}

	while(scanf("%d,%d,%d",&x,&y,&size)!=-1){
		switch(size){
			case 1:	//小
				pa[x][y]++;
				pa[x-1][y]++;
				pa[x+1][y]++;
				pa[x][y-1]++;
				pa[x][y+1]++;
				break;
			case 2:	//中
				for(i=-1;i<=1;i++){
					for(j=-1;j<=1;j++)
						pa[x+i][y+j]++;
				}
				break;
			case 3:	//大
				for(i=-1;i<=1;i++){
					for(j=-1;j<=1;j++)
						pa[x+i][y+j]++;
				}
				pa[x-2][y]++;
				pa[x+2][y]++;
				pa[x][y-2]++;
				pa[x][y+2]++;
				break;
		}
	}
	for(i=0;i<10;i++){
		for(j=0;j<10;j++){
			if(pa[i][j]==0)
				not++;
		}
	}
	for(i=0;i<10;i++){
		for(j=0;j<10;j++){
			if(pa[i][j]>da)
				da=pa[i][j];
		}
	}
	printf("%d\n%d\n",not,da);

	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:9:27: error: expected unqualified-id before 'not' token
    9 |         int x,y,size,da=0,not=0;
      |                           ^~~
a.cc:47:38: error: expected primary-expression before ';' token
   47 |                                 not++;
      |                                      ^
a.cc:56:30: error: expected primary-expression before ',' token
   56 |         printf("%d\n%d\n",not,da);
      |                              ^
Language: C++

//インクを落とす
#include<cstdio>

using namespace std;

int main(void){
	int pa[14][14];
	int i,j;	//ループカウンタ
	int x,y,size,da=0,not=0;
	
	//二次元配列の初期化
	for(i=2;i<12;i++){
		for(j=2;j<12;j++)
			pa[i][j]=0;
	}

	while(scanf("%d,%d,%d",&x,&y,&size)!=EOF){
		switch(size){
			case 1:	//小
				pa[x][y]++;
				pa[x-1][y]++;
				pa[x+1][y]++;
				pa[x][y-1]++;
				pa[x][y+1]++;
				break;
			case 2:	//中
				for(i=-1;i<=1;i++){
					for(j=-1;j<=1;j++)
						pa[x+i][y+j]++;
				}
				break;
			case 3:	//大
				for(i=-1;i<=1;i++){
					for(j=-1;j<=1;j++)
						pa[x+i][y+j]++;
				}
				pa[x-2][y]++;
				pa[x+2][y]++;
				pa[x][y-2]++;
				pa[x][y+2]++;
				break;
		}
	}
	for(i=2;i<12;i++){
		for(j=2;j<12;j++){
			if(pa[i][j]==0)
				not++;
		}
	}
	for(i=2;i<12;i++){
		for(j=2;j<12;j++){
			if(pa[i][j]>da)
				da=pa[i][j];
		}
	}
	printf("%d\n%d\n",not,da);

	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:9:27: error: expected unqualified-id before 'not' token
    9 |         int x,y,size,da=0,not=0;
      |                           ^~~
a.cc:47:38: error: expected primary-expression before ';' token
   47 |                                 not++;
      |                                      ^
a.cc:56:30: error: expected primary-expression before ',' token
   56 |         printf("%d\n%d\n",not,da);
      |                              ^
Language: C++

//インクを落とす
#include<cstdio>

using namespace std;

int main(void){
	int pa[14][14];
	int i,j;	//ループカウンタ
	int x,y,size,da=0,not=0;
	
	//二次元配列の初期化
	for(i=2;i<12;i++){
		for(j=2;j<12;j++)
			pa[i][j]=0;
	}

	while(scanf("%d,%d,%d",&x,&y,&size)!=EOF){
		x=x+2;
		y=y+2;
		switch(size){
			case 1:	//小
				pa[x][y]++;
				pa[x-1][y]++;
				pa[x+1][y]++;
				pa[x][y-1]++;
				pa[x][y+1]++;
				break;
			case 2:	//中
				for(i=-1;i<=1;i++){
					for(j=-1;j<=1;j++)
						pa[x+i][y+j]++;
				}
				break;
			case 3:	//大
				for(i=-1;i<=1;i++){
					for(j=-1;j<=1;j++)
						pa[x+i][y+j]++;
				}
				pa[x-2][y]++;
				pa[x+2][y]++;
				pa[x][y-2]++;
				pa[x][y+2]++;
				break;
		}
	}
	for(i=2;i<12;i++){
		for(j=2;j<12;j++){
			if(pa[i][j]==0)
				not++;
		}
	}
	for(i=2;i<12;i++){
		for(j=2;j<12;j++){
			if(pa[i][j]>da)
				da=pa[i][j];
		}
	}
	printf("%d\n%d\n",not,da);

	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:9:27: error: expected unqualified-id before 'not' token
    9 |         int x,y,size,da=0,not=0;
      |                           ^~~
a.cc:49:38: error: expected primary-expression before ';' token
   49 |                                 not++;
      |                                      ^
a.cc:58:30: error: expected primary-expression before ',' token
   58 |         printf("%d\n%d\n",not,da);
      |                              ^
Language: C++

//インクを落とす
#include<cstdio>

using namespace std;

int main(void){
	int pa[14][14];
	int i,j;	//ループカウンタ
	int x,y,size,da=0,not=0;
	
	//二次元配列の初期化
	for(i=0;i<14;i++){
		for(j=0;j<14;j++)
			pa[i][j]=0;
	}

	while(scanf("%d,%d,%d",&x,&y,&size)!=EOF){
		x=x+2;
		y=y+2;
		switch(size){
			case 1:	//小
				pa[x][y]++;
				pa[x-1][y]++;
				pa[x+1][y]++;
				pa[x][y-1]++;
				pa[x][y+1]++;
				break;
			case 2:	//中
				for(i=-1;i<=1;i++){
					for(j=-1;j<=1;j++)
						pa[x+i][y+j]++;
				}
				break;
			case 3:	//大
				for(i=-1;i<=1;i++){
					for(j=-1;j<=1;j++)
						pa[x+i][y+j]++;
				}
				pa[x-2][y]++;
				pa[x+2][y]++;
				pa[x][y-2]++;
				pa[x][y+2]++;
				break;
		}
	}
	for(i=2;i<12;i++){
		for(j=2;j<12;j++){
			if(pa[i][j]==0)
				not++;
		}
	}
	for(i=2;i<12;i++){
		for(j=2;j<12;j++){
			if(pa[i][j]>da)
				da=pa[i][j];
		}
	}
	printf("%d\n%d\n",not,da);

	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:9:27: error: expected unqualified-id before 'not' token
    9 |         int x,y,size,da=0,not=0;
      |                           ^~~
a.cc:49:38: error: expected primary-expression before ';' token
   49 |                                 not++;
      |                                      ^
a.cc:58:30: error: expected primary-expression before ',' token
   58 |         printf("%d\n%d\n",not,da);
      |                              ^
Language: C++

//インクを落とす
#include<cstdio>

using namespace std;

int main(void){
	int pa[14][14];
	int i,j;	//ループカウンタ
	int x,y,size,da=0,not=0;
	
	//二次元配列の初期化
	for(i=0;i<14;i++){
		for(j=0;j<14;j++)
			pa[i][j]=0;
	}

	while(scanf("%d,%d,%d",&x,&y,&size)!=EOF){
		x=x+2;
		y=y+2;
		switch(size){
			case 1:	//小
				pa[y][x]++;
				pa[y-1][x]++;
				pa[y+1][x]++;
				pa[y][x-1]++;
				pa[y][x+1]++;
				break;
			case 2:	//中
				for(i=-1;i<=1;i++){
					for(j=-1;j<=1;j++)
						pa[y+i][x+j]++;
				}
				break;
			case 3:	//大
				for(i=-1;i<=1;i++){
					for(j=-1;j<=1;j++)
						pa[y+i][x+j]++;
				}
				pa[y-2][x]++;
				pa[y+2][x]++;
				pa[y][x-2]++;
				pa[y][x+2]++;
				break;
		}
	}
	for(i=2;i<12;i++){
		for(j=2;j<12;j++){
			if(pa[i][j]==0)
				not++;
		}
	}
	for(i=2;i<12;i++){
		for(j=2;j<12;j++){
			if(pa[i][j]>da)
				da=pa[i][j];
		}
	}
	printf("%d\n%d\n",not,da);

	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:9:27: error: expected unqualified-id before 'not' token
    9 |         int x,y,size,da=0,not=0;
      |                           ^~~
a.cc:49:38: error: expected primary-expression before ';' token
   49 |                                 not++;
      |                                      ^
a.cc:58:30: error: expected primary-expression before ',' token
   58 |         printf("%d\n%d\n",not,da);
      |                              ^
Language: C++

#include<cstdio>

using namespace std;

int main(void){
	int pa[14][14];
	int i,j;
	int x,y,size,da=0,not=0;
	
	for(i=0;i<14;i++){
		for(j=0;j<14;j++)
			pa[i][j]=0;
	}

	while(scanf("%d,%d,%d",&x,&y,&size)!=EOF){
		x=x+2;
		y=y+2;
		switch(size){
			case 1:
				pa[y][x]++;
				pa[y-1][x]++;
				pa[y+1][x]++;
				pa[y][x-1]++;
				pa[y][x+1]++;
				break;
			case 2:
				for(i=-1;i<=1;i++){
					for(j=-1;j<=1;j++)
						pa[y+i][x+j]++;
				}
				break;
			case 3:
				for(i=-1;i<=1;i++){
					for(j=-1;j<=1;j++)
						pa[y+i][x+j]++;
				}
				pa[y-2][x]++;
				pa[y+2][x]++;
				pa[y][x-2]++;
				pa[y][x+2]++;
				break;
		}
	}
	for(i=2;i<12;i++){
		for(j=2;j<12;j++){
			if(pa[i][j]==0)
				not++;
			if(pa[i][j]>da)
				da=pa[i][j];
		}
	}
	printf("%d\n%d\n",not,da);

	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:8:27: error: expected unqualified-id before 'not' token
    8 |         int x,y,size,da=0,not=0;
      |                           ^~~
a.cc:47:38: error: expected primary-expression before ';' token
   47 |                                 not++;
      |                                      ^
a.cc:52:30: error: expected primary-expression before ',' token
   52 |         printf("%d\n%d\n",not,da);
      |                              ^
Language: C++

#include<cstdio>

using namespace std;

int main(){
 int pa[14][14];
 int i,j;
 int x,y,size;
 int da=0,not=0;
 
 for(i=0;i<14;i++){
  for(j=0;j<14;j++)
   pa[i][j]=0;
 }

 while(scanf("%d,%d,%d",&x,&y,&s)!=-1){
  x=x+2;
  y=y+2;
  switch(size){
   case 1:
    pa[y][x]++;
    pa[y-1][x]++;
    pa[y+1][x]++;
    pa[y][x-1]++;
    pa[y][x+1]++;
    break;
   case 2:
    for(i=-1;i<=1;i++){
     for(j=-1;j<=1;j++)
      pa[y+i][x+j]++;
    }
    break;
   case 3:
    for(i=-1;i<=1;i++){
     for(j=-1;j<=1;j++)
      pa[y+i][x+j]++;
    }
    pa[y-2][x]++;
    pa[y+2][x]++;
    pa[y][x-2]++;
    pa[y][x+2]++;
    break;
   default: break;
  }
 }
 for(i=2;i<12;i++){
  for(j=2;j<12;j++){
   if(pa[i][j]==0)
    not++;
  }
 }
 for(i=2;i<12;i++){
  for(j=2;j<12;j++){
   if(pa[i][j]>da)
    da=pa[i][j];
  }
 }
 printf("%d\n%d\n",not,da);
 return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:9:11: error: expected unqualified-id before 'not' token
    9 |  int da=0,not=0;
      |           ^~~
a.cc:16:32: error: 's' was not declared in this scope
   16 |  while(scanf("%d,%d,%d",&x,&y,&s)!=-1){
      |                                ^
a.cc:49:10: error: expected primary-expression before ';' token
   49 |     not++;
      |          ^
a.cc:58:23: error: expected primary-expression before ',' token
   58 |  printf("%d\n%d\n",not,da);
      |                       ^
Language: C++

#include<cstdio>

using namespace std;

int main(){
 int pa[14][14];
 int i,j;
 int x,y,size;
 int da=0,not=0;
 
 for(i=0;i<14;i++){
  for(j=0;j<14;j++)
   pa[i][j]=0;
 }

 while(scanf("%d,%d,%d",&x,&y,&size)!=-1){
  x=x+2;
  y=y+2;
  switch(size){
   case 1:
    pa[y][x]++;
    pa[y-1][x]++;
    pa[y+1][x]++;
    pa[y][x-1]++;
    pa[y][x+1]++;
    break;
   case 2:
    for(i=-1;i<=1;i++){
     for(j=-1;j<=1;j++){
      pa[y+i][x+j]++;
		}
    }
    break;
   case 3:
    for(i=-1;i<=1;i++){
     for(j=-1;j<=1;j++){
      pa[y+i][x+j]++;
		}
    }
    pa[y-2][x]++;
    pa[y+2][x]++;
    pa[y][x-2]++;
    pa[y][x+2]++;
    break;
   default: break;
  }
 }
 for(i=2;i<12;i++){
  for(j=2;j<12;j++){
   if(pa[i][j]==0){
    not++;
	}
  }
 }
 for(i=2;i<12;i++){
  for(j=2;j<12;j++){
   if(pa[i][j]>da){
    da=pa[i][j];
	}
  }
 }
 printf("%d\n%d\n",not,da);
 return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:9:11: error: expected unqualified-id before 'not' token
    9 |  int da=0,not=0;
      |           ^~~
a.cc:51:10: error: expected primary-expression before ';' token
   51 |     not++;
      |          ^
a.cc:62:23: error: expected primary-expression before ',' token
   62 |  printf("%d\n%d\n",not,da);
      |                       ^
Language: C++

#include<cstdio>

using namespace std;

int main(){
 int pa[14][14];
 int i,j;
 int x,y,size;
 int da;
 int not;
 da=not=0;
 for(i=0;i<14;i++){
  for(j=0;j<14;j++)
   pa[i][j]=0;
 }

 while(scanf("%d,%d,%d",&x,&y,&size)!=-1){
  x=x+2;
  y=y+2;
  switch(size){
   case 1:
    pa[y][x]++;
    pa[y-1][x]++;
    pa[y+1][x]++;
    pa[y][x-1]++;
    pa[y][x+1]++;
    break;
   case 2:
    for(i=-1;i<=1;i++){
     for(j=-1;j<=1;j++){
      pa[y+i][x+j]++;
		}
    }
    break;
   case 3:
    for(i=-1;i<=1;i++){
     for(j=-1;j<=1;j++){
      pa[y+i][x+j]++;
		}
    }
    pa[y-2][x]++;
    pa[y+2][x]++;
    pa[y][x-2]++;
    pa[y][x+2]++;
    break;
   default:break;
  }
 }
 for(i=2;i<12;i++){
  for(j=2;j<12;j++){
   if(pa[i][j]==0){
    not++;
	}
  }
 }
 for(i=2;i<12;i++){
  for(j=2;j<12;j++){
   if(pa[i][j]>da){
    da=pa[i][j];
	}
  }
 }
 printf("%d\n%d\n",not,da);
 return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:10:6: error: expected unqualified-id before 'not' token
   10 |  int not;
      |      ^~~
a.cc:11:8: error: expected primary-expression before '=' token
   11 |  da=not=0;
      |        ^
a.cc:52:10: error: expected primary-expression before ';' token
   52 |     not++;
      |          ^
a.cc:63:23: error: expected primary-expression before ',' token
   63 |  printf("%d\n%d\n",not,da);
      |                       ^