Cod sursa(job #712654)

Utilizator Sm3USmeu Rares Sm3U Data 13 martie 2012 18:12:02
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.75 kb
#include <cstdio>
#define min(a,b) ((a<b)?a:b)
#define nMax 110

using namespace std;

int n;
int a[nMax][nMax];

int main()
{
    freopen ("royfloyd.in", "r", stdin);
    freopen ("royfloyd.out", "w", stdout);
    scanf ("%d", &n);
    for (int i = 0; i < n; ++ i){
        for (int j = 0; j < n; ++ j){
            scanf ("%d", &a[i][j]);
        }
    }
    for (int k = 0; k < n; ++ k){
        for (int i = 0; i < n; ++ i){
            for (int j = 0; j < n; ++ j){
                a[i][j] = min (a[i][j], a[i][k] + a[k][j]);
            }
        }
    }
    for (int i = 0; i < n; ++ i){
        for (int j = 0; j < n; ++ j){
            printf ("%d ", a[i][j]);
        }
        printf ("\n");
    }


    return 0;
}