Cod sursa(job #1425368)

Utilizator alexandru.jercaianuJercaianu Alexandru alexandru.jercaianu Data 27 aprilie 2015 13:06:52
Problema Floyd-Warshall/Roy-Floyd Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 0.99 kb
#include<iostream>
#include<fstream>
#include<limits>
using namespace std;

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

int g[100][100];
int c[100][100];
int d[100][100];
int N, M;


void royfloyd() 
{
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            if (d[i][j] == 0 && i != j) {
                d[i][j] = numeric_limits<int>::max();
            }
        }
    }
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            for (int k = 0; k < N; k++) {
                if (d[i][j] > d[i][k] + d[k][j]) {
                    d[i][j] = d[i][k] + d[k][j];
                }
            }
        }
    }
}

int main()
{
    fin >> N;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            int x;
            fin >> x;
            d[i][j] = x;
        }
    }
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) { 
            fout << d[i][j] << " ";
        }
        fout << endl;
    }
}