Cod sursa(job #2504552)

Utilizator DBogdan23Dumitru Bogdan Mihai DBogdan23 Data 5 decembrie 2019 09:11:47
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.98 kb
#include <bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int a[101][101],n,m;
void citire()
{
    int e, r, di, i, j;
    in>>n;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            in>>a[i][j];
}
void drumuri()
{
    for(int k=1; k<=n; k++)
        for(int i=1; i<=n; i++)
            for(int j=1; j<=n; j++)
            {
                if(i!=k && j!=k && i!=j)
                    if(a[i][j]==0 && a[i][k]==0 && a[k][j]==0)
                        a[i][j]=-1;
            }
}
void roy()
{
    int i, j, k;
    for(k=1; k<=n; k++)
        for(i=1; i<=n; i++)
            for(j=1; j<=n; j++)
                if (a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j)
                    a[i][j] = a[i][k] + a[k][j];
}
int main()
{
    citire();
    roy();
    for(int i=1; i<=n; i++,out<<endl)
        for(int j=1; j<=n; j++)
            out<<a[i][j]<<' ';
    return 0;
}