Cod sursa(job #1022061)

Utilizator ThomasFMI Suditu Thomas Thomas Data 4 noiembrie 2013 18:21:06
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.59 kb
#include <fstream>
using namespace std;

//ifstream f("megascoala.in");
//ofstream g("megascoala.out");
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");

int M[101][101];
int n,i,j,k;

int main()
{
    f>>n;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            f>>M[i][j];

    for(k=1;k<=n;k++)
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++)
                if(M[i][k]+M[k][j]<M[i][j]) M[i][j]=M[i][k]+M[k][j];

    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
        g<<M[i][j]<<" "; g<<"\n";
    }

    f.close();
    g.close();
    return 0;
}