日期问题——蓝桥杯

#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<string.h>
#include<math.h>
#include<iomanip>
#include<string>
#include<sstream>
#include<bitset>
#include<queue>
#include<set>
using namespace std;
#define QUICK ios::sync_with_stdio(false), cin.tie(0),cout.tie(0); //quickly! quickly!
const int N=110;

int day[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
int leapsday[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};

int isleapyear(int y)
{
	if((y%4==0&&y%100!=0)||y%400==0)
	{
		return 1;
	}
	return 0;
}


int check(int i2)
{
	int d=i2%100;
	i2/=100;
	int moth=i2%100;
	int year=i2/100;
	if(isleapyear(year))
	{
		if(moth<=12&&moth>0)
		{
			if(d<=leapsday[moth])
			{
				return 1;
			}
		}
		return 0;
		
	}
	else
	{
		if(moth<=12&&moth>0)
		{
			if(d<=day[moth])
			{
				return 1;
			}
		}
	}
	
	return 0;
}



void print(int i)
{
		int d=i%100;
	i/=100;
	int moth=i%100;
	int year=i/100;
	printf("%d-%02d-%02d\n",year,moth,d);
}



set<int> ans;
int main()
{
	QUICK;
	int a,b,c;
	scanf("%d/%d/%d",&a,&b,&c);
	for(int i=19600101;i<=20591231;i++)
	{
		if(check(i))
		{
			int i1=i;
			cout<<i<<endl;
			int d=i%100;
         	i/=100;
			int moth=i%100;
			i/=100;
			int year=i%100;
			if(year==a&&moth==b&&d==c)
			{
				ans.insert(i1);
			}
				if(year==c&&moth==a&&d==b)
			{
				ans.insert(i1);
			}
				if(year==c&&moth==b&&d==a)
			{
				ans.insert(i1);
			}
			
			
		}
	
	}
	for(set<int>::iterator it=ans.begin();it!=ans.end();it++)
	{
		print(*it);
	}
}