Codeforces Round #340 (Div. 2):B. Chocolate
来源:互联网 发布:广电网络云平台 编辑:程序博客网 时间:2024/05/03 00:48
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 containexactly 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 ai (0 ≤ ai ≤ 1), where0 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.
30 1 0
1
51 0 1 0 1
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
#include<iostream>#include<cstdio>#include<cstring>using namespace std;int main(){ int n; int a, key=0; long long pos[105], ans=1; scanf("%d",&n); for(int i = 0; i < n; i++){ scanf("%d", &a); if(a==1) pos[key++] = i; } if(key==1 ) printf("1\n"); else if(key==0) printf("0\n"); //这一步,有坑 else { for(int i = 1; i < key; i++){ ans *= pos[i]-pos[i-1];// printf("%d %d %d\n", i, pos[i], pos[i-1]); } printf("%I64d\n", ans); } return 0;}
- Codeforces Round #340 (Div. 2):B. Chocolate
- Codeforces 617B Chocolate (Round #340 (Div. 2) B题)
- Codeforces Round #340 (Div. 2)-B. Chocolate(组合数学的乘法计数)
- Codeforces Round #340 (Div. 2) B. Chocolate 组合学、简单题
- Codeforces Round #279 (Div. 2) D. Chocolate
- Codeforces Round #279 (Div. 2) D. Chocolate
- Codeforces Round #279 (Div. 2) D. Chocolate
- Codeforces Round #279 (Div. 2)D. Chocolate
- Codeforces Round #340-B. Chocolate-水+坑
- 【Codeforces Round 340 (Div 2)B】【简单题】Chocolate 巧克力划分方案数 每段恰有一个坚果
- Codeforces Round #257 (Div. 2) C. Jzzhu and Chocolate
- Codeforces Round #257 (Div. 2)C. Jzzhu and Chocolate
- Codeforces Round #257 (Div. 2)449A - Jzzhu and Chocolate
- Codeforces Round #257 (Div. 2) 1C Jzzhu and Chocolate
- Codeforces Round #257 (Div. 2) C. Jzzhu and Chocolate
- Codeforces Round #279 (Div. 2), problem: (D) Chocolate
- Codeforces Round #257 (Div. 2) C. Jzzhu and Chocolate (数学)
- Codeforces Round #361 (Div. 2) C. Mike and Chocolate Thieves
- 3450: Tyvj1952 Easy 概率与期望 DP
- 面试题
- Leetcode Array题型总结
- 猴子分桃
- 读《钝感力》有感
- Codeforces Round #340 (Div. 2):B. Chocolate
- NCrawler 开源爬虫框架学习
- 1000个赞的《快乐码农》
- ZIP压缩算法详细分析及解压实例解释
- c3p0详细配置
- POJ 2421 Constructing Roads
- poj1852
- 常用的字符串哈希函数
- RPM基本使用指南