生成可重集的排列

#include<stdio.h>
int P[100],A[100];
void print_permutation(int n,int* P,int* A,int cur)
{
int i, j;
　　if(cur == n)
　　{
　   for(i = 0; i < n; i++)
printf("%d ", A[i]);
printf("\n");
　  }
else for(i = 0; i < n; i++)
if(!i || P[i] != P[i-1])
{
int c1 = 0, c2 = 0;
for(j = 0; j < cur; j++)  if(A[j] == P[i]) c1++;
for(j = 0; j < n; j++)    if(P[i] == P[j]) c2++;
if(c1 < c2)
{
A[cur] = P[i];
print_permutation(n, P, A, cur+1);
}
}
}
int main()
{   int i, n;
scanf("%d", &n);
for(i = 0; i < n; i++)
scanf("%d", &P[i]);
print_permutation(n, P, A, 0);
return 0;
}

#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
int n,p[10];
scanf("%d",&n);
for(int i=0;i<n;i++) scanf("%d",&p[i]);
sort(p,p+n);
do{
for(int i=0;i,n;i++) printf("%d ",p[i]);
printf("\n");
}while(next_permutation(p,p+n));
return 0;
}