Pagini recente » Cod sursa (job #1359024) | Cod sursa (job #2621151) | Cod sursa (job #1880847) | Cod sursa (job #1146756) | Cod sursa (job #2158369)
#include <fstream>
#define N 105
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout("royfloyd.out");
int a[N][N];
int main()
{
int n;
fin >> n;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j) fin >> a[i][j];
fin.close();
for(int k = 1; k <= n; ++k)
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
if(a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j) a[i][j] = a[i][k] + a[k][j];
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= n; ++j) fout << a[i][j] << " ";
fout << '\n';
}
fout.close();
return 0;
}