蓝桥杯真题103 日期问题

最新推荐文章于 2024-07-23 22:06:37 发布

m0_67799292

最新推荐文章于 2024-07-23 22:06:37 发布

阅读量362

点赞数 7

文章标签：蓝桥杯算法职场和发展

本文链接：https://blog.csdn.net/m0_67799292/article/details/134818439

版权

#include <iostream>
using namespace std;

int a, b, c;

int judgement(int y, int m, int d) {
    y = y % 100;
    if (a == y && b == m && c == d) return 1;
    if (a == m && b == d && c == y) return 1;
    if (a == d && b == m && c == y) return 1;
    return 0;
}

int main() {
    int month[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
    scanf("%d/%d/%d", &a, &b, &c);

    for (int i = 1960; i <= 2059; i++) {
        if (i % 4 == 0) {
            month[1] = 29;
        } 
        else {
          month[1]=28;
        }

        for (int j = 1; j <= 12; j++) {
            for (int k = 1; k <= month[j - 1]; k++) {
                int ss = judgement(i, j, k);
                if (ss == 1) {
                    printf("%d-%02d-%02d\n", i, j, k);
                }
            }
        }
    }

    return 0;
}