Bloodsucker

Description

In 0th day, there are n-1 people and 1 bloodsucker. Every day, two and only two of them meet. Nothing will happen if they are of the same species, that is, a people meets a people or a bloodsucker meets a bloodsucker. Otherwise, people may be transformed into bloodsucker with probability p. Sooner or later(D days), all people will be turned into bloodsucker. Calculate the mathematical expectation of D.

Input

The number of test cases (T, T ≤ 100) is given in the first line of the input. Each case consists of an integer n and a float number p (1 ≤ n< 100000, 0 < p ≤ 1, accurate to 3 digits after decimal point), separated by spaces.

Output

For each case, you should output the expectation(3 digits after the decimal point) in a single line.

Sample Input

1
2 1

Sample Output

1.000

注意此题是算全部的人变成Bloodsucker的天数的期望，那么我们不妨转化成每天人变为Bloodsucker的期望。那么首先要知道每天只有一个人变为Bloodsucker。那么这就比较容易了。假设第i个人变为Bloodsucker的概率设为p[i];从而p[i]就可以容易的算出来了p[i]=i*(n-i)/n*(n-1)/2;每次都求和。

代码：

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <queue>
#include <cstdio>
#include <cmath>
#include <string>
#include <stack>
#include <cctype>
using namespace std;
int main()
{
    int T;
    int n;
    double p;
    scanf("%d", &T);
    while(T--)
    {
        scanf("%d%lf",&n,&p);
        double ans=0;
        double tmp=n*0.5*(n-1)/p;
        for(int i=1; i<n; i++)
            ans+=tmp/i/(n-i);
           
        printf("%.3lf\n",ans);
    }
    return 0;
}