Cod sursa(job #1605290)

Utilizator andreitulusAndrei andreitulus Data 18 februarie 2016 21:36:18
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.92 kb
#include<stdio.h>
#define maxn 103
using namespace std;

int n, a[maxn][maxn];


void read()
{
    int i, j;

    scanf("%d", &n);

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



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

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



void afis()
{
    int i, j;


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

        printf("\n");
    }
}



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

    read();

    royfloyd();

    afis();

    fclose(stdin);
    fclose(stdout);

    return 0;

}