杭电 acm 1076

多校综合排名前25名的学校请发送邮件到HDUACM@QQ.COM,告知转账信息（支付宝或者卡号）

An Easy Task Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 14221    Accepted Submission(s): 9086 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 00 2004 10 0   Sample Output 2108 1904 4323 6 Hint We call year Y a leap year only if (Y%4==0 && Y%100!=0) or Y%400==0.   AC代码： #include<stdio.h> int main(){ int m,n,y,i,t,number; while(scanf("%d",&m)!=EOF){ for(i=0;i<m;i++){ scanf("%d%d",&y,&n); number=0; while(1){ if((y%4==0&&y%100!=0)||y%400==0){ number++; } if(number==n){ printf("%d\n",y); break; } y++; } } } }