Cod sursa(job #3329587)

Utilizator boboc132Boboc Teodor boboc132 Data 14 decembrie 2025 13:18:40
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.81 kb
#include <iostream>
#include <fstream>
using namespace std;

ifstream in("royfloyd.in");
ofstream out("royfloyd.out");

int cost[105][105];
int minim[105][105];

int min(int a,int b){
    return (a<b ? a:b);
}
//mai exista si nr total de trasee etc...
int main(){
    int n;
    in>>n;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(i==j)
                continue;
            in>>cost[i][j];
            minim[i][j]=cost[i][j];
        }
    }
    for(int k=1;k<=n;k++){
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                minim[i][j]=min(minim[i][j],minim[i][k]+minim[k][j]);
            }
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            out<<minim[i][j]<<" ";
        }
        out<<"\n";
    }
}