「Light OJ1104」Birthday Paradox【决策单调性优化dp】

1104 - Birthday Paradox

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(\le 20000)$, denoting the number of test cases.

Each case contains an integer $n(1\le n\le 10^5)$ 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

Output for Sample Input

Case 1: 22
Case 2: 30

题意

某星球一年有$n$天，求一个集合中至少有多少人使得这些人至少有两个人生日是同一天的概率不低于$0.5$

解法

另$P$为$x$人中至少有两个人生日是同一天的概率，那么有
$$P=1-\frac{A_n^x}{n^x}\ge 0.5$$化简得
$$2A_n^x\le n^x$$即
$$2\times \prod _{i=0}^{x-1}n-i\le n^x$$两边取对数，得
$$\log 2+\sum _{i=0}^{x-1}\log (n-i)-x\log n\le 0$$
显然 随$n$的增大$x$是单调不减的，而且可以看到$n=2$时$x=2$，然后就可以$dp$了，本来只是想用这种做法打个前几项表，因为涉及$log$相加减，可能会爆精度，没想到就直接过了$233$，应该是因为$n=100000$的时候答案也只有$372$，所以没爆

代码

#include<bits/stdc++.h>

using namespace std;
const int maxn=1e5+10;
const double eps=1e-10;
int ans[maxn];

int main()
{
    ans[1]=2;ans[2]=2;double cur=0;
    for(int i=3;i<maxn;i++){
        cur+=log(i);cur-=log(i-ans[i-1]);cur+=ans[i-1]*log(i-1);cur-=ans[i-1]*log(i);
        ans[i]=ans[i-1];
        while(cur>eps){
            cur+=log(i-ans[i]);
            cur-=log(i);
            ans[i]++;
        }
    }
    int t;scanf("%d",&t);
    for(int i=1,n;i<=t;i++){
        scanf("%d",&n);
        printf("Case %d: %d\n",i,ans[n]-1);
    }
}