Pagini recente » Cod sursa (job #2859175) | Cod sursa (job #1560967) | Cod sursa (job #1582972) | Cod sursa (job #1640551) | Cod sursa (job #2022160)
#include <iostream>
#include <fstream>
#include <cstdio>
#define NMax 101
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, a[NMax][NMax];
int main()
{
f >> n;
for(int i = 0; i < n; ++i)
for(int j = 0; j < n; ++j)
f >> a[i][j];
/// ROY FLOYD
for(int i = 0; i < n; ++i)
for(int j = 0; j < n; ++j)
for(int k = 0; k < n; ++k)
if(a[j][i] && a[i][k] && (a[j][k] > a[j][i] + a[i][k] || !a[j][k]) && j != k) a[j][k] = a[j][i] + a[i][k];
for(int i = 0; i < n; ++i)
{
for(int j = 0; j < n; ++j)
g << a[i][j] << " ";
g << '\n';
}
return 0;
}