hdu 4336 容斥原理 2012 Multi-University Training Contest 4
来源:互联网 发布:网络犯罪的危害英文 编辑:程序博客网 时间:2024/04/29 05:03
Card Collector
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4592 Accepted Submission(s): 2319
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.
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.
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.
You will get accepted if the difference between your answer and the standard answer is no more that 10^-4.
Sample Input
10.120.1 0.4
Sample Output
10.00010.500
Source
2012 Multi-University Training Contest 4
题意:
给出n个卡片出现的概率,卡片都是单独出现,不能一次出现多张
题解:
对于第一个样例,出现第一张的期望为 1.0/.01 出现第二张的期望为 1/0.4
此时我们就想用容斥原理,就要减去在一包中可能出现这两张的概率(不是同时出现,只是可能出现这两张的概率)是 0.1 + 0.4
然后减去这个期望值 1/ (0.1 + 0.4)
很容易发现这就是一个容斥了
然后稍微搞一搞就过了
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;#define MAXN 100double a[MAXN],ans;int n;void dfs(int now,double num,int sym){ ans+=1.0/num*sym; for(int i=now+1;i<=n;i++) dfs(i,num+a[i],-1*sym);}int main(){ //freopen("in.txt","r",stdin); while(scanf("%d",&n)!=EOF) { for(int i=1;i<=n;i++) scanf("%lf",&a[i]); ans=0; for(int i=1;i<=n;i++) dfs(i,a[i],1); printf("%0.4lf\n",ans); } return 0;}
阅读全文
0 0
- hdu 4336 容斥原理 2012 Multi-University Training Contest 4
- hdu 5297 - Y sequence( 2015 Multi-University Training Contest 1)容斥原理
- hdu 5794 2016 Multi-University Training Contest 6(鲁卡斯+容斥原理)
- hdu 6143 容斥原理+多重集合的排列数 2017 Multi-University Training Contest
- HDU 5768 Lucky7(2016 Multi-University Training Contest 4 -1005)——中国剩余定理 + 容斥原理
- hdu 4336 Card Collector 2012 Multi-University Training Contest 4
- CRT+容斥定理——Luck7 ( HDU 5768 ) ( 2016 Multi-University Training Contest 4 1005 )
- (HDU 5794)2016 Multi-University Training Contest 6 A Simple Chess (Lucas、容斥)
- HDU 6053 TrickGCD(分块+容斥)——2017 Multi-University Training Contest
- 2012 Multi-University Training Contest 4
- 2012 Multi-University Training Contest
- hdu 4902 Nice boat--2014 Multi-University Training Contest 4
- hdu 5335 Walk Out (2015 Multi-University Training Contest 4)
- hdu 5335 Walk Out 2015 Multi-University Training Contest 4
- hdu 5328 Problem Killer 2015 Multi-University Training Contest 4
- hdu 5327 Olympiad 2015 Multi-University Training Contest 4
- hdu 4638 Group(2013 Multi-University Training Contest 4)
- 2016 Multi-University Training Contest 4 1007 (hdu 5770)
- 子网掩码
- HTML中input只能输入数字(键盘抬起和粘贴事件)
- android studio查找应用控件id实现自动化测试
- Maven学习总结(七)——eclipse中使用Maven创建Web项目
- input输入框,正则格式化手机号(344)
- hdu 4336 容斥原理 2012 Multi-University Training Contest 4
- C++继承之钻石继承和虚继承
- 牛客网牛牛换瓷砖的编程题
- 一个游戏程序员的学习资料
- 与或非门电路的实现原理。
- 我心中理解的:Done is better than perfect
- 物体朝着鼠标点击的地方移动
- 在营销活动中的抽奖算法放送
- 双鱼直播动态调试 .so文件输出密匙