Pagini recente » Cod sursa (job #1142900) | Cod sursa (job #664412) | Cod sursa (job #2527543) | Borderou de evaluare (job #2051291) | Cod sursa (job #798117)
Cod sursa(job #798117)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, a[101][101];
void solve()
{
for ( int i = 1; i <= n; i++ )
for ( int j = 1; j <= n; j++ )
for ( int k = 1; k <= n; k++ )
{
if ( a[i][j] && a[j][k] && (a[i][j]+a[j][k]<a[i][k] || !a[i][k])&& i != k)
{
a[i][k] = a[i][j]+a[j][k];
}
}
}
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;
}