Cod sursa(job #1513555)

Utilizator BaweeLazar Vlad Bawee Data 29 octombrie 2015 18:14:19
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.84 kb
#include <cstdio>
#define INF 1001

using namespace std;

int a[105][105];
int n;

void roy_floyd()
{
    int i,j,k;
    for(k = 1; k <= n; k++)
        for(i = 1; i <= n; i++)
            for(j = 1; j <= n; j++)
                    if (a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j)
                        a[i][j] = a[i][k] + a[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",&a[i][j]);
            //if(!a[i][j]) a[i][j] = INF;
        }

    roy_floyd();

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