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\n", count, max)
}

C++: #include<iostream>

using namespace std;

int main(){

  int data[15][15], x, y, size, sum = 0, max = 0;
  char trash[2];


  for(int i = 0; i < 10; i++){
    for(int j = 0; j < 10; j++){
      data[i][j] = 0;
    }
  }


  while(cin >> x >> trash[0] >> y >> trash[1] >> size){

    if(size == 1){

      data[x][y]++;
      data[x][y-1]++;
      data[x-1][y]++;
      data[x+1][y]++;
      data[x][y+1]++;

    }else if(size == 2){

      data[x][y]++;
      data[x][y-1]++;
      data[x-1][y]++;
      data[x+1][y]++;
      data[x][y+1]++;
      data[x-1][y-1]++;
      data[x+1][y-1]++;
      data[x-1][y+1]++;
      data[x+1][y+1]++;

    }else{

      data[x][y]++;
      data[x][y-1]++;
      data[x-1][y]++;
      data[x+1][y]++;
      data[x][y+1]++;
      data[x-1][y-1]++;
      data[x+1][y-1]++;
      data[x-1][y+1]++;
      data[x+1][y+1]++;
      data[x-2][y]++;
      data[x+2][y]++;
      data[x][y+2]++;
      data[x][y-2]++;

      
 
    }
  }


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

  cout << sum << endl << max << endl;

  return 0;

}

C++: #include <iostream>
#include <algorithm>
int main()
{
	int s = 100;
	int xy[10][10] = {};
	while (true) {
		int x, y, n;
		char a, b;
		std::cin >> x >> a >> y >> b >> n;
		if (x == 0) {
			break;
		}
		switch (n)
		{
		case 1:{
			if (x != 0) {
				++xy[x - 1][y];
			}
			++xy[x + 1][y];
			if (y != 0) {
				++xy[x][y - 1];
			}
			++xy[x][y + 1];
			break;
		}
		case 2:{
			if (x != 0) {
				++xy[x - 1][y];
				++xy[x - 1][y - 1];
				++xy[x - 1][y + 1];
			}
			if (y != 0) {
				++xy[x][y - 1];
				++xy[x + 1][y - 1];
			}
			++xy[x + 1][y];
			++xy[x][y + 1];
			++xy[x + 1][y + 1];
			break;
		}
		case 3:{
			if (x != 0) {
				++xy[x - 1][y];
				++xy[x - 1][y - 1];
				++xy[x - 1][y + 1];
			}
			if (y != 0) {
				++xy[x][y - 1];
				++xy[x + 1][y - 1];
			}
			++xy[x + 1][y];
			++xy[x][y + 1];
			++xy[x + 1][y + 1];
			if(x!=2){	++xy[x - 2][y];}
			++xy[x + 2][y];
			if (y != 2) {
				++xy[x][y - 2];
			}
			++xy[x][y + 2];
			break;
		}
		}
}
	 
	for (int i = 0; i < 10; ++i) {
		for (int j = 0; j < 10; ++j) {
			if (xy[i][j] > 0) {
				--s;
			}
		}
	}
	std::sort(xy[0][0], xy[10][10]);
	std::cout << s << std::endl;
	std::cout << xy[10][10] << std::endl;
	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <list>
#include <algorithm>
#include <cmath>
#include <stack>
#include <set>
using namespace std;

#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define FOR(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
#define PUSH(n,v) for(int i=0; i<(n); i++) {int j; cin >> j; v.push_back(j);}
#define ALL(v) v.begin(), v.end()

vector<vector<int>> vv;

void ink(int x, int y) {
    if (x >= 0 && x < 10 && y >= 0 && y < 10) {
        vv[x][y]++;
    }
}

void big(int x, int y) {
    ink(x-2,y);
    ink(x-1,y);
    ink(x,y);
    ink(x+1,y);
    ink(x+2,y);
    ink(x-1,y-1);
    ink(x,y-1);
    ink(x+1,y-1);
    ink(x-1,y+1);
    ink(x,y+1);
    ink(x+1,y+1);
    ink(x,y-2);
    ink(x,y+2);
}

void mid(int x, int y) {
    ink(x-2,y);
    ink(x-1,y);
    ink(x,y);
    ink(x+1,y);
    ink(x+2,y);
    ink(x-1,y-1);
    ink(x,y-1);
    ink(x+1,y-1);
    ink(x-1,y+1);
    ink(x,y+1);
}

void small(int x, int y) {
    ink(x-1,y);
    ink(x,y);
    ink(x+1,y);
    ink(x,y-1);
    ink(x,y+1);
}

int countNotBlank() {
    int cnt = 0;
    REP(i,10) REP(j,10) if (vv[i][j] > 0) cnt++;
    return cnt;
}

int getThickest() {
    int t = 0;
    REP(i,10) REP(j,10) if (vv[i][j] > t) t = vv[i][j];
    return t;
}

int main() {
    REP(i,10) {
        vector<int> v(10,0);
        vv.push_back(v);
    }
    
    int x, y, s;
    while(scanf("%d,%d,%d"), &x, &y, &s) {
        switch (s) {
            case 1:
                small(x,y);
                break;
            case 2:
                mid(x,y);
                break;
            case 3:
                big(x,y);
                break;
                
            default:
                break;
        }
    }
    
    cout << countNotBlank() << endl << getThickest() << endl;
    
    return 0;
}

C++: #include <stdio.h>
#define TIMES 6

/* http://rose.u-aizu.ac.jp/onlinejudge/ProblemSet/description.jsp?id=0026&lang=jp */

int main(void)
{
	int paper[10][10] = {0} ;
	int blank = 0;
	int maxdk = 0;
	int x = 0 ;
	int y = 0 ;
	int size = 0 ;
	
	for ( ; i < TIMES ; i++ ){
	scanf("%d",&x) ;
	scanf(",%d",&y) ;
	scanf(",%d",&size) ;
	
	if(size >= 1){
		if (x+1<10)
			paper[x+1][y]++;
		if (x-1>=0)
			paper[x-1][y]++;
		if (y+1<10)
			paper[x][y+1]++;
		if (y-1>=0)
			paper[x][y-1]++;
		}
		
	if(size >= 2){
		if (x+1<10 && y+1<10)
			paper[x+1][y+1]++;
		if (x-1>=0 && y+1<10)
			paper[x-1][y+1]++;
		if (x-1>=0 && y-1>=0)
			paper[x-1][y-1]++;
		if (x+1<10 && y-1>=0)
			paper[x+1][y-1]++;
		}
		
	if(size >= 3){
		if (x+2<10)
			paper[x+2][y]++;
		if (x-2>=0)
			paper[x-2][y]++;
		if (y+2<10)
			paper[x][y+2]++;
		if (y-2>=0)
			paper[x][y-2]++;
		}
		
/*		printf("%d,",x); printf("%d,",y); printf("%d\n",size);	*/
		
		}
		
		
		for( y = 0 ; y < 10 ; y++ ){
			for( x = 0 ; x < 10 ; x++ ){
				if(paper[x][y] == 0)
				blank++;
				if(paper[x][y] > maxdk)
				maxdk = paper[x][y] ;
			}
		}
		
		printf("----------------\n");
		printf("BLANK:%d\n",blank);
		printf("MAX:%d\n",maxdk);
		
	return 0;
}