Cod sursa(job #1310021)

Utilizator mikeKiLL3rLupea Mihai Ionut mikeKiLL3r Data 6 ianuarie 2015 12:37:07
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.8 kb
#include <cstdio>
typedef char BYTE;
using namespace std;


BYTE a[102][102];

short 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("%i", &n);
    int i,j;
    for(i=1; i<=n;i++)
    {
        for(j=1;j<=n;j++)
        {
            scanf("%i", &a[i][j]);
        }
    }

    roy_floyd();

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

    return 0;
}