Cod sursa(job #1053209)

Utilizator rares96cheseliRares Cheseli rares96cheseli Data 12 decembrie 2013 15:24:58
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.84 kb
#include <iostream>
#include <fstream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <bitset>
#include <cmath>
#define x first
#define y second
#define inf 20000000
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");

int N, A[105][105];

int main()
{
    f>>N;
    for (int i=1; i<=N; ++i)
        for (int j=1; j<=N; ++j)
        {
            f>>A[i][j];
            if (i!=j && !A[i][j]) A[i][j]=inf;
        }

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

    for (int i=1; i<=N; ++i && g<<'\n')
        for (int j=1; j<=N; ++j)
            if (A[i][j]==inf) g<<0<<' ';
                else g<<A[i][j]<<' ';
    return 0;
}