Cod sursa(job #2109799)

Utilizator GrasuneAlexandruGrasune Alexandru Mihai GrasuneAlexandru Data 20 ianuarie 2018 10:03:58
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.79 kb
#include <fstream>



using namespace std;
int n,a[101][101],d[101][101];

int main()
{
    int N=99999;
    ifstream fin("royfloyd.in");
    ofstream cout("royfloyd.out");
    fin>>n;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)

        {
            fin>>a[i][j];
            if(a[i][j]==0&&i!=j)
                d[i][j]=N;
                else
                d[i][j]=a[i][j];
        }


    for(int k=1; k<=n; k++)
        for(int i=1; i<=n; i++)
            for(int j=1; j<=n; j++)
                d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
            if(d[i][j]==N)
                cout<<0<<" ";
        else

            cout<<d[i][j]<<" ";
        cout<<'\n';
    }


    return 0;
}