Pagini recente » Cod sursa (job #2385531) | Cod sursa (job #578159) | Cod sursa (job #1168209) | Cod sursa (job #2653958) | Cod sursa (job #3121113)
#include <fstream>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int n;
int G[106][106];
long long D[106][106];
int main()
{
cin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
cin >> G[i][j];
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
D[i][j] = G[i][j];
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
if(D[i][k] != 0 && D[k][j] != 0)
D[i][j] = min(D[i][j], D[i][k] + D[k][j]);
for(int i = 1; i <= n; i++, cout << '\n')
for(int j = 1; j <= n; j++)
cout << D[i][j] << ' ';
return 0;
}