Cod sursa(job #898982)

Utilizator starduststardust stardust Data 28 februarie 2013 12:25:58
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.64 kb
#include <fstream>
#define maxn 120

using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n;
int a[maxn][maxn];

void read()
{
    in>>n;
    for(int i=1;i<=n;i++)
     for(int j=1;j<=n;j++)
       in>>a[i][j];

    for(int k=1;k<=n;k++)
     for(int i=1;i<=n;i++)
      for(int j=1;j<=n;j++)
         if(i==j) continue;
         else if(a[i][k] && a[k][j] && (a[i][j]>a[i][k]+a[k][j] ||a[i][j]==0 )) a[i][j]=a[i][k]+a[k][j];
}
int main()
{
    read();
    for(int i=1;i<=n;i++)
     {
         for(int j=1;j<=n;j++)
         out<<a[i][j]<<" ";
         out<<"\n";
     }

    return 0;
}