Cod sursa(job #1650516)

Utilizator al3xionescuIonescu Alexandru al3xionescu Data 11 martie 2016 18:54:28
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.94 kb
#include <fstream>
#include<climits>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int m,n,a[101][101],x,y,z,i,j,k;/*
void drum(int i, int j)
{int ok=1;
    for(int k=1;k<=n;k++)
if(k!=i&&k!=j&&i!=j&&a[i][j]==a[i][k]+a[k][j]) {ok=0;break;}
if(ok==0) {drum(i,k);drum(k,j);}
else fout<<i<<' ';
}*/
int main()
{fin>>n;/*
for(i=1;i<=n;i++)
    for(j=1;j<=n;j++)
        a[i][j]=INT_MAX/2;*/
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
    {fin>>z; a[i][j]=z;}
  for(k=1;k<=n;k++)
    for(i=1;i<=n;i++)
    for(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];
        for(i=1;i<=n;i++)
        {for(j=1;j<=n;j++)
            fout<<a[i][j]<<' '; fout<<'\n';
        }
       /* for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            if(a[i][j]!=INT_MAX/2;) drum(i,j);
    */
    //drum(1,3);
    return 0;
}