Pagini recente » Cod sursa (job #2398150) | Cod sursa (job #1696913) | Cod sursa (job #2973261) | Cod sursa (job #206740) | Cod sursa (job #2571076)
#include <bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int DIM = 107;
const int INF = 1e9;
int v[DIM][DIM];
int main()
{
int n;
in >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
{
in >> v[i][j];
if(i != j)
if(v[i][j] == 0)
v[i][j] = INF;
}
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
v[i][j] = min(v[i][j],v[i][k] + v[k][j]);
for(int i = 1; i <= n; i++)
{for(int j = 1; j <= n; j++)
if(v[i][j] == INF)
out << 0 <<" ";
else
out <<v[i][j] <<" ";
out <<'\n';
}
return 0;
}