子集和问题：按给定的子集和从集合找出满足的所有子集

import java.util.Scanner;

public class test {
		static int sum=0;
		static int c=0;
		static int n=0;
		static int[] arr;
		static int[] temp;
		
		static int t=0;
		public static void main(String[] args) {
			Scanner input=new Scanner(System.in);
			n=44;
			c=85484;
			temp=new int[n];
			
			arr=new int[]{1420, 1198, 493, 300, 3006, 881, 2450, 1372, 3643, 1350, 598, 615, 740, 820, 841, 820, 1025, 885, 270, 270, 270, 270, 270, 1735, 885, 4719, 1661, 1435, 2255, 5895, 6465, 870, 330, 750, 1365, 2085, 3370, 1995, 7990, 381, 2048, 840, 6880, 7723};
			/*for (int i = 0; i < arr.length; i++) {
				arr[i]=input.nextInt();
			}*/
			search(0);
			//input.close();
			if(t==0){
				System.out.println("No Solution!");
			}
		}
		public static void search(int m){
			if(sum==c){
				t=1;
				for (int i = 0; i < m; i++) {
					if(temp[i]==1){
						System.out.print(arr[i]+" ");
						
					}
				}
				System.out.println();
				return;
			}
			if(sum>c||m==n){
				return;
			}
			if(sum+arr[m]<=c){
				sum+=arr[m];
				temp[m]=1;
				search(m+1);
				temp[m]=0;
				sum-=arr[m];
			}
			search(m+1);
		}
	}