Mai intai trebuie sa te autentifici.
Cod sursa(job #1736601)
| Utilizator | Data | 2 august 2016 11:41:59 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <stdio.h>
#define NMAX 100
int n, graph[NMAX][NMAX];
int main() {
freopen("cmlsc.in", "r", stdin);
freopen("cmlsc.out", "w", stdout);
scanf("%d", &n);
for (int it = 0; it < n; ++it)
for (int jt = 0; jt < n; ++jt)
scanf("%d", &graph[it][jt]);
for (int k = 0; k < n; ++k) {
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (graph[i][j] > graph[i][k] + graph[k][j]) {
graph[i][j] = graph[i][k] + graph[k][j];
}
}
}
}
for (int it = 0; it < n; ++it) {
for (int jt = 0; jt < n; ++jt)
printf("%d ", graph[it][jt]);
printf("\n");
}
return 0;
}