Cod sursa(job #527582)

Utilizator DanceKrissCristian Oancea DanceKriss Data 31 ianuarie 2011 21:50:46
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.1 kb
#include <iostream>
#include<stdio.h>

using namespace std;

const int lg=105;
int a[lg][lg],s[lg][lg];
int n;
const int maxi=1005;

int min(int x,int y)
{
    if(x<y) return x;
        else return y;
}

void read()
{
    int i,j;

    cin>>n;

    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
        {
            cin>>s[i][j];
            if(!s[i][j])
                if(i==j) a[i][j]=0;
                    else a[i][j]=maxi;
                else a[i][j]=s[i][j];

        }

}

void wfi()
{
    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] && i!=j)
               a[i][j]=min(a[i][j],a[i][k]+a[k][j]);

}

void out()
{
    int i,j;

    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
            if(i==j || a[i][j]==maxi) printf("0 ");
            else
                printf("%d ",a[i][j]);
        printf("\n");

    }
}

int main()
{
    freopen("royfloyd.in","r",stdin);
    freopen("royfloyd.out","w",stdout);

    read();
    wfi();
    out();
    return 0;
}