Pagini recente » Cod sursa (job #2868343) | Cod sursa (job #2190481) | Cod sursa (job #1486639) | Cod sursa (job #1487753) | Cod sursa (job #3121119)
#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(G[i][k] && G[k][i] && (D[i][k] + D[k][j] < D[i][j] || !G[i][j]) && i != j)
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;
}