Cod sursa(job #3167319)
Utilizator | Data | 10 noiembrie 2023 16:39:08 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
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 n,a[101][101];
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][k] && a[k][j] && i!=j && (a[i][k]+a[k][j]<a[i][j] || !a[i][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;
}