Light oj 1038 - Race to 1 Again(概率dp)

1038 - Race to 1 Again

PDF (English)

Statistics

Forum

Time Limit: 2 second(s)

Memory Limit: 32 MB

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 ≤ 10⁵).

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	Output for Sample Input
3 1 2 50	Case 1: 0 Case 2: 2.00 Case 3: 3.0333333333

 

---

PROBLEM SETTER: JANE ALAM JAN

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<map>

#define L(x) (x<<1)
#define R(x) (x<<1|1)
#define MID(x,y) ((x+y)>>1)

#define bug printf("hihi\n")

#define eps 1e-12

typedef long long ll;

using namespace std;
#define N 100005

vector<int>g[N];
double dp[N];
int n;

void inint()
{
    int i,j;
    for(i=0;i<N;i++) g[i].clear();
    for(i=2;i<N;i++)
        for(j=i;j<N;j+=i)
           g[j].push_back(i);
}

double dfs(int n)
{
    if(n==1) return dp[n]=0;
    if(dp[n]>-0.5) return dp[n];
    double temp=0;
    for(int i=0;i<g[n].size();i++)
        temp+=dfs(n/g[n][i]);
    return dp[n]=(temp/(g[n].size()+1)+1)*(g[n].size()+1)/g[n].size();
}

int main()
{
    int i,j,t,ca=0;
    memset(dp,-1,sizeof(dp));
    inint();
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        printf("Case %d: %.7f\n",++ca,dfs(n));
    }
    return 0;
}