Race to 1 Again LightOJ - 1038 dp 概率

https://vjudge.net/problem/LightOJ-1038

Race to 1 Again LightOJ - 1038

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

using namespace std;
#define M(a, b) memset(a,b,sizeof(a))

const int maxn = 1e5 + 1;
double dp[maxn];

int main() {
    int T;
    cin >> T;
    int ca = 1;
    int n;
    while (ca <= T) {
        cin >> n;
        M(dp, 0);
        double ans = 0;
        for (int i = 2; i <= n; i++) {
            int cnt = 2;// 因数个数，包括1和本身 dp[i] = Ei
            double temp_sum = 0; // E10 = 1/4 * [ (1+E1) + (1+E2) + (1+E5) + (1+E10) ]
            int sqrt_int = (int) (sqrt(i));
            for (int j = 2; j <= sqrt_int; j++) { // 求因数
                if (i % j == 0) {
                    cnt++;
                    temp_sum += dp[j];
                    int quotient = i / j;
                    if (j != quotient) { // 如 25 = 5 * 5 ,5 不能再加一次
                        cnt++;
                        temp_sum += dp[quotient];
                    }
                }
            }
            printf("%d\n", cnt);
            dp[i] = (cnt + (double) temp_sum) / (cnt - 1);
            printf("dp[%d]: %f\n", i, dp[i]);
        }
        ans = dp[n];
        ca++;
        printf("Case 1: %lf\n", ans);
    }
    return 0;
}