第四章教学示例

1.组合数

#include<iostream>
#include<Windows.h>
#include<ctype.h>
#define MAXN 1010
#define INF 10000000
using namespace std;
long long C(int n,int m)
{
	long long cnt = 1;
	if (m > n - m) m = n - m;	//简化计算 Cnm=Cn(m-1)
	for (int i = m + 1;i <= n;i++) cnt *= i;
	for (int j = n - m;j >= 1;j--) cnt /= j;
	return cnt;
}
int main()
{
	int m, n;
	long long result;
	cin >> n >> m;
	result=C(n, m);
	cout << result << endl;
	system("pause");
	return 0;
}

2.判断素数

#include<iostream>
#include<Windows.h>
#include<ctype.h>
#include<cmath>
#define MAXN 1010
#define INF 10000000
using namespace std;
int isPrime(int n)
{
	if (n <= 1) return 0;
	for (int i = 2;i < floor(sqrt(n) + 0.5);i++)
		if (n%i == 0) return 0;
	return 1;
}
int main()
{
	int n;
	cin >> n;
	if (isPrime(n)) cout << "yes" << endl;
	else cout << "no" << endl;
	system("pause");
	return 0;
}

3.刽子手游戏

#include<iostream>
#include<Windows.h>
#include<ctype.h>
#include<cmath>
#define MAXN 1010
#define INF 10000000
char str[MAXN], ans[MAXN];
int lef, chance;
int win, lose;
using namespace std;
void guess(char ch)
{
	int find = 0;
	for(int i=0;i<strlen(str);i++)
		if (ch == str[i]) {
			lef--;
			find = 1;
			str[i] = ' ';
		}
	if (!find) chance--;
	if (!chance) lose = 1;
	if (!lef) win = 1;
}
int main()
{
	int a, i, j;
	while (scanf("%d%s%s", &a, str, ans) == 3 && a != -1)
	{
		lef = strlen(str);
		chance = 7;
		win = lose = 0;
		for (i = 0;i < strlen(ans);i++)
		{
			guess(ans[i]);
			if (win || lose) break;
		}
		if (win) cout << "You win." << endl;
		else if (lose) cout << "You cose." << endl;
		else cout << "You chickened out." << endl;
	}
	system("pause");
	return 0;
}