Pagini recente » Cod sursa (job #2505766) | Cod sursa (job #2432727) | Cod sursa (job #2809310) | Cod sursa (job #2424000) | Cod sursa (job #1817710)
#include <fstream>
#include <limits.h>
using namespace std;
#define Nmax 100
ifstream fin("royfloyd.in");
ofstream fout("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++)
fout << a[i][j] << " ";
fout<< "\n";
}
}
int main()
{
fin >> N;
int i, j;
for(i = 0; i < N; i++)
for(j = 0; j < N; j++)
fin>> a[i][j];
RoyFloyd();
return 0;
}