Codeforces Problem - 617B Chocolate
2016-03-08 18:59
465 查看
http://www.codeforces.com/problemset/problem/617/B
B. Chocolate
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Examples
input
output
input
output
Note
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
我的思路就是:
有n个1就应该放n-1个bar
两个1距离多少,放当前这个bar的时候就有几个地方放,用乘法原理
B. Chocolate
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Examples
input
3 0 1 0
output
1
input
5
1 0 1 0 1
output
4
Note
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
我的思路就是:
有n个1就应该放n-1个bar
两个1距离多少,放当前这个bar的时候就有几个地方放,用乘法原理
#include <stdio.h>
int arr[1001];
#define LL __int64int main()
{
int n;
while(~scanf("%d",&n))
{
int cnt=0;
for(int i=1;i<=n;++i)
{
scanf("%d",arr+i);
if(arr[i]) cnt++;
}
if(cnt==0)
{
printf("0\n");
continue;
}
if(cnt==1)
{
printf("1\n");
continue;
}
LL ans=1;
int j;
for(int i=1;i<=n;++i)
{
if(arr[i])
{
j=i;
break;
}
}
int t=j;
for(int i=1;i<=n;++i)
{
if(i==t) continue;
if(arr[i])
{
ans*=i-j;
j=i;
}
}
printf("%I64d\n",ans);
}
return 0;
}
相关文章推荐
- 微信公众号编辑模式应用
- 用户代码未处理 UpdateException
- 彻底理解js中this的指向
- c++ 一次读取文件全部内容
- 【Codeforces Round 345 (Div 1) A】【STL-map or stable_sort or双关键字排序】Watchmen 曼哈顿距离=欧几里得距离点对数
- zjnu1716 NEKAMELEONI (线段树)
- redis在mac上的安装
- Codeforces Round #345 (Div. 2) C (multiset+pair )
- 上海微博签到系统
- Python学习之:打印输出同一行
- 正则表达式
- 【2015-2016 XVI Open CupL】【找规律】Liesbeth and the String 字符串变换何时变为长度1
- 关于独立按键与矩阵按键的程序(51单片机)
- ios 真机调试时出现CopyPngFile error解决方法
- Android Toast
- 规定元素的高度,宽度
- Java的多态——看程序时自动带感
- online_judge_1385
- C/C++面试常见的几个库函数详解(strcpy,memcpy,memset,atoi...)
- pygame学习过程