Cod sursa(job #1507102)

Utilizator radu_uniculeu sunt radu radu_unicul Data 21 octombrie 2015 13:20:24
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
#include<stdio.h>
using namespace std;
int n;
#define INF 999999
int main()
{
    freopen("royfloyd.in","r",stdin);
    freopen("royfloyd.out","w",stdout);
    scanf("%d",&n);
    int m[n+1][n+1],sol[n+1][n+1];
    for(int i=0; i<n; i++)
        for(int j=0; j<n; j++)
        {
            //printf("\n");
            scanf("%d",&m[i][j]);
            sol[i][j]=m[i][j]!=0?m[i][j]:INF;
            sol[i][j]=i==j?0:sol[i][j];
            //printf("%d ",sol[i][j]);
        }
    for(int i=0; i<n; i++)
        for(int j=0; j<n; j++)
            for(int k=0; k<n; k++)
            {
                if(sol[i][j]>sol[i][k]+sol[k][j]) sol[i][j]=sol[i][k]+sol[k][j];
            }
    for(int i=0; i<n; i++)
    {
        for(int j=0; j<n; j++) printf("%d ",sol[i][j]==INF?0:sol[i][j]);
        printf("\n");
    }
}