Some error occured while loading page for you. Please try again.
Given a set of distinct integers, print the size of a maximal subset of where the sum of any numbers in is not evenly divisible by .
The first line contains space-separated integers, and , the number of values in and the non factor.
The second line contains space-separated integers describing , the unique values of the set.
Print the size of the largest possible subset ().
1 7 2 4
The sums of all permutations of two elements from are:
1 + 7 = 8
1 + 2 = 3
1 + 4 = 5
7 + 2 = 9
7 + 4 = 11
2 + 4 = 6
We see that only will not ever sum to a multiple of .