Problem:
Score : 300 points

Problem Statement

Tak has N cards. On the i-th (1 \leq i \leq N) card is written an integer x_i.
He is selecting one or more cards from these N cards, so that the average of the integers written on the selected cards is exactly A.
In how many ways can he make his selection?

Constraints

1 \leq N \leq 50

1 \leq A \leq 50

1 \leq x_i \leq 50

N,\,A,\,x_i are integers.

Partial Score

200 points will be awarded for passing the test set satisfying 1 \leq N \leq 16.

Input

The input is given from Standard Input in the following format:

N A
x_1 x_2 ... x_N

Output

Print the number of ways to select cards such that the average of the written integers is exactly A.

Sample Input 1

4 8
7 9 8 9

Sample Output 1

5

The following are the 5 ways to select cards such that the average is 8:

Select the 3-rd card.

Select the 1-st and 2-nd cards.

Select the 1-st and 4-th cards.

Select the 1-st, 2-nd and 3-rd cards.

Select the 1-st, 3-rd and 4-th cards.

Sample Input 2

3 8
6 6 9

Sample Output 2

0

Sample Input 3

8 5
3 6 2 8 7 6 5 9

Sample Output 3

19

Sample Input 4

33 3
3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3

Sample Output 4

8589934591

The answer may not fit into a 32-bit integer.

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Time Limit Exceeded)


import java.math.BigDecimal;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int a = scanner.nextInt();

        List<Integer> smalls = new ArrayList<>();
        List<Integer> larges = new ArrayList<>();
        List<Integer> sames = new ArrayList<>();
        int min = 0;
        int max = 0;
        for (int i = 0; i < n; i++) {
            int data = scanner.nextInt();
            int remain = data - a;
            if (remain > 0) {
                larges.add(remain);
            } else if (remain < 0) {
                smalls.add(-remain);
            } else {
                sames.add(remain);
            }
        }
        BigDecimal sameB = new BigDecimal(1);
        for (int i = 1; i <= sames.size(); i++) {
            sameB = sameB.add(count(sames.size(), i));
        }
        BigDecimal result = new BigDecimal(0);
        result = result.add(sameB).subtract(new BigDecimal(1));

        for (int i = 1; i <= 2500; i++) {
            BigDecimal r = find(larges, 0, i);
            if (r.compareTo(new BigDecimal(0)) == 0) {
                continue;
            }
            BigDecimal r2 = find(smalls, 0, i);
            if (r2.compareTo(new BigDecimal(0)) == 0) {
                continue;
            }
            result = result.add(r.multiply(r2).multiply(sameB));
        }

        System.out.println(result);

    }

    static BigDecimal[][] cache = new BigDecimal[50][50];

    private static BigDecimal find(List<Integer> datas, int index, int target) {
        if (target == 0) {
            return new BigDecimal(1);
        }
        if (datas.size() == index) {
            return new BigDecimal(0);
        }
        BigDecimal r = new BigDecimal(0);
        Integer integer = datas.get(index);
        if (target - integer >= 0) {
            return find(datas, index + 1, target - integer).add(find(datas, index + 1, target));
        } else {
            return find(datas, index + 1, target);
        }
    }

    private static BigDecimal count(int c1, int c2) {
        int c3 = c1 - c2;
        c2 = Math.min(c2, c3);
        if (cache[c1][c2] != null) {
            return cache[c1][c2];
        }
        BigDecimal r = new BigDecimal(1);
        for (int i = 0; i < c2; i++) {
            r = r.multiply(new BigDecimal(c1 - i));
        }
        for (int i = 0; i < c2; i++) {
            r = r.divide(new BigDecimal(c2 - i));
        }
        return r;
    }
}