Cod sursa(job #2483888)

Utilizator Sho10Andrei Alexandru Sho10 Data 30 octombrie 2019 15:22:26
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.9 kb
#include <bits/stdc++.h> //JuniorMonster a.k.a Sho10
#define ll long long int
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define mod 1000000007
#define PI 3.14159265359
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
using namespace std;
ll n,a[105][105];
int32_t main(){
CODE_START;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
cin>>n;
for(ll i=0;i<n;i++)
for(ll j=0;j<n;j++)
cin>>a[i][j];
for(ll i=0;i<n;i++){
for(ll k=0;k<n;k++){
for(ll j=0;j<n;j++){
if(a[j][k]>a[j][i]+a[i][k]||a[j][k]==0){
if(a[j][i]!=0&&a[i][k]!=0&&j!=k){
a[j][k]=a[j][i]+a[i][k];
}
}
}
}
}
for(ll i=0;i<n;i++){
for(ll j=0;j<n;j++)
cout<<a[i][j]<<' ';
cout<<endl;
}
}