Cod sursa(job #1146597)

Utilizator bogobatBerbece Daniel bogobat Data 19 martie 2014 09:36:25
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.51 kb
#include <iostream>
#include <fstream>
using namespace std;
int i,j,k,a[1001][1001],n;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");

int main()
{
f>>n;
for(i=1;i<=n;++i)
    for(j=1;i<=n;++j)
       f>>a[i][j];

for(k=1;k<=n;k++)
    for(i=1;i<=n;i++)
       for(j=1;j<=n;j++){
            if(i!=j && a[k][j] && a[i][k] && (a[i][j]>a[i][k] + a[k][j] || !a[i][j])) a[i][j]=a[i][k] + a[k][j];
}
for(i=1;i<=n;++i){
for(j=1;j<=n;++j){
      g<<a[i][j]<< " ";}
      g<<endl;}
    return 0;
}