蓝桥杯——模拟法——日期问题17G

//对输入数据进行合理排列得出合理时间猜测
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int days[14] = { 0,31,28,31,30,31,30,31,31,30,31,30,31 };
int leapdays[14] = { 0,31,29,31,30,31,30,31,31,30,31,30,31 };
int i;
int data[4][4] = { {0,0,0,0},
	{0,0,0,0},
	{0,0,0,0},
	{0,0,0,0} };
bool leapyear(int y) {
	return (y % 4 == 0 && y%100 != 0)|| y%400 == 0;
}
void check(int y,int m,int d) {
	if (y >= 60) {
		y += 1900;
	}
	else {
		y += 2000;
	}
	if (m > 12)return;
	if (leapyear(y)) {
		if (leapdays[m] < d)return;
	}
	else {
		if (days[m] < d)return;
	}
	if (i>0) {
		for (int j = 0; j < i;j++) {
			if (::data[j][0] == y && ::data[j][1] == m &&::data[j][2] == d) {
				return;
			}
		}
	}
	::data[i][0] = y;
	::data[i][1] = m;
	::data[i][2] = d;
	i++;
}
int main() {
	int a, b, c, e, f, g;
	int d[3];
	i = 0;
	scanf_s("%d/%d/%d",&a,&b,&c);
	//cin >> a >> b >> c;
	check(a, b, c);
	check(c, a, b);
	check(c, b, a);
	for (int j = 0; j < i;j++) {
		d[j] = ::data[j][0] * 10000 + ::data[j][1] * 100 + ::data[j][2];
	}
	sort(d,d+i);
	for (int j = 0; j < i; j++) {
		e = d[j] / 10000;
		f = (d[j]/100) % 100;
		g = d[j] % 100;
		cout << e << "-" << f << "-" << g<<endl;
	}
	return 0;
}