codeforces 617B 水题~
来源:互联网 发布:网上商城系统web源码 编辑:程序博客网 时间:2024/05/01 08:16
Description
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.
Input
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 ai (0 ≤ ai ≤ 1), where 0 represents a piece without the nut and 1 stands for a piece with the nut.
Output
Print the number of ways to break the chocolate into multiple parts so that each part would contain exactly one nut.
Sample Input
30 1 0
1
51 0 1 0 1
4
Hint
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
思路:根据样例分析,头尾的0都是无效的。所以我们只要找到第一个1和最后一个1.然后开始遍历,在每两个1之间0的个数决定多少种方案。
例如,1 0 1,有两种,1 0 0 1,有三种,所以只要将每两个1之间的(0的个数+1)乘起来就是最终答案。那如果全为0的情况呢?就特判一下输出0.
(自己wa了一发的原因,没考虑到全是0的情况)
附上AC代码:
- codeforces 617B 水题~
- Codeforces 617B Chocolate
- CodeForces 617B
- CodeForces 617B Chocolate
- CodeForces 617B-chocolate
- CodeForces 483B(水题)
- codeforces 691B 水题
- CodeForces 352B 水题
- B - Pasha Maximizes -水题-CodeForces 435B
- Codeforces 617B Chocolate 【dp】
- Codeforces Problem - 617B Chocolate
- Codeforces 617B Chocolate【思维】
- Codeforces 417B Crash(水题)
- CodeForces 20B Equation 水题
- CodeForces 18B Platforms (水题)
- CodeForces 670B(模拟)水题
- codeforces 746 B. Decoding【水题】
- Codeforces - 133B - Unary (水题)
- 求出1~1000之间的素数,每行输出六个
- java方法执行图解
- 数据结构 - 知识点
- [HeadFirst-JSPServlet学习笔记][第二章:高层概述]
- 基于OpenGL 的STL 文件可视化研究
- codeforces 617B 水题~
- 算法虐我千百遍,我待算法如初恋
- 【杭电 】[2040]亲和数
- [HeadFirst-JSPServlet学习笔记][第三章:实战MVC]
- 初识angularJs
- 全栈工程师
- 求1的方加上2的方一直加到N的方小于等于1000的N的值
- Android UI学习笔记 之 colors.xml
- vsftpd