Cod sursa(job #1251355)

Utilizator OnimushaLordTiberiu Copaciu OnimushaLord Data 29 octombrie 2014 12:35:32
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.74 kb
# include <cstdio>
# define N 105

using namespace std;

int i,j,a[N][N];
int n;

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] && ( ( a[i][j]> a[i][k]+ a[k][j]) || !a[i][j] && i!=j ) ) a[i][j]=a[i][k]+a[k][j];
    return;
}

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

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

	fclose(stdin);
	fclose(stdout);
	return 0;
}