poj 3187 (康托逆展开)

       利用康托逆展开得到从1至n的全排列，然后验证是否为答案即可，水题。

      代码如下：

#include <cstdio>
#include <stack>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <list>
#include <functional>
#include <cstring>
#include <algorithm>
#include <cctype>
#include <string>
#include <map>
#include <iomanip>
#include <cmath>
#define LL long long
#define ULL unsigned long long
#define SZ(x) (int)x.size()
#define Lowbit(x) ((x) & (-x))
#define MP(a, b) make_pair(a, b)
#define MS(arr, num) memset(arr, num, sizeof(arr))
#define PB push_back
#define F first
#define S second
#define ROP freopen("input.txt", "r", stdin);
#define MID(a, b) (a + ((b - a) >> 1))
#define LC rt << 1, l, mid
#define RC rt << 1|1, mid + 1, r
#define LRT rt << 1
#define RRT rt << 1|1
#define BitCount(x) __builtin_popcount(x)
#define BitCountll(x) __builtin_popcountll(x)
#define LeftPos(x) 32 - __builtin_clz(x) - 1
#define LeftPosll(x) 64 - __builtin_clzll(x) - 1
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
using namespace std;
const double eps = 1e-8;
const int MAXN = 300 + 10;
const int MOD = 1000007;
const int M=1e5;
const int N=1e7+10;
typedef pair<int, int> pii;
typedef pair<int, string> pis;
const int d[4][2]={{0,1},{0,-1},{-1,0},{1,0}};
int n,sum,ans;
int a[N],b[N];
int f[11];
bool vis[11];
void invKT(int x)
{
    int i,j;
    MS(vis,false);
    for (i=0;i<n;i++) {
        int t=x/f[n-i-1];
        for (j=1;j<=n;j++) if (!vis[j]) {
            if (t==0) break;
            t--;
        }
        a[i]=j;
        vis[j]=1;
        x%=f[n-i-1];
    }
}
void fact()
{
    f[0]=f[1]=1;
    for (int i=2;i<=10;i++) f[i]=i*f[i-1];
}
bool ok()
{
    int k=n,i;
    for (i=0;i<n;i++) b[i]=a[i];
    while(k>1) {
        for (i=0;i<k;i++) {
            b[i]=b[i]+b[i+1];
        }
        k--;
    }
    if (sum==b[0]) return true;
    else return false;
}
int main()
{
    int i,j;
    fact();
    while(~scanf("%d%d",&n,&sum))
    {
        for (i=0;1;i++) {
            invKT(i);
            if (ok()) {
                for (j=0;j<n-1;j++) printf("%d ",a[j]);
                printf("%d\n",a[n-1]);
                break;
            }
        }
    }
}