hdu 1076

An Easy Task

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

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

32005 251855 122004 10000

Sample Output

2108190443236
#include<stdio.h>int isleap(int x){if(x%400==0 || x%4==0 && x%100!=0)return 1;elsereturn 0;}int main(){int t,y,n,num,i;scanf("%d",&t);while(t--){scanf("%d%d",&y,&n);if(isleap(y))num=1;elsenum=0;while(num<n){y+=1;if(isleap(y))num++;}printf("%d\n",y);}return 0;}