Cod sursa(job #2071869)

Utilizator Marcel.DragosMarcel Dragos Ignat Marcel.Dragos Data 21 noiembrie 2017 09:11:42
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
#include <iostream>
#include <fstream>
#define INF 1000000
using namespace std;
int a[101][101],c[101][101],i,j,k,n;
int main()
{
    freopen("royfloyd.in" , "r", stdin);
    freopen("royfloyd.out", "w", stdout);
    scanf("%d", &n);
    for(i=1; i<=n; i++)
        for(j=1; j<=n; j++)
            {scanf("%d", &a[i][j]);
            c[i][j]=a[i][j];}

    for(k=1; k<=n; k++)
        for(i=1; i<=n; i++)
            for(j=1; j<=n; j++)
                if(i!=k && j!=k && i!=j && c[i][k] && c[k][j])
                    if(c[i][j]==0)
                        c[i][j]=c[i][k]+c[k][j];
                        else
                            c[i][j]=min(c[i][j], c[i][k]+c[k][j]);
    for(i=1; i<=n; i++)
        {for(j=1; j<=n; j++)
                printf("%d ", c[i][j]);
        printf("\n");}


    return 0;
}