POJ 1006

最新推荐文章于 2018-04-18 00:08:20 发布

SSWDG123456

最新推荐文章于 2018-04-18 00:08:20 发布

阅读量518

点赞数

分类专栏： OJ 文章标签： poj

本文链接：https://blog.csdn.net/SSWDG123456/article/details/27240343

版权

OJ 专栏收录该内容

8 篇文章 0 订阅

订阅专栏

这道题难度在于数学通式的转换，如果不理解中国剩余定理，这道题做出来感觉也比较水，代码如下：

import java.util.Scanner;

public class poj1006 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int loop = 1;
		while (true) {
			int p = in.nextInt();
			int e = in.nextInt();
			int i = in.nextInt();
			int d = in.nextInt();
			if (p == -1 && e == -1 && i == -1 && d == -1) {
				break;
			}
			int days = (5544 * p + 14421 * e + 1288 * i - d + 21252) % 21252;
			if (days <= 0) {
				System.out.println("Case " + loop
						+ ": the next triple peak occurs in " + (21252 - days)
						+ " days.");
			} else {
				System.out
						.println("Case " + loop
								+ ": the next triple peak occurs in " + days
								+ " days.");
			}
			loop++;
		}
	}
}