Cod sursa(job #2549852)

Utilizator rusu.ralucaRusu Raluca rusu.raluca Data 18 februarie 2020 08:17:01
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.69 kb
#include <iostream> 
#include <fstream>
using namespace std; 

#define N 100  

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

	
int n, a[N][N];
 
void Roy_Warshall(int n, int a[][N]){
    for(int k = 1; k <= n; ++k)
        for(int i = 1; i <= n; ++i)
            for(int j = 1; j <= n; ++j)
                if(a[i][k] && a[k][j] && i != j && (a[i][j] == 0 || a[i][k] + a[k][j] < a[i][j] ))
                    a[i][j] = a[i][k] + a[k][j];
}
 
int main(){
    in>>n;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            in>>a[i][j];
    Roy_Warshall(n,a);
    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++)
            cout<<a[i][j]<<" ";
        cout<<"\n";
    }
}