Cod sursa(job #3203985)
Utilizator | Data | 15 februarie 2024 10:24:03 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
#include <cmath>
std::ifstream fin("royfloyd.in");
std::ofstream fout("royfloyd.out");
int n, g[1001][1001];
int main() {
fin >> n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
fin >> g[i][j];
for(int k=1; k<=n; k++)
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
if(g[i][k] && g[k][j] && (g[i][j] > g[i][k] + g[k][j] || !g[i][j]) && i != j)
g[i][j] = g[i][k] + g[k][j];
for(int i=1; i<=n; i++) {
for(int j=1; j<=n; j++)
fout << g[i][j] << ' ';
fout << '\n';
}
return 0;
}