简单背包问题

#include <stdio.h>

int g_value[1000];

int packet(int weight, int mount)
{
if (weight == 0)  //背包问题有解
{
return 1;  
}
if (weight < 0 || (weight > 0 && mount < 1))  //此背包集合不符合条件
{
return 0;
}
if (packet(weight - g_value[mount - 1], mount - 1))  //判断是否 weight[mount - 1]是否包含在最后的背包集合中
{
return 1;    //在
}
else
{
return packet(weight, mount - 1);  //不在
}
}
int main()
{
int weight, mount, i;
while(EOF != scanf("%d%d", &weight, &mount))
{
for (i = 0; i < mount; i++)
{
scanf("%d", &g_value[i]);
}
if (packet(weight, mount))
{
printf("YES\n");
}
else
{
printf("NO\n");
}
}
return 0;
}