Go: package main

import (
	"bufio"
	"os"
	"strings"
	"strconv"
	"fmt"
)

func rangeCheck(x, y int) bool {
	if x >= 0 && x <= 9 && y >= 0 && y <= 9 {
		return true
	} else {
		return false
	}
}

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	paper := make([][]int, 10)
	for i := range paper {
		paper[i] = make([]int, 10)
		for j := range paper[i] {
			paper[i][j] = 0
		}
	}
	fmt.Println(paper)
	for scanner.Scan() {
		infos := strings.Split(scanner.Text(), ",")
		x, _ := strconv.Atoi(infos[0])
		y, _ := strconv.Atoi(infos[1])
		s, _ := strconv.Atoi(infos[2])
		// fmt.Println(x, y, s)
		switch s {
		case 1:
			paper[x][y]++
			if rangeCheck(x, y-1) {
				paper[x][y-1]++
			}
			if rangeCheck(x, y+1) {
				paper[x][y+1]++
			}
			if rangeCheck(x-1, y) {
				paper[x-1][y]++
			}
			if rangeCheck(x+1, y) {
				paper[x+1][y]++
			}
			continue
		case 2:
			paper[x][y]++
			if rangeCheck(x-1, y-1) {
				paper[x-1][y-1]++
			}
			if rangeCheck(x, y-1) {
				paper[x][y-1]++
			}
			if rangeCheck(x+1, y-1) {
				paper[x+1][y-1]++
			}
			if rangeCheck(x-1, y) {
				paper[x-1][y]++
			}
			if rangeCheck(x+1, y) {
				paper[x+1][y]++
			}
			if rangeCheck(x-1, y+1) {
				paper[x-1][y+1]++
			}
			if rangeCheck(x, y+1) {
				paper[x][y+1]++
			}
			if rangeCheck(x+1, y+1) {
				paper[x+1][y+1]++
			}
			continue
		case 3:
			paper[x][y]++
			if rangeCheck(x-1,y-1) {
				paper[x-1][y-1]++
			}
			if rangeCheck(x,y-1) {
				paper[x][y-1]++
			}
			if rangeCheck(x+1,y-1) {
				paper[x+1][y-1]++
			}
			if rangeCheck(x-1,y) {
				paper[x-1][y]++
			}
			if rangeCheck(x+1,y) {
				paper[x+1][y]++
			}
			if rangeCheck(x-1,y+1) {
				paper[x-1][y+1]++
			}
			if rangeCheck(x,y+1) {
				paper[x][y+1]++
			}
			if rangeCheck(x+1,y+1) {
				paper[x+1][y+1]++
			}
			if rangeCheck(x,y-2) {
				paper[x][y-2]++
			}
			if rangeCheck(x-2,y) {
				paper[x-2][y]++
			}
			if rangeCheck(x+2,y) {
				paper[x+2][y]++
			}
			if rangeCheck(x,y+2) {
				paper[x][y+2]++
			}
			continue
		}
	}
	count := 0
	max := -1
	for i := range paper {
		for j := range paper[i] {
			if paper[i][j] == 0 {
				count++
			}
			if max >= paper[i][j] {
				max = max
			} else {
				max = paper[i][j]
			}
		}
	}
	fmt.Printf("%d\n%d", count, max)
}

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;
// Dropping Ink (0026)
int main()
{
    vector<vector<int> > paper(10, vector<int>(10));
    int ret1 = 100;
    int ret2 = 0;
 
    int dx[] = {0, 0, 0, 1, -1, 1, 1, -1, -1, 0, 0, 2, -2}; 
    int dy[] = {0, 1, -1, 0, 0, 1, -1, 1, -1, 2, -2, 0, 0};

    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 <bits/stdc++.h>
using namespace std;

int field[10][10];

int main() {
  int x,y,size; 
  char ch;
  while ( cin >> x >> ch >> y >> ch >> size ) {
    for ( int i = 0; i < 10; i++ ) {
      for ( int j = 0; j < 10; j++ ) {
	field[i][j] = 0;
      }
    }

    if ( size == 1 ) {
      field[y][x]++;
      if ( x-1 >= 0 ) field[y][x-1]++;
      if ( x+1 < 10 ) field[y][x+1]++;
      if ( y-1 >= 0 ) field[y-1][x]++;
      if ( y+1 < 10 ) field[y+1][x]++;

    } else if ( size == 2 ) {
      field[y][x]++;
      if ( x-1 >= 0 ) field[y][x-1]++;
      if ( x+1 < 10 ) field[y][x+1]++;
      if ( y-1 >= 0 ) field[y-1][x]++;
      if ( y+1 < 10 ) field[y+1][x]++;
      if ( x+1 < 10 && y+1 < 10 ) field[y+1][x+1]++;
      if ( x-1 >= 0 && y+1 < 10 ) field[y-1][x+1]++;
      if ( x+1 < 10 && y-1 >= 0 ) field[y+1][x-1]++;
      if ( x-1 >= 0 && y-1 >= 0 ) field[y-1][x-1]++;
    } 

    if ( size == 3 ) {
      field[y][x]++;
      if ( x-1 >= 0 ) field[y][x-1]++;
      if ( x+1 < 10 ) field[y][x+1]++;
      if ( y-1 >= 0 ) field[y-1][x]++;
      if ( y+1 < 10 ) field[y+1][x]++;
      if ( x+1 < 10 && y+1 < 10 ) field[y+1][x+1]++;
      if ( x-1 >= 0 && y+1 < 10 ) field[y-1][x+1]++;
      if ( x+1 < 10 && y-1 >= 0 ) field[y+1][x-1]++;
      if ( x-1 >= 0 && y-1 >= 0 ) field[y-1][x-1]++;
      if ( x+2 < 10 ) field[y][x+2]++;
      if ( x-2 >= 0 ) field[y][x-2]++;
      if ( y+2 < 10 ) field[y+2][x]++;
      if ( y-2 >= 0 ) field[y-2][x]++;
    }

  }
 
  int cnt = 0,maxv = 0;

  for ( int i = 0; i < 10; i++ ) {
    for ( int j = 0; j < 10; j++ ) {
      if ( field[i][j] == 0 ) cnt++;
      maxv = max(maxv,field[i][j]);
    }
  }

  cout << cnt << endl;
  cout << maxv << endl;
  
  return 0;
}

C++: #include<iostream>
#include<string>
int mem[14][14] = {}, i = 0, X[50], Y[50], S[50];
int f(int a) {
	if (S[a] == 1) {
		mem[X[a] + 2][Y[a] + 2] += 1;
		mem[X[a] + 1][Y[a] + 2] += 1;
		mem[X[a] + 3][Y[a] + 2] += 1;
		mem[X[a] + 2][Y[a] + 1] += 1;
		mem[X[a] + 2][Y[a] + 3] += 1;
	}
	else if (S[a] == 2) {
		mem[X[a] + 2][Y[a] + 2] += 1;
		mem[X[a] + 1][Y[a] + 2] += 1;
		mem[X[a] + 3][Y[a] + 2] += 1;
		mem[X[a] + 2][Y[a] + 1] += 1;
		mem[X[a] + 2][Y[a] + 3] += 1;
		mem[X[a] + 1][Y[a] + 1] += 1;
		mem[X[a] + 1][Y[a] + 3] += 1;
		mem[X[a] + 3][Y[a] + 1] += 1;
		mem[X[a] + 3][Y[a] + 3] += 1;
	}
	else if (S[a] == 3) {
		mem[X[a] + 2][Y[a] + 2] += 1;
		mem[X[a] + 1][Y[a] + 2] += 1;
		mem[X[a] + 3][Y[a] + 2] += 1;
		mem[X[a] + 2][Y[a] + 1] += 1;
		mem[X[a] + 2][Y[a] + 3] += 1;
		mem[X[a] + 1][Y[a] + 1] += 1;
		mem[X[a] + 1][Y[a] + 3] += 1;
		mem[X[a] + 3][Y[a] + 1] += 1;
		mem[X[a] + 3][Y[a] + 3] += 1;
		mem[X[a]][Y[a] + 2] += 1;
		mem[X[a] + 4][Y[a] + 2] += 1;
		mem[X[a]][Y[a] + 4] += 1;
		mem[X[a] + 4][Y[a] + 2] += 1;
	}
	if (a == i)
		return 0;
	else
		return f(a + 1);
}
int main() {
	int x;
	char a;
	while (std::cin >> x, x) {
		X[i] = x;
		int y, s;
		std::cin >> a >> y >> a >> s;
		Y[i] = y, S[i] = s;
		i += 1;
	}
	f(0);
	int flag = 0, max = 0;
	for(int i=0;i<10;i+=1)
		for (int j = 0; j < 10; j += 1) {
			if (0 == mem[i + 2][j + 2])
				flag += 1;
			if (max < mem[i + 2][j + 2])
				max = mem[i + 2][j + 2];
		}
	std::cout << flag+1 << std::endl;
	std::cout << max << std::endl;
	return 0;
}