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>
void tyu(int x,int y,int N[15][15])
{
	int xt,yt;
	xt=x-1;yt=y-1;
	for(int i=yt;i>=yt+2;i++)
		for(int j=xt;j>=xt+2;j++)
			N[i][j]++;
}
void syo(int x,int y,int N[15][15])
{
	N[y][x]++;N[y+1][x]++;N[y-1][x]++;
	N[y][x+1]++;N[y][x-1]++;
}
void dai(int x,int y,int N[15][15])
{
	int xt,yt;
	xt=x-1;yt=y-1;
	for(int i=yt;i<=yt+2;i++)
		for(int j=xt;j<=xt+2;j++)
			N[i][j]++;
	N[y+2][x]++;N[y-2][x]++;
	N[y][x+2]++;N[y][x-2]++;
}

int main()
{
	int x,y,z,PP[15][15]={},xt=0,yt=0;
	while(scanf("%d,%d,%d",&x,&y,&z)!=EOF)
	{
		xt=x+2;yt=y+2;
		if(z==1)syo(xt,yt,PP);
		else if(z==2)tyu(xt,yt,PP);
		else if(z==3)dai(xt,yt,PP);
	}
	int SUM1=0,SUM2=0,max=0;
	for(int i=2;i<12;i++){
		for(int j=2;j<12;j++){
			if(PP[i][j]==0)SUM1++;
			if(PP[i][j]>max){max=PP[i][j];SUM2=1;}
			if(PP[i][j]=max)SUM2++;
		}
	}
	printf("%d\n%d\n",SUM1,SUM2);

	return 0;
}

C++: #include<stdio.h>

int main(void)
{
	int i,j,k,paper[10][10]={0},x,y,n,c=0,max=0;
	
	while(scanf("%d",&x)!=EOF){
		scanf("%d,%d",&y,&n);
		if(n==1){
			if(y-1>=0)paper[y-1][x]++;
			if(y+1<10)paper[y+1][x]++;
			if(x-1>=0)paper[y][x-1]++;
			if(x+1<10)paper[y][x+1]++;
			if(y>=0 && y<10 && x>=0 && x<10)paper[y][x]++;
		}
		if(n==2){
			if(y-1>=0)paper[y-1][x]++;
			if(y+1<10)paper[y+1][x]++;
			if(x-1>=0)paper[y][x-1]++;
			if(x+1<10)paper[y][x+1]++;
			if(y-1>=0 && x-1>=0)paper[y-1][x-1]++;
			if(y-1>=0 && x+1<10)paper[y-1][x+1]++;
			if(y+1<10 && x-1>=0)paper[y+1][x-1]++;
			if(y+1<10 && x+1<10)paper[y+1][x+1]++;
			if(y>=0 && y<10 && x>=0 && x<10)paper[y][x]++;
		}
		if(n==3){
			if(y-1>=0)paper[y-1][x]++;
			if(y+1<10)paper[y+1][x]++;
			if(x-1>=0)paper[y][x-1]++;
			if(x+1<10)paper[y][x+1]++;
			if(y-1>=0 && x-1>=0)paper[y-1][x-1]++;
			if(y-1>=0 && x+1<10)paper[y-1][x+1]++;
			if(y+1<10 && x-1>=0)paper[y+1][x-1]++;
			if(y+1<10 && x+1<10)paper[y+1][x+1]++;
			
			if(y-2>=0)paper[y-2][x]++;
			if(y+2<10)paper[y+2][x]++;
			if(x+2<10)paper[y][x+2]++;
			if(x-2>=0)paper[y][x-2]++;
			if(y>=0 && y<10 && x>=0 && x<10)paper[y][x]++;
		}
		for(i=0;i<10;i++){
			for(j=0;j<10;j++){
				printf("%d ",paper[i][j]);
			}
			puts("");
		}
	}
	for(i=0;i<10;i++){
		for(j=0;j<10;j++){
			printf("%d ",paper[i][j]);
		}
		puts("");
	}
	
	for(i=0;i<10;i++){
		for(j=0;j<10;j++){
			if(paper[i][j]==0)c++;
			if(paper[i][j]>=max)max=paper[i][j];
		}
	}
	printf("%d\n%d\n",c,max);
	return 0;
}

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

using namespace std;

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

bool is_in_field(int x, int y){
  return ((x >= 0 && x <= 9) && (y >= 0 && y <= 9));
}

void mark( int x, int y, int size,  int i) {
  
  if(is_in_field(x + dx[i], y + dy[i])) {
    q[x + dx[i]][y + dy[i]]++;
  }
  if(i != (size) * 4) mark(x, y, size, i + 1);
}


int main(){
  int x, y, size, max = 0, count = 0;
  while(~scanf("%d,%d,%d", &x, &y, &size)) {
    mark(x, y, size, 0);
  }
  for(x = 0; x < 10; x++)
    for(y = 0; y < 10; y++) {
      if(q[x][y] == 0) count++;
      else if(q[x][y] > max) max = q[x][y];
    }
  cout << count << endl << max <<endl;
}

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

int table[12][12]={0};

void dropink(int x,int y, int s){
	switch (s){
		case 3:
			if(x-2>=0)
				table[x-2][y]++;
			if(y-2>=0)
				table[x][y-2]++;
			if(x+2<=11)
				table[x+2][y]++;
			if(y+2<=11)
				table[x][y+2]++;
		case 2:
			table[x+1][y+1]++;
			table[x-1][y+1]++;
			table[x+1][y-1]++;
			table[x-1][y-1]++;
		case 1:
			table[x][y]++;
			table[x+1][y]++;
			table[x][y+1]++;
			table[x-1][y]++;
			table[x][y-1]++;
	}
	return ;
}

int main(){
	int x,y,s;
	char tem;
	while( cin >> x >> tem >> y >> tem >> s ,!cin.eof())
		dropink(x+1,y+1,s);
	int NUM=0,MAX=0;
	for(int y=1;y<=10;y++){
		for(int x=1;x<=10;x++){
			if(table[x][y])
				MAX=max(MAX,table[x][y]);
			else
				NUM++;
		}
	}
	cout << NUM << endl << MAX << endl;
	return 0;
}

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

int main()
{
	int size, x, y, coord[20][20] = {0}, noink = 0, max =0;

	while (scanf("%d,%d,%d", &x, &y, &size) != EOF){
		x += 5;
		y += 5;
		coord[x][y]++;
		coord[x - 1][y]++;
		coord[x + 1][y]++;
		coord[x][y - 1]++;
		coord[x][y + 1]++;
		if (size >= 2){
			coord[x - 1][y - 1]++;
			coord[x - 1][y + 1]++;
			coord[x + 1][y - 1]++;
			coord[x + 1][y + 1]++;
			if (size == 3){
				coord[x - 2][y]++;
				coord[x + 2][y]++;
				coord[x][y - 2]++;
				coord[x][y + 2]++;
			}
		}
	}
	
	for (int i = 5; i < 15; i++){
		for (int j = 5; j < 15; j++){
			if (coord[i][j] == 0) noink++;
			if (coord[i][j] > max) max = coord[i][j];
		}		
	}
	cout << noink << endl;
	cout << max << endl;
	return (0);
}

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

int main() {
  int a[10][10]={},x,y,z,count=0, max=0;
  while(scanf("%d%*c%d%*c%d",&x,&y,&z)==3) {
    if(z>2) {
      if(y-2>=0) a[x][y-2]++;
      if(y+2<10) a[x][y+2]++;
      if(x-2>=0) a[x-2][y]++;
      if(x+2<10) a[x+2][y]++;
    }
    if(z>1) {
      if(y+1<10 && x-1>=0) a[x-1][y+1]++;
      if(y+1<10 && x+1<10) a[x+1][y+1]++;
      if(y-1>=0 && x-1>=0) a[x-1][y-1]++;
      if(y-1>=0 && x+1<10) a[x+1][y-1]++;
    }
    if(z>0) {
      if(y+1<10) a[x][y+1]++;
      if(y-1>=0) a[x][y-1]++;
      if(x-1>=0) a[x-1][y]++;
      if(x+1<10) a[x+1][y]++;
      a[x][y]++;
    }
  }
  for(int i=0; i<10; i++) {
    for(int j=0; j<10; j++) {
      if(a[i][j]==0) count++;
      if(a[i][j]>max) max=a[i][j];
    }
  }
  cout << count << endl << max << endl;
  return 0;
}