Cod sursa(job #2945767)
| Utilizator | Data | 24 noiembrie 2022 07:58:10 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, a[102][102];
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][k] > 0 && a[k][j] > 0)
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] << ' ';
}
