Cod sursa(job #2682400)
| Utilizator | Data | 8 decembrie 2020 16:58:07 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int nmax = 1e2 + 1;
int n, rin[nmax][nmax];
int main()
{
f >> n;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
f >> rin[i][j];
for(int k = 1; k <= n; ++k)
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
rin[i][j] = min(rin[i][k] + rin[k][j], rin[i][j]);
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= n; ++j)
g<<rin[i][j]<<' ';
g<<'\n';
}
return 0;
}
