Arcade Game （全排列函数应用）

Arcade mall is a new modern mall. It has a new hammer game called “Arcade Game”. In this game you’re presented with a number n which is hanged on a wall on top of a long vertical tube, at the bottom of the tube there is a button that you should hit with your hammer.

When you hit the button with all your force (as you always do), a ball is pushed all over the tube and hit the number n. The number n flies in the air and it’s digits fall back in any random permutation with uniform probability.

If the new number formed is less than or equal to the previous number, the game ends and you lose what ever the new number is. Otherwise (if the number is greater than the previous number), you are still in the game and you should hit the button again.

You win if the new number formed is greater than the previous number and it is equal to the greatest possible permutation number.

Can you compute the probability of winning?
Input

The first line of the input contains the number of test cases T. Following that there are T lines represents T test cases. In each line, there is a single integer (1 ≤ n ≤ 109) the target number. The digits of n are all unique, which means that any 2 digits of n are different.
Output

For each test case, print one line containing the answer. Print the answer rounded to exactly 9 decimal digits.
Example
Input

3
952
925
592

Output

0.000000000
0.166666667
0.194444444

Note

In the first test case, the answer is 0 because 952 is greater than all 2,5 and 9 permutations so you can’t win, whatever you do.

In the second test case, the answer is 0.166666667 because you may win by getting number 952 with probability 1/6.

In the third test case the answer is 0.194444444 because you may win by getting number 952 in round1 with probability 1/6 or you can win by getting number 925 in round 1 and then 952 in round 2 with probability 1/6 * 1/6.
题意：给你长度小于10的 数, 问 当前下 所有数字全排列 比他的 的概率是多少, 会叠加,
例如 592 比他大的有952 925 比925 大的有952 所有 概率为 1/6 + 1/6*1/6;
这里需要引用全排列函数next_permutation，寻找后一个全排列，如果存在就返回1，如果不存在就返回0.与之相反的是prev_permutatio，寻找前一个全排列

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int n[15]={1,1};
int a[15];
double p,q;
int main()
{
    for(int i=2;i<10;i++)
    {
        n[i]=n[i-1]*i;
    }
    int T;
    cin>>T;
    while(T--)
    {
        char s[11];
        int cnt=0;
        scanf("%s",s);
        int l=strlen(s);
        for(int i=0;i<l;i++)
        {
            a[i]=s[i]-'0';
        }
        while(next_permutation(a,a+l))
        {
            cnt++;
        }
        if(cnt==0)
        {
            printf("0.000000000\n");
        }
        else
        {
            double temp=1.0/n[l];
            q=p=temp;
            for(int i=1;i<cnt;i++)
            {
                q=p+p*temp;
                p=q;
            }
            printf("%.9lf\n",p);
        }
    }
    return 0;
}