英语题翻译8

Holding Bin-Laden Captive! | JXNUOJ

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! ”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 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 the minimum positive value that one cannot pay with given coins, one line for one case.

翻译：

我们都知道本拉登是一个臭名昭著的恐怖分子，并且他已经消失了很长时间。但是近来，据报道，他藏在中国杭州。哦，老天爷，多么可怕！兄弟们，不要害怕。尽管他藏在中国杭州的一个洞穴里，他也不敢出来。拉登近年来非常无聊以至于他沉浸在数学问题中，而且他说，如果有人能解决他的问题，他将会投降！哈哈！很显然，拉登对他的智商非常自信！但是，他的问题是什么？给一些中国硬币（有三种面值--1，2，5），并且它们的数量分别是num_1,num_2,num_5。请输出用给定的硬币不能支付的最小值。你，最棒的ACMer，应该能够轻松的解决这个问题，不要忘记从布什那里拿走25000000美元！

输入包含多个测试用例。每个测试用例包含3个正整数num_1,num_2和num_5（0<=num_i<=1000）。包含0 0 0的测试用例将会终止输入，而且这组测试用例不被处理。

输出一个人不能用给定的硬币支付的最小正值，一行一个测试用例的结果。