LightOJ 1038 - Race to 1 Again （期望dp）

题意:

$n<=10^5, 每次操作可以除以它的约数, 求变成1的期望$

分析:

$期望dp, dp[i]:= i变成1的期望步数,\ $由于可以除1, 所以这个我们单独考虑, 不然就转移到自己就炸了
$dp[i]=(dp[a]+1+dp[b]+1\cdots+dp[?]+1)* \frac{1}{n} + (dp[i]+1)*\frac{1}{n}$
　　　$=(dp[a]+dp[b]+\cdots+dp[?])*\frac{1}{n}+dp[i]*\frac{1}{n} + n*\frac{1}{n}$
$\frac{n-1}{n}*dp[i] = (dp[a]+dp[b]+\cdots+dp[?])*\frac{1}{n} + 1$
$(n-1)*dp[i] = (dp[a]+dp[b]+\cdots+dp[?]) + n$
$dp[i] =\frac{dp[a]+dp[b]+\cdots+dp[?] + n}{n - 1}$
$dp[i] =\frac{(dp[a]+1+dp[b]+1+\cdots+dp[?] +1)+ 1}{n - 1}$
$然后就是下面的这个转移了啊$
$约数还可以用筛法来打表, 我突然给忘记了$

代码:

//
//  Created by TaoSama on 2015-11-13
//  Copyright (c) 2015 TaoSama. All rights reserved.
//
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>

using namespace std;
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
const int N = 1e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;

int n;
bool vis[N];
double dp[N];

vector<int> fact(int n) {
    vector<int> divisor;
    for(int i = 2; i * i <= n; ++i) {
        if(n % i == 0) {
            divisor.push_back(i);
            int t = n / i;
            if(i != t) divisor.push_back(t);
        }
    }
    divisor.push_back(n);
    return divisor;
}

double dfs(int x) {
    double& ret = dp[x];
    if(x == 1) return 0;
    if(vis[x]) return ret;
    vis[x] = true;

    vector<int> divisor = fact(x);
    int n = divisor.size();
//  prln(x);
//  for(int i = 0; i < n; ++i) printf("%d ", divisor[i]); puts("");
    ret = 0;
    for(int i = 0; i < n; ++i) {
        ret += dfs(x / divisor[i]) + 1;
    }
    ret = (ret + 1) / n;
    return ret;
}

int main() {
#ifdef LOCAL
    freopen("C:\\Users\\TaoSama\\Desktop\\in.txt", "r", stdin);
//  freopen("C:\\Users\\TaoSama\\Desktop\\out.txt","w",stdout);
#endif
    ios_base::sync_with_stdio(0);

    int t; scanf("%d", &t);
    int kase = 0;
    memset(vis, false, sizeof vis);
    while(t--) {
        scanf("%d", &n);
        printf("Case %d: %.12f\n", ++kase, dfs(n));
    }
    return 0;
}