1328: [蓝桥杯2017初赛]日期问题 【中 / 枚举】

http://oj.ecustacm.cn/problem.php?id=1328
模拟写法： 代码太冗长了。

#include<cstring>
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int m[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
bool judge(int year)
{
	if(year%400==0|| (year%4==0&&year%100!=0) ) return true;
	else return false;
}
struct date
{
	int year;
	int month;
	int day;
}d[10];
bool cmp(date a,date b)
{
	if(a.year==b.year)
	{
		if(a.month==b.month)
		{
			return a.day<b.day;
		}
		return a.month<b.month;
	}
	return a.year<b.year;
}
int main(void)
{
	int x1,x2,x3;
	scanf("%d/%d/%d",&x1,&x2,&x3);
	int sum=x1+1900;//x1为年 x2为月 x3为日 
	int number=0;
	if(sum>=1960&&sum<=2059)
	{
		if(judge(sum))
			m[2]=29; 
		if(x2>=1&&x2<=12)
		{
			if(x3>=1&&x3<=m[x2])
			{
				d[number].year=sum;
				d[number].month=x2;
				d[number++].day=x3;
			}
		}
		m[2]=28;
	}
	sum=x1+2000;
	if(sum>=1960&&sum<=2059)
	{
		if(judge(sum))
			m[2]=29; 
		if(x2>=1&&x2<=12)
		{
			if(x3>=1&&x3<=m[x2])
			{
				d[number].year=sum;
				d[number].month=x2;
				d[number++].day=x3;
			}
		}
		m[2]=28;
	}
	
	int sum2=x3+1900;//x1为月 x2为日 x3为年 
	if(sum2>=1960&&sum2<=2059)
	{
		if(judge(sum2))
			m[2]=29; 
		if(x1>=1&&x1<=12)
		{
			if(x2>=1&&x2<=m[x1])
			{
				d[number].year=sum2;
				d[number].month=x1;
				d[number++].day=x2;
			}
		}
		m[2]=28;
	}
	sum2=x3+2000;
	if(sum2>=1960&&sum2<=2059)
	{
		if(judge(sum2))
			m[2]=29; 
		if(x1>=1&&x1<=12)
		{
			if(x2>=1&&x2<=m[x1])
			{
				d[number].year=sum2;
				d[number].month=x1;
				d[number++].day=x2;
			}
		}
		m[2]=28;
	}
	
	int sum3=x3+1900;//x1为日 x2为月 x3为年 
	if(sum3>=1960&&sum3<=2059)
	{
		if(judge(sum3))
			m[2]=29; 
		if(x2>=1&&x2<=12)
		{
			if(x1>=1&&x1<=m[x2])
			{
				d[number].year=sum3;
				d[number].month=x2;
				d[number++].day=x1;
			}
		}
		m[2]=28;
	}
	sum3=x3+2000;
	if(sum3>=1960&&sum3<=2059)
	{
		if(judge(sum3))
			m[2]=29; 
		if(x2>=1&&x2<=12)
		{
			if(x1>=1&&x1<=m[x2])
			{
				d[number].year=sum3;
				d[number].month=x2;
				d[number++].day=x1;
			}
		}
		m[2]=28;
	}
	sort(d,d+number,cmp);
	printf("%d-%02d-%02d\n",d[0].year,d[0].month,d[0].day);
	for(int i=1;i<number;i++) 
	{
		//去重 
		if( (d[i].year==d[i-1].year) && (d[i].month==d[i-1].month) && (d[i].day==d[i-1].day) )
		 	continue;
		printf("%d-%02d-%02d\n",d[i].year,d[i].month,d[i].day);
	}
	return 0;
} 

枚举写法: 操作简单，枚举所有的日期看是不是，是合法的日期，再看是不是和我们输入的日期相匹配。

#include<cstdio>
#include<iostream>
#include<string>
using namespace std; 
int m[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
int x1,x2,x3;
bool judge(int n)
{
	if(n%400==0|| (n%4==0&&n%100!=0) ) return true;
	else return false;
}
bool check(int a,int b,int c)
{
	if(a==x1&&b==x2&&c==x3)
		return true;
	return false;
}
int main(void)
{
	scanf("%d/%d/%d",&x1,&x2,&x3);
	for(int i=19600101;i<=20591231;i++)
	{
		int year=i/10000;
		int month=i%10000/100;
		int day=i%100;
		if(judge(year)) m[2]=29;
		if(month>=1&&month<=12&&day>=1&&day<=m[month])//日期和法 
		if(check(year%100,month,day)||check(month,day,year%100)||check(day,month,year%100))//匹配 
		{
			printf("%d-%02d-%02d\n",year,month,day);
		}
		m[2]=28;
	}
	return 0;
} 

#include<iostream>
#include<cstdio>
using namespace std;
int x1,x2,x3;
int m[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
bool judge(int year)
{
	if( (year%400==0) || (year%4==0&&year%100!=0) ) return true;
	else return false;
}
bool F(int x,int y,int z)
{
	if(x==x1&&y==x2&&z==x3) return true;
	else return false;
}
int main(void)
{
	scanf("%d/%d/%d",&x1,&x2,&x3);
	for(int i=19600101;i<=20591231;i++)
	{
		int year,month,day;
		year=i/10000,month=(i%10000)/100,day=i%100;
		if(judge(year)) m[2]=29;
		if(month<=12&&month>=1&&day>=1&&day<=m[month])
		if(F(year%100,month,day)||F(month,day,year%100)||F(day,month,year%100))
			printf("%d-%02d-%02d\n",year,month,day);
		m[2]=28;
	}
	return 0;
}