Cod sursa(job #3271499)

Utilizator BogdancxTrifan Bogdan Bogdancx Data 26 ianuarie 2025 13:22:28
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.87 kb
#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

int main()
{
    ifstream fin("royfloyd.in");
    ofstream fout("royfloy.out");
    
    int n;
    
    fin >> n;
    
    vector<vector<int>> graph(n + 1, vector<int>(n + 1, 0));
    
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            fin >> 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++) {
            fout << graph[i][j] << ' ';
        }
        fout << endl;
    }
    
    return 0;
}