Cod sursa(job #1650688)

Utilizator Liviu98Dinca Liviu Liviu98 Data 11 martie 2016 19:51:07
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.75 kb
#include <iostream>
#include <fstream>
#define NMax 105
using namespace std;
int A[NMax][NMax],N;

void Citire()
{
    ifstream g("royfloyd.in");
    g>>N;
    for(int i=1;i<=N;i++)
    for(int j=1;j<=N;j++)
    g>>A[i][j];
}

void RoyFloyd()
{
    for(int k=1;k<=N;k++)
       for(int i=1;i<=N;i++)
          for(int j=1;j<=N;j++)
             if((A[i][j]>A[i][k]+A[k][j] || A[i][j]==0) && A[i][k] && A[k][j] && i!=j)
             {
                 A[i][j]=A[i][k]+A[k][j];
             }
}

void Afisare()
{
    ofstream f("royfloyd.out");
    for(int i=1;i<=N;i++)
    {
        for(int j=1;j<=N;j++)
            f<<A[i][j]<<' ';
        f<<endl;
    }
}

int main()
{
    Citire();
    RoyFloyd();
    Afisare();
}