Cod sursa(job #1361152)

Utilizator forever16Alex M forever16 Data 25 februarie 2015 19:54:25
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.64 kb
#include <iostream>
#include<fstream>
#define nmax 1005

using namespace std;
    ifstream f("royfloyd.in");
    ofstream g("royfloyd.out");

int a[nmax][nmax], n;

int roy( int n)
  { for( int k=1; k<=n; k++)
        for( int i=1; i<=n; i++)
            for( int j=1; j<=n; j++)
            if(a[i][k] && a[k][j] && (a[i][j]>a[i][k]+a[k][j] || !a[i][j] && i!=j)) a[i][j]=a[i][k]+a[k][j];
  }
int main()
{   f>>n;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++) f>>a[i][j];

roy(n);

    for( int i=1; i<=n; i++) {
            for( int j=1; j<=n; j++) g<<a[i][j]<<" ";
                        g<<"\n"; }
    return 0;
}