Pagini recente » Cod sursa (job #963028) | Istoria paginii runda/oni2015day1/clasament | Cod sursa (job #2424430) | Cod sursa (job #801872) | Cod sursa (job #1268719)
#include <fstream>
using namespace std;
ifstream is("royfloyd.in");
ofstream os("royfloyd.out");
int n;
int a[101][101], c[101][101];
int main()
{
is >> n;
for ( int i = 1; i <= n; ++i )
for ( int j = 1; j <= n; ++j )
{
is >> a[i][j];
c[i][j] = a[i][j];
}
for ( int k = 1; k <= n; ++k )
for ( int i = 1; i <= n; ++i )
for ( int j = 1; j <= n; ++j )
if ( c[i][j] > c[i][k] + c[k][j] )
c[i][j] = c[i][k] + c[k][j];
for ( int i = 1; i <= n; ++i )
{
for ( int j = 1; j <= n; ++j )
os << c[i][j] << ' ';
os << '\n';
}
is.close();
os.close();
return 0;
}