Pagini recente » Cod sursa (job #3356353) | Cod sursa (job #270617) | Cod sursa (job #1102226) | Cod sursa (job #1668604) | Cod sursa (job #3323462)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
const int HIGH = 10000000;
const int N_LIM = 100;
int N, A[N_LIM][N_LIM];
void royfloyd()
{
for(int i = 0; i < N; i++)
for(int j = 0; j < N; j++)
{
if(i == j)
continue;
for(int k = 0; k < N; k++)
{
int D = A[i][k] + A[k][j];
if(D < A[i][j])
A[i][j] = D;
}
}
}
int main()
{
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
fin >> N;
for(int i = 0; i < N; i++)
for(int j = 0; j < N; j++)
{
fin >> A[i][j];
if(A[i][j] == 0)
A[i][j] = HIGH;
}
royfloyd();
for(int i = 0; i < N; i++)
for(int j = 0; j < N; j++)
fout << (A[i][j] >= HIGH ? 0 : A[i][j]) << (j == N - 1 ? '\n' : ' ');
fin.close();
fout.close();
return 0;
}