poj1258-我被题坑了

看题目的时候看到这句话“physically, they are limited in length to 80 characters, so some lines continue onto others",可最后不判断>80也能过，有一种被坑的赶脚!

#include<cstdio>
#include<cstring>

const int INF=1e9;
int map[105][105];
int vis[105];
int low[105];

int prim(int m)
{
    memset(vis,0,sizeof(vis));
    memset(low,0,sizeof(low));
    for(int i=2;i<=m;i++)low[i]=map[1][i];
    vis[1]=1;
    int sum=0;
    for(int i=2;i<=m;i++){
        int x=-1,MIN=INF;
        for(int y=1;y<=m;y++){
            if(!vis[y]&&low[y]<MIN)
                MIN=low[x=y];
        }
        sum+=MIN;
        vis[x]=1;
        for(int y=1;y<=m;y++){
            if(!vis[y]&&low[y]>map[x][y])
                low[y]=map[x][y];
        }
    }
    return  sum;
}

int main()
{
    //freopen("int.txt","r",stdin);
    int n;
    char ch;
    while(~scanf("%d",&n)){
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++){
                map[i][j]=INF;
            }
        for(int i=1;i<=n;i++){
           //ch=' ';
            for(int j=1;j<=n;j++){
                scanf("%d",&map[i][j]);
                map[j][i]=map[i][j];
            }
        }
        int ans=prim(n);
        printf("%d\n",ans);
    }
    return 0;
}

三重循环：

#include<iostream>
using namespace std;
int map[101][101];
int visited[101];
int main()
{
    int n;
    while(cin>>n)
    {
        memset(visited,0,sizeof(visited));
        int i,j,k;
        memset(map,0,sizeof(map));
        for(i=0;i<n;i++)
            for(j=0;j<n;j++)
                scanf("%d",&map[i][j]);
        visited[0]=1;
        int temp=0;
        int sum=0;
        for(i=1;i<n;i++)
        {
            int min=1000000;
            for(j=0;j<n;j++)
                if(visited[j])
                {
                    
                    for(k=0;k<n;k++)
                    {
                        if(!visited[k]&&map[j][k]<min)
                            min=map[j][k],temp=k;
                    }

                }
                sum+=min;
                visited[temp]=1;
        }
        cout<<sum<<endl;
    }
    return 0;
}