Cod sursa(job #2296674)

Utilizator canmihaiCancescu Mihai canmihai Data 4 decembrie 2018 21:59:06
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1 kb
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,a[300][300],b[300][300];
int main (){
    fin>>n;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++){
            fin>>a[i][j];
            if(a[i][j]!=0)
                b[i][j]=1;
        }
    for(int k=1;k<=n;k++)
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                if(i!=j){
                if(a[i][j]>a[i][k]+a[k][j]){
                    a[i][j]=a[i][k]+a[k][j];
                    b[i][j]=b[i][k]+b[k][j];
                }
                if(a[i][j]==a[i][k]+a[k][j])
                    b[i][j]=max(b[i][k]+b[k][j],b[i][j]);

            }

    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++)
            fout<<a[i][j]<<" ";
        fout<<endl;
    }/*
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++)
            fout<<b[i][j]<<" ";
        fout<<endl;
    }*/


    return 0;
}