Cod sursa(job #1135802)

Utilizator gabrielinelusGabriel-Robert Inelus gabrielinelus Data 8 martie 2014 13:55:03
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.94 kb
#include <cstdio>

#define Nmax 105

using namespace std;
int ADJ[Nmax][Nmax];
int N;

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",&ADJ[i][j]);
                if(ADJ[i][j] == 0)
                    ADJ[i][j] = 0x3f3f3f3f;
        }
    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(ADJ[i][k] + ADJ[k][j] < ADJ[i][j])
                    ADJ[i][j] = ADJ[i][k] + ADJ[k][j];

    for(int i = 1; i <= N; ++i)
    {
        for(int j =1 ; j <= N; ++j)
        {
            if(ADJ[i][j] == 0x3f3f3f3f)
                printf("0 ");
            else
                printf("%d ",ADJ[i][j]);
        }
        printf("\n");
    }
    return 0;
}