Race to 1 Again LightOJ - 1038

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

Solution.

这题类似loj1027 A Dangerous Maze的，求解当前n的期望会用到之前求出来的m（m < < <script type="math/tex" id="MathJax-Element-146"><</script>n）的期望，以及n的期望（当除数是1时），整理一下，解一元一次方程即可。
预处理$10^5$个数，复杂度是${n \sqrt{n}}$的。

Code

#include <bits/stdc++.h>

using namespace std;
const int MX = 100010;
int T, n, j;
double d[MX];

int main() {
//    freopen("../in","r",stdin);
    d[1] = 0;
    d[2] = 2;
    for (int i = 3; i <= 100000; ++i) {
        n = 0;
        for (j = 2; j * j < i; ++j) {
            if (i % j == 0) {
                n += 2;
                d[i] += d[j];
                d[i] += d[i / j];
            }
        }
        if (j*j==i) {
            n++;
            d[i]+=d[j];
        }
        d[i] += n + 2;
        d[i] /= n + 1;
    }
    scanf("%d", &T);
    for (int I = 1; I <= T; ++I) {
        printf("Case %d: ", I);
        scanf("%d", &n);
        printf("%.7f\n", d[n]);
    }
    return 0;
}