HDU 1076 An Easy Task

An Easy Task

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

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.

Author
Ignatius.L

题目大意:给你当前年份y，问你这年之后的m个闰年是多少年

题目思路 400年里有97个闰年

#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<cstdlib>#define OK 1#define ERROR 0using namespace std;int main(){    int t,n,y;    cin>>t;    while(t--)    {        cin>>y>>n;        while(n)        {            if(y%4 == 0&&y%100!=0||y%400 == 0)                n--;            y++;        }        cout<<y-1<<endl;    }    return 0;