Cod sursa(job #2342977)

Utilizator chiutamarcelChiuta Mihai Marcel chiutamarcel Data 13 februarie 2019 16:19:27
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.61 kb
#include <iostream>
#include <fstream>

using namespace std;

int N, A[105][105];
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

int main()
{
    fin >> N;
    for(int i = 1; i <= N; i++){
        for(int j = 1; j <= N; j++){
            fin >> A[i][j];
        }
    }
    
    for(int k = 1; k <= N; k++){
        for(int i = 1; i <= N; i++){
            for(int j = 1; j <= N; j++){
                A[i][j] = min(A[i][j], A[i][k] + A[k][j]);
            }
        }
    }
    
    for(int i = 1; i <= N; i++){
        for(int j = 1; j <= N; j++){
            fout << A[i][j];
        }
    }

    return 0;
}