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 <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("%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;

}

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

int a[10][10];

void drop( int x, int y ){
  if( x<0 || x>=10 ) return;
  if( y<0 || y>=10 ) return;
  a[y][x]++;
}

int main(){
  int x,y,s;
  char c;

  for( int i=0;i<10;i++ )
    for( int j=0;j<10;j++ )
      a[i][j] = 0;

  while( cin>>x>>c>>y>>c>>s ){
    //    cout << x << " "<< y << " "<<s << endl;

    if( s>=1 ){
      drop(x,y);
      drop(x+1,y); drop(x-1,y);
      drop(x,y+1); drop(x,y-1);
    }
    if( s>=2 ){
      drop(x+1,y+1); drop(x+1,y-1);
      drop(x-1,y+1); drop(x-1,y-1);
    }
    if( s>=3 ){
      drop(x,y+2); drop(x,y-2);
      drop(x+2,y); drop(x-2,y);
    }
  }
  int zero=0;
  int mx=0;
  for( int i=0;i<10;i++ ){
    for( int j=0;j<10;j++ ){
      if( a[i][j]==0 ) zero++;
      if( a[i][j]>mx ) mx=a[i][j];
    }
  }
  cout << zero << endl;
  cout << mx << endl;

  return 0;
}

C++: #include <cstdio>

using namespace std;

int main() {
	int p[10][10];
	for (int i=0; i<10; i++) {
		for (int j=0; j<10; j++) {
			p[i][j] = 0;
		}
	}
	int x,y,size;
	int dx[] = { 0, 0,-1, 1,-1,-1, 1, 1, 0, 0,-2, 2};
	int dy[] = {-1, 1, 0, 0,-1, 1,-1, 1,-2, 2, 0, 0};
	while (scanf("%d,%d,%d", &x, &y, &size)!=EOF) {
		p[x][y]++;
		for (int i=0; i<size*4; i++) {
			int mx=x+dx[i];
			int my=x+dy[i];
			if (mx>=0&&mx<10&&my>=0&&my<10) {
				p[mx][my]++;
			}
		}
	}
	int c=0,m=0;
	for (int i=0; i<10; i++) {
		for (int j=0; j<10; j++) {
			if (p[i][j] == 0) {
				c++;
			} else if (p[i][j]>m) {
				m=p[i][j];
			}
		}
	}
	scanf("%d\n%d\n",c,m);
	return 0;
}

C++: 
#include<stdio.h>
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include <map>     
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <iomanip>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
#define roop(a,t) for(int a=0;a<t;a++) 
int grid[14][14];
int main()
{
	cin.tie(0);
	ios::sync_with_stdio(false);
	int u;
	roop(i, 0) { roop(j, 0) { grid[i][j] = 0; } }
	int pow1x[5] = { 0,1,-1,0,0 };
	int pow1y[5] = { 0,0,0,1,-1 };
	int pow2x[9] = { 0,0,0,1,1,1,-1,-1,-1 };
	int pow2y[9] = { -1,0,1,-1,0,1,-1,0,1 };
	int pow3x[13] = { 0 ,0,0,0,0,1,1,1,-1,-1,-1,2,-2 };
	int pow3y[13] = { 2,1,0,-1,-2,1,0,-1,1,0,-1,0,0 };
	int x, y, power;
	char g, h;
	while (cin >> x >> g >> y >> h >> power) {
		
		x += 2; y += 2;
		power = power * 4 + 1;
		if (power == 5) {
			for (int i = 0; i < power; i++) {
				grid[pow1x[i] + x][pow1y[i] + y]++;
			}
		}
		else if (power == 9) {
			for (int i = 0; i < power; i++) {
				grid[pow2x[i] + x][pow2y[i] + y]++;
			}
		}
		else {
			for (int i = 0; i < power; i++) {
				grid[pow3x[i] + x][pow3y[i] + y]++;
			}
		}
	}
	int ans1 = 0;
	int ans2 = 0;
	for (int i = 2; i < 12; i++) {
		for (int j = 2; j < 12; j++) {
			ans2 = max(ans2, grid[i][j]);
			if (grid[i][j] = 0) {
				ans1++;
			}
			/////
			cout<< grid[i][j]<<" ";
		}cout<<endl;
	}
	
	cout << ans1 << endl << ans2 << endl;
	return 0;
}

C++: #include <stdio.h>

#define SIZE 10

int main()
{
	int paper[SIZE][SIZE], x, y, s, i, j, zero_count, max;

	zero_count = 0;
	max = 0;

	for(i = 0; i < SIZE; i++){
		for(j = 0; j < SIZE; j++){
			paper[i][j] = 0;
		}
	}

	while(scanf("%d,%d,%d", &x, &y, &s) != EOF){
		switch(s){
			case 1:
				paper[x][y]++;
				paper[x-1][y]++;
				paper[x][y-1]++;
				paper[x+1][y]++;
				paper[x][y+1]++;
				break;
			case 2:
				for(i = 0; i < 3; i++){
					for(j = 0; j < 3; j++){
						paper[x+i-1][y+j-1]++;
					}
				}
				break;
			case 3:
				for(i = 0; i < 3; i++){
					for(j = 0; j < 3; j++){
						paper[x+i-1][y+j-1]++;
					}
				}

				paper[x-2][y]++;
				paper[x][y-2]++;
				paper[x+2][y]++;
				paper[x][y+2]++;
				break;
		}
	}

	for(i = 0; i < SIZE; i++){
		for(j = 0; j < SIZE; j++){
			printf("%2d", paper[j][i]);
			if(paper[j][i] == 0) zero_count++;
			if(paper[j][i] > max) max = paper[j][i];
		}
		printf("\n");
	}

	printf("%d\n%d\n", zero_count, max);

	return 0;
}