Cod sursa(job #890528)

Utilizator dtoniucDaniel Toniuc dtoniuc Data 25 februarie 2013 10:12:25
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.66 kb
#include <iostream>
#include <fstream>
using namespace std;

int n,A[110][110];
int main()
{
    ifstream fin("royfloyd.in");
    ofstream fout("royfloyd.out");
    fin>>n;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
        {
            fin>>A[i][j];
            if(A[i][j] == 0 && i!=j) A[i][j]=99999;
        }

    for(int k=1;k<=n;k++)
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                if(A[i][k]+A[k][j]<A[i][j])
                    A[i][j]=A[i][k]+A[k][j];

    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
            fout<<A[i][j]<<" ";
        fout<<'\n';
    }

    return 0;
}