Pagini recente » Cod sursa (job #977792) | Cod sursa (job #2550440) | Cod sursa (job #665825) | Cod sursa (job #2435984) | Cod sursa (job #2121245)
#include <iostream>
#include <fstream>
#define MAX 105
#include <climits>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, a[MAX][MAX], inf=INT_MAX;
int main()
{
f>>n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
f >> a[i][j];
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
for(int k = 1; k <= n; k++)
if(i != j && a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || a[i][j] == 0) )
{
a[i][j] = a[i][k] + a[k][j];
}
for(int i = 1; i <= n; i++, g<<'\n')
for(int j = 1; j <= n; j++)
g<<a[i][j]<<' ';
return 0;
}