Cod sursa(job #2018807)

Utilizator BovisioNitica Ionut Bogdan Bovisio Data 5 septembrie 2017 23:23:34
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.94 kb
#include <cstdio>

using namespace std;

int n,c[101][101];

void Read()
{
    freopen("royfloyd.in","r",stdin);
    freopen("royfloyd.out","w",stdout);
    scanf("%i",&n);
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            scanf("%i",&c[i][j]);
        }
    }
}

int min(int x,int y)
{
    if(x > y)
        return y;
    return x;
}

void RoyFloyd()
{
    for(int k=1;k<=n;k++)
    {
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                if(c[i][k] && c[k][j] && (c[i][j] > c[i][k] + c[k][j] || !c[i][j]) && i != j)
                {
                    c[i][j] = c[i][k] + c[k][j];
                }
            }
        }
    }
}

int main()
{
    Read();
    RoyFloyd();
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
            printf("%i ",c[i][j]);
        printf("\n");
    }
    return 0;
}