Cod sursa(job #1881751)

Utilizator jordan1998Jordan jordan1998 Data 16 februarie 2017 18:28:51
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.18 kb
#include <cstdio>
#define buffs 65536
#define inf 32000
using namespace std;
FILE *f=freopen("royfloyd.in","r",stdin);
int pos=0;
char buff[buffs];
inline void read(short int &nr)
{   short int semn=1;
    while(buff[pos]<'0'||buff[pos]>'9') if(++pos==buffs)     fread(buff,1,buffs,stdin);
    nr=0;
    if(buff[pos-1]=='-') semn=-1;
    while(buff[pos]>='0'&&buff[pos]<='9')
    {
        nr=(nr<<1)+(nr<<3)+buff[pos]-'0';
        if(++pos==buffs)     fread(buff,1,buffs,stdin);
    }
    nr*=semn;
}
short int n,i,j,k,a[102][102];
int main()
{
    freopen("royfloyd.out","w",stdout);
    fread(buff,1,buffs,stdin);
    read(n);
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
        {read(a[i][j]);
         if(i!=j&&a[i][j]==0)
                a[i][j]=inf;
        }
    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] = a[i][k] + a[k][j];
      //  if((i!=j)&&(a[i][k]&&a[k][j])&&(a[i][j]>a[i][k]+a[k][j]||!a[i][j]))a[i][j]=a[i][k]+a[k][j];
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
            printf("%d ",a[i][j]);
        printf("\n");
    }
}