Cod sursa(job #1785447)

Utilizator woogiefanBogdan Stanciu woogiefan Data 21 octombrie 2016 12:25:07
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.65 kb
#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

#define MAX 102
#define for(i,n) for(i=1;i<=n;i++)
#define for(j,n) for(j=1;j<=n;j++)
#define for(k,n) for(k=1;k<=n;k++)

int a[MAX][MAX];
int n , i , j ,k;

int main()
{
    fin >> n;
    for(i,n) for(j,n) fin >> a[i][j];
    for(k,n) for(i,n) for(j,n)
        if(i != j && (a[i][k] + a[k][j] < a[i][j] || a[i][j] == 0) && a[i][k] && a[k][j])
                    a[i][j] = a[i][k] + a[k][j];

    for(i,n){
        for(j,n)
            fout << a[i][j] << " ";
        fout << endl;
    }

    return 0;
}