Pagini recente » Cod sursa (job #937573) | Cod sursa (job #365502) | Cod sursa (job #1565003) | Cod sursa (job #3202642) | Cod sursa (job #3273869)
#include <fstream>
using namespace std;
const int NMAX = 101;
int n, a[NMAX][NMAX];
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int main()
{
int i, j, k;
f >> n;
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
f >> a[i][j];
//
for(k = 1; k <= n; k++)
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
if(i != j && a[i][k] && a[k][j] && (a[i][k] + a[k][j] < a[i][j]))
a[i][j] = a[i][k] + a[k][j];
//
for(i = 1; i <= n; i++, g << '\n')
for(j = 1; j <= n; j++)
g << a[i][j] << ' ';
f.close();
g.close();
return 0;
}