Cod sursa(job #751962)

Utilizator test1Trying Here test1 Data 27 mai 2012 15:46:21
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include <cstdio>
#include <algorithm>
using namespace std;
#define INF 0xffffff

int n,c[101][101];

void roy_floyd(){
    int k,i,j;
    for(k=1;k<=n;k++)
    for(i=1;i<=n;i++)
    for(j=1;j<=n;j++)
    if(i != k && j != k && c[i][k] + c[k][j] < c[i][j]) c[i][j] = c[i][k] + c[k][j];
}

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",&c[i][j]);
            if(c[i][j] == 0)c[i][j] = INF;
        }
        roy_floyd();
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++)printf("%d ",c[i][j] == INF ? 0 : c[i][j]); printf("\n"); }
        return 0;
}