Cod sursa(job #2237498)

Utilizator parsulPaul Cristian Banu-Taran parsul Data 2 septembrie 2018 00:22:15
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.61 kb
#include<fstream>
#define MAX 100001
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int main()
{
    int n,i,j,k,c[101][101];
    in>>n;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
    {
        in>>c[i][j];
        if(i!=j&!c[i][j])
            c[i][j]=MAX;
    }
    for(k=1;k<=n;k++)
        for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            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++)
        if(c[i][j]==MAX)
            out<<0<<" ";
        else
            out<<c[i][j]<<" ";
        out<<endl;}

}