시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
2 초 | 1024 MB | 51 | 42 | 36 | 81.818% |
You are given an integer array $A$ of length $N$, consisting of $0$'s and $1$'s. Let $a$ be initially the array $A$. You are going to perform the following operation $N-1$ times.
There are $2^{N-1} \times (N-1)!$ ways to perform the operations. Count the number of ways that result in a single value of $1$, modulo $998244353$.
The first line contains an integer $N$ ($1 \leq N \leq 10^6$).
The second line contains integers $A_1,A_2,\ldots,A_N$ ($0 \leq A_i \leq 1$).
Print the answer.
3 0 1 0
2
5 1 1 1 1 1
384
7 0 1 1 0 1 0 1
25515