1．以二维数组list[N+1] 表示地图，N表示区域数目，数组中以元素值为0表示不邻接，1表示邻接，限定区域数目N<=50. 2．用户先输入区域数目N，再输入邻接区域的代码，邻接可只写一次，区域的代码为0～N,N个为区域，一个为外部区域，或输入N-1,则可不包括外部区域，N个区域由用户定义 3．输出时，采用一一对应的方法，一个区域对应一种颜色 形式：区域代码＝＝》颜色代码（1～4）＝》颜色 4．本程序可为任意一张的地图染色，并且至多只染四种颜色-1. To two-dimensional array list [N+ 1] that the map, N, said the regional number of elements in the array value of 0 indicated that he did not adjacent, 1, said adjacent limit the number of regional N <= 50. 2. The number of users to enter the region N, and then enter the adjacent region code, adjacent can only write once, region code 0 ~ N, N months for the region, an external region, or enter N-1, may not include the external region, N regions by the user-defined 3. Output using one-to-one approach, a regional counterpart of a different color forms: regional code ==　color code (1 ~ 4) =　color 4. This procedure can be an arbitrary map of staining and staining of up to only four colors