LightOJ1038-Race to 1 Again

简单概率dp，dp[i]表示从i出发转到1的期望次数，每个因子被选的概率相等
dp[i] = 1 + ∑(k是i的因子)dp[i/k] / div(i) , div(i)表示i的因子个数
把和式中的dp[i/1] / div(i) 取出来移项
最后得到dp[i] = （ div(i) + ∑(k是i的因子 && k != 1)dp[i/k]  ）/  （div(i) - 1 )

因为n有点大，枚举的时候用√n的复杂度把i和D/i一起算了

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#define M 1100000
using namespace std;
double dp[100001];
double d ( int D ) {
	if ( dp[D] >= 0 )
		return dp[D];
	double cnt = 0;
	double ans = 0;
	for ( int i = 1; i*i <= D; i++ ) {
		if ( D % i == 0 ) {
			if ( i >= 2 ) {
				if ( i != D/i ) {
					cnt += 2;
					ans += d( i ) + d ( D/i );
				}
				else {
					cnt += 1;
					ans += d(i);
				}
			}
			else if ( i == 1 ) {
				cnt += 2.0;
				ans += d(1);
			}
		}
	}
	dp[D] = cnt + ans;
	dp[D] /= cnt -1;
	return dp[D];
}
int main () {
	for ( int i = 0; i <= 100000; i++ )
		dp[i] = -1;
	dp[0] = dp[1] = 0;
	int t;
	scanf ( "%d", &t );
	for ( int cas = 1; cas <= t; cas++ ) {
		int n;
		scanf ( "%d", &n );
		d (n);
		printf ( "Case %d: %lf\n", cas, dp[n] );
	}
	return 0;
}