Race to 1 Again (基础概率dp)

Rimi learned a new thing about integers, which is - any positive integer greater than 1 can be divided by its divisors. So, he is now playing with this property. He selects a number N. And he calls this D.

In each turn he randomly chooses a divisor of D (1 to D). Then he divides D by the number to obtain new D. He repeats this procedure until D becomes 1. What is the expected number of moves required for N to become 1.

Input
Input starts with an integer T (≤ 10000), denoting the number of test cases.

Each case begins with an integer N (1 ≤ N ≤ 105).

Output
For each case of input you have to print the case number and the expected value. Errors less than 10-6 will be ignored.

Sample Input
3
1
2
50
Sample Output
Case 1: 0
Case 2: 2.00
Case 3: 3.0333333333

题目是说，给出一个数字n,然后每次从n的因子里，包含1和他本身，找到一个数字，用n除以这个数字，得到新的n,知道n为1，问次数的期望。。。。

这道题目可以这样理解，假设n的因子个数是num个，每一个因子分别为a[1], a[2], a[3], ….a[num],
然后 dp[n] (从n到1次数的期望) = (dp[a[1]]+1)(因为n/a[1]不为1，所以步数+1) * 1/num +（dp[a[2]] + 1） * 1/num +……+(dp[a[num]]+1) * 1/num.

也就是：
dp[n] = (dp[a[1]] + dp[a[2]] + dp[a[3]] + …… +dp[a[num]] + num)/num;
因为因子数包含本身，所以
a[num] = n;
dp[a[num]] = dp[n]
所以，上面的式子化简为：
dp[n] = (dp[a[1]] + dp[a[2]] + dp[a[3]] + …… +dp[n] + num)/num;
移项得：
(num-1)/num * dp[n] = (dp[a[1]] + dp[a[2]] + dp[a[3]] + …… +num)/num;
等价于：
dp[n] = (dp[a[1]] + dp[a[2]] + dp[a[3]] + …… +num)/（num-1）;

根据上述，可以做题了。。。。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <set>
#include <cstring>
#include <cstdlib>
#include <vector>
using namespace std;
double dp[123123];
int main()
{
    dp[1] = 0;
    for(int i=2; i<=100000; i++)
    {
        dp[i] = 0;
        int num = 0;
        for(int j=1; j*j<=i; j++)//找一半就可以了
        {
            if(i%j==0)
            {
                dp[i] += dp[j];
                num++;
                if(i/j!=j)//在左右各一个
                {
                    num++;
                    dp[i] += dp[i/j];
                }
            }
        }
        dp[i] = (dp[i]+num)/(num-1);//上面的公式
    }
    int t;
    scanf("%d", &t);
    for(int T=1; T<=t; T++)
    {
        int n;
        scanf("%d", &n);
        printf("Case %d: %lf\n", T, dp[n]);
    }
    return 0;
}