light OJ Birthday Paradox.
来源:互联网 发布:软件开发需求分析 编辑:程序博客网 时间:2024/06/09 20:59
Birthday Paradox.
Description
Sometimes some mathematical results are hard to believe. One of the common problems is the birthday paradox. Suppose you are in a party where there are 23 people including you. What is the probability that at least two people in the party have same birthday? Surprisingly the result is more than 0.5. Now here you have to do the opposite. You have given the number of days in a year. Remember that you can be in a different planet, for example, in Mars, a year is 669 days long. You have to find the minimum number of people you have to invite in a party such that the probability of at least two people in the party have same birthday is at least 0.5.
Input
Input starts with an integer T (≤ 20000), denoting the number of test cases.
Each case contains an integer n (1 ≤ n ≤ 105) in a single line, denoting the number of days in a year in the planet.
Output
For each case, print the case number and the desired result.
Sample Input
2
365
669
Sample Output
Case 1: 22
Case 2: 30
#include<stdio.h>int main(){int i,n,t,k=1;;int ans;double a;scanf("%d",&t);while(t--){a=1.0;ans=0;scanf("%d",&n);for(i=1;i<=n;i++){a=a*(1.0*(n-i))/(n*1.0);ans=i;if(a<=0.5)break;}printf("Case %d: %d\n",k++,ans);}}
- light OJ Birthday Paradox.
- 【Light OJ 1104】Birthday Paradox
- [概率+水] light oj 1104 Birthday Paradox
- LIGHT OJ-1104 Birthday Paradox 【组合】
- Light oj 1104 Birthday Paradox (生日悖论----概率)
- Light OJ:1104 Birthday Paradox(数学概率+思维)
- 【light-oj】-1104 - Birthday Paradox(数学,概率)
- Light oj 1104 Birthday Paradox 生日悖论-雀巢原理
- E - Birthday Paradox Light 1104
- birthday paradox
- Birthday Paradox
- Birthday Paradox
- Light OJ 1008- Fibsieve`s Fantabulous Birthday
- Light oj 1008 Fibsieve`s Fantabulous Birthday
- Light OJ - 1008 - Fibsieve`s Fantabulous Birthday
- Light OJ - 1008 - Fibsieve`s Fantabulous Birthday
- light oj 1008 Fibsieve`s Fantabulous Birthday
- LIGHT OJ-1008 Fibsieve`s Fantabulous Birthday
- EDIFACT 通讯工具 Mendelson AS2
- Intent七大属性
- Text Mining(文本挖掘)
- Android[LeetCode] 创建一个后台程序
- 错误定位
- light OJ Birthday Paradox.
- web.xml 中spring-servlet.xml 和 application.xml 配置位置及含义
- Android优秀文章收集(转载)
- Association Mining(关联挖掘)
- isolinux
- 回忆录
- Recommendation Engine(推荐引擎)
- Java Script-判断
- POJ 1971 Parallelogram Counting