Pagini recente » Borderou de evaluare (job #129947) | Cod sursa (job #1924578) | Cod sursa (job #2633942) | Cod sursa (job #215999) | Cod sursa (job #1468710)
#include<iostream>
#include<fstream>
using namespace std;
#define MAX 101
int A[MAX][MAX], N, i, j, k;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int main()
{
in >> N;
for (i = 1;i <= N;++i)
for (j = 1;j <= N;++j)
{
in >> A[i][j];
}
for (k = 1;k <= N;++k)
for (i = 1;i <= N;++i)
for (j = 1;j <= N;++j)
if (A[i][j] > A[i][k] + A[k][j] && A[i][k]>0 && A[k][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)
out << A[i][j] << ' ';
out << '\n';
}
in.close();
out.close();
return 0;
}