Pagini recente » Cod sursa (job #798611) | Cod sursa (job #3210658) | Cod sursa (job #1201505) | Cod sursa (job #2272627) | Cod sursa (job #2867480)
#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,i,j,k,a[102][102];
int main()
{
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
fin>>a[i][j];
if(a[i][j]==0)
a[i][j]=999999;
}
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][j]=a[i][k]+a[k][j];
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(i==j or a[i][j]==999999)
a[i][j]=0;
fout<<a[i][j]<<' ';
}
//fout<<a[i][j]<<' ';
fout<<'\n';
}
return 0;
}