Nick4343

4343.cpp

unsigned int findBestWay() {

    unsigned int be4last = N;
    for(int i=0; i < N; ++i)
        bestWay[i].resize(N);
    for (unsigned int i = 0; i < N; i++) {
        for (unsigned int k = 0; k < N; k++)
            for (unsigned int j = 0; j < N; j++) {
                int res = G[ans[i]][ans[k]] * G[ans[k]][ans[j]] / 10000;
                if (G[ans[i]][ans[j]] < res) {
                    G[ans[i]][ans[j]] = res;
                    bestWay[ans[i]][ans[j]] = ans[k];
                }
            }
    }

    return be4last;
}