Cod sursa(job #1379057)

Utilizator alecsandrualex cuturela alecsandru Data 6 martie 2015 16:02:27
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp Status done
Runda Arhiva educationala Marime 0.88 kb
#include<cstdio>
using namespace std;

const int MAXN = 100;
const int INF = 0x7fffffff;

int w[MAXN + 1][MAXN + 1],d[MAXN + 1][MAXN + 1];
int n;

int main()
{
    int i,j,k;
    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",&w[i][j]);
            d[i][j]=INF;
        }
    for(i=1;i<=n;i++)
        d[i][i]=0;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            if(i!=j && w[i][j]!=0)
                d[i][j]=w[i][j];
    for(k=1;k<=n;k++)
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++)
                if(d[i][k]+d[k][j]<d[i][j])
                    d[i][j]=d[i][k]+d[k][j];
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
            printf("%d ",d[i][j]);
        printf("\n");
    }
    return 0;
}