Pagini recente » Cod sursa (job #1139846) | Cod sursa (job #2524866) | Cod sursa (job #1163113) | Cod sursa (job #2031428) | Cod sursa (job #1988393)
#include <iostream>
#include <fstream>
#define oo (1 << 30)
#define NMAX 101
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int a[NMAX][NMAX], n;
int main(int argc, char* argv[]) {
in >> n;
int x;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
in >> x;
if (i != j) {
if (x == 0)
a[i][j] = oo;
else
a[i][j] = x;
}
}
in.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][j] > a[i][k] + a[k][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";
}
out.close();
return 0;
}