图中有多少个三角形

题目：编程计算下面图形中包含多少个三角形。

思路：首先给图中每个线段的交点设一个字母标记，不是任何两个字母都构成一条线段，使用穷举法列出所有线段；

之后将图中所有的线段进行任意3条的组合，如果这3条线段能构成一个三角形，则计数加一，否则计数不变。

判断线段能否组成三角形，需要注意每两条线段之间是否有交点、三条线段是否共线、三条线段是否有同一交点。

#include "stdio.h"

#define NO_POINT '0'

char * map[] =  {"ab","ad","db","ag","gc","ac","ah","ae","ej","jh",
    "aj","eh","af","ak","ai","fk","fi","ki","de","df","dg","ef","eg",
    "fg","bj","bk","bg","jk","jg","kg","bh","bi","bc","hi","hc","ic"};<