#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
int main() {
int a = 0;
int ten, five, two, one;
for (ten = 1; ten <= 9; ten++) { //最多9
for (five = 1; five <= 18; five++) { //最多18
for (two = 1; two <= 37; two++) { //最多37
for (one = 1; one <= 37; one++) { //最多37
if (10*ten+5*five+2*two+one == 100 && ten+five+two+one == 40) {
a++;//有多少种方法
}
}
}
}
}
printf("%d\n",a);
return 0;
}
穷举法判断每张纸币各有多少张,要求每种纸币最少一张,有几种算法
最新推荐文章于 2024-09-28 22:42:28 发布