Cod sursa(job #2168229)

Utilizator mariastStoichitescu Maria mariast Data 14 martie 2018 10:06:51
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include<cstdio>
#include<algorithm>
#define oo 2e7
using namespace std;

int n,a[101][101];
int main()
{
    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",&a[i][j]);
            if(i!=j&&a[i][j]==0)a[i][j]=oo;

        }
    }
    for(int k=1;k<=n;++k){
        for(int i=1;i<=n;++i){
            for(int j=1;j<=n;++j)
                a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
        }
    }
     for(int i=1;i<=n;++i){
        for(int j=1;j<=n;++j){
            if(a[i][j]==oo) printf("0 ");
            printf ("%d ",a[i][j]);
        }
        printf("\n");
    }
}