biorhythms.java

来自「PKU中一些数据结构基本算法题的java实现」· Java 代码 · 共 48 行

package PKU;
import java.util.Scanner;


/**
 * ID:1006
 * 
 * @author yhm
 *
 */
public class Biorhythms {
	public static void main(String args[]) throws Exception {
		Scanner cin = new Scanner(System.in);
		int i = 0;
		while(cin.hasNextInt()){
			i++;
			int[] array = new int[4];
			int j=0;
			while(j<4){
				array[j] = cin.nextInt();
				j++;
			}
			if(array[0]==-1) break;
			System.out.println("Case "+i+": the next triple peak occurs in "+findNextDay(array)+" days.");
		}
	}
	
	static public int findNextDay(int[] array){
		int a,b,c;
		for(a=array[3]+1;a<21252;a++){
			if((a-array[0])%23==0){
				break;
			}
		}
		for(b=a;b<21252;b+=23){
			if((b-array[1])%28==0){
				break;
			}
		}
		for(c=b;c<21252;c+=23*28){
			if((c-array[2])%33==0){
				break;
			}
		}
		return c-array[3];
	}
}