Cod sursa(job #1751644)

Utilizator AcuasPopescu Nicolae-Aurelian Acuas Data 1 septembrie 2016 18:00:01
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.94 kb
#include <fstream>
#define NMAX 10005
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,a[105][105];
void citire(){
    f>>n;
    int i,j;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            f>>a[i][j];
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            if(a[i][j]==0)
                a[i][j]=NMAX;
}
void roy_floyd(){
    //se incearca sa se scurteze drumul prin trecerea printr-un nod suplimentar k
    for(int k=1;k<=n;k++)
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                if(a[i][j]>a[i][k]+a[k][j]&&i!=j)
                    a[i][j]=a[i][k]+a[k][j];
}
void afis_mat(){
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++)
            if(a[i][j]==NMAX)
                g<<0<<' ';
            else
                g<<a[i][j]<<' ';
        g<<'\n';
    }
}
int main()
{
    citire();
    roy_floyd();
    afis_mat();
    return 0;
}