Pagini recente » Cod sursa (job #2921282) | Cod sursa (job #118559) | Cod sursa (job #3210583) | Cod sursa (job #711463) | Cod sursa (job #1795259)
#include<stdio.h>
#include<algorithm>
FILE *in, *out;
using namespace std;
int v[101][101], n;
int main ()
{
in = fopen("royfloyd.in", "r");
out = fopen("royfloyd.out", "w");
fscanf(in, "%d", &n);
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
fscanf(in, "%d", &v[i][j]);
}
}
for(int k = 0; k < n; k++) {
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
v[i][j] = min(v[i][j], (v[i][k] + v[k][j]));
}
}
}
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
fprintf(out, "%d ", v[i][j]);
}
fprintf(out, "\n");
}
fclose(in);
fclose(out);
return 0;
}