hdu1076 An Easy Task(C语言)

C语言实现:找出第N个闰年
该博客介绍了如何使用C语言解决一个ACM问题,即从给定的起始年份Y开始,找到第N个闰年。代码中包含了一个简单的while循环,根据闰年的判断条件逐年检查并减小计数。最后输出结果。
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.
 

Author
Ignatius.L



C语言AC代码
#include<stdio.h>
int main()
{
    int n;
    scanf("%d",&n);
    while(n--)
    {
        int year,sum;
        scanf("%d%d",&year,&sum);
        while(sum)
        {
            if(year%4==0)
            {
                if(year%4==0&&year%100!=0||year%400==0)
                    sum=sum-1;
            }
            year++;
        }
        printf("%d\n",year-1);
    }
    return 0;
}
思路:闰年的判断条件题目已经讲清楚了,注意一下当前年份是不是闰年就可以了

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值