Cod sursa(job #1991030)

Utilizator BeatriceBBeatrice Roxana BeatriceB Data 14 iunie 2017 18:18:25
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.62 kb
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int N=110;
const int oo=1000000010;
int n,i,j,k,p[N][N];

int main()
{
    f>>n;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
        {
            f>>p[i][j];
            if(!p[i][j])
                p[i][j]=oo;
        }

    for(k=1;k<=n;k++)
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++)
                p[i][j]=min(p[i][j],p[i][k]+p[k][j]);

    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
            p[i][j]<oo?g<<p[i][j]<<' ':g<<"0 ";
        g<<"\n";
    }
    return 0;
}