> // 1833.cpp : Defines the entry point for the console application.
> //
> 
> //#include "stdafx.h"
> #include <stdio.h>
> 
> 
> #include<algorithm>
> using namespace std;
> 
> int main()
> {
> 	int m;
> 	//freopen("1833.txt","r",stdin);
> 
> 	scanf("%d",&m);
> 	while(m--)
> 	{
> 		int n,j,k,i,a[1025];
> 		scanf("%d %d",&n,&k);
> 		for(i=0;i<n;i++)
> 		{
> 			scanf("%d",&a[i]);
> 			//printf("%d",a[i]);
> 		}//printf("\n");
> 
> 		 i=0;
> 		j=1;
> 		while(1) 
> 		{
> 			if(!next_permutation(a,a+n))//产生当前排列的后一个排列
> 			{
> 				for(i=1;i<n;i++)
> 				printf("%d ",i);
> 				printf("%d\n",i);
> 				goto loop;
> 			}
> 			else if(next_permutation(a,a+n))
> 			{
> 				j++;
> 				if(j==k)
> 				{
> 					for(i=0;i<n-1;i++)
> 					printf("%d ",a[i]);
> 					printf("%d\n",a[i]);
> 					goto p2;
> 				}
> 			}
> 		}
> 		p2:;
> 		loop:;
> 	
> 	}
> 	return 0;
> }
> 

直接用 next_permutation() K次就可以了呀~~
        for(i=0;i<k;i++)
        {
            next_permutation(p,p+n);
        }

• Re:感谢高手指点......... (19) jinweiliang 2009-04-07 23:42:49