Cod sursa(job #1481220)

Utilizator CiobaCatalinCioba Catalin CiobaCatalin Data 4 septembrie 2015 00:32:10
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.88 kb
#include <iostream>
#include <cstdio>
#include <cstdlib>

#define inf (1<<30)
#define maxn 105

using namespace std;

int dist[maxn][maxn];


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

    int n, tmp;
    scanf("%d", &n);

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

    for (int k = 1; k <= n; ++k)
        for (int i = 1; i <= n; ++i)
            for (int j = 1; j <= n; ++j)
                if (dist[k][j] && dist[i][k] && i != j)
                    if (dist[i][j] > dist[i][k] + dist[k][j] || dist[i][j] == 0)
                        dist[i][j] = dist[i][k] + dist[k][j];

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

    return 0;

}