시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
1 초 | 1024 MB | 27 | 15 | 9 | 52.941% |
Seunghyun is a mathematician, and he likes good jokes.
For a set $U = \{0, 1, \cdots, 2^k - 1\}$, a nonempty subset $A \subset U$ is good if it satisfies the following rules.
You are given $n$ distinct integers in $[0, 2^k-1]$ range. Find the number of good sets which contains all $n$ integers.
The first line contains two integers $k, n$. ($1 \le k \le 7, 0 \le n \le 2^k$)
The next line contains $n$ distinct integers $a_1, a_2, \cdots, a_n$($0 \le a_i \le 2^k - 1$).
Print a single integer denoting the number of good sets.
2 1 0
7
4 3 1 2 7
29
Contest > Open Cup > 2018/2019 Season > Stage 19: Grand Prix of Daejeon G번