zoukankan      html  css  js  c++  java
  • 3.4日期处理

    3.4日期处理

    http://www.codeup.cn/problem.php?cid=100000578&pid=0

    #include<cstdio>
    int month[13][2] = {    // 平年和闰年的每个月的天数 
        {0,0},
        {31,31},
        {28,29},
        {31,31},
        {30,30},
        {31,31},
        {30,30},
        {31,31}, 
        {31,31},
        {30,30},
        {31,31},
        {30,30},
        {31,31}
    };
    
    bool isLeap(int year){  //判断是否是闰年 
        return(year % 4 == 0 && year % 100 != 0) || (year % 400 == 0);
    }
    
    int main(){
        int time1, y1, m1, d1;
        int time2, y2, m2, d2;
        while(scanf("%d%d", &time1, &time2) != EOF){
            if(time1 > time2){
                int temp = time1;
                time1 = time2;
                time2 = temp;
            }
            y1 = time1 / 10000, m1 = time1 % 10000 / 100, d1 = time1 % 100;
            y2 = time2 / 10000, m2 = time2 % 10000 / 100, d2 = time2 % 100;
            int ans = 1;        //记录结果
    
            //第一个日期没有达到第二个日期时进行循环
            //即 !((y1 == y2) && (m1 == m2) && (d1 = d2))
            while(y1 < y2 || m1 < m2 || d1 < d2){
    
                d1++;           //天数加 1
    
                if(d1 == month[m1][isLeap(y1)] + 1){    //满当月天数
                    m1 ++;      //日期变为下个月的 1 号
                    d1 = 1; 
                } 
    
                if(m1 == 13){   //月份满 12 个月
                    y1++;
                    m1 = 1; 
                }
                ans++;          //累计 
            } 
            printf("%d
    ", ans);    //输出结果 
        }
        return 0;
    }
    
  • 相关阅读:
    [IOI2013]Dreaming
    Lost Cows
    Mobile Service
    [POI2005]Bank notes
    [CTSC2007]动物园zoo
    [CF1093F]Vasya and Array
    [雅礼集训 2017 Day1]市场
    [APIO2014]序列分割
    [CEOI2004]锯木厂选址
    [APIO2010]特别行动队
  • 原文地址:https://www.cnblogs.com/lingr7/p/9392989.html
Copyright © 2011-2022 走看看