Cod sursa(job #1310007)

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


BYTE matr[102][102];
BYTE dist[102][102];

short n;

void roy()
{
    int i,j,k;

    for(k=1;k<=n;k++)
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++)
            {
                if (matr[i][k] && matr[k][j] && (matr[i][j] > matr[i][k] + matr[k][j] || !matr[i][j]) && i != j) matr[i][j] = matr[i][k] + matr[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", &matr[i][j]);
        }
    }
    roy();

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

    return 0;
}