use dp to solve this
find the biggest subsequence so that no two in the set a == b * k