Cod sursa(job #2735676)
Utilizator | Alin Sava alisava | Data | 2 aprilie 2021 18:03:14 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout("royfloyd.out");
int a[105][105];
int main()
{
int n;
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++)
a[i][j] = min(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;
}