import java.util.*;
/**
 * Find all triangles in a given set of lines (connected and intersecting)
 *
 * @author Peter.Buettner@gmx.net
 */
public class FBTriangle {
	/* a point is identified by a String with the number of the point.
	 * a line is a List containing points
	 * a triangle is a Set containing points (3 of them:-)
	 */

public static void main(String[] args) {
	// only for creating input: separate lines by '#', points by ','
	String[] rows = "0,5,8,10#0,3,7,9#0,2,4,6#0,1#1,2,3,5#1,4,7,8#1,6,9,10".split("#");

	// lines will contain Lists with points
	List[] lines = new List[rows.length];
	for (int i=0; i<lines.length; i++) lines[i] = Arrays.asList(rows[i].split(","));

	Set triangles = new HashSet();// dupes are identified automatically

	// walk through all lines and find 3 of them sharing 3 points
	// note: lines have at most one intersection
	for(int i=0;i<lines.length;i++){
		k: for(int k=i+1;k<lines.length;k++){
			Object p1 = sharePoint(lines[i],lines[k]);
			if(p1==null) continue k;

			m: for(int m=k+1;m<lines.length;m++){
				Object p2 = sharePoint(lines[k],lines[m]);
				if(p2==null || p1.equals(p2))continue m;

				Object p3 = sharePoint(lines[m],lines[i]);
				if(p3!=null && !p3.equals(p2)&& !p3.equals(p1))
					// a triangle is a set of points (~Strings)
					triangles.add(new HashSet(Arrays.asList(new Object[]{p1,p2,p3})));
				}
			}
		}

	// gui :-)
	System.out.println("count:"+triangles.size() + "\n"+triangles);
}
// returns the point the two lists share, or null if there is no shared one
static private Object sharePoint(List a, List b){
	for (int i=0; i<a.size();i++)
		if(b.contains(a.get(i)))return a.get(i);
	return null;
	}
}