Pagini recente » Cod sursa (job #1376505) | Cod sursa (job #323409) | Cod sursa (job #516522) | Cod sursa (job #2961408) | Cod sursa (job #1422999)
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
#define N 101
int n, a[N][N];
int main()
{
in >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
in >> a[i][j];
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] && i != j && (a[i][j] > a[i][k] + a[k][j] || !a[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++)
out << a[i][j] << ' ';
out << '\n';
}
return 0;
}