学长只能帮你到这儿了00-HDU1076

来源:互联网 发布:云计算特征 编辑:程序博客网 时间:2024/05/01 15:29

An Easy Task

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

Problem Description

Ignatius was born in a leap year, so he want to know whenhe could hold his birthday party. Can you tell him?

Given a positive integers Y which indicate the start year, and a positiveinteger 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 ofthe input is a single integer T which is the number of test cases. T test casesfollow.
Each test case contains two positive integers Y and N(1<=N<=10000).

 

 

Output

For each test case, you should output the Nth leap yearfrom year Y.

 

 

Sample Input

3

2005 25

1855 12

2004 10000

 

 

Sample Output

2108

1904

43236

 

Hint

 

We call yearY a leap year only if (Y%4==0 && Y%100!=0) or Y%400==0.

 

#include <stdio.h>
#include <stdlib.h>
 
int main()
{
    long t,y,n,k;
    scanf("%d",&t);
    for(k=0;k<t;k++){
        scanf("%d%d", &y, &n);
        if(y%4==0 && y%100 != 0 || y%400 == 0)n--;
        while(n>0){
            y++;
            if(y%4==0 && y%100 != 0 || y%400 == 0)n--;
        }
        printf("%d\n",y);
    }
}

原创粉丝点击