Pagini recente » Cod sursa (job #178887) | Cod sursa (job #2817522) | Cod sursa (job #923360) | Cod sursa (job #3242254) | Cod sursa (job #2691280)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int NMAX = 100;
const int INF = INT_MAX;
int dist[NMAX+5][NMAX+5];
void roy_floyd(int n){
int i, j, k;
for(i=1;i<=n;i++)
{
for(j =1;j<=n;j++)
{
for(k=1;k<=n;k++)
dist[i][j] = min(1ll * dist[i][j], 1ll * dist[i][k] + dist[k][j]);
}
}
}
int main()
{
int n, i, j;
fin>>n;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
fin>>dist[i][j];
if(dist[i][j] == 0)
dist[i][j] = INF;
if(i== j)
dist[i][j] = 0;
}
}
roy_floyd(n);
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(dist[i][j] == INF)
dist[i][j] = 0;
fout<<dist[i][j]<<" ";
}
fout<<"\n";
}
return 0;
}