Cod sursa(job #2801152)

Utilizator qubitrubbitQubit Rubbit qubitrubbit Data 15 noiembrie 2021 09:59:29
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.83 kb
#include <fstream>
using namespace std; 
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
#define MAX_N 101

int n; 
int dp[MAX_N][MAX_N];
int main()
{
    fin >> n;
    for (int i = 1; i <= n; ++i){
        for (int j = 1; j <= n; ++j){
            fin >> dp[i][j];
            if (dp[i][j] == 0){
                dp[i][j] = MAX_N;
            }
        }
    }
    for (int i = 1; i <= n; ++i){
        dp[i][i] = 0;
    }
    
    for (int k = 1; k <= n; ++k){
        for (int i = 1; i <= n; ++i){
            for (int j = 1; j <= n; ++j){ 
                dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
            }
        }
    }
    for (int i = 1; i <= n; ++i){
        for (int j = 1; j <= n; ++j){
            fout << dp[i][j] << " ";
        }
        fout << "\n";
    }
    return 0;
}