Pagini recente » Borderou de evaluare (job #2017906) | Cod sursa (job #2818011) | Cod sursa (job #2137909) | Cod sursa (job #793297) | Cod sursa (job #1984756)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n,dmin[105][105];
int main()
{
in>>n;
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)in>>dmin[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 && dmin[i][k]!=0 && dmin[k][j]!=0)dmin[i][j]=min(dmin[i][j],dmin[i][k]+dmin[k][j]);
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
{
out<<dmin[i][j]<<" ";
}
out<<'\n';
}
return 0;
}