ZOJ3696-Alien's Organ(泊松分布)

63 篇文章 0 订阅
15 篇文章 0 订阅

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


题意:一个外星人每时每刻都能制造出随机数量的器官。已知平均每天能制造出λ数量器官,求一天内制造器官不超过n的概率

解题思路:泊松分布的概率分布函数为: 泊松分布的参数λ是单位时间(或单位面积)内随机事件的平均发生率。 泊松分布适合于描述单位时间内随机事件发生的次数,泊松分布的期望和方差均为λ


#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <climits>

using namespace std;

#define LL long long
const int INF=0x3f3f3f3f;

const double e=exp(1);
int n;
double p;

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%lf",&n,&p);
        double ans=pow(e,-p);
        double ans1=1;
        double k=p;
        for(int i=2;i<=n+1;i++)
        {
            ans1+=k;
            k=k*p/i;
        }
        ans=ans*ans1;
        printf("%.3f\n",ans);
    }
    return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值