#include<stdio.h>
int main(){
int m,n,result=0,y,i,leap,day;
int mm[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
scanf("%d %d",&m,&n);
for(y=m;y<=n;y++){
leap=((y%4==0&&y%100!=0)||(y%400==0))?1:0;
for(i=1;i<=12;i++){
if(leap==1){
mm[2]=29;
}
for(day=1;day<=mm[i];day++){
if(y==day%10*1000+day/10*100+i%10*10+i/10){
printf("%d.%02d.%02d\n",y,i,day);
result=1;
}
}
}
}if(result==0){
printf("None");
}return 0;
}
用数组实现pta上的求完全对称日,做的时候查了csdn发现没有用数组做的,我就发一下吧,各位期末复习加油!!