Problems Description
<p class="p0"> <span style="font-size:10.5pt;font-family:'宋体';">小张是软件项目经理,他带领<span>3</span><span>items开发组。工期紧,今天都在加班呢。为鼓舞士气,小张打算给每items组发一袋核桃(据传言能补脑)。他的要求是: </span><span>1. </span><span>各组的核桃数量必须相同 </span><span>2. </span><span>各组内必须能平points核桃(当然是不能打碎的) </span><span>3. </span><span>尽量提供满足</span><span>1,2</span><span>条件的最小数量(节约闹革命嘛) </span></span> </p>
Input格式
<p> <span><span>程序从标准输入读入: </span><span><span>a b c a,b,c</span></span><span><span>都是正整数,表示每items组正在加班的人数,用空格points开(</span></span><span><span>a,b,c<30</span></span><span><span>) </span></span></span> </p>
Output格式
<span><span>程序输出: 一items正整数,表示每袋核桃的数量。 例如: User输入: </span><span><span>245 </span></span><span><span>程序输出: </span></span><span><span>20 </span></span><span><span>再例如: User输入: </span></span><span><span>311 </span></span><span><span>程序输出: </span></span><span><span>3</span></span><span> </span></span>
Sample
Sample Input 1
3 1 1
Sample Output 1
3
Submit Code
请先Login后Submit
🤖 AI 解题助手
OpenRouter
就绪