Pagini recente » Cod sursa (job #1147102) | Cod sursa (job #2890982) | Cod sursa (job #220255) | Cod sursa (job #816394) | Cod sursa (job #798123)
Cod sursa(job #798123)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, a[101][101];
void solve()
{
for ( int k = 1; k <= n; k++ )
for ( int i = 1; i <= n; i++ )
for ( int j = 1; j <= n; j++ )
{
if ( a[i][k] && a[k][j] && (a[i][k]+a[k][j]<a[i][j]||!a[i][j]) && i != j )
{
a[i][j] = a[i][k]+a[k][j];
}
}
}
int main()
{
fin >> n;
for ( int i = 1; i <= n; i++ )
{
for (int j = 1; j <= n; j++ )
{
fin >> a[i][j];
}
}
solve();
for ( int i = 1; i <= n; i++ )
{
for ( int j = 1; j <= n; j++ )
{
fout << a[i][j] << ' ';
}
fout << '\n';
}
fin.close();
fout.close();
return 0;
}