Mai intai trebuie sa te autentifici.
Cod sursa(job #897922)
Utilizator | Data | 27 februarie 2013 22:58:50 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.73 kb |
#include <cstdio>
#include <cstring>
using namespace std;
int a[111][111], i,j,n;
void floyd ()
{
int i,j,k;
for (k=1; k<=n; k++)
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
if ((a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i!=j && a[i][k] && a[k][j])
a[i][j] = a[i][k] + a[k][j];
}
int main()
{
freopen ("royfloyd.in","r",stdin);
freopen ("royfloyd.out","w",stdout);
scanf ("%d",&n);
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
scanf ("%d",&a[i][j]);
floyd();
for (i=1; i<=n; i++)
{
for (j=1; j<=n; j++)
printf ("%d ",a[i][j]);
printf ("\n");
}
return 0;
}