Cod sursa(job #1883920)

Utilizator PaulCbnCiobanu Paul PaulCbn Data 18 februarie 2017 12:11:36
Problema Floyd-Warshall/Roy-Floyd Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 0.85 kb
#include <iostream>
#include <cstdio>
#define NMAX 105
using namespace std;

int graf[NMAX][NMAX];
int N;
void citire()
{
    scanf("%d\n",&N);
    for(int i=1; i<=N; i++)
        for(int j=1; j<=N; j++)
            scanf("%d",*(graf+i)+j);
}

void rf()
{
    for(int i=1;i<=N;i++)
        for(int j=1;j<=N;j++)
            for(int k=1;k<=N;k++)
                if(i!=j && j!=k && k!=i)
                    if(graf[i][k]+graf[k][j] < graf[i][j] || graf[i][j]==0)
                        graf[i][j]=graf[i][k]+graf[k][j];
}

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

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

    citire();
    rf();
    afisare();

    return 0;
}