输入与输出外挂

#include<iostream>
#include<cstdio>
#include<string.h>
#include<algorithm>

using namespace std;
//bool vis[10];
int a[10];
int b[10];
int n;
/*void dfs(int cur)
{
	if(cur==n)
	{
		for(int i=0;i<cur;++i) cout<<a[i];
		cout<<endl;
		return;
	}
	for(int i=0;i!=n;++i)
	 if(!i||b[i-1]!=b[i])
	 {
		 int c1=0,c2=0;
		 for(int j=0;j<n;++j) if(b[i]==b[j]) c1++;
		 for(int j=0;j<cur;++j) if(a[j]==b[i]) c2++;
		 if(c1>c2)
		 {
			 a[cur]=b[i];
			 dfs(cur+1);
		 }
	 }
}*/
void in(int &a)
{
	char ch;
	while((ch=getchar())<'0'||ch>'9');
	for(a=0;ch>='0'&&ch<='9';ch=getchar()) a=a*10+ch-'0';

}
void out(int x)
{
	if(x>9) out(x/10);
	 putchar(x%10+48);
}
int main()
{
	
	while(cin>>n)
	{
		for(int i=0;i!=n;++i) in(b[i]);
		sort(b,b+n);
		do
		{
			for(int i=0;i!=n;++i) out(b[i]);
			cout<<endl;
		}while(next_permutation(b,b+n));
	}return 0;
}