Pagini recente » Cod sursa (job #1292760) | Cod sursa (job #1539693) | Cod sursa (job #1682458) | Statistici mihai ilie (mihaitensor) | Cod sursa (job #509531)
Cod sursa(job #509531)
#include<fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
#define DIM 100
int a[DIM][DIM], n;
void Read();
void Solve();
void Write();
int main()
{
Read();
Solve();
Write();
fin.close();
fout.close();
return 0;
}
void Read()
{
fin >> n;
for(int i = 1; i <= n; ++i )
for(int j = 1; j <= n; ++j )
fin >> a[i][j];
}
void Solve()
{
for(int k = 1; k <= n; ++k )
for( int i = 1; i <= n; ++i )
for( int j = 1; j <= n; ++j )
if( i != j && a[i][j] > a[i][k] + a[k][j] )
a[i][j] = a[i][k] + a[k][j];
}
void Write()
{
for( int i = 1; i <= n; ++i )
{
for( int j = 1; j <= n; ++j )
fout << a[i][j] << ' ';
fout << endl;
}
}