機(jī)試常用算法和題型-日期問題

日期問題

日期問題的常規(guī)操作

/*給出年份m和一年中的第幾天,算出第幾天是幾月幾號,按照yyyy-mm-dd格式打印*/
#include <stdio.h>

int IsYeap(int year){
    if(year%400==0||(year%100!=0&&year%4==0)) return 1;
    else return 0;
}
int DayOfMonth[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
};

int main(){
    int m,n;
    while(scanf("%d %d",&m,&n)!=EOF){
        int month=0;
        for(int i=1;i<=12;i++){
            if(n>DayOfMonth[i][IsYeap(m)]){
                n=n-DayOfMonth[i][IsYeap(m)];
            }else{
                month=i;
                break;
            }
        }
        //c語言的格式輸出好處
        printf("%d-%02d-%02d\n",m,month,n);
    }
}

日期問題相差天數(shù)

//太復(fù)雜的做法    
string s1,s2,tmp;
    cin>>s1>>s2;
    if(s1>s2){
        tmp=s1;
        s1=s2;
        s2=tmp;
    }
    string yearS1=s1.substr(0,4),monS1=s1.substr(4,2),dayS1=s1.substr(6,2);
    string yearS2=s2.substr(0,4),monS2=s2.substr(4,2),dayS2=s2.substr(6,2);
    int year1,mon1,day1,year2,mon2,day2;
    year1=atoi(yearS1.c_str());
    mon1=atoi(monS1.c_str());
    day1=atoi(dayS1.c_str());
    year2=atoi(yearS2.c_str());
    mon2=atoi(monS2.c_str());
    day2=atoi(dayS2.c_str());
    cout << year1 <<" "<< mon1 <<" "<<day1<< endl;

//機(jī)制簡便的處理辦法
#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}};
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;
        while(y1<y2||m1<m2||d1<d2)
        {
            d1++;
            if(d1==month[m1][(y1%4==0&&y1%100!=0)||(y1%400==0)]+1)
            {   
                m1++;
                d1=1;
            }
            if(m1==13)
            {
                y1++;
                m1=1;
            }
            ans++;
        }
        printf("%d\n",ans);
    }
    return 0;
}

利用日期差值求星期

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
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}};
char weekname[8][15]={"","Monday","Tuesday","Wednesday","Thursday","Friday","Saturday","Sunday"};
char monthname[13][15]={"","January","February","March","April","May","June","July","August","September","October","November","December"};
int StringtoNumber(char a[])
{
    for(int i=1;i<13;++i)
        if(strcmp(a,monthname[i])==0)
            return i;
}
void NumbertoString(char a[],int ans,int flag)
{
    int b;
    if(flag==0)
        b=6-ans%7;
    else
        b=(ans+6)%7;
    if(b==0)
        b=7;
    strcat(a,weekname[b]);
}
int main()
{ 
    char m[20],week[20];
    int y1,m1,d1;
    while(scanf("%d %s %d",&d1,m,&y1)!=EOF)
    {
        int y2=2018,m2=1,d2=6,flag=0,ans=0;
        m1=StringtoNumber(m);
        memset(m,'\0',sizeof(m));
        memset(week,'\0',sizeof(week));
        if(y1>y2||(y1==y2&&m1>m2)||(y1==y2&&m1==m2&&d1>d2))
        {
            flag=1;
            swap(y1,y2);
            swap(m1,m2);
            swap(d1,d2);
        }
        while(y1<y2||m1<m2||d1<d2)
        {
            d1++;
            if(d1==month[m1][(y1%4==0&&y1%100!=0)||(y1%400==0)]+1)
            {   
                m1++;
                d1=1;
            }
            if(m1==13)
            {
                y1++;
                m1=1;
            }
            ans++;
        }
        NumbertoString(week,ans,flag);
        printf("%s\n",week);
    }
    return 0;
}
?著作權(quán)歸作者所有,轉(zhuǎn)載或內(nèi)容合作請聯(lián)系作者
【社區(qū)內(nèi)容提示】社區(qū)部分內(nèi)容疑似由AI輔助生成,瀏覽時請結(jié)合常識與多方信息審慎甄別。
平臺聲明:文章內(nèi)容(如有圖片或視頻亦包括在內(nèi))由作者上傳并發(fā)布,文章內(nèi)容僅代表作者本人觀點,簡書系信息發(fā)布平臺,僅提供信息存儲服務(wù)。

相關(guān)閱讀更多精彩內(nèi)容

友情鏈接更多精彩內(nèi)容