Python代码
根据此文章思路改写为python代码;
https://blog.csdn.net/weixin_68629353/article/details/136271767

# 初始化数组
array = [5, 6, 8, 6, 9, 1, 6, 1, 2, 4, 9, 1, 9, 8, 2, 3, 6, 4, 7, 7,
    5, 9, 5, 0, 3, 8, 7, 5, 8, 1, 5, 8, 6, 1, 8, 3, 0, 3, 7, 9,
    2, 7, 0, 5, 8, 8, 5, 7, 0, 9, 9, 1, 9, 4, 4, 6, 8, 6, 3, 3,
    8, 5, 1, 6, 3, 4, 6, 7, 0, 7, 8, 2, 7, 6, 8, 9, 5, 6, 5, 6,
    1, 4, 0, 1, 0, 0, 9, 4, 8, 0, 9, 1, 2, 8, 5, 0, 2, 5, 3, 3]

# 每个月的天数
days_in_month = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]

# 初始化答案变量
ans = 0

# 遍历每个月
for month in range(1, 13):  # i为月份,最大取12
    # 遍历每个月的每一天
    for day in range(1, days_in_month[month] + 1):  # j为日数,最大取days_in_month对应数值
        # 构造日期序列
        date_seq = [2, 0, 2, 3, month // 10, month % 10, day // 10, day % 10]

        # 检查日期序列是否存在于数组中
        k = 0
        for num in array:
            if num == date_seq[k]:
                k += 1
                if k == 8:
                    ans += 1
                    break  # 找到完整的序列，跳出内层循环

# 输出结果
print(ans)