Cod sursa(job #2127768)

Utilizator LauraNaduLaura Nadu LauraNadu Data 10 februarie 2018 23:40:34
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.94 kb
#include<fstream>
#define inf 2000000000
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, d[300][300];//, a[300][300];
int main()
{
    f>>n;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            f>>d[i][j];
    for(int k=1;k<=n;k++)
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                if((d[i][j]>d[i][k]+d[k][j] || d[i][j]==0) && i!=j && d[i][k]!=0 && d[k][j]!=0)
                {
                    d[i][j]=d[i][k]+d[k][j];
                    //a[i][j]=1;
                }
                /*else if(d[i][j]==d[i][k]+d[k][j] && i!=j)
                        a[i][j]=max(a[i][j], a[i][k]+a[k][j]);*/
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
            g<<d[i][j]<<" ";
        g<<"\n";
    }
    /*for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
            g<<a[i][j]<<" ";
        g<<"\n";
    }*/
    return 0;
}