Cod sursa(job #936508)

Utilizator andreitulusAndrei andreitulus Data 7 aprilie 2013 14:28:48
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.88 kb
#include<stdio.h>
#define maxx 102
#define inf 999999999
using namespace std;
 
int a[maxx][maxx],n;
 
void cit()
{
    int i,j,x;
 
    scanf("%d",&n);
 
    for(i=1;i<=n;i++)
      for(j=1;j<=n;j++)
        scanf("%d",&x),a[i][j]=x;
 
}
 
 
 
void roy()
{
    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][k] && a[k][j] && (!a[i][j] || a[i][j]>a[i][k]+a[k][j]) && i!=j)
                    a[i][j]=a[i][k]+a[k][j];
 
}
 
 
 
 
void afis()
{
    int i,j;
 
    for(i=1;i<=n;i++)
     {
         for(j=1;j<=n;j++)
              printf("%d ",a[i][j]);
 
        printf("\n");
     }
 
}
 
 
 
int main()
{
    freopen("royfloyd.in","r",stdin);
    freopen("royfloyd.out","w",stdout);
 
    cit();
    roy();
    afis();
 
    fclose(stdin);
    fclose(stdout);
    return 0;
}