HDU 1027 全排列

#include<stdio.h>
#include<string.h>
#include<cstdlib>
#include<algorithm>
using namespace std;
int n,m;
int sequence[1010];
int main()
{
	int i,j,k;
	while(scanf("%d %d",&n,&m)!=EOF)
	{
		sequence[0]=0;
		for(i=1;i<=n;i++)
		{
			sequence[i]=i;
		}
		for(i=2;i<=m;i++)
		{
			j=n;
			while(sequence[j]<sequence[j-1])
			{
				j--;
			}
			if(j==1)
			{
				for(k=1;k<=n;k++)
				{
					sequence[k]=k;
				}
			}
			else
			{
				for(k=n;k>=j;k--)
				{
					if(sequence[k]>sequence[j-1])
					{
						int temp=sequence[j-1];
						sequence[j-1]=sequence[k];
						sequence[k]=temp;
						break;
					}
				}
				sort(sequence+j,sequence+n+1);
			}
		}
		for(i=1;i<n;i++)
		{
			printf("%d ",sequence[i]);
		}
		printf("%d\n",sequence[n]);
	}
	return 0;
}