Cod sursa(job #2422748)

Utilizator razvan_ursuUrsu Razvan razvan_ursu Data 19 mai 2019 20:44:10
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.11 kb
#include <fstream>
#include <iostream>

using namespace std;

ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

short int w[100][100], dist[100][100], ok[100][100];

int main()
{
    int n;
    fin>>n;
    for(int i = 0; i< n; i++)
        for(int j = 0; j < n; j++)
        {
            fin>>w[i][j];
            dist[i][j] = w[i][j];
            if(w[i][j])
            {
                dist[i][j] = w[i][j];
            }
            else
            {
                dist[i][j] = SHRT_MAX;
            }

        }
    for(int k = 0; k <n; k++)
        for(int i = 0; i <n; i++)
            for(int j = 0; j <n; j++)
                if(dist[i][j] > dist[i][k] + dist[k][j] && dist[i][k]!= SHRT_MAX && dist[k][j]!= SHRT_MAX && i!= j)
                {
                    dist[i][j] = dist[i][k] + dist[k][j];
                }


    for(int i = 0; i< n; i++)
    {
        for(int j = 0; j < n; j++)
        {
            if(dist[i][j] == SHRT_MAX)
                dist[i][j] = 0;
            fout<<dist[i][j]<<' ';
        }
        fout<<'\n';
    }
    return 0;
}