Cod sursa(job #1713642)

Utilizator gabrielinelusGabriel-Robert Inelus gabrielinelus Data 6 iunie 2016 04:03:28
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.97 kb
#include <cstdio>

#define INF 0x3f3f3f3f

using namespace std;
int DP[105][105],N;

void Read()
{
    scanf("%d",&N);
    for(int i = 1; i <= N; ++i)
        for(int j = 1; j <= N; ++j){
            scanf("%d",&DP[i][j]);
            if(DP[i][j] == 0)
                DP[i][j] = INF;
        }
}

void FW()
{
    for(int k = 1; k <= N; ++k)
        for(int i = 1; i <= N; ++i)
            if(i != k)
            for(int j = 1; j <= N; ++j)
                if(i != j && k != 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){
        for(int j = 1; j <= N; ++j)
            if(DP[i][j] >= INF || i == j)
                printf("0 ");
            else
                printf("%d ",DP[i][j]);
        printf("\n");
    }
}

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

    Read();
    FW();

    return 0;
}