HDOJ 1076 An Easy Task(闰年计算)
发布日期:2021-06-29 13:33:07 浏览次数:3 分类:技术文章

本文共 1255 字,大约阅读时间需要 4 分钟。

Problem Description

Ignatius was born in a leap year, so he want to know when he could hold his birthday party. Can you tell him?

Given a positive integers Y which indicate the start year, and a positive integer N, your task is to tell the Nth leap year from year Y.

Note: if year Y is a leap year, then the 1st leap year is year Y.

Input

The input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.
Each test case contains two positive integers Y and N(1<=N<=10000).

Output

For each test case, you should output the Nth leap year from year Y.

Sample Input

3
2005 25
1855 12
2004 10000

Sample Output

2108
1904
43236

Hint:

We call year Y a leap year only if (Y%4==0 && Y%100!=0) or Y%400==0.

题意就是:输入一个年份year和一个n,求这个year之后的第n个闰年,

如果year是闰年,则算第一个闰年。

直接暴力做,并没有超时。

import java.util.Scanner;public class Main{    public static void main(String[] args) {        Scanner sc = new Scanner(System.in);        int t = sc.nextInt();        while(t-->0){            int year = sc.nextInt();            int n = sc.nextInt();            int nyear = 0;            if((year%4==0&&year%100!=0)|(year%400==0)){                nyear=1;            }//如果year是闰年,nyear就加一            while(nyear

转载地址:https://chenhx.blog.csdn.net/article/details/51037949 如侵犯您的版权,请留言回复原文章的地址,我们会给您删除此文章,给您带来不便请您谅解!

上一篇:HDOJ 1163 Eddy's digital Roots(九余数定理的应用)
下一篇:HDOJ 1070 Milk(水题,考英文的)

发表评论

最新留言

第一次来,支持一个
[***.219.124.196]2024年04月11日 00时10分21秒

关于作者

    喝酒易醉,品茶养心,人生如梦,品茶悟道,何以解忧?唯有杜康!
-- 愿君每日到此一游!

推荐文章