Pagini recente » Cod sursa (job #2573882) | Cod sursa (job #87972) | Cod sursa (job #1450841) | Cod sursa (job #2105317) | Cod sursa (job #2802167)
#include <fstream>
#include <cmath>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
long long n, a[110][110];
const int oo=(1<<30);
void citire()
{
int i,j;
cin >> n;
for( i = 1; i <= n; i++)
for( j = 1; j <= n; j++)
{
cin >> a[i][j];
if(a[i][j] == 0)
a[i][j] = oo;
}
}
int main()
{ int i,j,k;
citire();
for( k = 1; k <= n; k++)
for( i = 1; i <= n; i++)
if(i != k)
{
for( j = 1; j <= n; j++)
if(i != j && j != k)
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
}
for( i = 1; i <= n; i++)
{
for( j = 1; j <= n; j++)
{
if(a[i][j] ==oo)
cout << "0 ";
else cout << a[i][j] << " ";
}
cout <<'\n';
}
return 0;
}