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>
#include<cstdio>
#include<algorithm>

using namespace std;

int main(){
	int masu[14][14] = {0};
	int x, y, s, i, j, n = 0, cut = 0;
	int num[100] = {0};

	while(scanf("%d,%d,%d", &x, &y, &s) != EOF){
		x = x + 2;
		y = y + 2;
		masu[x][y] ++;
		if(s == 1){
			masu[x][y-1] += 1, masu[x][y+1] += 1, masu[x-1][y] += 1, masu[x+1][y] += 1;
		}
		else if(s == 2){
			masu[x][y-1] += 1, masu[x][y+1] += 1, masu[x-1][y] += 1, masu[x+1][y] += 1;
			masu[x+1][y-1] += 1, masu[x+1][y+1] += 1, masu[x-1][y-1] += 1, masu[x-1][y+1] += 1;
		}
		else{
			masu[x][y-1] += 1, masu[x][y+1] += 1, masu[x-1][y] += 1, masu[x+1][y] += 1;
			masu[x+1][y-1] += 1, masu[x+1][y+1] += 1, masu[x-1][y-1] += 1, masu[x-1][y+1] += 1;
			masu[x+2][y] += 1, masu[x-2][y] += 1, masu[x][y+2] +=1, masu[x][y-2] += 1;
		}
		
	}

	for(i = 2; i < 12; i ++){
		for(j = 2; j < 12; j ++){
			num[n] = masu[i][j];
			n ++;
		}
	}

	sort(num, num+100);

	for(i = 0; i < 100; i ++){
		if(num[i] == 0) cut ++;
		else break;
	}

	cout << cut << endl << num[99] << endl;

	return 0;    
}

C++: #include <iostream>
#include <cstring>
#include <cstdio>

using namespace std;

int main(void){
  int i,j;
  int field[16][16]={0};
  int x,y;
  int size;
  int max=0;
  int none=0;

  while(scanf("%d,%d,%d",&x,&y,&size)!=EOF){
    if(size>=1){
      field[x+2][y+2]++;
      field[x+1][y+2]++;
      field[x+3][y+2]++;
      field[x+2][y+1]++;
      field[x+2][y+3]++;
    }
    if(size>=2){
      field[x+1][y+1]++;
      field[x+1][y+3]++;
      field[x+3][y+1]++;
      field[x+3][y+3]++;
    }
    if(size>=3){
      field[x+2][y]++;
      field[x+2][y+4]++;
      field[x][y+2]++;
      field[x+4][y+2]++;
    }
  }

  for(i=2;i<12;i++){
    for(j=2;j<12;j++){
      if(field[i][j]>max){
	max=field[i][j];
      }
      if(field[i][j]==0){
	none++;
      }
    }
  }

  cout<<none<<endl;
  cout<<max<<endl;

  return(0);
}

C++: #include<iostream>
using namespace std;
int mas[10][10]={{0}};
void dot(int x,int y){
  if(x>=0&&y>=0&&x<=9&&y<=9) mas[y][x]++;
}
void small(int x,int y){
  dot(x,y);
  dot(x+1,y);
  dot(x,y+1);
  dot(x-1,y);
  dot(x,y-1);
}
void mid(int x,int y){
  small(x,y);
  dot(x+1,y+1);
  dot(x-1,y-1);
  dot(x+1,y-1);
  dot(x-1,y+1);
}
void big(int x,int y){
  mid(x,y);
  dot(x+2,y);
  dot(x-2,y);
  dot(x,y+2);
  dot(x,y-2);
}
int main(){
  int count=0,max=0,x,y,size;
  char a,b;
  while(cin>>x>>a>>y>>b>>size){
    if(size==1) small(x,y);
    else if(size==2) mid(x,y);
    else big(x,y);
  }
  for(int i=0;i<10;i++){
    for(int j=0;j<10;j++){
      if(mas[i][j]==0) count++;
      if(mas[i][j]>max) max = mas[i][j];
    }
  }
  cout << count << endl << max << endl;
  return 0;
}

C++: #include<iostream>
#include<cstdio>
using namespace std;
int main(){
  int mp[100][100];
  int x,y,size;
  int siro=100;
  int kosa=0;
  for(int i=20;i<30;i++){
    for(int j=20;j<30;j++){
      mp[i][j]=0;
    }
  }

  while(scanf("%d,%d,%d",&x,&y,&size)!=EOF){
    x=x+20;
    y=y+20;
    if(size==1){
      if(20<=x && x<=29 && 20<=y && y<=29){
	mp[x][y]++;
	mp[x+1][y]++;
	mp[x][y+1]++;
	mp[x-1][y]++;
	mp[x][y-1]++;
      }
    }
    else if(size==2){
      if(20<=x && x<=29 && 20<=y && y<=29){
	mp[x][y]++;
	mp[x][y-1]++;
	mp[x+1][y-1]++;
	mp[x+1][y]++;
	mp[x+1][y+1]++;
	mp[x][y+1]++;
	mp[x-1][y+1]++;
	mp[x-1][y]++;
	mp[x-1][y-1]++;
      }
    }
    else if(size==3){
      if(20<=x && x<=29 && 20<=y && y<=29){
	mp[x][y]++;
	mp[x][y-1]++;
	mp[x+1][y-1]++;
	mp[x+1][y]++;
	mp[x+1][y+1]++;
	mp[x][y+1]++;
	mp[x-1][y+1]++;
	mp[x-1][y]++;
	mp[x-1][y-1]++;
	mp[x][y-2]++;
	mp[x+2][y]++;
	mp[x][y+2]++;
	mp[x-2][y]++;
      }
    }
  }
  for(int i=20;i<30;i++){
    for(int j=20;j<30;j++){
      if(mp[i][j]!=0) siro--;
      if(kosa<mp[i][j]) kosa=mp[i][j];
    }
  }
  printf("%d\n",siro);
  printf("%d\n",kosa);
}

C++: #include <iostream>
#include <cstdio>

using namespace std;

int paper[14][14] = {0};

void drop(int n, int m, int l)
{
    if (l == 3)
    {
        paper[n][m + 2]++;

        paper[n + 1][m + 1]++;
        paper[n + 1][m + 2]++;
        paper[n + 1][m + 3]++;
        
        paper[n + 2][m]++;
        paper[n + 2][m + 1]++;
        paper[n + 2][m + 3]++;
        paper[n + 2][m + 4]++;

        paper[n + 3][m + 1]++;
        paper[n + 3][m + 2]++;
        paper[n + 3][m + 3]++;

        paper[n + 4][m + 2]++;

    }
    else if (l == 2)
    {
        paper[n + 1][m + 1]++;
        paper[n + 1][m + 2]++;
        paper[n + 1][m + 3]++;
        
        paper[n + 2][m + 1]++;
        paper[n + 2][m + 2]++;
        paper[n + 2][m + 3]++;

        paper[n + 3][m + 1]++;
        paper[n + 3][m + 2]++;
        paper[n + 3][m + 3]++;
    }
    else if( l == 1 )
    {
        paper[n + 1][m + 2]++;

        paper[n + 2][m + 1]++;
        paper[n + 2][m + 2]++;
        paper[n + 2][m + 3]++;

        paper[n + 3][m + 2]++;
    }
    
    return;
}

int n, m, l;

int main()
{
    while (scanf("%d,%d,%d\n", &n, &m, &l) != EOF)
    {
        drop(n, m, l);

/*         printf( "%d %d %d\n", n, m, l ); */
/* 
        for (int i = 2; i < 12; i++)
        {
            for (int j = 2; j < 12; j++)
            {
                printf(" %d", paper[i][j]);
            }
            printf("\n");
        } */
        n--;
    }

    int zero = 0, max = 0;
    for (int i = 2; i < 12; i++)
    {
        for (int j = 2; j < 12; j++)
        {
            if (paper[i][j] == 0)
            {
                zero++;
            }
            else if (paper[i][j] > max)
            {
                max = paper[i][j];
            }
        }
    }
    printf("%d\n%d\n", zero, max );
    return 0;
}