邻位互换法：已知序号求序列

#include <cmath>
#include <queue>
#include <vector>
#include<list>
#include <cstdio>
#include <string>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <algorithm>
using namespace std;

class Sequence
{
public:
	Sequence(int n, int s)		//s从零开始
	{
		serial = s;
		int i;
		for (i = 2; i <= n; i++)
		{
			inter.push_back(0);
		}
		tranSequence(n,s);
		arr.push_back(1);
		for (i = 2; i <= n; i++)
		{
			insertArr(i);
		}
	}
	void tranSequence(int n, int s)
	{
		while (s)
		{
			inter[n - 2] = s % n;
			s /= n;
			n--;
		}
	}
	void insertArr(int i)
	{
		bool lfflag;
		int pos = inter[i - 2];
		if (i == 2)
		{
			lfflag = 0;
		}
		else if (i % 2 == 1)
		{
			lfflag = inter[i - 3] % 2;
		}
		else
		{
			lfflag = (inter[i - 3] + inter[i - 4]) % 2;
		}
		list<int>::iterator p;
		int j;
		if (pos == arr.size())
		{
			if (lfflag)
			{
				arr.push_back(i);
			}
			else
			{
				arr.push_front(i);
			}
		}
		else if (pos == 0)
		{
			if (!lfflag)
			{
				arr.push_back(i);
			}
			else
			{
				arr.push_front(i);
			}
		}
		else
		{
			if (!lfflag)
			{
				p = arr.end();
				for (j = 0; j < pos; j++)
				{
					p--;
				}
				arr.insert(p, i);
			}
			else
			{
				p = arr.begin();
				for (j = 0; j < pos; j++)
				{
					p++;
				}
				arr.insert(p, i);
			}
		}
	}

	void showArr()
	{
		int i;
		list<int>::iterator p = arr.begin();

		while (1)
		{
			if (p == arr.end())
			{
				printf("\n");
				break;
			}
			if (p != arr.begin())
			{
				printf(" ");
			}
			printf("%d", *p);
			p++;
		}

	}

private:
	vector<int>inter;
	list<int>arr;
	int serial;
};

int main()
{
	int m, n, k;
	int i;
	Sequence* temp;
	scanf("%d", &m);
	getchar();
	for (i = 0; i < m; i++)
	{
		scanf("%d %d", &n, &k);
		getchar();
		temp = new Sequence(n, k - 1);
		temp->showArr();
		delete temp;
	}
}