基本编程笔试题（二）递归问题

一、组合问题，从M个不同字符里任取N个字符的所有组合

#include"stdafx.h"
#include<stdio.h>
#include <iostream>
using namespace std;
void Find(char *source, char *result, int n)
{
	if (n == 1)
	{
		while (*source)
			cout<< result<< *source++<<" ";
	}
	else {
		int i, j;
		for (i = 0; source[i] != 0; i++);
		for (j = 0; result[j] != 0; j++);
		for (; i >= n; i--)
		{
			result[j] = *source++;
			result[j + 1] = '\0';
			Find(source, result, n - 1);
		}

	}
}
int main()
{
	int const n = 3;
	char *source = "ABCDE", result[n + 1] = { 0 };
	if (n > 0 && strlen(source) > 0 && n <= strlen(source))
		Find(source, result, n);
}

二、将一组整数逆序后放入一数组中（要求递归实现）

#include"stdafx.h"
#include<stdio.h>
#include <iostream>
using namespace std;
void convert(int *result, int n)
{
	if (n >= 10)
		convert(result + 1, n / 10);
	*result = n % 10;
}
int main()
{
	int n = 123456789,result[20] = { 0 };
	convert(result, n);
	printf("%d:", n);
	for (int i = 0; i < 9; i++)
		printf("%d", result[i]);
}

三、分解成质因数

#include"stdafx.h"
#include<stdio.h>
#include <iostream>
using namespace std;
void prim(int m, int n)
{
	if (m > n)
	{

		while (m%n != 0) n++;
		m /= n;
		prim(m, n);
		printf("%d*", n);
	}

}
int main()
{
	int n = 435234;
	printf("%d=", n);
	prim(n, 2);
	return 0;
 }

四。求高于平均分的学生学号和成绩

#include"stdafx.h"
#include<stdio.h>
#include <iostream>
using namespace std;
double find(int total, int n)
{
	int number, score, average;
	cin >> number;
	if (number != 0)
	{
		cin >> score;
		average = find(total + score,n+1);
		if(score>=average)
			cout<<number<<

	}

}

int main()
{
	find(0, 0);
	return 0;
}