Cod sursa(job #1629731)

Utilizator papinubPapa Victor papinub Data 4 martie 2016 18:01:28
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.97 kb
# include <cstdio>
using namespace std;

FILE *f = freopen("royfloyd.in", "r", stdin);
FILE *g = freopen("royfloyd.out", "w", stdout);

const int N_MAX = 101;

int cost[N_MAX][N_MAX];
int d[N_MAX][N_MAX];
int n;

int main()
{
    scanf("%d", &n);

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

    for (int k=1; k<=n; k++)
    {
        for (int i=1; i<=n; i++)
        {
            if (i == k) continue;
            for (int j = 1; j<=n ; j++)
            {
                if (j == k || j == i) continue;
                if (d[i][j] > d[i][k] + d[k][j])
                {
                    d[i][j] = d[i][k] + d[k][j];
                }
            }
        }
    }

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