Pagini recente » Cod sursa (job #1806060) | Cod sursa (job #997806) | Cod sursa (job #913267) | Cod sursa (job #2306825) | Cod sursa (job #2524272)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int lmt = 1e5+1;
int n,m, a[101][101], b[101][101];
int main()
{
fin>>n;
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
{
fin>>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 && a[i][k]!=0 && a[k][j]!=0)
{
if(a[i][j]>a[i][k]+a[k][j] || a[i][j]==0)
a[i][j]=a[i][k]+a[k][j];
}
}
}
}
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
{
fout<<a[i][j]<<' ';
}
fout<<endl;
}
return 0;
}