摘要： /* ID:chenjiong PROG:concom LANG:C++*/#include <stdio.h>#include <string.h>const int MAXN = 101;int map[MAXN][MAXN];bool con[MAXN][MAXN];int E;bool flag;int cal(){ int i,j; int sum = 0; for ( i = 0; i < MAXN; i++) for ( j = 0; j < MAXN; j++) if ( con[i][j] ) ... 阅读全文