Pagini recente » Monitorul de evaluare | Monitorul de evaluare | Cod sursa (job #3322909) | Cod sursa (job #715435) | Cod sursa (job #3340979)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int NMAX = 101, INF = 1e9;
int n, adj[NMAX][NMAX];
void roy_floyd()
{
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
adj[i][j] = min(adj[i][j], adj[i][k] + adj[k][j]);
}
int main()
{
fin >> n;
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
fin >> adj[i][j];
if(i != j)
adj[i][j] = (adj[i][j] == 0 ? INF : adj[i][j]);
}
}
roy_floyd();
for(int i = 1; i <= n; i++, fout << "\n")
for(int j = 1; j <= n; j++)
fout << (adj[i][j] == INF ? 0 : adj[i][j]) << " ";
fin.close();
fout.close();
return 0;
}