Pagini recente » Cod sursa (job #1288541) | Cod sursa (job #1624441) | Cod sursa (job #822647) | Cod sursa (job #1274008) | Cod sursa (job #2027183)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, d[105][105];
void royFloyd()
{
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(d[i][k] && d[k][j] && d[i][j]>d[i][k]+d[k][j]) d[i][j]=d[i][k]+d[k][j];
}
int main()
{
f>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++) f>>d[i][j];
royFloyd();
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++) g<<d[i][j]<<" ";
g<<'\n';
}
return 0;
}