zoukankan      html  css  js  c++  java
  • ZOJ 3696 Alien's Organ(泊松定理,期望值)

    Alien's Organ

    Time Limit: 2 Seconds      Memory Limit: 65536 KB

    There's an alien whose name is Marjar. It is an universal solder came from planet Highrich a long time ago.

    Marjar is a strange alien. It needs to generate new organs(body parts) to fight. The generated organs will provide power to Marjar and then it will disappear. To fight for problem of moral integrity decay on our earth, it will randomly generate new fighting organs all the time, no matter day or night, no matter rain or shine. Averagely, it will generate λ new fighting organs every day.

    Marjar's fighting story is well known to people on earth. So can you help to calculate the possibility of that Marjar generates no more than N organs in one day?

    Input

    The first line contains a single integer T (0 ≤ T ≤ 10000), indicating there are T cases in total. Then the following T lines each contains one integer N (1 ≤ N ≤ 100) and one float number λ (1 ≤ λ ≤ 100), which are described in problem statement.

    Output

    For each case, output the possibility described in problem statement, rounded to 3 decimal points.

    Sample Input

    3
    5 8.000
    8 5.000
    2 4.910

    Sample Output

    0.191
    0.932
    0.132

    Author: FAN, Yuzhe
    Contest: The 13th Zhejiang University Programming Contest

    //泊松定理
    #include <iostream>
    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    #include<stack>
    #include<map>
    #include<set>
    #include<queue>
    #include<cmath>
    #include<string>
    #include<vector>
    using namespace std;
    int n,t;
    double e=2.7182818285;
    double E,sum;
    
    int main()
    {
        //printf("%.10lf",exp(1));
       while(~scanf("%d",&t))
       {
       for(;t>0;t--)
       {
           scanf("%d %lf",&n,&E);
           sum=pow(e,-E);
           double a=1.0,b=1.0;
           for(int i=1;i<=n;i++)
           {
               a=a*E;
               b=b*i;
               sum=sum+a/b*pow(e,-E);
           }
          //sum=sum*pow(e,-E);
         //在最后一起乘会出现精度问题,数值不对
          printf("%.3lf
    ",sum);
       }
       }
    
        return 0;
    }
  • 相关阅读:
    python上传阿里云oss
    python调用百度图片识别api
    python实现sm2和sm4国密(国家商用密码)算法
    python坐标获取经纬度或经纬度获取坐标免费模块--geopy
    剑指 Offer 36. 二叉搜索树与双向链表
    vs code中终端中的命令不能使用的解决方法
    VS Code切换默认终端(cmd、powershell)
    剑指 Offer 35. 复杂链表的复制
    剑指 Offer 33. 二叉搜索树的后序遍历序列
    剑指 Offer 32
  • 原文地址:https://www.cnblogs.com/stepping/p/6676055.html
Copyright © 2011-2022 走看看