Cod sursa(job #2928227)
Utilizator | Data | 22 octombrie 2022 14:56:54 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
#define nmax 110
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[nmax][nmax];
int main()
{
int n;
f>>n;
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
f>>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] and i!=j and a[i][k] and a[k][j])a[i][j]=a[i][k]+a[k][j];
for(int i=1;i<=n;++i,g<<"\n")
for(int j=1;j<=n;++j)
g<<a[i][j]<<" ";
}