Cod sursa(job #2855107)
| Utilizator | Data | 22 februarie 2022 09:27:53 | |
|---|---|---|---|
| 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 fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
const int MAXN = 103;
int n, a[MAXN][MAXN];
int main()
{
fin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
fin >> a[i][j];
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
if(a[i][j] > a[i][k] + a[k][j]) a[i][j] = a[i][k] + a[k][j];
for(int i = 1; i <= n; i++, fout << "\n")
for(int j = 1; j <= n; j++)
fout << a[i][j] << " ";
return 0;
}
