Cod sursa(job #1849573)

Utilizator OlivianOlivian Dan Cretu Olivian Data 17 ianuarie 2017 18:06:41
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
    int n,m[107][107];
    freopen("royfloyd.in","r",stdin);
    freopen("royfloyd.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            scanf("%d",&m[i][j]);
            if(m[i][j]==0) m[i][j]=1000000000;
        }
    }
    for(int k=1;k<=n;k++)
    {
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                if(i!=j) m[i][j]=min(m[i][j],(m[i][k]+m[k][j]));
            }
        }
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            if(m[i][j]==1000000000) printf("0 "); else printf("%d ",m[i][j]);
        }
        printf("\n");
    }
}