Problem:
Problem D: Digits on the Floor

Taro attempts to tell digits to Hanako by putting straight bars on the floor. Taro wants to
express each digit by making one of the forms shown in Figure 1.

Since Taro may not have bars of desired lengths, Taro cannot always make forms exactly as
shown in Figure 1. Fortunately, Hanako can recognize a form as a digit if the connection
relation between bars in the form is kept. Neither the lengths of bars nor the directions of forms
affect Hanako’s perception as long as the connection relation remains the same. For example,
Hanako can recognize all the awkward forms in Figure 2 as digits. On the other hand, Hanako
cannot recognize the forms in Figure 3 as digits. For clarity, touching bars are slightly separated
in Figures 1, 2 and 3. Actually, touching bars overlap exactly at one single point.

Figure 1: Representation of digits

Figure 2: Examples of forms recognized as digits

In the forms, when a bar touches another, the touching point is an end of at least one of them.
That is, bars never cross. In addition, the angle of such two bars is always a right angle.

To enable Taro to represent forms with his limited set of bars, positions and lengths of bars can
be changed as far as the connection relations are kept. Also, forms can be rotated.

Keeping the connection relations means the following.

Figure 3: Forms not recognized as digits (these kinds of forms are not contained in the dataset)

Separated bars are not made to touch.

Touching bars are not made separate.

When one end of a bar touches another bar, that end still touches the same bar. When it
touches a midpoint of the other bar, it remains to touch a midpoint of the same bar on
the same side.

The angle of touching two bars is kept to be the same right angle (90 degrees and -90
degrees are considered different, and forms for 2 and 5 are kept distinguished).

Your task is to find how many times each digit appears on the floor.

The forms of some digits always contain the forms of other digits. For example, a form for
9 always contains four forms for 1, one form for 4, and two overlapping forms for 7. In this
problem, ignore the forms contained in another form and count only the digit of the “largest”
form composed of all mutually connecting bars. If there is one form for 9, it should be interpreted
as one appearance of 9 and no appearance of 1, 4, or 7.

Input

The input consists of a number of datasets. Each dataset is formatted as follows.

n

x1a y1a x1b y1b

x2a y2a x2b y2b

.

.

.

xna yna xnb ynb

In the first line, n represents the number of bars in the dataset. For the rest of the lines, one
line represents one bar. Four integers xa, ya , xb , yb , delimited by single spaces, are given in
each line. xa and ya are the x- and y-coordinates of one end of the bar, respectively. xb and
yb are those of the other end. The coordinate system is as shown in Figure 4. You can assume
1 ≤ n ≤ 1000 and 0 ≤ xa , ya , xb , yb ≤ 1000.

The end of the input is indicated by a line containing one zero.

Figure 4: The coordinate system

You can also assume the following conditions.

More than two bars do not overlap at one point.

Every bar is used as a part of a digit. Non-digit forms do not exist on the floor.

A bar that makes up one digit does not touch nor cross any bar that makes up another
digit.

There is no bar whose length is zero.

Output

For each dataset, output a single line containing ten integers delimited by single spaces. These
integers represent how many times 0, 1, 2, . . . , and 9 appear on the floor in this order. Output
lines must not contain other characters.

Sample Input

9
60 140 200 300
300 105 330 135
330 135 250 215
240 205 250 215
298 167 285 154
30 40 30 90
30 90 150 90
150 90 150 20
30 40 150 40
8
320 20 300 60
320 20 380 50
380 50 240 330
10 50 40 20
10 50 110 150
110 150 180 80
40 20 37 17
37 17 27 27
20
72 222 132 182
204 154 204 54
510 410 520 370
404 54 204 54
530 450 410 450
204 68 404 68
80 110 120 30
130 160 180 60
520 370 320 320
310 360 320 320
120 30 180 60
60 100 80 110
404 154 204 154
80 60 60 100
430 550 590 550
510 410 310 360
430 450 430 550
404 54 404 154
232 202 142 262
142 262 102 202
0

Output for the Sample Input

0 1 0 1 0 0 0 0 0 1
0 0 0 0 0 1 0 1 0 0
1 0 1 0 2 0 0 0 1 0

Solution in JAVA (judge verdict: Accepted)

import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

//Digits on the Floor
public class Main{

	class UnionFind {
		final int[] tree;
		int num;
		public UnionFind(int n) {
			this.tree = new int[n];
			Arrays.fill(tree, -1);
			num=n;
		}
		void union(int x, int y) {
			x = root(x);
			y = root(y);
			if(x != y) {
				if(tree[x] < tree[y]) {
					x ^= y; y ^= x; x^= y;
				}
				tree[x] += tree[y];
				tree[y] = x;
				num--;
			}
		}
		boolean find(int x, int y) {
			return root(x) == root(y);
		}
		int root(int x) {
			return tree[x] < 0 ? x : (tree[x] = root(tree[x]));
		}
		int size(int x) {
			return -tree[root(x)];
		}
		int getNum() {
			return num;
		}
	}
	
	@SuppressWarnings("unchecked")
	void run(){
		Scanner sc = new Scanner(System.in);
		int[][] check = {{0,0,4,0,0,0},
				{1,0,0,0,0,0},
				{0,2,3,0,0,0},
				{0,2,1,0,0,1},
				{1,1,0,1,0,0},
				{0,2,3,0,0,0},
				{0,1,3,1,0,0},
				{0,2,1,0,0,0},
				{0,0,4,0,1,0},
				{0,1,2,1,0,0}};
		for(;;){
			int n = sc.nextInt();
			if(n==0)break;
			int[][] x = new int[n][2], y = new int[n][2];
			for(int i=0;i<n;i++)for(int j=0;j<2;j++){
				x[i][j] = sc.nextInt(); y[i][j] = sc.nextInt();
			}
			UnionFind uf = new UnionFind(n);
			int[] info = new int[n];
			for(int i=0;i<n;i++){
				int c = 0, m = 0;
				int x1 = x[i][0], y1 = y[i][0], x2 = x[i][1], y2 = y[i][1];
				for(int j=0;j<n;j++){
					if(i==j)continue;
					int x3 = x[j][0], y3 = y[j][0], x4 = x[j][1], y4 = y[j][1];
					if(x1==x3&&y1==y3 || x1==x4&&y1==y4 || x2==x3&&y2==y3 || x2==x4&&y2==y4){
						if(!uf.find(i, j))uf.union(i, j);
						c++;
					}
					else if((y1-y3)*(x4-x3)==(y4-y3)*(x1-x3)&&Math.min(x3, x4)<=x1&&x1<=Math.max(x3, x4)&&Math.min(y3, y4)<=y1&&y1<=Math.max(y3, y4) ||
						(y2-y3)*(x4-x3)==(y4-y3)*(x2-x3)&&Math.min(x3, x4)<=x2&&x2<=Math.max(x3, x4)&&Math.min(y3, y4)<=y2&&y2<=Math.max(y3, y4)){
						if(!uf.find(i, j))uf.union(i, j);
						m++;
					}
				}
				if(c==2)info[i]=2;
				else if(m==2)info[i]=4;
				else if(c==1&&m==1)info[i]=3;
				else if(c==1)info[i]=1;
				else if(m==1)info[i]=5;
				else info[i]=0;
			}
			Set<Integer>[] set = new Set[n];
			for(int i=0;i<n;i++)set[i]=new HashSet<Integer>();
			int[][] at = new int[n][6];
			for(int i=0;i<n;i++){
				set[uf.root(i)].add(i);
				at[uf.root(i)][info[i]]++;
			}
			int[] res = new int[10];
			for(int i=0;i<n;i++){
				for(int j=0;j<10;j++){
					boolean ok = true;
					for(int k=0;k<6;k++)if(at[i][k]!=check[j][k])ok=false;
					if(ok){
						if(j!=2)res[j]++;
						else{
							int e = -1, px = -1, py = -1, qx = -1, qy = -1;
							for(int v:set[i])if(info[v]==1)e = v;
							for(int v:set[i])if(v!=e){
								if(x[e][0]==x[v][0]&&y[e][0]==y[v][0]){
									px = x[e][0]-x[e][1]; py = y[e][0]-y[e][1]; qx = x[v][1]-x[e][1]; qy = y[v][1]-y[e][1];
								}
								else if(x[e][0]==x[v][1]&&y[e][0]==y[v][1]){
									px = x[e][0]-x[e][1]; py = y[e][0]-y[e][1]; qx = x[v][0]-x[e][1]; qy = y[v][0]-y[e][1];
								}
								else if(x[e][1]==x[v][0]&&y[e][1]==y[v][0]){
									px = x[e][1]-x[e][0]; py = y[e][1]-y[e][0]; qx = x[v][1]-x[e][0]; qy = y[v][1]-y[e][0];
								}
								else if(x[e][1]==x[v][1]&&y[e][1]==y[v][1]){
									px = x[e][1]-x[e][0]; py = y[e][1]-y[e][0]; qx = x[v][0]-x[e][0]; qy = y[v][0]-y[e][0];
								}
							}
							if(px*qy-qx*py<0)res[2]++;
							else res[5]++;
						}
						break;
					}
				}
			}
			for(int i=0;i<10;i++)System.out.print(res[i]+(i==9?"\n":" "));
		}
	}
	
	public static void main(String[] args) {
		new Main().run();
	}
}