摘要：
#include<stdio.h>#include<string.h>#define max 99999int map[101][101],visit[101],lowcost[101];int temp,n;int prime(){ int i,j,k,sum=0; memset(visit,0,sizeof(visit)); visit[1] = 1; for(i = 1; i <= n; i++) lowcost[i] = map[1][i]; for(i = 1; i <= n; i++) { temp = max... 阅读全文
