解题思路:
注意事项:
参考代码:
#include<iostream> #include<string> #include<set>; using namespace std; int dir[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; string s; set<int> se; int year, month, day; int ff = 0; int run(int y){ if(y % 400 == 0 || y % 4 == 0 && y % 100 != 0){ return 1; } return 0; } int check(int y, int m, int d){ if(run(y)){ ff = 1; dir[2]++; } if(m > 0 && m <= 12 && d > 0 && d <= dir[m]){ return 1; } return 0; } void f(int y, int m, int d){ if(check(y, m, d)){ if(y >= 60){ y = 1900 + y; } else { y = 2000 + y; } int x = y * 10000 + m * 100 + d; se.insert(x); } if(ff){ dir[2]--; ff = 0; } } int main(){ cin>>s; year = ((int)(s[0]) - 48) * 10 + ((int)(s[1]) - 48); month = ((int)(s[3]) - 48) * 10 + ((int)(s[4]) - 48); day = ((int)(s[6]) - 48) * 10 + ((int)(s[7]) - 48); f(year, month, day); f(day, year, month); f(day, month, year); for(set<int>::iterator it = se.begin(); it != se.end(); it++){ int y = *it / 10000; int m = *it / 100 % 100; int d = *it % 100; printf("%d-%02d-%02d\n", y, m, d); } return 0; }
0.0分
0 人评分