Pagini recente » Cod sursa (job #2784237) | Cod sursa (job #942758) | Cod sursa (job #1226263) | Cod sursa (job #1969660) | Cod sursa (job #3348081)
#include <fstream>
using namespace std;
const int INF = 9999999;
int n, C[101][101];
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int main()
{
cin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
{
cin >> C[i][j];
if(i != j && C[i][j] == 0)
C[i][j] = INF;
}
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
if(C[i][k] != INF && C[k][j] != INF)
if(C[i][k] + C[k][j] < C[i][j])
C[i][j] = C[i][k] + C[k][j];
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
if(C[i][j] == INF)
cout << "0 ";
else
cout << C[i][j] << " ";
}
cout << '\n';
}
return 0;
}