Pagini recente » Cod sursa (job #2802857) | Cod sursa (job #2379381) | Cod sursa (job #1369035) | Cod sursa (job #1743520) | Cod sursa (job #2176222)
#include <iostream>
#include <fstream>
#include <list>
#include <stack>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n;
int mat[111][111];
int pond[111][111];
int main()
{f>>n;
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
{
f>>mat[i][j];
if(mat[i][j])
pond[i][j]=mat[i][j];
else pond[i][j]=1<<30;
}
for(int k=1;k<=n;++k)
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
if((i-k)*(i-j)*(j-k))
if(mat[i][k] and mat[k][j] and pond[i][j]>pond[i][k]+pond[k][j])
pond[i][j]=pond[i][k]+pond[k][j];
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
if(pond[i][j]!=1<<30)
g<<pond[i][j]<<' ';
else g<<0<<' ';
g<<endl;
}
return 0;
}