Cod sursa(job #1983834)

Utilizator flaviu_2001Craciun Ioan-Flaviu flaviu_2001 Data 22 mai 2017 15:27:48
Problema Floyd-Warshall/Roy-Floyd Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 0.7 kb
#include <fstream>

using namespace std;

int n, v[101][101], r[101][101];

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 >> v[i][j],
            r[i][j] = v[i][j];
    for (int k = 1; k <= n; ++k)
        for (int i = 1; i <= n; ++i)
            for (int j = 1; j <= n; ++j)
                if(r[i][k] != 0 && r[k][j] != 0 && i != j)
                    r[i][j] = min(r[i][j], r[i][k] + v[k][j]);
    for (int i = 1; i <= n; ++i){
        for (int j = 1; j <= n; ++j)
            fout << r[i][j] << " ";
        fout << "\n";
    }
    fin.close();
    fout.close();
    return 0;
}