hdu4465 数学期望

http://acm.hdu.edu.cn/showproblem.php?pid=4465

这题公式比较好推，但是直接计算的数太大，可以用exp（log（x））来优化式子x
见代码

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <queue>
using namespace std;
typedef long long LL;
const int maxN=2e5+5;
int N;
double f[maxN<<1];

double solve(double p)
{
    double ans=0.0,pp=double(N+1)*log(p);
    for(int i=1; i<=N; i++)
        ans+=exp(double(N-i)*log(1.0-p)+f[2*N-i]-f[2*N-i-N]-f[N]+pp)*double(i);
    return ans;//*exp(double(N+1)*log(p));
}
int main()
{
    double p,ans;
    int cas=1;
    f[0]=f[1]=0.0;
    for(int i=2; i<=400000; i++)
        f[i]=f[i-1]+log(double(i));
    while(~scanf("%d%lf",&N,&p))
    {
        ans=solve(p)+solve(1-p);
        printf("Case %d: %.6f\n",cas++,ans);
    }
    return 0;
}