Pagini recente » Cod sursa (job #2947821) | Cod sursa (job #2937372) | Cod sursa (job #400046) | Cod sursa (job #2391437) | Cod sursa (job #1706006)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int Nmax = 105, oo = 10000000;
int a[Nmax][Nmax], 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] = oo;
}
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
{
if(a[i][k]+a[k][j] < a[i][j]) a[i][j] = a[i][k]+a[k][j];
}
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
if(a[i][j] != oo) g<<a[i][j]<<' ';
else g<<0<<' ';
g<<'\n';
}
return 0;
}