Pagini recente » Cod sursa (job #2346474) | Cod sursa (job #2942098) | Cod sursa (job #1979405) | Cod sursa (job #661568) | Cod sursa (job #1098786)
#include <fstream>
using namespace std;
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,m[101][101],i,j,k;
f>>n;
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
f>>m[i][j];
for(k=1;k<=n;++k)
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
if (m[i][j]>m[i][k]+m[k][j]&&i!=j)
m[i][j]=m[i][k]+m[k][j];
for(i=1;i<=n;++i)
{
for(j=1;j<=n;++j)
g<<m[i][j]<<" ";
g<<"\n";
}
f.close();
g.close();
return 0;
}