Cod sursa(job #2125417)

Utilizator B_RazvanBaboiu Razvan B_Razvan Data 8 februarie 2018 14:21:17
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.89 kb
#include <iostream>
#include <cstdio>
#define NMAX 105
#define INF 0x3f3f3f

using namespace std;

int N, G[NMAX][NMAX];

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

void royfloyd()
{
    for(int k=1; k<=N; ++k)
        for(int i=1; i<=N; ++i)
            for(int j=1; j<=N; ++j)
                if(i != k || j != k)
                    G[i][j] = min(G[i][j], G[i][k] + G[k][j]);
}

void print()
{
    for(int i=1; i<=N; ++i)
    {
        for(int j=1; j<=N; ++j)
            printf("%d ", G[i][j]);
        printf("\n");
    }
}

int main()
{
    freopen("royfloyd.in", "r", stdin);
    freopen("royfloyd.out", "w", stdout);
    read();
    royfloyd();
    print();
    return 0;
}