Pagini recente » Cod sursa (job #2616617) | Cod sursa (job #2142772) | Cod sursa (job #1142595) | Istoria paginii runda/extended_mag/clasament | Cod sursa (job #2448011)
#include <fstream>
#define NMAX 101
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[NMAX][NMAX], n;
void RF()
{
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]) && i != j)
a[i][j] = a[i][k] + a[k][j];
}
int main()
{
f >> n;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
f >> a[i][j];
RF();
for(int i = 1; i <= n; ++i, g << '\n')
for(int j = 1; j <= n; ++j)
g << a[i][j] << ' ';
f.close();
g.close();
return 0;
}