E - 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 ≤ 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

题目大意：输入一个天数，找到最小的人数，使人群中至少有两个人同一天生日的概率至少是0.5。

思路：其实这是一个生日悖论的裸题，我们可以先拿365天做例子。但是我们要算的是每个人生日不同的概率。式子如下；

n为至少的人数，而P就是至少两个人生日相同的概率。可以解释一下，第一个人在365天中随便选一天，而第二个人在365天只能选364天，以此类推得到此式。虽然这个式子简单，易于理解，但求阶乘会导致时间复杂度很高，而且还会爆long long，所以这个方法适合理解，不适合用来做题。
这里会给出一个近似解法，可以大大减少复杂度，式子如下：
给了式子就可以暴力了，暴力出奇迹。

上代码

#pragma GCC optimize(2)
#include<bits/stdc++.h> 
using namespace std;
typedef long long ll;
const int maxn=1e5+7;
const int mod=1e9+7;
const double eps=1e-6;
double cnt,sum,ans;
int main()
{
	ll t;
	cin>>t;
	for(ll k=1;k<=t;k++)
	{
		double n;
		cin>>n;
		ans=1.0;
		cnt=1.0;
		while(ans>0.5000)
		{
			ans*=(1-cnt/n);
			cnt++;
		}
		printf("Case %lld: ",k);
		cout<<cnt-1<<endl;
	}
	return 0;
}