hdu-oj 1076 An Easy Task

An Easy Task

Time Limit: 2000//Other1000 MS (Javas)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 14063    Accepted Submission(s): 8991

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


  
  

闰年判断：(Y%4==0 && Y%100!=0) or Y%400==0.

附代码：

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