Cod sursa(job #634192)

Utilizator warchildmdMihail Burduja warchildmd Data 15 noiembrie 2011 19:56:41
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.03 kb
#include <cstdio>

#define INF 20000001

int a[100][100];
int n;

int min(int x, int y)
{
    if(x > y)
        return y;
    return x;
}

int main()
{
    freopen("royfloyd.in", "r", stdin);
    freopen("royfloyd.out", "w", stdout);

    scanf("%d", &n);
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j++)
        {
            scanf("%d", &a[i][j]);
            if(a[i][j] == 0)
                a[i][j] = INF;
        }
    }

    //roy-floyd
    for(int k = 0; k < n; k++)
    {
        for(int i = 0; i < n; i++)
        {
            for(int j = 0; j < n; j++)
            {
                if(i == j)
                    continue;
                a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
            }
        }
    }

    for(int i = 0; i < n; i++)
    {
        a[i][i] = 0;
    }

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

    return 0;
}