排列组合(组合C语言实现)

Windows环境实现：

#include <stdio.h>
#define MAX 200
int fit_value[MAX] = {0};//初始化 
int C_N = 0, C_M = 0;//初始化 
int count = 0;
void print()
{
	int i = 0;
	for(i = 0; i < C_M; i++)
		printf("%d ", fit_value[i + 1]);
	count++;
	printf("\n");
}
void match(int num)
{
	if (num == C_M + 1)
		print();
	else
		for(fit_value[num] = fit_value[num - 1] + 1; fit_value[num] <= C_N - C_M + num; fit_value[num]++)
			match(num + 1);
}
int main()
{
	printf("请分别输入元素C_N和C_M,空格隔开：\n");
	scanf("%d %d", &C_N, &C_M);
	printf("%d个元素中取出%d个元素的所有组合如下: \n", C_N, C_M);
	match(1);
	printf("%d个元素中取出%d个元素总计: %d 种组合\n", C_N, C_M, count);
	return 0;
}

Linux环境实现：

#include <stdio.h>
#define MAX 200
int fit_value[MAX] = {0};//初始化
int C_N = 0, C_M = 0, count = 0;//初始化
void print()
{
	int i = 0;
	for(i = 0; i < C_M; i++)
		printf("%d ", fit_value[i + 1]);
	count++;
	printf("\n");
}
void match(int num)
{
	if (num == C_M + 1)
		print();
	else
		for(fit_value[num] = fit_value[num - 1] + 1; fit_value[num] <= C_N - C_M + num; fit_value[num]++)
			match(num + 1);
}
int main(int argc, char *argv[])
{
	C_N = atoi((int *)argv[1]);
	C_M = atoi((int *)argv[2]);
	printf("%d numbers random select %d numbers, match show: \n",C_N, C_M);
	match(1);
	printf("%d numbers random select %d numbers, match count = %d\n",C_N, C_M, count);
	return 0;
}