Cod sursa(job #1650310)

Utilizator VladuZ1338Vlad Vlad VladuZ1338 Data 11 martie 2016 17:38:13
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.81 kb
#include <cstdio>

using namespace std;

const int Nmax = 101;
const int oo = 0x3f3f3f3f;

int n, i, j, a[Nmax][Nmax], k;

int main()
{
    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", &a[i][j]);
        }
    }
    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");
    }
}