zoukankan      html  css  js  c++  java
  • HDOJ 4336 Card Collector

    容斥原理+状压

    Card Collector

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 1940    Accepted Submission(s): 907
    Special Judge


    Problem Description
    In your childhood, do you crazy for collecting the beautiful cards in the snacks? They said that, for example, if you collect all the 108 people in the famous novel Water Margin, you will win an amazing award. 

    As a smart boy, you notice that to win the award, you must buy much more snacks than it seems to be. To convince your friends not to waste money any more, you should find the expected number of snacks one should buy to collect a full suit of cards.
     
    Input
    The first line of each test case contains one integer N (1 <= N <= 20), indicating the number of different cards you need the collect. The second line contains N numbers p1, p2, ..., pN, (p1 + p2 + ... + pN <= 1), indicating the possibility of each card to appear in a bag of snacks. 

    Note there is at most one card in a bag of snacks. And it is possible that there is nothing in the bag.
     
    Output
    Output one number for each test case, indicating the expected number of bags to buy to collect all the N different cards.

    You will get accepted if the difference between your answer and the standard answer is no more that 10^-4.
     
    Sample Input
    1
    0.1
    2
    0.1 0.4
     
    Sample Output
    10.000 10.500
     
    Source
     
    Recommend
    zhoujiaqi2010   |   We have carefully selected several similar problems for you:  4337 4331 4332 4333 4334 
     
     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstring>
     4 
     5 using namespace std;
     6 
     7 double p[30];
     8 int n;
     9 
    10 int main()
    11 {
    12     while(scanf("%d",&n)!=EOF)
    13     {
    14         for(int i=0;i<n;i++) scanf("%lf",p+i);
    15         double ans=0;
    16         for(int i=1;i<(1<<n);i++)
    17         {
    18             double temp=0;
    19             int k=0;
    20             for(int j=0;j<n;j++)
    21             {
    22                 if(i&(1<<j))
    23                 {
    24                     k++;
    25                     temp+=p[j];
    26                 }
    27             }
    28             ans+=1./temp *((k&1)?1:-1);
    29         }
    30         printf("%lf
    ",ans);
    31     }
    32     return 0;
    33 }
  • 相关阅读:
    迭代模型
    螺旋模型
    瀑布模型
    V模型
    codeforces411div.2
    专题1:记忆化搜索/DAG问题/基础动态规划
    Python
    字符串的相关操作方法
    Python基本数据类型
    编码
  • 原文地址:https://www.cnblogs.com/CKboss/p/3404775.html
Copyright © 2011-2022 走看看