Cod sursa(job #1579176)

Utilizator vancea.catalincatalin vancea.catalin Data 24 ianuarie 2016 14:51:08
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.82 kb
#include<iostream>
#include<fstream>
#define N 110
using namespace std;
fstream fin("royfloyd.in",ios::in),fout("royfloyd.out",ios::out);
int in[N][N],n;
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(in[i][k]!=0 && in[k][j]!=0)
                {
                    if(i!=j && in[i][j]==0) in[i][j]=in[i][k]+in[k][j];
                    in[i][j]=min(in[i][j],in[i][k]+in[k][j]);
                }
            }
        }
    }
}
int main()
{
    int i,j;
    fin>>n;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
        {
            fin>>in[i][j];
        }
    }
    roy();
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++) fout<<in[i][j]<<" ";
        fout<<"\n";
    }
}