例题4-11 穷举问题-搬砖
某工地需要搬运砖块,已知男人一人搬3块,女人一人搬2块,小孩两人搬1块。如果想用n人正好搬n块砖,问有多少种搬法?
输入格式:
输入在一行中给出一个正整数n。
输出格式:
输出在每一行显示一种方案,按照"men = cnt_m, women = cnt_w, child = cnt_c"的格式,输出男人的数量cnt_m,女人的数量cnt_w,小孩的数量cnt_c。请注意,等号的两侧各有一个空格,逗号的后面也有一个空格。
#include
//某工地需要搬运砖块,已知男人一人搬3块,女人一人搬2块,小孩两人搬1块。如果想用n人正好搬n块砖,问有多少种搬法?
int main()
{
int man = 0, woman = 0, child = 0;
int n;
scanf("%d", &n);
for (; man <= n / 3; man++)
{
for (; woman <= n / 2; woman++)
{
for (; child <= n; child += 2)
{
if (man * 3 + woman * 2 + child / 2 == n && man + woman + child == n)
printf("men = %d, women = %d, child = %d\n", man, woman, child);
}
}
}
}
无结果
#include<stdio.h>
//某工地需要搬运砖块,已知男人一人搬3块,女人一人搬2块,小孩两人搬1块。如果想用n人正好搬n块砖,问有多少种搬法?
int main()
{
int man = 0, woman = 0, child = 0;
int n;
scanf("%d", &n);
for (; man <= n / 3; man++)
{
for (woman = 0; woman <= n / 2; woman++)
{
for (child = 0; child <= n; child += 2)
{
if (man * 3 + woman * 2 + child / 2 == n && man + woman + child == n)
printf("men = %d, women = %d, child = %d\n", man, woman, child);
}
}
}
}
14行,条件不对,小孩是两个人搬一块砖。改成2n。