Cod sursa(job #1918397)

Utilizator binicBinica Nicolae binic Data 9 martie 2017 15:17:32
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.65 kb
#include<bits/stdc++.h>
using namespace std;
int n,dp[103][103];
int main ()
{
    freopen ("royfloyd.in", "r", stdin);
    freopen ("royfloyd.out", "w", stdout);
    scanf("%d ",&n);
    for (int i = 1; i <= n; i ++)
        for (int j = 1; j <= n; j ++)
            scanf ("%d", &dp[i][j]);

    for (int k = 1; k <= n; k++)
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
                if (dp[i][j] > dp[i][k] + dp[k][j])
                    dp[i][j] = dp[i][k] + dp[k][j];
    for (int i = 1; i <= n; i++ && printf("\n"))
        for (int j = 1; j <= n; j++)
            printf("%d ",dp[i][j]);
    return 0;
}