Chocolate

题意翻译

## 分割序列 #### 题目描述： 给一个01序列，将之分割成若干段，要求每段恰好只含有1个1，计算分解方案的总数。 #### 输入格式： 第一行为正整数n(≤100)，第二行为用空格分隔的n个0或1。 #### 输出格式： 输出分解方案总数。 #### 输入 #1 3 0 1 0 #### 输出 #1 1 #### 输入 #2 5 1 0 1 0 1 #### 输出 #2 4

题目描述

Bob loves everything sweet. His favorite chocolate bar consists of pieces, each piece may contain a nut. Bob wants to break the bar of chocolate into multiple pieces so that each part would contain exactly one nut and any break line goes between two adjacent pieces. You are asked to calculate the number of ways he can do it. Two ways to break chocolate are considered distinct if one of them contains a break between some two adjacent pieces and the other one doesn't. Please note, that if Bob doesn't make any breaks, all the bar will form one piece and it still has to have exactly one nut.

输入输出格式

输入格式

The first line of the input contains integer $ n $ ( $ 1<=n<=100 $ ) — the number of pieces in the chocolate bar. The second line contains $ n $ integers $ a_{i} $ ( $ 0<=a_{i}<=1 $ ), where $ 0 $ represents a piece without the nut and $ 1 $ stands for a piece with the nut.

输出格式

Print the number of ways to break the chocolate into multiple parts so that each part would contain exactly one nut.

输入输出样例

输入样例 #1

3
0 1 0

输出样例 #1

1

输入样例 #2

5
1 0 1 0 1

输出样例 #2

4

说明

In the first sample there is exactly one nut, so the number of ways equals $ 1 $ — Bob shouldn't make any breaks. In the second sample you can break the bar in four ways: 10|10|1 1|010|1 10|1|01 1|01|01

题意翻译

## 分割序列 #### 题目描述： 给一个01序列，将之分割成若干段，要求每段恰好只含有1个1，计算分解方案的总数。 #### 输入格式： 第一行为正整数n(≤100)，第二行为用空格分隔的n个0或1。 #### 输出格式： 输出分解方案总数。 #### 输入 #1 3 0 1 0 #### 输出 #1 1 #### 输入 #2 5 1 0 1 0 1 #### 输出 #2 4