Cod sursa(job #1620183)

Utilizator tothalToth Alexandru tothal Data 28 februarie 2016 21:20:08
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.94 kb
#include <fstream>
using namespace std;
int n, a[105][105];

void citire()
{
    ifstream fin("royfloyd.in");
    ofstream fout("royfloyd.out");

    int i,j;
        fin>>n;
    for (i = 1; i <= n; i++)
        for (j = 1; j <= n; j++) fin>>a[i][j];
}

void roy_floyd()
{
    int i, j, k;
    for (k = 1; k <= n; k++)
        for (i = 1; i <= n; i++)
            for (j = 1; j <= n; j++)
                {//if (a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j) a[i][j] = a[i][k] + a[k][j];
                if((!a[i][j] && a[i][k] && a[k][j]) || (a[i][k] && a[k][j] && a[i][j]>a[i][k]+a[k][j]) && i!=j )
                    a[i][j]=a[i][k]+a[k][j];


                }
}

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


int main()
{
    citire();
    roy_floyd();
    afis();
    return 0;
}