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<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
int pos[10][10];
/*void p(){
	for(int i=0;i<10;++i){
		for(int j=0;j<10;++j){
			cout<<pos[i][j]<<" ";
		}
		cout<<endl;
	}
	cout<<endl;
}*/
main(){
	int tmp[3],ink2[3]={1,1,2};
	int ink[3][5][5]={
		{{0,1,0,0,0},{1,1,1,0,0},{0,1,0,0,0},{0,0,0,0,0},{0,0,0,0,0}},
		{{1,1,1,0,0},{1,1,1,0,0},{1,1,1,0,0},{0,0,0,0,0},{0,0,0,0,0}},
		{{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}}
	};
	for(int i=0;i<10;++i)
		for(int j=0;j<10;++j)
			pos[i][j]=0;
	while(cin>>tmp[0]){
		scanf(",%d,%d",&tmp[1],&tmp[2]);
		for(int i=0;i<5;++i){
			for(int j=0;j<5;++j){
				int t[2]={tmp[0]-ink2[tmp[2]-1]+i,tmp[1]-ink2[tmp[2]-1]+j};
				if(t[0]>=0 && t[0]<=9 && t[1]>=0 && t[1]<=9){
					pos[t[0]][t[1]]+=ink[tmp[2]-1][i][j];
				}
			}
		}
	}
	int ans[2]={0,0};
	for(int i=0;i<10;++i){
		for(int j=0;j<10;++j){
			if(pos[i][j]==0)ans[0]++;
			ans[1]=max(pos[i][j],ans[1]);
		}
	}
	cout<<ans[0]<<" "<<ans[1]<<endl;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main()
{
	int bigx[4] = { 0, 2, 0, -2 };
	int bigy[4] = { 2, 0, -2, 0 };
	int smx[4] = {0,1,0,-1};
	int smy[4] = {1,0,-1,0};
	int midx[9] = { -1, -1, 0, 1, 1,  1,  0, -1 };
	int midy[9] = {  0,  1, 1, 1, 0, -1, -1, -1 };
	int map[10][10] = { 0 };
	int cnt = 100;
	int x, y, size;
	char s, d;
	int ma = 0;
	int c = 0;
	while (cin >> x >> s >> y >> d >> size){
		
		if (size == 1){
			for (int i = 0; i < 4; i++){
				int xx = smx[i] + x;
				int yy = smy[i] + y;
				if (xx >= 0 && xx < 10 && y >= 0 && y < 10){
					map[xx][yy]++;
				}
			}
		}
		else if (size == 2){
			for (int i = 0; i < 8; i++){
				int xx = midx[i] + x;
				int yy = midy[i] + y;
				if (xx >= 0 && xx < 10 && y >= 0 && y < 10){
					map[xx][yy]++;
				}
			}
		}
		else if(size==3) {
			for (int i = 0; i < 4; i++){
				int xx = bigx[i] + x;
				int yy = bigy[i] + y;
				if (xx >= 0 && xx < 10 && y >= 0 && y < 10){
					map[xx][yy]++;
				}
			}
			for (int i = 0; i < 8; i++){
				int xx = midx[i] + x;
				int yy = midy[i] + y;
				if (xx >= 0 && xx < 10 && y >= 0 && y < 10){
					map[xx][yy]++;
				}
			}
		}
	}
	/*for (int i = 0; i < 10; i++){
		for (int i2 = 0; i2 < 10; i2++){
			cout << map[i][i2] << " ";
			if (map[i][i2] != 0){
				cnt--;
			}
			ma = max(ma, map[i][i2]);
		}cout << endl;
	}*/
	cout << ma << endl;
	cout << cnt << endl;
}

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

using namespace std;

int main() {

	int x, y, ink, blank=0, max=0, m[10][10];
	int mx[]={0, 1, 0, -1, 1, 1, -1, -1, 0, 2, 0, -2};
	int my[]={1, 0, -1, 0, 1, -1, -1, 1, 2, 0, -2, 0};

	for(x=0; x<10; x++) {
		for(y=0; y<10; y++) {
			m[x][y]=0;
		}
	}

	while(scanf("%d, %d, %d", &x, &y, &ink)!=EOF) {
		m[x][y]++;
		for(int i=0; i<ink*4; i++) {
			int dx=x+mx[i];
			int dy=y+my[i];
			if(x>=0&&x<=9&&y>=0&&y<=9)
				m[dx][dy]++;
		}
	}

	for(int i=0; i<10; i++) {
		for(int j=0; j<10; j++) {
			if(m[i][j]==0)
				blank++;
			if(m[i][j]>max)
				max=m[i][j];
		}
	}

	cout << blank << endl << max << endl;

	return 0;

}

C++: #include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;

int main()
{
    vector<vector<int> > paper(10, vector<int>(10, 0));
    int ret1 = 100;
    int ret2 = 0;

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

    for(;;){
        int x0, y0, size;
        char c;
        if(!(cin >> x0 >> c >> y0 >> c >> size))
            break;
        for(int i=0; i<4*size+1; ++i){
            int y = y0 + dy[i];
            int x = x0 + dx[i];
            if(y < 0 || y > 9 || x < 0 || x > 9)
                continue;
            if(paper[y][x] == 0)
                -- ret1;
            ++ paper[y][x];
            ret2 = max(ret2, paper[y][x]);
        }
    }

    cout << ret1 << endl << ret2 << endl;
}

C++: #include<iostream>
using namespace std;
int main(){
  int mas[10][10],x,y,size,count=0,max=0;
  char a,b;
  for(int i=0;i<10;i++){
    for(int j=0;j<10;j++) mas[i][j] = 0;
  }
  while(cin>>x>>a>>y>>b>>size){
    mas[y][x]++;
    for(int i=-1;i<=1;i++){
      if(i!=0){
	if(y+i>=0&&y+i<=9)mas[y+i][x]++;
	if(x+i>=0&&x+i<=9)mas[y][x+i]++;
	if(size==2||size==3&&y+i>=0&&y+i<=9&&x+i>=0&&x+i<=9){
	  mas[y+i][x+i]++;
	}
      }
    }
    if(size==2||size==3){
      if(x!=9&&y!=0) mas[y+1][x-1]++;
      if(x!=0&&y!=9) mas[y-1][x+1]++;
    }
    if(size==3){
      if(x+2<=9) mas[y][x+2]++;
      if(y+2<=9) mas[y+2][x]++;
      if(x-2>=0) mas[y][x-2]++;
      if(y-2>=0) mas[y-2][x]++;
    }
  }
  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 <algorithm>
#include <functional>
#include <vector>
#include <cstdio>
#include <string>
#include <cmath>
#include <cfloat>
#include <map>
using namespace std;
void drop(int x,int y,int *k,int d[10][10]){
	if(x>=0&&y>=0&&x<10&&y<10){
		if(d[y][x]==0)
			*k=*k-1;
		d[y][x]++;	
	}
}

int main(){
	
	int d[10][10]={0};
	char comma;
	int x,y,s;
	int k=100;
	while(cin>>x>>comma>>y>>comma>>s){
		if(s>=1){
			drop(x,y,&k,d);
			drop(x+1,y,&k,d);
			drop(x,y+1,&k,d);
			drop(x-1,y,&k,d);
			drop(x,y-1,&k,d);
	}
		if(s>=2){
			drop(x+1,y+1,&k,d);
			drop(x+1,y-1,&k,d);
			drop(x-1,y-1,&k,d);
			drop(x-1,y+1,&k,d);
		}
		if(s>=3){
			drop(x-2,y,&k,d);
			drop(x+2,y,&k,d);
			drop(x,y-2,&k,d);
			drop(x,y+2,&k,d);
		}
	}
	cout<<k<<endl;
	int max=0;
	for(int i=0;i<10;i++){
		for(int j=0;j<10;j++){
			if(max<d[i][j])
				max=d[i][j];
		}
	}
	cout<<max<<endl;
}