Pagini recente » Cod sursa (job #1833528) | Cod sursa (job #759930) | Cod sursa (job #1727841) | Cod sursa (job #1866229) | Cod sursa (job #3130326)
#include <fstream>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
const int N = 100;
const int INF = 1e9;
int n, m[N + 1][N + 1];
int main()
{
cin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
{
cin >> m[i][j];
if(m[i][j] == 0 && i != j)
m[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(m[i][k] + m[k][j] < m[i][j])
m[i][j] = m[i][k] + m[k][j];
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
if(m[i][j] == INF)
m[i][j] = 0;
cout << m[i][j] << " ";
}
cout << '\n';
}
return 0;
}