Cod sursa(job #2452499)

Utilizator verde.cristian2005Verde Flaviu-Cristian verde.cristian2005 Data 30 august 2019 22:49:59
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.62 kb
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int cost[101][101];
int main()
{
    int n,i,j,k;
    in>>n;
    for(i=1; i<=n; i++)
        for(j=1; j<=n; j++)
            in>>cost[i][j];
    for(k=1; k<=n; k++)
        for(i=1; i<=n; i++)
            for(j=1; j<=n; j++)
                if(cost[i][k]&&cost[k][j]&&(cost[i][k]+cost[k][j]<cost[i][j]||cost[i][j]==0)&&i!=j)
                    cost[i][j]=cost[i][k]+cost[k][j];
    for(i=1; i<=n; i++)
    {
        for(j=1; j<=n; j++)
            out<<cost[i][j]<<" ";
        out<<'\n';
    }
    return 0;
}