Cod sursa(job #899926)

Utilizator aciobanusebiCiobanu Sebastian aciobanusebi Data 28 februarie 2013 16:53:13
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.81 kb
#include<cstdio>
#define MAX 1000
int n,c[102][102],tata[102][102];
void citire()
{
    freopen("royfloyd.in","r",stdin);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            scanf("%d",&c[i][j]);
}
void roy()
{
    for(int k=1;k<=n;k++)
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                if(c[i][k] && c[k][j] && i != j && (c[i][j] > c[i][k] + c[k][j] || !c[i][j]))
                {
                    c[i][j]=c[i][k]+c[k][j];
                    tata[i][j]=tata[k][j];
                }
}
void afisare()
{
    freopen("royfloyd.out","w",stdout);
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
            printf("%d ",c[i][j]);
        printf("\n");
    }
}
int main()
{
    citire();
    roy();
    afisare();
}