Cod sursa(job #2685827)

Utilizator RNedelcuNedelcu Radu RNedelcu Data 17 decembrie 2020 19:41:48
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.71 kb
#include <iostream>
#include <bits/stdc++.h>
#define MAX 101
#define INF 2000
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int N,M;
int Graph[MAX][MAX];
int main()
{
    in>>N;
    for(int i=1; i<=N; i++)
        for(int j=1; j<=N; j++)
            in>>Graph[i][j];

    for(int k=1; k<=N; k++)
        for(int i=1; i<=N; i++)
            for(int j=1; j<=N; j++)
                if(Graph[i][j]> Graph[i][k]+Graph[k][j])
                {
                    Graph[i][j] = Graph[i][k]+Graph[k][j];
                }

    for(int i=1; i<=N; i++)
    {
        for(int j=1; j<=N; j++)
            out<<Graph[i][j]<<" ";
        out<<'\n';
    }
    return 0;
}