小白书之求排列

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<string>
#include<cctype>
#include<cmath>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<stack>
#include<ctime>
#include<algorithm>
#include<climits>
#define LL long long
using namespace std;
const int N=101;
void print_permutation(int n,int *A,int cur)
{
if(cur==n)
{
for(int i=0;i<n;i++)
cout<<A[i]<<' ';
cout<<endl;
}
else
{
for(int i=1;i<=n;i++)
{
int ok=1;
for(int j=0;j<cur;j++)
{
if(A[j]==i)
{
ok=0;
break;
}
}
if(ok)
{
A[cur]=i;
print_permutation(n,A,cur+1);
}
}
}
}
int main()
{
int n;
while(cin>>n)
{
int A
;
print_permutation(n,A,0);
}
return 0;
}

<pre name="code" class="cpp">#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<string>
#include<cctype>
#include<cmath>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<stack>
#include<ctime>
#include<algorithm>
#include<climits>
#define LL long long
using namespace std;
const int N=101;
int P
;
void print_permutation(int n,int *A,int cur)
{
if(cur==n)
{
for(int i=0;i<n;i++)
cout<<A[i]<<' ';
cout<<endl;
}
else
{
for(int i=0;i<n;i++)
{
if(!i||P[i]!=P[i-1])
{
int c1=0,c2=0;
for(int j=0;j<n;j++)
if(P[j]==P[i]) c1++;
for(int j=0;j<cur;j++)
if(A[j]==P[i]) c2++;
if(c2<c1)
{
A[cur]=P[i];
print_permutation(n,A,cur+1);
}
}
}
}
}
int main()
{
int n;
while(cin>>n)
{
int A
;
for(int i=0;i<n;i++)
cin>>P[i];
sort(P,P+n);
print_permutation(n,A,0);
}
return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<string>
#include<cctype>
#include<cmath>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<stack>
#include<ctime>
#include<algorithm>
#include<climits>
#define LL long long
using namespace std;
const int N=101;
int P
;
int main()
{
int n;
while(cin>>n)
{
for(int i=0;i<n;i++)
cin>>P[i];
sort(P,P+n);
do
{
for(int i=0;i<n;i++)
cout<<P[i]<<' ';
cout<<endl;
}while(next_permutation(P,P+n));
}
return 0;
}