C/C++ 排列组合问题（递归）

1、问题描述：一个MXN的矩形，从左下角走到右上角有多少种走法。

#include <iostream>
#include <string.h>
using namespace std;

void luxian(int alen, int blen, char P[][100], int ai, int bi, int num);

const int alen = 5;
const int blen = 7;
char *a[] = {"a1", "a2", "a3", "a4", "a5"};
char *b[] = {"b1", "b2", "b3", "b4", "b5", "b6", "b7"};
static int count = 0;
int main(void)
{
	char P[alen+blen][100];
	luxian(alen, blen, P, 0, 0, 0);
	return 0;
}
/*
	alen:a的长度
	blen:b的长度
	ai:a中已经选取了几个
	bi:b中已经选取了几个
	num：P中共有几个
*/
void luxian(int alen, int blen, char P[][100], int ai, int bi, int num)
{
	if (num == alen + blen)  //满了
	{
		for (int i = 0; i < num; i++)
			cout << P[i] << ",";
		
		cout << "   " << ++count;
		cout << endl;
	}
	else  //没满
	{
		if (ai < alen && bi==blen)  //b率先读取完
		{
			strcpy(P[num], a[ai]);
			luxian(alen, blen, P, ai+1, bi, num+1);
		}
		else if (ai == alen && bi < blen)  //a率先读取完
		{
			strcpy(P[num], b[bi]);
			luxian(alen, blen, P, ai, bi+1, num+1);
		}
		else
		{
			strcpy(P[num], a[ai]);
			luxian(alen, blen, P, ai+1, bi, num+1);
			strcpy(P[num], b[bi]);
			luxian(alen, blen, P, ai, bi+1, num+1);
		}
	}
}

2、问题描述：从（a1,a2,a3,...,an）中选取N个元素组合，有多少中组法

#include <iostream>
using namespace std;

#define NUM 3
void zuhe(char P[][100], int aPos, int num);

const int alen = 6;
char *a[] = {"a1","a2","a3","a4","a5","a6"};
static int count = 0;
int main(void)
{
	char p[NUM][100];
	zuhe(p, 0, 0);
	return 0;
}

/*
	aPos:当前取到a的位置
	num:当前组合P中的数 num < NUM
*/
void zuhe(char P[][100], int aPos, int num)
{
	if (NUM == num)
	{
		for (int i = 0; i < NUM; i++)
			cout << P[i] << ",";
		cout << "   " << ++count;
		cout << endl;
	}
	else if (num < NUM)
	{
		for (int i = aPos; i < alen; i++)
		{
			strcpy(P[num], a[i]);
			zuhe(P, i+1, num+1);
		}
	}
}