子集和问题的一个实例为〈 S,t 〉。其中，S={x1 ，x2 ，…， xn }是一个正整数的集合，c是一个正整数。子集和问题判定是否存在S的一个子集S1，使得x1+x2+...+xk=S, 其中x1,x2...xk属于集合S1。



对于给定的正整数的集合S和正整数c，编程计算S 的一个子集S1，使得x1+x2+...+xk=S, 其中x1,x2...xk属于集合S1。-Subset of the problem and an example for < S, t> . Of which, S = (x1, x2, ..., xn) is a set of positive integers, c is a positive integer. And problems in a subset of S to determine whether there is a subset of S1, makes x1+ x2+...+ xk = S, one x1, x2 ... xk are set S1. For a given set of positive integers S and positive integer c, calculated S a subset of S1, makes x1+ x2+...+ xk = S, one x1, x2 ... xk are set S1.