Pagini recente » Borderou de evaluare (job #125612) | Cod sursa (job #815671) | Cod sursa (job #2659275) | Cod sursa (job #1742194) | Cod sursa (job #2814073)
#include <iostream>
#include <fstream>
#define inf 10000
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[105][105], N;
void Citire()
{
fin >> N;
for ( int i = 1; i <= N; i++ )
for ( int j = 1; j <= N; j++ )
fin >> a[i][j];
for ( int i = 1; i <= N; i++ )
for ( int j = 1; j <= N; j++ )
if ( i == j ) a[i][j] = 0;
else
if ( a[i][j] == 0 && i != j)
a[i][j] = inf;
}
void RoyFloyd()
{
for ( int k = 1; k <= N; k++ )
for ( int i = 1; i <= N; i++ )
for ( int j = 1; j <= N; j++ )
if ( a[i][j] > a[i][k] + a[k][j] )
a[i][j] = a[i][k] + a[k][j];
}
void afisare()
{
for ( int i = 1; i <= N; i++ )
for ( int j = 1; j <= N; j++ )
if ( a[i][j] == inf ) a[i][j] = 0;
for ( int i = 1; i <= N; i++ )
{
for ( int j = 1; j <= N; j++ )
fout << a[i][j] << " ";
fout<<"\n";
}
}
int main()
{
Citire();
RoyFloyd();
afisare();
return 0;
}