题意:给出N 每一步都可以选N的一个除数D
N=N / D
求N=1的期望
DP[ N ] = sigma DP[ N的除数 ] * 除数个数的倒数+1 ;
右边还有DP[ N ](除数==1 时) 提取移到左边就可以了
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <string>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cmath>
using namespace std;
#include <queue>
#include <stack>
#include <set>
#include <vector>
#include <deque>
#include <map>
#define cler(arr, val) memset(arr, val, sizeof(arr))
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long LL;
const int MAXN = 302020;
const int MAXM = 1602020;
const int INF = 0x3f3f3f3f;
const int mod = 1000000007;
const double eps = 1e-4;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
double dp[102000];
int main()
{
int cas=1,t,n,a;
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif
scanf("%d",&t);
cler(dp,0);
for(int i=2; i<=100000; i++)
{
double sum=0,num=0;
for(int j=1; j*j<=i; j++)
{
if(i%j==0)
{
num+=1;
sum+=dp[i/j];
if(j!=i/j)
{
sum+=dp[j];
num+=1;
}
}
}
dp[i]=(sum+num)/(num-1);
}
while(t--)
{
scanf("%d",&n);
printf("Case %d: %.6lf\n",cas++,dp[n]);
}
return 0;
}