zoukankan      html  css  js  c++  java
  • 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串 分割成段 每段只能有一个1 问一段串有多少种分割方式

    题解:每两个1之间0的个数增加一的乘积

    #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);
    }
    

      

  • 相关阅读:
    TERSUS笔记员工信息409-修改
    TERSUS笔记员工信息408-查询
    TERSUS笔记员工信息407-07GO
    TERSUS笔记员工信息406-03首页
    TERSUS笔记员工信息405-04上一页
    TERSUS笔记员工信息404-05下一页
    TERSUS笔记员工信息403-06末页
    TERSUS笔记员工信息402-08每页条数逻辑
    layui 更新echarts版本后地图报错
    常用的CMS系统有哪些
  • 原文地址:https://www.cnblogs.com/hsd-/p/5158735.html
Copyright © 2011-2022 走看看