Cod sursa(job #1256055)

Utilizator G.RobertGosuly Robert G.Robert Data 5 noiembrie 2014 19:13:36
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.92 kb

#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
#define MAX 1001
int N,V[101][101],C[101][101],i,j,k;

void read()
{
    in>>N;
    for(int i=1;i<=N;i++){
        for(int j=1;j<=N;j++){
                in>>V[i][j];

                if(V[i][j]==0)
                    V[i][j]=MAX;


        }
    }

}
void royfloyd()
{
   for(i=1;i<=N;i++){
        for(j=1;j<=N;j++){
            for( k=1;k<=N;k++){

                if((V[i][j]>V[i][k]+V[k][j])&&(i!=j))
                    C[i][j]=C[i][k]+C[k][j];
                else
                    C[i][j]=0;
            }
        }
    }
}


void print()
{
    for(int i=1;i<=N;i++){
        for(int j=1;j<=N;j++){
            out<<C[i][j]<<' ';
        }
        out<<endl;
    }
}

int main()
{

    read();
    royfloyd();
    print();

    in.close();
    out.close();
    return 0;

}