Cod sursa(job #2812501)
Utilizator | Data | 4 decembrie 2021 16:54:41 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
typedef long long ll;
ll v[105][105],n;
int main()
{
in>>n;
for(ll i=1;i<=n;++i)
for(ll j=1;j<=n;++j)
in>>v[i][j];
for(ll k=1;k<=n;++k)
for(ll i=1;i<=n;++i) if(i!=k)
for(ll j=1;j<=n;++j) if(j!=i and j!=k)
if(v[i][k]+v[k][j]<v[i][j])
v[i][j]=v[i][k]+v[k][j];
for(ll i=1;i<=n;++i)
{
for(ll j=1;j<=n;++j)
out<<v[i][j]<<' ';
out<<'\n';
}
return 0;
}