蓝桥杯--日期统计

目录

一、题目

二、解决代码

三、代码分析

​四、另一种思路

五、关于set文章推荐

一、题目

二、解决代码

#include 
using namespace std;
int main() {
	int arr[100] = { 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
	               };
	int month[12] = { 31,28,31,30,31,30,31,31,30,31,30,31 };
	int monthChecke[12] = { 0 };//记录月份访问状态防止重复遍历
	int flag=0;
	int jilu[100000];
	int date_sum;
	for (int i = 0; i