Pagini recente » Cod sursa (job #1489766) | Problema satisfiabilității formulelor logice de ordinul doi | Problema satisfiabilității formulelor logice de ordinul doi | Borderou de evaluare (job #2011036) | Cod sursa (job #1291252)
#include <iostream>
#include<fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,a[101][101],oo=10000000;
void read()
{
fin>>n;
int i,j;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
fin>>a[i][j];
if(a[i][j]==0) a[i][j]=oo;
}
for(i=1;i<=n;i++)
a[i][i]=0;
}
void roy_floyd()
{
int i,j,k;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
a[i][j]=min(a[i][j], a[i][k]+a[k][j]);
}
int main()
{
read();
roy_floyd();
int i,j;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
if(a[i][j]==oo) fout<<0<<" ";
else fout<<a[i][j]<<" ";
fout<<"\n";
}
return 0;
}