ccf 节日

本次刷题错误:计算某一天是周几的时候,需要将每一天往后移动一天,因为1850/1/1是周二,顾对7取模之前应该先加一

#include<bits/stdc++.h>

using namespace std;

int isRun(int x) {
    if(x%400==0||(x%4==0&&x%100!=0)) return 1;
    return 0;
}

int day[7] = {1,2,3,4,5,6,7};

int mon1[12]={31,28,31,30,31,30,31,31,30,31,30,31};
int mon2[12]={31,29,31,30,31,30,31,31,30,31,30,31};

int day_1850[300];

int main() {
    int a,b,c,y1,y2;
    cin>>a>>b>>c>>y1>>y2;
    day_1850[0]=0;
    for(int i=1;i<=200;i++) {
        if(isRun(1850+i-1)) day_1850[i]=day_1850[i-1]+366;
        else day_1850[i]=day_1850[i-1]+365;
    }
    
    for(int i=y1;i<=y2;i++) {
        int days=day_1850[i-1850];
        int firday;
        if(isRun(i)) {
            for(int j=1;j<a;j++) {
                days+=mon2[j-1];
            }
            firday = day[(days+1)%7];
            int date=0;
            if(firday>c) {
                date=7-firday+1+7*(b-1)+c;
            } else {
                if(b==1){
                date = c-firday+1;
            } else {
                date = 7-firday+1+7*(b-2);
                date+=c;
            }
            }
            if(date>mon2[a-1]) cout<<"none"<<endl;
            else
            printf("%d/%02d/%02d\n",i,a,date);
        } else {
            for(int j=1;j<a;j++) {
                days+=mon1[j-1];
            }
            firday = day[(days+1)%7];
            int date=0;
            if(firday>c) {
                date=7-firday+1+7*(b-1)+c;
            } else {
                if(b==1){
                date = c-firday+1;
            } else {
                date = 7-firday+1+7*(b-2);
                date+=c;
            }
            }
            if(date>mon1[a-1]) cout<<"none"<<endl;
            else
            printf("%d/%02d/%02d\n",i,a,date);
            }
            
        }
    return 0;
}

简单解法:(以后关于日期的题可以以此为模板)

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

int months[13] = {
    0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31
};

int is_leap(int year)
{
    if (year % 4 == 0 && year % 100 || year % 400 == 0)
        return 1;
    return 0;
}

int get_days(int year, int month)  // 求某月有多少天
{
    if (month == 2) return months[month] + is_leap(year);
    return months[month];
}

int main()
{
    int a, b, c, y1, y2;
    cin >> a >> b >> c >> y1 >> y2;
    int days = 0;
    for (int year = 1850; year <= y2; year ++ )
        for (int month = 1; month <= 12; month ++ )
        {
            if (year >= y1 && month == a)
            {
                int w = (1 + days) % 7, cnt = 0;
                for (int d = 1; d <= get_days(year, month); d ++ )
                {
                    if (w == c - 1)
                    {
                        cnt ++ ;
                        if (cnt == b)
                        {
                            printf("%04d/%02d/%02d\n", year, month, d);
                            break;
                        }
                    }
                    w = (w + 1) % 7;
                }
                if (cnt < b) puts("none");
            }
            days += get_days(year, month);
        }

    return 0;
}

  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值