UVA12439 February 29【日期计算】

本文介绍了一种计算两个特定日期之间闰日数量的方法。通过分析闰年的规则,利用简单的数学计算确定给定区间内2月29日出现的次数。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

    It is 2012, and it’s a leap year. So there is a “February 29” in this year, which is called leap day. Interesting thing is the infant who will born in this February 29, will get his/her birthday again in 2016, which is another leap year. So February 29 only exists in leap years. Does leap year comes in every 4 years? Years that are divisible by 4 are leap years, but years that are divisible by 100 are not leap years, unless they are divisible by 400 in which case they are leap years.
    In this problem, you will be given two different date. You have to find the number of leap days in between them.
Input
The first line of input will contain T (≤ 500) denoting the number of cases.
    Each of the test cases will have two lines. First line represents the first date and second line represents the second date. Note that, the second date will not represent a date which arrives earlier than the first date. The dates will be in this format — ‘month day, year’. See sample input for exact format. You are guaranteed that dates will be valid and the year will be in between 2 ∗ 103 to 2 ∗ 109. For your convenience, the month list and the number of days per months are given below. You can assume that all the given dates will be a valid date.
Output
For each case, print the case number and the number of leap days in between two given dates (inclusive).
Note:
The names of the months are {“January”, “February”, “March”, “April”, “May”, “June”, “July”, “August”, “September”, “October”, “November” and “December”}. And the numbers of days for the months are {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30 and 31} respectively in a non-leap year. In a leap year, number of days for February is 29 days; others are same as shown in previous line.
Sample Input
4
January 12, 2012
March 19, 2012
August 12, 2899
August 12, 2901
August 12, 2000
August 12, 2005
February 29, 2004
February 29, 2012
Sample Output
Case 1: 1
Case 2: 0
Case 3: 1
Case 4: 3

问题链接UVA12439 February 29
问题简述:给定若干对日期,计算这两个日期之间有多少个2月29日?
问题分析:简单的日期计算问题,不解释。根据闰年判定原理,直接用公式来计算是最佳方法。
程序说明:(略)
参考链接:(略)
题记:(略)

AC的C++语言程序如下:

/* UVA12439 February 29 */

#include <bits/stdc++.h>

using namespace std;

string MON[] = {"", "January", "February", "March", "April", "May", "June", "July",
        "August", "September", "October", "November", "December"};

int main()
{
    int t;
    cin >> t;
    for (int k = 1; k <= t; k++) {
        int m1, d1, y1, m2, d2, y2;
        string mon1, mon2, s;

        cin >> mon1 >> d1 >> s >> y1;
        cin >> mon2 >> d2 >> s >> y2;

        for (m1 = 1; m1 <= 12; m1++)
            if (mon1 == MON[m1]) break;
        for (m2 = 1; m2 <= 12; m2++)
            if (mon2 == MON[m2]) break;
        if (y1 > y2 || (y1 == y2 && m1 > m2)) {
            swap(y1, y2);
            swap(m1, m2);
            swap(d1, d2);
        }
        if(m1 > 2) y1++;
        if(m2 < 2 || (m2 == 2 && d2 < 29)) y2--;
        y1--;

        int t1 = y1 / 4 - y1 / 100 + y1 / 400;
        int t2 = y2 / 4 - y2 / 100 + y2 / 400;

        cout << "Case " << k << ": " << t2 - t1 << endl;
    }

    return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值