public static int solve(int[] power, int minimum, boolean[] used, int total) {
        if (total >= minimum)
            return 1;
        int sum = 0;
        for (int i = 0; i < power.length; ++i)
            sum += solve(power, minimum, used, power[i] + total);
        return sum;
    }