Cod sursa(job #1834229)

Utilizator andreigasparoviciAndrei Gasparovici andreigasparovici Data 24 decembrie 2016 08:30:10
Problema Floyd-Warshall/Roy-Floyd Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 0.96 kb
#include <iostream>
#include <cstdio>
using namespace std;

#define NMAX 105

int n;
int a[NMAX][NMAX];
int dist[NMAX][NMAX];

void read()
{
    scanf("%d ",&n);
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            scanf("%d ",&a[i][j]);
}

void initialize_dist()
{
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
            dist[i][j]=a[i][j];
        dist[i][i]=0;
    }
}

void royfloyd()
{
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            for(int k=1; k<=n; k++)
            {
                if(dist[i][j]>dist[i][k]+dist[k][j])
                    dist[i][j]=dist[i][k]+dist[k][j];
            }
}

void print()
{
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
            printf("%d ",dist[i][j]);
        printf("\n");
    }
}

int main()
{
    freopen("royfloyd.in","r",stdin);
    freopen("royfloyd.out","w",stdout);
    read();
    initialize_dist();
    royfloyd();
    print();
    return 0;
}