Mai intai trebuie sa te autentifici.
Cod sursa(job #1760101)
| Utilizator | Data | 20 septembrie 2016 12:13:38 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.7 kb |
#include <iostream>
#include <cstdio>
using namespace std;
long a[200][200],dp[200][200],i,j,k,n;
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
scanf("%ld",&n);
for (i=1;i<=n;i++)
for (j=1;j<=n;j++) scanf("%ld",&dp[i][j]);
for (k=1;k<=n;k++)
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
{
if ((dp[i][k]!=0) && (dp[k][j]!=0))
if (dp[i][j] == 0)
dp[i][j] = dp[i][k]+dp[k][j];
dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j]);}
}
for (i=1;i<=n;i++)
{for (j=1;j<=n;j++) printf("%ld ",dp[i][j]);
printf("\n");}
return 0;
}
