Cod sursa(job #1912725)

Utilizator Catalin121Catalin Sumanaru Catalin121 Data 8 martie 2017 10:22:15
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include <fstream>
#define N 101
using namespace std;

int main()
{
    int cost[N][N];
    ifstream fin("royfloyd.in");
    int n;
    fin >> n;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
        fin >> cost[i][j];
    fin.close();

    for(int k=1; k<=n; k++)     // Roy -Floyd
        for(int i=1; i<=n; i++)
            for(int j=1; j<=n; j++)
            if(cost[i][j] > cost[i][k] + cost[k][j])
                cost[i][j] = cost[i][k] + cost[k][j];

    ofstream fout("royfloyd.out");
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
            fout << cost[i][j] << " ";
        fout << '\n';
    }
    fout.close();
        return 0;
}