Cod sursa(job #1364127)

Utilizator gabrielinelusGabriel-Robert Inelus gabrielinelus Data 27 februarie 2015 14:35:21
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.09 kb
#include <cstdio>

#define INF 0x3f3f3f3f

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

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

}

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

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

    Read();
    Solve();

    return 0;
}