Cod sursa(job #1662127)

Utilizator akaprosAna Kapros akapros Data 24 martie 2016 15:17:01
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.88 kb
#include <bits/stdc++.h>
#define maxN 102
using namespace std;
int a[maxN][maxN], n;
void read()
{
    int i, j;
    freopen("royfloyd.in", "r", stdin);
    scanf("%d", &n);
    for (i = 1; i <= n; ++ i)
        for (j = 1; j <= n; ++ j)
            scanf("%d", &a[i][j]);
}
void solve()
{
    int i, j, k;
    for (k = 1; k <= n; ++ k)
        for (i = 1; i <= n; ++ i)
            for (j = 1; j <= n; ++ j)
                if (i != j)
                    if (a[i][k] && a[k][j] && (a[i][k] + a[k][j] < a[i][j] || !a[i][j]))
                        a[i][j] = a[i][k] + a[k][j];
}
void write()
{
    int i, j;
    freopen("royfloyd.out", "w", stdout);
    for (i = 1; i <= n; ++ i)
    {
        for (j = 1; j <= n; ++ j)
            printf("%d ", a[i][j]);
        printf("\n");
    }
}
int main()
{
    read();
    solve();
    write();
    return 0;
}