We all know that Bin-Laden is a notorious terrorist, and he has disappeared for a long time. But recently, it is reported that he hides in Hang Zhou of China!
“Oh, God! How terrible! ”
“Oh, God! How terrible! ”
Don’t
be so afraid, guys. Although he hides in a cave of Hang Zhou, he dares
not to go out. Laden is so bored recent years that he fling himself into
some math problems, and he said that if anyone can solve his problem,
he will give himself up!
Ha-ha! Obviously, Laden is too proud of his intelligence! But, what is his problem?
“Given
some Chinese Coins (硬币) (three kinds-- 1, 2, 5), and their number is
num_1, num_2 and num_5 respectively, please output the minimum value
that you cannot pay with given coins.”
You, super ACMer, should solve the problem easily, and don’t forget to take $25000000 from Bush!
Input
Input
contains multiple test cases. Each test case contains 3 positive
integers num_1, num_2 and num_5 (0<=num_i<=1000). A test case
containing 0 0 0 terminates the input and this test case is not to be
processed.
contains multiple test cases. Each test case contains 3 positive
integers num_1, num_2 and num_5 (0<=num_i<=1000). A test case
containing 0 0 0 terminates the input and this test case is not to be
processed.
Output
Output the minimum positive value that one cannot pay with given coins, one line for one case.
Sample Input
1 1 3
0 0 0
Sample Output
4
#include<stdio.h>
#include<string.h>
#include<math.h> int n1[],n2[];
int num[],p[],sum; void fuction()
{
memset(n1,,sizeof(n1));
memset(n2,,sizeof(n2));
n1[]=;/*注意，0面值也要算在内，不然后面if(n1[j])不通过,因为假如要计算1面币是否存在，1=1+0，所以0面币要存在*/
int i,j,k;
for(i=;i<=;i++)//1 2 5硬币
{
for(j=;j<=sum;j++)//产生的面额
for(k=;k<=num[i]&&k*p[i]+j<=sum;k++)//个数，判断是否超出sum
if(n1[j])
n2[k*p[i]+j]=;/*没有明白为什么要赋值1，怎么不是他的个数？？*/
for(j=;j<=sum;j++)
{
n1[j]=n2[j];
n2[j]=;
}
}
}
int main()
{
p[]=,p[]=,p[]=;
int i;
while(~scanf("%d%d%d",&num[],&num[],&num[])&&(num[]||num[]||num[]))
{
sum=p[]*num[]+p[]*num[]+p[]*num[];
fuction();
for(i=;i<=sum+;i++)
if(n1[i]==)
{
printf("%d\n",i);
break;
}
}
return ;
}