Pagini recente » Cod sursa (job #1779117) | Cod sursa (job #1948186) | Rating Nenciu Bianca (nenciu.bianca) | Rating Anicai Denis (deniros14) | Cod sursa (job #1932700)
#include <fstream>
const int NMAX = 128;
int a[NMAX][NMAX], n;
void read()
{
std::ifstream fin("royfloyd.in");
fin >> n;
int i,j;
for ( i = 1; i <= n; i++)
{
for ( j = 1; j <= n; j++)
{
fin >> a[i][j];
}
}
fin.close();
}
void print()
{
std::ofstream fout("royfloyd.out");
for ( int i = 1; i <= n; i++)
{
for ( int j = 1; j <= n; j++)
{
fout << a[i][j] << ' ';
}
fout << '\n';
}
fout.close();
}
void roy_floyd()
{
int i, j, k;
for ( k = 1; k <= n; k++)
{
for ( i = 1; i <= n; i++)
{
for ( j = 1; j <= n; j++)
{
if (a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j )
{
a[i][j] = a[i][k] + a[k][j];
}
}
}
}
}
int main()
{
read();
roy_floyd();
print();
return 0;
}