LightOJ - 1104 Birthday Paradox —— 概率

最新推荐文章于 2020-04-14 16:53:13 发布

转载最新推荐文章于 2020-04-14 16:53:13 发布 · 178 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

原文链接：http://www.cnblogs.com/DOLFAMINGO/p/8442436.html

标签

#数据结构与算法

本文探讨了生日悖论，即在特定数量的人群中，至少两人同一天生日的概率超过0.5的问题。通过数学分析和编程实现，计算了不同天数的一年中，达到这一概率所需的最少人数。

题目链接：https://vjudge.net/problem/LightOJ-1104

1104 - Birthday Paradox

PDF (English)

Statistics

Forum

Time Limit: 2 second(s)

Memory Limit: 32 MB

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 ≤ 10⁵) 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

Output for Sample Input

365

669

Case 1: 22

Case 2: 30

题意：

问至少要多少人，才能使得至少两个人同一天生日的概率不小于0.5？其中一年的天数由题目给定。

题解：

1.至少2个人同一天生日的对立事件为：所有人的生日都不同。先求对立事件，然后再：p(C) = 1-p(!C) 。

2.假设答案为m，如果所有人的生日都不同，那么： p(!C) = A[n][m]/n^m = n/n * (n-1)/n * …… *(n-m+1)/n。

3.m从1开始枚举，当 1- p(!C) >= 0.5 时， m-1就是答案（题目求除己之外）。

代码如下：

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <algorithm>
 5 #include <vector>
 6 #include <cmath>
 7 #include <queue>
 8 #include <stack>
 9 #include <map>
10 #include <string>
11 #include <set>
12 using namespace std;
13 typedef long long LL;
14 const int INF = 2e9;
15 const LL LNF = 9e18;
16 const int MOD = 1e9+7;
17 const int MAXN = 1e2+100;
18 
19 int main()
20 {
21     int T, n, kase = 0;
22     scanf("%d", &T);
23     while(T--)
24     {
25         scanf("%d", &n);
26         double p = 1.0;
27         int m;
28         for(m = 1; ;m++)
29         {
30             p *= 1.0*(n-m+1)/n;
31             if(1-p>=0.5) break;
32         }
33         printf("Case %d: %d\n",++kase, m-1);
34     }
35 }

View Code

转载于:https://www.cnblogs.com/DOLFAMINGO/p/8442436.html