Cod sursa(job #1395203)

Utilizator lau0097Cioclei Laurentiu lau0097 Data 21 martie 2015 10:18:39
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.77 kb
#include <fstream>
#define nmax 101
#define inf 1100

using namespace std;

ifstream f("rf.in");
ofstream g("rf.out");

int n,b[nmax][nmax];

int main()
{
    f>>n;
    int i,j,k;

    for(i=1;i<=n;++i)
        for(j=1;j<=n;++j)
            f>>b[i][j];

    for(k=1;k<=n;++k)
    {
        for(i=1;j<=n;++i)
        {
            for(j=1;j<=n;++j)
            {
               if(b[i][j]>b[i][k]+b[k][j] && i!=j && b[i][k]!=0 && b[k][j])
                {
                        b[i][j]=b[i][k]+b[k][j];

                }

            }





        }
    }
     for(i=1;i<=n;++i)
        {for(j=1;j<=n;++j)
           if(i!=j && b[i][j]!=inf) g<<b[i][j]<<" ";
                  else g<<0<<" ";
         g<<"\n";
        }

    return 0;
}