[UVA11762] Race to 1 && 数学期望

用p(x)表示小于x的质数个数 g(x)表示x的质因数个数

d[n] = 1 + d[n] * (1 - g(x) / p(x)) + sum{d[x/y] * 1 / p(x) | x % y == 0}

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<cmath>
#define SF scanf
#define PF printf
using namespace std;
typedef long long LL;
const int MAXN = 1000000;
int n, k, m, kase;
double d[MAXN+10];
bool ok[MAXN+10], vis[MAXN+10];
int P, prime[MAXN+10];
void init()
{
	int t = sqrt(MAXN)+0.5;
	for(int i = 2; i <= t; i++) 
		if(!ok[i]) {
			for(int j = i; (LL)j * i <= MAXN; j++)
				ok[j*i] = true;
			}
	for(int i = 2; i <= MAXN; i++) if(!ok[i]) prime[++P] = i;
}
double dp(int n)
{
	if(n == 1) return 0;
	if(vis[n]) return d[n];
	
	vis[n] = true;
	double &ans = d[n];
	int g = 0, p = 0;
	for(p = 1; p <= P && prime[p] <= n; p++)
		if(n % prime[p] == 0) g++, ans += dp(n / prime[p]);
	ans = (ans + (p-1)) / g;
	return ans;
}
int main()
{
	init();
	int T, kase = 1; for(SF("%d", &T); kase <= T; kase++) {
		int n; SF("%d", &n);
		printf("Case %d: %.10lf\n", kase, dp(n));  
	}
}