Cod sursa(job #889539)

Utilizator LeocruxRadu Romaniuc Leocrux Data 24 februarie 2013 16:13:35
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include <stdio.h>
using namespace std;
int m[105][105],n;
void citire(){
    scanf("%d\n",&n);
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++){
            scanf("%d",&m[i][j]);
        }
}

void royw(){
    for(int k=1;k<=n;k++)
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                if(m[i][k] && m[k][i] && (m[i][j] > m[i][k] + m[k][j] || !m[i][j]) && i != j)m[i][j]=m[i][k]+m[k][j];
}
int main()
{
    freopen("royfloyd.in","r",stdin);
    freopen("royfloyd.out","w",stdout);
    citire();
    royw();
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++)
            printf("%d ",m[i][j]);
        printf("\n");
    }
    return 0;
}