Birthday Paradox LightOJ - 1104 生日悖论

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

2

365

669

Sample Output

Case 1: 22

Case 2: 30

首先需要知道这个是如何算的，计算方法就是首先算出他们每个人生日都在不同天的概率p，然后用1-p算出至少有两个人相同生日的概率

具体计算方法如下

不计特殊的年月，如闰二月。

先计算房间里所有人的生日都不相同的概率，那么

第一个人的生日是 365选365

第二个人的生日是 365选364

第三个人的生日是 365选363

:

:

:

第n个人的生日是 365选365-(n-1)

所以所有人生日都不相同的概率是：

那么，n个人中有至少两个人生日相同的概率就是：

所以当n=23的时候，概率为0.507

天数不同的计算方法同365天的计算方法

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int kase;
    scanf("%d",&kase);
    for(int s=1; s<=kase; s++)
    {
        int day;
        scanf("%d",&day);
        int sum=1;
        double temp=1;
        while(1)
        {
            temp*=(day-sum)*1.0/day;
            if(1.0-temp>=0.5)
            {
                printf("Case %d: %d\n",s,sum);
                break;
            }
            sum++;
        }
    }
}