NYOJ 366 D的小L

地址：http://acm.nyist.net/JudgeOnline/problem.php?pid=366

方法；用next_permutation（pɝmjʊ'teʃə）来求解，递归调用代码

#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
    int a[]={1,2,3,4,5,6,7,8,9};
    int k,n,i;
    scanf("%d",&k);
    while(k--)
    {
       scanf("%d",&n);
       do
       {
          for(i=0;i<n;i++)
          {
               printf("%d",a[i]);
          }
          printf("\n");
       }
         while(next_permutation(a,a+n));
    }
    return 0;
}