Cod sursa(job #1782980)

Utilizator VladG26Ene Vlad-Mihai VladG26 Data 18 octombrie 2016 17:38:31
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include <iostream>
#include <cstdio>
using namespace std;
int n,a[1002][1002];
void citire()
{
    scanf("%d",&n);
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            scanf("%d",&a[i][j]);
}
void royFloyd()
{
    for(int k=1; k<=n; k++)
        for(int i=1; i<=n; i++)
            for(int j=1; j<=n; j++)
                a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
}
void afisare()
{
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
            printf("%d ",a[i][j]);
        printf("\n");
    }

}

int main()
{
    freopen("royfloyd.in","r",stdin);
    freopen("royfloyd.out","w",stdout);
    citire();
    royFloyd();
    afisare();
    return 0;
}