Cod sursa(job #3242444)
| Utilizator | Data | 12 septembrie 2024 11:53:13 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,dp[101][101];
int main(){
fin>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
fin>>dp[i][j];
if(i!=j && dp[i][j]==0)
dp[i][j]=1000000000;
}
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(i!=j)
if(dp[i][j]>dp[i][k]+dp[k][j])
dp[i][j]=dp[i][k]+dp[k][j];
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)
fout<<dp[i][j]<<" ";
fout<<'\n';}
return 0;
}
