幸运的袋子 幸运的袋子 import java.util.*; public class Main{ public static int dsfCount(int[] array,int n,int pos,int sum,int multi){ int count = 0; for(int i = pos;i<n;i++){ sum += array[i]; multi *= array[i]; if(sum>multi){ //满足幸运袋子! //count +1 并且往下一层遍历! count = count + 1 + dsfCount(array,n,i+1,su...