题解 | #牛牛的计划#
牛牛的计划
http://www.nowcoder.com/practice/cf956ceef9f84f7393a0b7284fdbf95a
#include<stdio.h>
int main() {
int y, m, d, y1, m1, d1;
scanf("%d %d %d\n%d %d %d", &y, &m, &d, &y1, &m1, &d1);
if (y < y1) printf("yes");
else if (y == y1 && m <= m1 && d <= d1) printf("yes");
else printf("no");
return 0;
}
int main() {
int y, m, d, y1, m1, d1;
scanf("%d %d %d\n%d %d %d", &y, &m, &d, &y1, &m1, &d1);
if (y < y1) printf("yes");
else if (y == y1 && m <= m1 && d <= d1) printf("yes");
else printf("no");
return 0;
}
