日期问题常用模板＞.＜（简单日期问题一网打尽）...

日期问题一网打尽>.<

前言

近来做蓝桥杯题目，遇到了几次日期问题后，将自己常用的模板和大家分享一下。

判断是否为合法日期

int days[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
bool check_valid(int date)//例如20220211
{
    int year = date/10000;
    int month = date/100%100;
    int day = date%100;
    // 判断
    if(month<=0 || month>12) return false;
    if(day==0 || month != 2 && day>days[month]) return false;
    
    if(month == 2)
    {
        int leap = (year%4==0 && year%100 != 0 || year%400==0);
        if(day > 28+leap) return false;
    }
    return true;
}

得到某年某月的天数

int get_days(int year, int month)
{
	if(month!=2) return days[month];
	else
	{
		//2月 要判断是否为闰年
		int leap=(year%4==0 && year%100!=0 || year%400==0);
		return 28+leap;
	}
}

给定年月日，经过n天后对应的日期

void pass(int y,int m,int d,int n)
{
	while(n--)
	{
		d++;
		if(d>get_days(y,m)) m++,d=1;
		if(m>12) y++,m=1;
	}
	//格式化输出 02 不够两位前面补0
	printf("%d-%02d-%02d\n",y,m,d);
}

日期问题

AcWing 466.回文日期

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int days[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
//判断日期是否为回文数
bool check_hw(int x) 
{
    int a=x/10000;
    int t=a;
    while(t)
    {
        a=a*10+t%10;
        t=t/10;
    }
    if(a==x) return true;
    else return false;
}
//判断是否为合法日期
bool check_valid(int date)//例如20220211
{
    int year = date/10000;
    int month = date/100%100;
    int day = date%100;
    // 判断
    if(month<=0 || month>12) return false;
    if(day==0 || month != 2 && day>days[month]) return false;
    
    if(month == 2)
    {
        int leap = (year%4==0 && year%100 != 0 || year%400==0);
        if(day > 28+leap) return false;
    }
    return true;
}
int main()
{
    int date1, date2,res=0;
    cin >> date1 >> date2;
    for(int i=date1;i<=date2;i++)
    {
        if(check_valid(i) && check_hw(i))
            res++;
    }
    cout<<res<<endl;
    return 0;
}

AcWing 1229.日期问题

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int days[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
bool check(int year,int month,int day)//判断是否为合法日期
{

    if(month==0 || month>12) return false;
    //这里先不考虑 2月
    if(day==0 || month!=2 && day>days[month]) return false;

    if(month==2)
    {
        int leap= year%4==0 && year%100!=0 || year%400==0;
        if(day>28+leap) return false;
    }
    return true;
}


int main()
{
    int a,b,c;
    scanf("%d/%d/%d",&a,&b,&c);
    for(int i=19600101;i<=20591231;i++)
    {
        int year = i/10000;
        int month = i/100%100;
        int day=i%100;
        if(check(year,month,day))
        {
            if(year%100==a && month==b && day==c || //年月日
               year%100==c && month==b && day==a|| //日月年
               year%100==c && month==a && day==b)//月日年 
            printf("%d-%02d-%02d\n",year,month,day); //02d 不够两位前面补0
        }
    }
    return 0;
}

AcWing 3218.日期计算

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int days[]={0,31,28,31,30,31,30,31,31,30,31,30,31};
int get_days(int year,int month)
{
    if(month!=2) return days[month];
    else
    {
        int leap=(year%4==0 && year%100!=0 || year%400==0);
        return 28+leap;
    }
}
void pass(int y,int m,int d,int n)
{
    while (n -- )
    {
        d++;
        if(d>get_days(y,m)) m++,d=1;
        if(m>12) y++,m=1;
    }
    cout<<m<<endl<<d<<endl;
}
int main()
{
    int y,n;
    cin>>y>>n;
    int m=1,d=0;
    pass(y,m,d,n);
    
    return 0;
}

AcWing 2867.回文日期（蓝桥杯）

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int days[13]={0,31,30,31,30,31,30,31,31,30,31,30,31};
bool check_valid(int date)
{
    int year = date%10000;
    int month = date/100%100;
    int day = date%100;
    
    if(month<=0 || month>12) return false;
    if(day<0 || month!=2 && day>days[month]) return false;
    
    if(month==2)
    {
        int leap = (year%4==0 && year%100!=0 || year%400==0);
        if(day> 28+leap) return false;
    }
    return true;
}
bool check_hw(int date)
{
    int x=date/10000;
    int t=x;
    while(t)
    {
        x=x*10+t%10;
        t/=10;
    }
    if(x==date) return true;
    else return false;
}
bool check_hwAB(int date)
{
    int year = date%10000;
    int month = date/100%100;
    int day = date%100;
    
    if(month%10==day%10 && month/10==day/10 && month%10!=day/10)
        return true;
    return false;
}
int main()
{
    int date;
    cin>>date;
    bool st1,st2;
    int ans1,ans2;
    for(int i=date+1;;i++)
    {
        if(check_valid(i))
        {
            if(!st1 && check_hw(i)) st1=true,ans1=i;
            if(!st2 && check_hw(i) && check_hwAB(i)) st2=true,ans2=i;
        }
        if(st1 && st2) break; //找到两个解 退出循环
    }
    cout<<ans1<<endl<<ans2<<endl;
    return 0;
}