CCF CSP 201503-3节日![在这里插入图片描述](https://img-blog.csdnimg.cn/2020112516441324.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQ0MDkxNjgx,size_16,color_FFFFFF,t_70#pic_center)
#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
const int maxn = 205,begin = 1850,firstday = 2;
int dayNum[maxn];
int month[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int main(){
int a,b,c,y1,y2;
cin>>a>>b>>c>>y1>>y2;
c %= 7;
if(y1 > y2){
swap(y1, y2);
}
for(int i = 0; i < maxn; i++){
dayNum[i] = dayNum[i-1] + 365;
if((i+begin)%400 == 0 || ((i+begin) % 4 == 0 && (i+begin) % 100 != 0)){
dayNum[i] ++;
}
}
int mon = 0;
for(int i = 1; i < a; i++){
mon += month[i];
}
for(int i = y1; i <= y2; i++){
int dd = mon + firstday, ans = 1,m = month[a];
if(i%400 == 0 || (i % 4 == 0 && i % 100 != 0)){
m++;
if(a > 2)
dd++;
}
if(i > begin){
dd = (dd + dayNum[i - begin - 1])%7 ;
}
else{
dd = dd % 7;
}
ans = (b - 1) * 7 + 1;
if(c < dd){
ans += c-dd+7;
}
else if(c > dd){
ans += c - dd;
}
if(ans <= m){
printf("%04d/%02d/%02d\n",i,a,ans);
}
else{
cout<<"none"<<endl;
}
}
return 0;
}