[原创]NYOJ 139 我排第几个 [康拓展开]【数学】

# include <stdio.h>
# include <iostream>
# include <algorithm>
# include <string.h>
# include <cmath>
using namespace std;

# define INF      0x3f3f3f3f
# define pb       push_back
# define abs(a)   ((a)>0?(a):-(a))
# define min(a,b) ((a)>(b)?(a):(b))
# define lalal    puts("*******")

typedef long long int LL ;
typedef unsigned long long int LLu ;
/*******************************/

const int MOD = 10086;
const int N = 1e7+5;

int prime[700000],kp;
bool Is_or[N];

char s1[30];
bool vis[30];
LL a[30];
LL jiecheng[30];

void init()
{
    jiecheng[0]=1;
    for(int i=1; i<=12; i++)
        jiecheng[i]=jiecheng[i-1]*i;
    return ;
}

LL Cantor_expansion(char s1[])
{
    LL x=0;
    int rk=0;
    for(int i=0; i<12; i++)
    {
        rk=0;
        for(int j=11; j>i; j--)
            if(s1[i]>s1[j])rk++;
        a[i]=rk;
    }

    for(int i=0; i<12; i++)
        x+=a[i]*jiecheng[11-i];
    return x+1;
}

int main()
{
    init();
    int _;
    while(~scanf("%d",&_))
    {
        while(_--)
        {
            scanf("%s",s1);
            printf("%I64d\n",Cantor_expansion(s1));
        }
    }
    return 0;
}