生日驳论:第一个人的生日是365选365
第二个人的生日是365选364
第三个人的生日是365选363
第四个人的生日是365选362
第n个人的生日是365选365-(n-1) 所有人生日都不同的概率是365/365*364/365*363/365.......(365-n+1)/365
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 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.
For each case, print the case number and the desired result.
2
365
669
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);
}
}