Cod sursa(job #1564597)

Utilizator VladTiberiuMihailescu Vlad Tiberiu VladTiberiu Data 9 ianuarie 2016 19:49:47
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.9 kb
#include <cstdio>

#define NMax 105
#define INF 0x3f3f3f3f
using namespace std;

int a[NMax][NMax];
int n;

void floyd(){

    for(int nod = 1; nod <= n; nod++){
        for(int i = 1; i <= n; i++){
            for(int j = 1; j <= n; j++){
                if(a[i][j] > a[i][nod] + a[nod][j] && i != j){
                    a[i][j] = a[i][nod] + a[nod][j];
                }
            }
        }
    }
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            printf("%d ",a[i][j]);
        }
        printf("\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",&a[i][j]);
            if(a[i][j] == 0 && i != j)
                a[i][j] = INF;
        }
    }
    floyd();
    return 0;
}