Pagini recente » Cod sursa (job #762309) | Cod sursa (job #1619839) | Cod sursa (job #1734492) | Cod sursa (job #1206630) | Cod sursa (job #2194961)
#include <iostream>
#include <fstream>
#define cin in
#define cout out
using namespace std;
int main() {
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n;
int graph[101][101];
int i, j, k;
cin >> n;
for (i = 1; i <= n; ++i)
for (j = 1; j <= n; ++j)
cin >> graph[i][j];
for (k = 1; k <= n; ++k)
for (i = 1; i <= n; ++i)
for (j = 1; j <= n; ++j)
if (graph[i][j] > graph[i][k] + graph[k][j])
graph[i][j] = graph[i][k] + graph[k][j];
for (i = 1; i <= n; ++i) {
for (j = 1; j <= n; ++j)
cout << graph[i][j] << ' ';
cout << '\n';
}
in.close();
out.close();
return 0;
}