Method idxToComb

app/src/main/java/solver/PyraminxV.java:108–116

(int[] n, int[] s, int c, int o)

    }

    private static void idxToComb(int[] n, int[] s, int c, int o) {
        int q = 2;
        for (int t = 0; t < 6; t++)
            if (c >= Utils.Cnk[5 - t][q]) {
                c -= Utils.Cnk[5 - t][q--];
                n[t] = s[q] << 1 | o & 1;
                o >>= 1;
            } else n[t] = -1;
    }

    private static boolean search(int p, int f, int t, int solvedp, int d, int lm) {
        if (d == 0) return p == solvedp && f == solvedp * 2 && t == 0;