Cod sursa(job #1335769)

Utilizator TimitocArdelean Andrei Timotei Timitoc Data 5 februarie 2015 21:01:05
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.9 kb
#include <iostream>
#include <cstdio>
#define MAXN 110

using namespace std;

int a[MAXN][MAXN], n;

void citire()
{
    scanf("%d ", &n);
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            scanf("%d ", &a[i][j]);
}

void solve()
{

    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            for (int k = 1; k <= n; k++)
                if (i == j) continue;
                else if (a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || a[i][j] == 0))
                    a[i][j] = a[i][k] + a[k][j];
}

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

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

    citire();
    solve();
    afisare();

    return 0;
}