Cod sursa(job #3041920)
| Utilizator | Data | 2 aprilie 2023 19:10:08 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[105][105];
int main(){
int n;
cin >> 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] << ' ';
}