概率DP基础 SGU495 Kids and Prizes

递推计算式需要整理，期望能避免运算优先级出错或精度出错

#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<queue>
#include<stack>
#include<set>
#include<map>
#define CLEAR(a) memset((a),0,sizeof((a)))

using namespace std;
const int maxn = 1e5 + 10;
double dp[maxn];

int main()
{
    int n, m;
    while (~scanf("%d%d", &n, &m))
    {
        dp[1] = 1;
        for (int i = 2; i <= m; i++)
        {
            //dp[i]=(1-dp[i-1])*dp[i-1]+(dp[i-1]-1.0/n)*dp[i-1];
            dp[i] = (1 - 1.0 / n) * dp[i - 1];
        }
        double ans = 0;
        for (int i = 1; i <= m; i++)
        {
            ans += dp[i];
        }
        printf("%.9lf\n", ans);
    }
    return 0;
}