Pagini recente » Cod sursa (job #2607630) | Cod sursa (job #29257) | Cod sursa (job #364927) | Cod sursa (job #81834) | Cod sursa (job #3224785)
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int inf = 100000;
int a[105][105], n;
int main()
{
f >> n;
for(int i = 1; i <= n; i ++)
for(int j = 1; j <= n; j ++)
{
f >> a[i][j];
if(a[i][j] == 0)
a[i][j] = inf;
}
for(int k = 1; k <= n; k ++)
for(int i = 1; i <= n; i ++)
for(int j = 1; j <= n; j ++)
if(i != j)
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
for(int i = 1; i <= n; i ++, g << '\n')
for(int j = 1; j <= n; j ++)
if(a[i][j] == inf)
g << 0 << " ";
else
g << a[i][j] << " ";
return 0;
}