An Easy Task

An Easy Task

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

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.

   
   
#include<stdio.h>
int isleap(int n)
{
    if(n%4==0&&n%100!=0||n%400==0)
    {
        return 1;
    }
    return 0;
}
int main()
{
    int n,year,cases,num;
    scanf("%d",&cases);
    while(cases--)
    {
        scanf("%d%d",&year,&n);
        num=0;
       for(year;num<n;year++)
       {
           if(isleap(year))
           {
               num++;
           }
       }
        printf("%d\n",year-1);
    }
}