Cod sursa(job #792104)

Utilizator unsilviuContvechidontdeactivatepls unsilviu Data 26 septembrie 2012 15:22:54
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include <fstream>
using namespace std;
int n,v[101][101];

void roy() {
    int i,j,k;
    for (k=1; k<=n; k++)
        for (i=1; i<=n; i++)
            for (j=1; j<=n; j++)
                if ((i!=j&&v[i][k]&&v[k][j]&&v[i][j]))
                    v[i][j]=min(v[i][j],v[i][k]+v[k][j]);
                else if (i!=j&&(!v[i][j])&&v[i][k]&&v[k][j])
                    v[i][j]=v[i][k]+v[k][j];

}

int main() {
    int i,j;
    ifstream f("royfloyd.in");
    ofstream g("royfloyd.out");
    f>>n;
    for (i=1; i<=n; i++)
        for (j=1; j<=n; j++)
            f>>v[i][j];

    roy();
    for (i=1; i<=n; i++) {
        for (j=1; j<=n; j++)
            g<<v[i][j]<<' ';
        g<<'\n';
    }
    g.close();
    return 0;

}