Cod sursa(job #1816994)

Utilizator OFY4Ahmed Hamza Aydin OFY4 Data 27 noiembrie 2016 11:36:19
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.96 kb
#include <cstdio>
#include <algorithm>

using namespace std;

int main()
{
    freopen("royfloyd.in", "r", stdin);
    freopen("royfloyd.out", "w", stdout);

    int n, v[107][107];
    scanf("%d", &n);
    for(int i = 1; i <= n; ++i)
    {
        for(int j = 1; j <= n; ++j)
        {
            scanf("%d", &v[i][j]);
            if(v[i][j] == 0)
                v[i][j] = 1000000000;
        }
    }



    for(int i = 1; i <= n; ++i)
    {
        for(int j = 1; j <= n; ++j)
        {
            for(int k = 1; k <= n; ++k)
            {
                if(i != j)
                    v[i][j] = min(v[i][j], v[i][k] + v[k][j]);
            }
        }
    }

    for(int i = 1; i <= n; ++i)
    {
        for(int j = 1; j <= n; ++j)
        {
            if(v[i][j] == 1000000000)
                printf("0 ");
            else
                printf("%d ", v[i][j]);
        }
        printf("\n");
    }

    return 0;
}