Pagini recente » Cod sursa (job #1425241) | Cod sursa (job #527315) | Cod sursa (job #2333384) | Cod sursa (job #2891086) | Cod sursa (job #1425379)
#include<iostream>
#include<fstream>
#include<limits>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int g[100][100];
int c[100][100];
int d[100][100];
int N, M;
void royfloyd()
{
for (int k = 0; k < N; k++) {
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (d[i][k] != 0 &&
d[k][j] != 0 &&
(d[i][j] > d[i][k] + d[k][j] || !d[i][j]) &&
i != j) {
d[i][j] = d[i][k] + d[k][j];
}
}
}
}
}
int main()
{
fin >> N;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
int x;
fin >> x;
d[i][j] = x;
}
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
fout << d[i][j] << " ";
}
fout << endl;
}
}