HDU1076 An Easy Task【日期+水题】

An Easy Task

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 25537    Accepted Submission(s): 16505

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.

问题链接：HDU1076 An Easy Task

问题简述：（略）

问题分析：

  有多个测试样例，输入y和n，y是起始年份，n是整数，求从y年开始经过n个润年后是哪一年。

程序说明：　　

题记：（略）

参考链接：（略）

AC的C语言程序如下：

/* HDU1076 An Easy Task */

#include <iostream>

using namespace std;

int leapyear(int year)
{
    return ( ((year%4==0) && (year%100!=0)) || (year%400==0) ) ? 1 : 0;
}

int main()
{
    int t, y, n, sum;

    cin >> t;
    while(t--) {
        cin >> y >> n;

        sum = leapyear(y);
        while(sum < n) {
            y++;
            sum += leapyear(y);
        }

        cout << y << endl;
    }

    return 0;
}