import java.util.Vector;


public interface IKnapsackSimple {
	/**
	 * The simple version of the problem:
	 * Finds out if the integer exact knapsack problem has a solution.
	 * 
	 * @param weights represent the weights of the candidates
	 * @param last is the index of the last candidate (size-1)
	 * @param k is the total allowed weight 
	 * @return true if there is a solution.
	 */
  boolean hasSolution(Vector<Integer> weights, int last, int k);		
}