Description
人生来就有三个生理周期,分别为体力、感情和智力周期,它们的周期长度为23天、28天和33天。每一个周期中有一天是高峰。在高峰这天,人会在相应的方面表现出色。例如,智力周期的高峰,人会思维敏捷,精力容易高度集中。因为三个周期的周长不同,所以通常三个周期的高峰不会落在同一天。对于每个人,我们想知道何时三个高峰落在同一天。对于每个周期,我们会给出从当前年份的第一天开始,到出现高峰的天数(不一定是第一次高峰出现的时间)。你的任务是给定一个从当年第一天开始数的天数,输出从给定时间开始(不包括给定时间)下一次三个高峰落在同一天的时间(距给定时间的天数)。例如:给定时间为10,下次出现三个高峰同天的时间是12,则输出2(注意这里不是3)。
Input
输入四个整数:p, e, i和d。 p, e, i分别表示体力、情感和智力高峰出现的时间(时间从当年的第一天开始计算)。d 是给定的时间,可能小于p, e, 或 i。 所有给定时间是非负的并且小于365, 所求的时间小于21252。
当p = e = i = d = -1时,输入数据结束。
当p = e = i = d = -1时,输入数据结束。
Output
从给定时间起,下一次三个高峰同天的时间(距离给定时间的天数)。
采用以下格式:
Case 1: the next triple peak occurs in 1234 days.
注意:即使结果是1天,也使用复数形式“days”。
采用以下格式:
Case 1: the next triple peak occurs in 1234 days.
注意:即使结果是1天,也使用复数形式“days”。
Sample Input
0 0 0 0 0 0 0 100 5 20 34 325 4 5 6 7 283 102 23 320 203 301 203 40 -1 -1 -1 -1
Sample Output
Case 1: the next triple peak occurs in 21252 days. Case 2: the next triple peak occurs in 21152 days. Case 3: the next triple peak occurs in 19575 days. Case 4: the next triple peak occurs in 16994 days. Case 5: the next triple peak occurs in 8910 days. Case 6: the next triple peak occurs in 10789 days.package com.poj; import java.util.ArrayList; import java.util.Scanner; public class Main { private static final int PHTSICAL_CYCLE = 23; private static final int EMOTION_CYCLE = 28; private static final int INTELLIGENCE_CYCLE = 33; /** * @param args */ public static void main(String[] args) { Scanner in = new Scanner(System.in); ArrayList answers = new ArrayList(); while (true) { int physical = in.nextInt(); int emotion = in.nextInt(); int intelligence = in.nextInt(); int today = in.nextInt(); if ((physical == -1) && (emotion == -1) && (intelligence == -1) && (today == -1)) { break; } else { int result = caculate(physical, emotion, intelligence, today); answers.add(result); } } for (int i = 0; i < answers.size(); i++) { System.out.println("Case " + (i + 1) + ": the next triple peak occurs in " + answers.get(i) + " days."); } } private static int caculate(int physical, int emotion, int intelligence, int today) { int result = 0; int temp1 = 0; int temp2 = 0; physical = physical % PHTSICAL_CYCLE; emotion = emotion % EMOTION_CYCLE; intelligence = intelligence % INTELLIGENCE_CYCLE; for (int i = 0; i < PHTSICAL_CYCLE * EMOTION_CYCLE; i++) { temp1 = INTELLIGENCE_CYCLE * i + intelligence - physical; temp2 = INTELLIGENCE_CYCLE * i + intelligence - emotion; if ((temp1 % PHTSICAL_CYCLE == 0) && (temp2 % EMOTION_CYCLE == 0)) { result = INTELLIGENCE_CYCLE * i + intelligence; break; } } if (result <= today) { result = (result - today) + PHTSICAL_CYCLE * EMOTION_CYCLE * INTELLIGENCE_CYCLE; } else { result = result - today; } return result; } }