排列组合（可重复版）

#include<iostream>
#include <string>
#include <string.h>
#include<vector>
#include<stack>
#include<queue>
#include<stdio.h>
#include<stdlib.h>
#include<iomanip>
using namespace std;
int count1 = 0;
void print_permutation(int n, int* P, int* A, int cur) {
	if (cur == n) {//递归边界
		for (int i = 0; i < n; i++)printf("%d ", A[i]);
		count1++;
		printf("\n");
	}
	else
		for (int i = 0; i < n; i++)if (!i||P[i]!=P[i-1]) {//下标不重复
		int ok = 1; int c1 = 0, c2 = 0;
		for (int j = 0; j < cur; j++) if (A[j] == P[i])c1++;//计算P[i]在数组A中出现了多少次
		for (int j = 0; j < n; j++)if (P[i] == P[j])c2++;//计算P[i]在数组P中出现了多少次
		if (c1 < c2) {
			A[cur] = P[i];
			print_permutation(n, P, A, cur + 1);//递归调用
		}
	}
}
int main()
{
#ifdef LOCAL
	freopen("data.in", "r", stdin);//scanf
	freopen("data.out", "w", stdout);//printf
#endif
	int A[10000]; int n; int P[10000];
	while (cin >> n&&n) {
		for (int i = 0; i < n; i++)cin >> P[i];
		count1=0;
		print_permutation(n,P, A, 0);
		cout << count1 << endl;//输出有多少种组合
	}
	system("pause");
	return 0;
}