Cod sursa(job #2298397)

Utilizator oloeriudeliaOloeriu Delia Ioana oloeriudelia Data 8 decembrie 2018 09:41:51
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.82 kb
#include <fstream>

using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[101][101]={2000}, n, v, x, tata[101][101];
int main()
{
    fin>>n;
    for(int i=1;i<=n;++i)
        for(int j=1;j<=n;++j)
            fin>>a[i][j], tata[i][j]=i;
    for(int i=1;i<=n;++i)
        for(int j=1;j<=n;++j)
            for(int k=1;k<=n;++k)
            if(a[j][k]>a[j][i]+a[i][k])
            {
                a[j][k]=a[j][i]+a[i][k];
                tata[j][k]=tata[i][k];
            }
    for(int i=1;i<=n;++i)
        {
            for(int j=1;j<=n;++j)
                {
                    if(a[i][j]==2000)
                        fout<<0<<' ';
                    else
                        fout<<a[i][j]<<' ';
                }
            fout<<'\n';
        }
    return 0;
}