Pagini recente » Cod sursa (job #1381659) | Cod sursa (job #854062) | Cod sursa (job #1848950) | Cod sursa (job #1661338) | Cod sursa (job #1704176)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[105][105];
int N;
int main()
{
f >> N;
for (int i = 1; i <= N; ++i) {
for (int j = 1; j <= N; ++j) {
f >> 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 (i != 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) {
g << a[i][j] << " ";
}
g << "\n";
}
return 0;
}