zoukankan      html  css  js  c++  java
  • CF 304B——Calendar——————【年月日计算】

    B - Calendar
    Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u
    Appoint description: 

    Description

    Calendars in widespread use today include the Gregorian calendar, which is the de facto international standard, and is used almost everywhere in the world for civil purposes. The Gregorian reform modified the Julian calendar's scheme of leap years as follows:

    Every year that is exactly divisible by four is a leap year, except for years that are exactly divisible by 100; the centurial years that are exactly divisible by 400 are still leap years. For example, the year 1900 is not a leap year; the year 2000 is a leap year.

    In this problem, you have been given two dates and your task is to calculate how many days are between them. Note, that leap years have unusual number of days in February.

    Look at the sample to understand what borders are included in the aswer.

    Input

    The first two lines contain two dates, each date is in the format yyyy:mm:dd (1900 ≤ yyyy ≤ 2038 and yyyy:mm:dd is a legal date).

    Output

    Print a single integer — the answer to the problem.

    Sample Input

    Input
    1900:01:01
    2038:12:31
    Output
    50768
    Input
    1996:03:09
    1991:11:12
    Output
    1579


    题目大意:问你在这两个时间内有多少天。

    #include<bits/stdc++.h>
    using namespace std;
    int LeapY[12]={31,29,31,30,31,30,31,31,30,31,30,31};
    int ULeapY[12]={31,28,31,30,31,30,31,31,30,31,30,31};
    int sum;
    bool judge(int year){
        if(year%400==0||(year%4==0&&year%100!=0))
            return true;
        return false;
    }
    int main(){
        int i,yst,mst,dst,yen,men,den,stsum,tmp;
        while(scanf("%d:%d:%d",&yst,&mst,&dst)!=EOF){
            scanf("%d:%d:%d",&yen,&men,&den);
            if(yst>yen){
               swap(yst,yen);
               swap(mst,men);
               swap(dst,den);
            }
            else if(yst==yen){
                if(mst>men){
                    swap(mst,men);
                    swap(dst,den);
                }else if(mst==men){
                    if(dst>den){
                      swap(dst,den);
                    }
                }
            }
            sum=stsum=0;
            if(judge(yen)){
                for(i=1;i<men;i++){
                    sum+=LeapY[i-1];
                }
                sum+=den;
            }else{
                for(i=1;i<men;i++){
                    sum+=ULeapY[i-1];
                }
                sum+=den;
            }
            if(judge(yst)){
                for(i=1;i<mst;i++){
                   stsum+=LeapY[i-1];
                }
                stsum+=dst;
                sum=sum+366-stsum;
            }else{
                for(i=1;i<mst;i++){
                    stsum+=ULeapY[i-1];
                }
                stsum+=dst;
                sum=sum+365-stsum;
            }
            for(i=yst+1;i<yen;i++){
                if(judge(i)){
                    sum+=366;
                }else{
                    sum+=365;
                }
            }
            if(yst==yen){
                if(judge(yst)){
                    sum-=366;
                }else{
                    sum-=365;
                }
            }
            printf("%d
    ",sum);
        }
        return 0;
    }
    /*
    1999:03:02
    1999:03:01
    2000:03:03
    2000:03:01
    
    1999:03:05
    1999:05:05
    
    2000:03:05
    2000:05:05
    
    1999:01:01
    1999:01:01
    
    
    */
    

      

  • 相关阅读:
    2008年具有高校自主选拔录取资格的考生名单 江苏版
    OpenGL ES 2.0 for iPhone Tutorial
    Mathematica三维点插值算法(高维插值,多维插值)
    Mathematica颜色系,你喜欢哪一个?
    Khronos EGL and Apple EAGL
    ssh 免密码登陆配置
    2008年高考招生:北京大学自主选拔录取资格考生名单
    PlotLegends 应用
    Mathematica 如何更改文档的样式
    您为何而工作?
  • 原文地址:https://www.cnblogs.com/chengsheng/p/4540556.html
Copyright © 2011-2022 走看看