Cod sursa(job #2912166)

Utilizator raul41917raul rotar raul41917 Data 7 iulie 2022 10:43:08
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.69 kb
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define INF 1000000000
using namespace std;
ifstream fi("royfloyd.in");
ofstream fo("royfloyd.out");
int N;
int M[101][101];
int MD[101][101];
int main()
{
    fi>>N;
    for(int i=1;i<=N;i++)
        for(int j=1;j<=N;j++)
            fi>>M[i][j];
    for(int k=1;k<=N;k++)
    {
        for(int i=1;i<=N;i++)
            for(int j=1;j<=N;j++)
            {
                if(M[i][j]>M[i][k]+M[k][j])
                    M[i][j]=M[i][k]+M[k][j];
            }
    }
    for(int i=1;i<=N;i++)
    {
        for(int j=1;j<=N;j++)
            fo<<M[i][j]<<" ";
        fo<<"\n";
    }
    return 0;
}