Pagini recente » Cod sursa (job #2616201) | Cod sursa (job #187735) | Cod sursa (job #1944032) | Cod sursa (job #1656187) | Cod sursa (job #1498858)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
#define MAX 102
int a[MAX][MAX];
int n, i, j, k;
int main()
{
fin >> n;
for(i = 1 ; i <= n ; i++)
for(j = 1 ; j <= n ; j++)
fin >> a[i][j];
for(k = 1 ; k <= n ; k++)
for(i = 1 ; i <= n ; i++)
for(j = 1 ; j <= n ; j++)
if(a[i][k] && a[k][j] && (a[i][k] + a[k][j] < a[i][j] || (a[i][j] == 0 && i!=j)))
a[i][j] = a[i][k] + a[k][j];
for(i = 1 ; i <= n ; i++)
{
for(j = 1 ; j <= n ; j++)
fout << a[i][j] << " ";
fout << "\n";
}
}