Cod sursa(job #558637)

Utilizator PatrunjeluMarginean Bogdan Alexandru Patrunjelu Data 17 martie 2011 13:12:03
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.89 kb
#include <stdio.h>

int n;
int matrice[110][110];

int minimum(int a, int b)
{
    if (a <= b) return a;
    else return b;
}

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

void FLOYROYD()
{
    for (int k = 1; k <= n; ++k)
      for (int i = 1; i <=n; ++i)
        for (int j = 1; j<=n; ++j)
        matrice[i][j] = minimum(matrice[i][j], matrice[i][k] + matrice[k][j]);
}

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

int main()
{
    freopen("royfloyd.in", "r", stdin);
    freopen("royfloyd.out", "w", stdout);
    getInput();
    FLOYROYD();
    showOutput();
    return 0;
}