4.韩信点兵

问题：

相传韩信才智过人，从不直接清点自己军队的人数，只要让士兵先后以三人一排、五人一排、七人一排地变换队形，而他每次只掠一眼队伍的排尾就知道总人数了。输入3个非负整数a,b,c ，表示每种队形排尾的人数（a<3,b<5,c<7），输出总人数的最小值（或报告无解）。已知总人数不小于10，不超过100 。输入到文件结束为止。

方法一：

#include<stdio.h>
#define INF 10000000
using namespace std;
int main(){
	int a, b, c, cnt = 1;
	while (scanf("%d %d %d", &a, &b, &c) != EOF){
		int i;
		for (i = 10; i <= 100; i++){
			if (i % 3 == a && i % 5  == b && i % 7 == c){
				printf("Case %d: %d\n", cnt++, i);
				break;
			}
		}
		if (i == 101) printf("Case %d: No answer\n", cnt++);
	}
	return 0;
}

方法二：

#include<stdio.h>
#define INF 10000000
using namespace std;
int main() {
	int a, b, c, m, cnt = 1;
	while (scanf("%d %d %d", &a, &b, &c) != EOF) {
		m = (a * 70 + b * 21 + c * 15) % 105 ;
		if (m > 9 && m < 101) {
			printf("Case %d: %d\n", cnt++, m);
			continue;
		}
		else {
			printf("Case %d: No answer \n", cnt++);
		}
	}
	return 0;
}

输出所有可能性：

#include<stdio.h>
#define INF 10000000
using namespace std;
int main()
{
	int a, b, c, cnt = 1;
	for (a = 0; a < 3; a++) {
		for (b = 0; b < 5; b++) {
			for (c = 0; c < 7; c++) {
				int i;
				for (i = 10; i <= 100; i++) {
					if (i % 3 == a && i % 5 == b && i % 7 == c)
					{
						printf("Case %d: %d %d %d %d\n",cnt++, a, b, c, i);
						break;
					}
				}
				if (i == 101)
					printf("Case %d: No answer\n", cnt++);
			}
		}
	}

	return 0;
}

Case 1: No answer
Case 2: 0 0 1 15
Case 3: 0 0 2 30
Case 4: 0 0 3 45
Case 5: 0 0 4 60
Case 6: 0 0 5 75
Case 7: 0 0 6 90
Case 8: 0 1 0 21
Case 9: 0 1 1 36
Case 10: 0 1 2 51
Case 11: 0 1 3 66
Case 12: 0 1 4 81
Case 13: 0 1 5 96
Case 14: No answer
Case 15: 0 2 0 42
Case 16: 0 2 1 57
Case 17: 0 2 2 72
Case 18: 0 2 3 87
Case 19: No answer
Case 20: 0 2 5 12
Case 21: 0 2 6 27
Case 22: 0 3 0 63
Case 23: 0 3 1 78
Case 24: 0 3 2 93
Case 25: No answer
Case 26: 0 3 4 18
Case 27: 0 3 5 33
Case 28: 0 3 6 48
Case 29: 0 4 0 84
Case 30: 0 4 1 99
Case 31: No answer
Case 32: 0 4 3 24
Case 33: 0 4 4 39
Case 34: 0 4 5 54
Case 35: 0 4 6 69
Case 36: 1 0 0 70
Case 37: 1 0 1 85
Case 38: 1 0 2 100
Case 39: 1 0 3 10
Case 40: 1 0 4 25
Case 41: 1 0 5 40
Case 42: 1 0 6 55
Case 43: 1 1 0 91
Case 44: No answer
Case 45: 1 1 2 16
Case 46: 1 1 3 31
Case 47: 1 1 4 46
Case 48: 1 1 5 61
Case 49: 1 1 6 76
Case 50: No answer
Case 51: 1 2 1 22
Case 52: 1 2 2 37
Case 53: 1 2 3 52
Case 54: 1 2 4 67
Case 55: 1 2 5 82
Case 56: 1 2 6 97
Case 57: 1 3 0 28
Case 58: 1 3 1 43
Case 59: 1 3 2 58
Case 60: 1 3 3 73
Case 61: 1 3 4 88
Case 62: No answer
Case 63: 1 3 6 13
Case 64: 1 4 0 49
Case 65: 1 4 1 64
Case 66: 1 4 2 79
Case 67: 1 4 3 94
Case 68: No answer
Case 69: 1 4 5 19
Case 70: 1 4 6 34
Case 71: 2 0 0 35
Case 72: 2 0 1 50
Case 73: 2 0 2 65
Case 74: 2 0 3 80
Case 75: 2 0 4 95
Case 76: No answer
Case 77: 2 0 6 20
Case 78: 2 1 0 56
Case 79: 2 1 1 71
Case 80: 2 1 2 86
Case 81: No answer
Case 82: 2 1 4 11
Case 83: 2 1 5 26
Case 84: 2 1 6 41
Case 85: 2 2 0 77
Case 86: 2 2 1 92
Case 87: No answer
Case 88: 2 2 3 17
Case 89: 2 2 4 32
Case 90: 2 2 5 47
Case 91: 2 2 6 62
Case 92: 2 3 0 98
Case 93: No answer
Case 94: 2 3 2 23
Case 95: 2 3 3 38
Case 96: 2 3 4 53
Case 97: 2 3 5 68
Case 98: 2 3 6 83
Case 99: 2 4 0 14
Case 100: 2 4 1 29
Case 101: 2 4 2 44
Case 102: 2 4 3 59
Case 103: 2 4 4 74
Case 104: 2 4 5 89
Case 105: No answer