NYOJ 366 D的小L

#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;
}