Cod sursa(job #952225)

Utilizator primulDarie Sergiu primul Data 22 mai 2013 21:43:29
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.87 kb
#include <vector>
# include <cstdio>
 
using namespace std;
int n,i,j,k,a[110][110],d[110][110];
int main()
{
    freopen("royfloyd.in","r",stdin);
    freopen("royfloyd.out","w",stdout);
    scanf("%d\n",&n);
    for (i=1; i<=n; i++)
    {
        for (j=1; j<=n; j++)
        {
            scanf("%d ",&a[i][j]);
            d[i][j]=a[i][j];
            if (i!=j && a[i][j]==0)
            {
                d[i][j]=100000;
                a[i][j]=100000;
            }
        }
        scanf("\n");
    }
    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];
               }
    for (i=1; i<=n; i++)
    {
        for (j=1; j<=n; j++)
            printf("%d ",a[i][j]);
        printf("\n");
    }
    return 0;
}