Cod sursa(job #2343656)

Utilizator OvidiuDestulDeOkNicoleanu Ovidiu OvidiuDestulDeOk Data 14 februarie 2019 10:22:40
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.76 kb
#include <fstream>
#define NMAX 101
#define INF 1001

using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

int n;
int cost[NMAX][NMAX];

void read();

int main(){int i, j, k;
    read();
    for(k = 1; k <= n; k++)
    for(i = 1; i <= n; i++)
    for(j = 1; j <= n; j++)
        if(i != k && j != k && i!=j)
            cost[i][j] = min(cost[i][j], cost[i][k] + cost[k][j]);
    for(i = 1; i <= n; i++){
        for(j = 1; j <= n; j++)
            fout << cost[i][j] % INF << ' ';
        fout << '\n';
    }
    fout.close();
    return 0;
}

void read(){int i, j;
    fin >> n;
    for(i = 1; i <= n; i++)
    for(j = 1; j <= n; j++){
        fin >> cost[i][j];
        if(!cost[i][j]) cost[i][j] = INF;
    }
}