Cod sursa(job #3202389)

Utilizator LilGoatCalin Andrei Cristian LilGoat Data 11 februarie 2024 14:23:01
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.88 kb
#include <bits/stdc++.h>
using namespace std;

int inf=INT_MAX;

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

int n;
int a[100][100];
int dist[100][100];
void parcurgere(){
    for(int i=0;i<n;i++)
        for(int j=0;j<n;j++)
            dist[i][j]=a[i][j];

    for(int k=0;k<n;k++)
        for(int i=0;i<n;i++)
            for(int j=0;j<n;j++)
                if(dist[i][k]!=inf&&dist[k][j]!=inf)
                    if(dist[i][j]>dist[i][k]+dist[k][j])
                        dist[i][j]=dist[i][k]+dist[k][j];
}

int main(){
    in>>n;
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            in>>a[i][j];
            if(a[i][j]==0&&i!=j)
                a[i][j]=inf;
        }
    }
    parcurgere();
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++)
            out<<dist[i][j]<<" ";
        out<<endl;
    }
    return 0;
}