hdu An Easy Task

An Easy Task

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 22   Accepted Submission(s) : 21

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

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

代码：

#include <iostream>
using namespace std;
int main()
{
    int n,m,i,k,l,s;
    cin>>n;
    while(n--)
    {
      cin>>m>>s;
      int year=0;
      for(i=m;s>0;i++)
      {
          if((i%4==0&&i%100!=0)||i%400==0)
          {
          year=i;
          s--;
          }
      }
      cout<<year<<endl;
    }
    return 0;
}