Codeforces Round #340 (Div. 2)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.
Sample test(s)
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
 
제목: 한 단락 01열을 한 단락으로 나누고 한 단락당 한 단락만 물어볼 수 있습니다 한 단락 01열은 몇 가지 분할 방식이 있습니까
문제풀이: 두 개의 1 사이 0의 개수에 1의 곱셈을 증가시킨다
 

#include<bits/stdc++.h>
#define LL __int64
using namespace std;
LL n,l;
LL ans,k,flag;
int main()
{

    l=0;
    ans=1;
    k=0;
    scanf("%I64d",&n);
    for(int i=1; i<=n; i++)
    {
        scanf("%I64d",&flag);
        if(l)
        {
            k++;
            if(flag)
            {
                ans*=k;
                k=0;
            }
        }
        if(flag)
            l=1;
    }
    ans*=l;
    printf("%I64d
",ans);
}