Cod sursa(job #1626480)

Utilizator TrascaAndreiTrasca Andrei TrascaAndrei Data 3 martie 2016 09:21:31
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.92 kb
#include <iostream>
#include <stdio.h>

using namespace std;

const int N = 101;
const int INF = 1000000;
const char inf[] = "royfloyd.in";
const char outf[] = "royfloyd.out";

int n,a[N][N];

void royfloyd()
{
    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] && i!=j)
                    a[i][j]=a[i][k]+a[k][j];
}

int main()
{
    freopen(inf,"r",stdin);
    freopen(outf,"w",stdout);
    scanf("%d",&n);
    int i,j;
    for(i=1;i<n;i++)
        for(j=i+1;j<=n;j++)
            a[i][j]=a[j][i]=INF;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            scanf("%d",&a[i][j]);
    royfloyd();
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
            if(a[i][j]==INF)
                printf("0 ");
            else
                printf("%d ",a[i][j]);
        printf("\n");
    }
    return 0;
}