zoukankan      html  css  js  c++  java
  • 概率(经典问题) 解题心得

    原题:

    Description

    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

    分析:

    很裸的计算概率题,直接根据题意模拟过程就好了。

    代码:

    #include <stdio.h>
    #include <string.h>
    #include<iostream>
    using namespace std;
    
    
    int main()
    {
        double ans;
        int t,n,kase=0;
        cin >> t;
        while (t--)
        {
            ans = 1.0;
            kase++;
            cin >> n;
            for (int i = 0; i <= n; i++)
            {
                ans = ans*((n - i) / (double)n);
                if (ans <= 0.5)
                {
                    printf("Case %d: %d
    ", kase, i);
                    break;
                }
            }
        }
        return 0;
    }
  • 相关阅读:
    tk资料
    jQuery 1.x和jQuery 2.x的最大区别
    活得更像一个人,我的十六年学习之路——北漂18年(44)
    java中的java.util.Map的实现类
    MVC框架的优缺点
    Web Service有关术语的解释
    Java中的字节输入出流和字符输入输出流
    对称加密算法
    怎么让这4个人在17分钟内要过桥
    mysql 只给更新表的某个字段的授权
  • 原文地址:https://www.cnblogs.com/shawn-ji/p/4748860.html
Copyright © 2011-2022 走看看