Cod sursa(job #2726150)
| Utilizator | Data | 20 martie 2021 14:05:09 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <bits/stdc++.h>
using namespace std;
int n,dp[102][102];
void Roy_Floyd(){
int j,i,k;
for(k=1;k<=n;++k)
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
if(i!=j && dp[i][j]>dp[i][k]+dp[k][j])
dp[i][j]=dp[i][k]+dp[k][j];
}
int main()
{
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int i,j;
cin>>n;
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
cin>>dp[i][j];
Roy_Floyd();
for(i=1;i<=n;++i){
for(j=1;j<=n;++j)
cout<<dp[i][j]<<" ";
cout<<'\n';
}
return 0;
}
