zoukankan      html  css  js  c++  java
  • Pills

    #include<iostream>
    #include<cstring>
    using namespace std;

    int N;
    __int64 d[35][35];
    bool m[35][35];

    __int64 Cal(int i, int j)
    {
    if(m[i][j] || j == 0) return d[i][j];
    __int64 r = 0;
    if(i > 0) r += Cal(i - 1, j);
    if(j > 0) r += Cal(i + 1, j - 1);
    d[i][j] = r;
    m[i][j] = 1;
    return r;
    }

    int main()
    {
    int i;
    memset(d, 0, sizeof(d));
    memset(m, 0, sizeof(m));
    for(i = 0; i < 31; i ++) d[i][0] = 1;
    Cal(0, 30);
    while(scanf("%d", &N) != EOF && N != 0)
    {
    printf("%I64d\n", d[0][N]);
    }
    return 0;
    }

    Pills

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 49    Accepted Submission(s): 40


    Problem Description
    Aunt Lizzie takes half a pill of a certain medicine every day. She starts with a bottle that contains N pills.

    On the first day, she removes a random pill, breaks it in two halves, takes one half and puts the other half back into the bottle.

    On subsequent days, she removes a random piece (which can be either a whole pill or half a pill) from the bottle. If it is half a pill, she takes it. If it is a whole pill, she takes one half and puts the other half back into the bottle.

    In how many ways can she empty the bottle? We represent the sequence of pills removed from the bottle in the course of 2N days as a string, where the i-th character is W if a whole pill was chosen on the i-th day, and H if a half pill was chosen (0 <= i < 2N). How many different valid strings are there that empty the bottle?
     
    Input
    The input will contain data for at most 1000 problem instances. For each problem instance there will be one line of input: a positive integer N <= 30, the number of pills initially in the bottle. End of input will be indicated by 0.
     
    Output
    For each problem instance, the output will be a single number, displayed at the beginning of a new line. It will be the number of different ways the bottle can be emptied.
     
    Sample Input
    6 1 4 2 3 30 0
     
    Sample Output
    132 1 14 2 5 3814986502092304
     
    Source
  • 相关阅读:
    Node 命令行工具 commander.js 快速上手
    使用 express 极简处理前端路由的 history 模式问题
    在博客中插入希沃白板课件
    休息一下(屏幕提醒)
    vue htmlWebpackPlugin.options.title 标题设置
    使用 docker 部署 elasticsearch 并安装 ik 中文分词器
    .NET 中的计时 tick 是多长?
    剑指offer队列的最大值(主队列+辅助队列)
    Golang垃圾回收原理解析
    Golangchannel底层实现精要
  • 原文地址:https://www.cnblogs.com/xieyue/p/2378565.html
Copyright © 2011-2022 走看看