Pagini recente » Cod sursa (job #918145) | Cod sursa (job #43259) | Cod sursa (job #2989717) | Cod sursa (job #698461) | Cod sursa (job #1816569)
#include <fstream>
#include <limits.h>
using namespace std;
#define Nmax 100
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, a[Nmax][Nmax];
void RoyFloyd()
{
int i, j, k;
for(k = 0; k < n; k++)
for(i = 0; i < n; i++)
for(j = 0; j < n; j++)
if(i != j && a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]))
a[i][j] = a[i][k] + a[k][j];
for(i = 0; i < n; i++)
{
for(j = 0; j < n; j++)
g << a[i][j] << " ";
g << "\n";
}
}
int main()
{
f >> n;
int i, j;
for(i = 0; i < n; i++)
for(j = 0; j < n; j++)
f >> a[i][j];
RoyFloyd();
return 0;
}