Pagini recente » Cod sursa (job #3271557) | Cod sursa (job #1889107) | Cod sursa (job #2153771) | Cod sursa (job #2607394) | Cod sursa (job #2919019)
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast")
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
const int INF = 2e9;
const int MAX_N = 105;
int n, rf[MAX_N][MAX_N];
int main (){
ios_base::sync_with_stdio(false);
fin.tie(nullptr), fout.tie(nullptr);
fin>>n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
fin>>rf[i][j];
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
if(i != j)
for(int k=1; k<=n; k++)
if(rf[i][k] && rf[k][j])
if(rf[i][j] > rf[i][k] + rf[k][j] || rf[i][j] == 0)
rf[i][j] = rf[i][k] + rf[k][j];
for(int i=1; i<=n; i++, fout<<"\n")
for(int j=1; j<=n; j++, fout<<" ")
fout<<rf[i][j];
return 0;
}