zoukankan      html  css  js  c++  java
  • light oj 1104 Birthday Paradox (概率题)

    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

    Output for Sample Input

    2

    365

    669

    Case 1: 22

    Case 2: 30

    求出要多人才能保证两个人生日在同一天的概率大于0.5.

     

     1 #include<cstdio>
     2 int main()
     3 {
     4     int t,k=0;
     5     scanf("%d",&t);
     6     while(t--)
     7     {
     8         double n,p=1;
     9         scanf("%lf",&n);
    10         int i;
    11         for(i=1;;i++)
    12         {
    13             p*=((n-i)/n);
    14             if(p <= 0.5)
    15                 break;
    16         }
    17         printf("Case %d: %d
    ",++k,i);
    18     }

     

     

  • 相关阅读:
    P3015 [USACO11FEB]最好的括号Best Parenthesis
    P1944 最长括号匹配_NOI导刊2009提高(1)
    P2328 [SCOI2005]超级格雷码
    P2308 添加括号
    P5657 格雷码【民间数据】
    P2196 挖地雷
    P5020 货币系统
    括号序列模型--序列dp--U86873 小Y的精灵国机房之旅
    P1033 自由落体
    P1017 进制转换
  • 原文地址:https://www.cnblogs.com/yexiaozi/p/5770711.html
Copyright © 2011-2022 走看看