Pagini recente » Cod sursa (job #1433180) | Cod sursa (job #1106949) | Cod sursa (job #3211882) | Cod sursa (job #317970) | Cod sursa (job #2812161)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout("royfloyd.out");
const int MAXN = 103, INF = 2000;
int a[MAXN][MAXN], n;
int main()
{
fin >> n;
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
{
fin >> a[i][j];
if(i != j && !a[i][j]) a[i][j] = INF;
}
for(int k = 0; k < n; k++)
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
if(a[i][k] + a[k][j] < a[i][j]) a[i][j] = a[i][k] + a[k][j];
for(int i = 0; i < n; i++, fout << "\n")
for(int j = 0; j < n; j++)
fout << a[i][j] << " ";
return 0;
}