康托展开式去重来一发bfs
#include<iostream>
#include<map>
#include<string>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<queue>
#include<vector>
#include<algorithm>
using namespace std;
const int PermSize=9;
int factory[20]={0,1,2,6,24,120,720,5040,40320,362880,3628800,39916800};
bool used[362880];
char goal[9];
struct node
{
int x,step;
char s[9];
};
int cantor(const char* buf)
{
int i,j,count......
阅读全文