Go: package main

import (
        "fmt"
)

var paper [10][10]int

func main() {
        var x, y, s int
        for {
                _, err := fmt.Scanf("%d,%d,%d", &x, &y, &s)
                if err != nil {
                        break
                }

                fill(x, y, s)
        }
        var d, z int
        for i := 0; i < 10; i++ {
                for j := 0; j < 10; j++ {
                        if paper[i][j] == 0 {
                                z += 1
                        }
                        if paper[i][j] > d {
                                d += 1
                        }
                }
        }
        fmt.Printf("%d\n%d\n", z, d)
}

func fill(x int, y int, s int) {
        paper[x][y] += 1
        if x > 0 {
                paper[x-1][y] += 1
        }
        if x < 9 {
                paper[x+1][y] += 1
        }
        if y > 0 {
                paper[x][y-1] += 1
        }
        if y < 9 {
                paper[x][y+1] += 1
        }

        if s >= 2 {
                if x > 0 && y > 0 {
                        paper[x-1][y-1] += 1
                }
                if x > 0 && y < 9 {
                        paper[x-1][y+1] += 1
                }
                if x < 9 && y > 0 {
                        paper[x+1][y-1] += 1
                }
                if x < 9 && y < 9 {
                        paper[x+1][y+1] += 1
                }
        }

        if s > 2 {
                if x > 1 {
                        paper[x-2][y] += 1
                }
                if x < 8 {
                        paper[x+2][y] += 1
                }
                if y > 1 {
                        paper[x][y-2] += 1
                }
                if y < 8 {
                        paper[x][y+2] += 1
                }
        }
}

C++: #include <iostream>
using namespace std;

int main()
{
  int x, y, size;
  int canvas[10][10];
  int emp, max;
  char comma;
  int i, j;

  for(i=0; i<10; i++){
    for(j=0; j<10; j++) canvas[i][j]=0;
  }
  while(cin >> x >> comma >> y >> comma >> size){
    if(x>0) canvas[x-1][y]++;
    if(x<9) canvas[x+1][y]++;
    if(y>0) canvas[x][y-1]++;
    if(y<9) canvas[x][y+1]++;
    if(size>1){
      for(i=-1; i<=1; i+=2){
        for(j=-1; j<=1; j+=2){
          if(x+i>=0 && x+i<=9 && y+j>=0 && y+j<=9) canvas[x+i][y+j]++;
        }
      }
    }
    if(size>2){
      if(x>1) canvas[x-2][y]++;
      if(x<8) canvas[x+2][y]++;
      if(y>1) canvas[x][y-2]++;
      if(y<8) canvas[x][y+2]++;
    }
  }
  emp=0; max=0;
  for(i=0; i<10; i++){
    for(j=0; j<10; j++){
      if(canvas[i][j]==0) emp++;
      if(max<canvas[i][j]) max=canvas[i][j];
    }
  }
  printf("%d\n%d\n", emp, max);

  return 0;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;

int main(){
	int area[14][14];
	int x, y;
	char a, b;
	int size;
	for(int i = 0; i < 14; i++){
		for(int j = 0; j < 14; j++){
			area[i][j] = 0;
		}
	}
	while(cin >> x >> a >> y >> b >> size){
		x += 2;
		y += 2;
		area[x][y]++;
		area[x+1][y]++;
		area[x-1][y]++;
		area[x][y+1]++;
		area[x][y-1]++;
		if(size >= 2){
			area[x+1][y+1]++;
			area[x+1][y-1]++;
			area[x-1][y-1]++;
			area[x-1][y+1]++;
			if(size == 3){
				area[x+2][y]++;
				area[x-2][y]++;
				area[x][y+2]++;
				area[x][y-2]++;
			}
		}
	}
	int count = 0;
	int kmax = 0;
	for(int i = 2; i < 12; i++){
		for(int j = 2; j < 12; j++){
			if(area[i][j] == 0) count++;
			kmax = max(kmax, area[i][j]);
		}
	}
	cout << count << endl;
	cout << kmax << endl;
	return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;

int main(){

  int a[1000][1000] = {0};
  int x,y,z;
  int count = 0,kosa = 0;
  char s,t;

  while(cin >> x >> s >> y >> t >> z){

    if(z == 1){
      for(int i=x-1;i<x+2;i++) a[i][y]++;
      a[x][y+1]++;
      a[x][y-1]++;
    }

    if(z == 2){
      for(int i=x-1;i<x+2;i++){
	for(int j=y-1;j<y+2;j++) a[i][j]++;
      }
    }

    if(z == 3){
      for(int i=x-1;i<x+2;i++){
	a[i][y+1]++;
	a[i][y-1]++;
      }

      for(int i=x-2;i<x+3;i++) a[i][y]++;
      a[x][y+2]++;
      a[x][y-2]++;
    }

  }

  for(int i=0;i<10;i++){
    for(int j=0;j<10;j++){
      if(a[i][j] == 0) count++;
      if(kosa < a[i][j]) kosa = a[i][j];
    }
  }

  cout << count << endl << kosa << endl;

}

C++: #include <iostream>
#include <cstdio>
#include <string>
#include <sstream>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <vector>
#include <queue>

#define PI 3.14159265359

#define INF 1000000;

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

typedef long long ll;

using namespace std;


/*
class ElectronicPetEasy
{
public:
	string isDifficult(int st1, int p1, int t1, int st2, int p2, int t2)
	{
		
	}
};
*/




int main()
{
	int vx[]={ 0, 1,-1, 0, 0,-1,-1, 1, 1, 2,-2, 0, 0};
	int vy[]={ 0, 0, 0, 1,-1,-1, 1,-1, 1, 0, 0, 2,-2};
	int x, y, size, grid[10][10], nm_ans = 0, max_ans = 0;
	
	//grid初期化
	for (int i=0; i<10; i++)
	{
		for (int j=0; j<10; j++)
		{
			grid[i][j] = 0;
		}
	}
	
	while (scanf("%d,%d,%d", &x, &y, &size) != EOF)
	{
		switch (size)
		{
		case 1:
			for (int i=0; i<5; i++)
			{
				if ((min(x+vx[i], y+vy[i]) >= 0) && (max(x+vx[i], y+vy[i]) < 10))
				{
					grid[x+vx[i]][y+vy[i]]++;
				}
			}
			break;
		case 2:
			for (int i=0; i<9; i++)
			{
				if ((min(x+vx[i], y+vy[i]) >= 0) && (max(x+vx[i], y+vy[i]) < 10))
				{
					grid[x+vx[i]][y+vy[i]]++;
				}
			}
			break;
		case 3:
			for (int i=0; i<13; i++)
			{
				if ((min(x+vx[i], y+vy[i]) >= 0) && (max(x+vx[i], y+vy[i]) < 10))
				{
					grid[x+vx[i]][y+vy[i]]++;
				}
			}
			break;
		}
	}
	
	for (int i=0; i<10; i++)
	{
		for (int j=0; j<10; j++)
		{
			max_ans = max(max_ans, grid[i][j]);
			if (grid[i][j] == 0) nm_ans++;
		}
	}
	
	cout << nm_ans << endl;
	cout << max_ans << endl;
	
	return 0;
}

C++: #include<iostream>
#include<cstdio>
#define PAPER_C 10
#define PAPER_R 10
using namespace std;
void drop(int p[PAPER_C][PAPER_R], int x,int y){
	if(0<=x && x<PAPER_R && 0<=y && y<PAPER_C){
		p[y][x]++;
	}
	return;
}
int main(){
	int paper[PAPER_C][PAPER_R] = {0};
	int i, j, x, y, size, cnt, max;
	max = 0;
	cnt = PAPER_C * PAPER_R;
	while(scanf("%d,%d,%d", &x, &y, &size) != EOF){
		if(size == 1){
			drop(paper, x, y);
			drop(paper, x-1, y);
			drop(paper, x+1, y);
			drop(paper, x, y-1);
			drop(paper, x, y+1);
		}else if(size == 2){
			for(i=-1;i<2;i++){
				for(j=-1;j<2;j++){
					drop(paper, x+j, y+i);
				}
			}
		}else if(size == 3){
			for(i=-1;i<2;i++){
				for(j=-1;j<2;j++){
					drop(paper, x+j, y+i);
				}
			}
			drop(paper, x-2, y);
			drop(paper, x+2, y);
			drop(paper, x, y-2);
			drop(paper, x, y+2);
		}
	}
	for(i=0;i<PAPER_C;i++){
		for(j=0;j<PAPER_R;j++){
			if(paper[i][j] != 0){
				cnt--;
				if(paper[i][j] > max){
					max = paper[i][j];
				}
			}
		}
	}
	cout << cnt << endl;
	cout << max << endl;
	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <stdio.h>
using namespace std;
int main(){
	int x,y,s,count=0;
	int paper[14][14] = {0};
	while(scanf("%d,%d,%d",&x,&y,&s) != EOF){
		if(s==1 || s==2 || s==3){
			paper[x+2][y+2]++;
			paper[x+1][y+2]++;
			paper[x+3][y+2]++;
			paper[x+2][y+1]++;
			paper[x+2][y+3]++;
		}
		if(s==2 || s==3){
			paper[x+1][y+1]++;
			paper[x+1][y+3]++;
			paper[x+3][y+1]++;
			paper[x+3][y+3]++;
		}
		if(s==3){
			paper[x+4][y+2]++;
			paper[x+2][y+4]++;
			paper[x][y+2]++;
			paper[x+2][y]++;
		}
	}
	int a = 1;
	for(int i=2;i<12;i++){
		for(int j=2;j<12;j++){
			if(paper[i][j] == 0) count++;
			if(a<paper[i][j]) a = paper[i][j];
		}
	}
	cout<<count<<endl;
	cout<<a<<endl;
	return 0;
}