日常练习—日期问题

#include <iostream>
#include <stdio.h>
#include<algorithm>
using namespace std;

struct Node{
 int year,month,day;
}ans[5];
int ant=0;
int month[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
int isleap(int y){
 if((y%4==0 && y%100!=0) || y%400==0) return 1;
 return 0;
}
void func(int y,int m,int d){
 if(y>=0 && y<=59) y +=2000;
 if(y>=60 && y<=99) y += 1900;
 
 if(m>12 || m <1) return;
 if(d>31 ||d<1) return;
 if(m==2 && d>month[m]+isleap(y)) return;
 else if(m!=2 && d>month[m]) return;
 
 ans[ant].year = y;
 ans[ant].month = m;
 ans[ant].day = d;
 ant++; 
} 
bool cmp(Node a,Node b){
 if(a.year != b.year) return a.year<b.year;
 if(a.month != b.month) return a.month<b.month;
 return a.day<b.day;
}
int main(){
 char a[8];cin>>a;
 int AA = (a[0]-'0')*10 + (a[1]-'0');
 int BB = (a[3]-'0')*10 + (a[4]-'0');
 int CC = (a[6]-'0')*10 + (a[7]-'0');
 
 func(AA,BB,CC);
 func(BB,CC,AA);
 func(CC,BB,AA);
 sort(ans,ans+ant,cmp);
 
 for(int i=0;i<ant;i++){
  if(i>0 && ans[i-1].year == ans[i].year && \
  ans[i-1].month == ans[i].month && ans[i-1].day == ans[i].day) continue;
  printf("%02d-%02d-%02d\n", ans[i].year, ans[i].month, ans[i].day);
  
 }
 return 0;
}