Cod sursa(job #2815460)

Utilizator dariadragomir23Dragomir Daria dariadragomir23 Data 9 decembrie 2021 17:59:22
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.76 kb
#include <iostream>
#include <fstream>
#include <climits>
#define MAX INT_MAX/2
using namespace std;
ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");
int n, costuri[101][101];
int main()
{
    f >> n;
    for(int i = 1; i<=n; i++)
    {
        for(int j = 1; j<=n; j++)
        {
            f >> costuri[i][j];
            if(i!=j && costuri[i][j]==0)
                costuri[i][j] = MAX;
        }
    }
    for(int k = 1; k<=n; k++)
        for(int i = 1; i<=n; i++)
            for(int j = 1; j<=n; j++)
                if(costuri[i][j]>costuri[i][k]+costuri[k][j])
                    costuri[i][j] = costuri[i][k]+costuri[k][j];
    for(int i = 1;i<=n;i++)
    {
        for(int j = 1; j<=n; j++)
            g << costuri[i][j]<< " ";
        g << endl;
    }
}