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

查看19道真题和解析