Pagini recente » Cod sursa (job #2904350) | Cod sursa (job #2150340) | Cod sursa (job #1446279) | Cod sursa (job #564539) | Cod sursa (job #516124)
Cod sursa(job #516124)
#include <iostream>
#include <fstream>
using namespace std;
#define INF 999999999
int p[101][101],x,n;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
void warshall() {
for (int k=1;k<=n;k++)
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
p[i][j]=min(p[i][j],p[i][k]+p[k][j]);
}
int main()
{
fin>>n;
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++) {
fin>>x;
if (x==0&&i!=j) {p[i][j]=INF;}
else p[i][j]=x;
}
warshall();
for (int i=1;i<=n;i++) {
for (int j=1;j<=n;j++) {
if (p[i][j]==INF) fout<<"0 ";
else fout<<p[i][j]<<" ";
}
fout<<"\n";
}
fout.close();
return 0;
}