7x7x7：数字宇宙的七重奏，解锁无限可能

打印日期⭐️难度简单⭐️类型模拟题目题目链接题解利用好NextDay函数。

#define_CRT_SECURE_NO_WARNINGS#includestdio.h#includestring.h#includevector// vector不需要.h#includelist#includeset// // 可以用 set 和 multiset#includeunordered_set// 可以用 unordered_set 和 unordered_multisetusingnamespacestd;voidNextDay(intyear,intmonth,intday){intdayOfMonth[]{0,31,28,31,30,31,30,31,31,30,31,30,31};intisLeap;// 是否是闰年if(year%4000||(year%40year%100!

){// 闰年二月29天dayOfMonth[2]29;}day;if(daydayOfMonth[month]){day1;month;}if(month

{month1;year;}}intmain(){intyear0;intnum0;while(scanf(%d%d,year,num)!EOF){intmonth0;intday0;intcount0;while(num!count){NextDay(year,month,day);count;}printf(%04d-%02d-%02d\n,year,month,day);}return0;}答案#includestdio.h#includestring.husingnamespacestd;voidNextDay(intyear,intmonth,intday){// 出现在定义or形参当中 表示引用的意思 出现在其他位置表示取地址// 存储一下 月份和天数的对应关系intdayOfMonth[]{0,31,28,31,30,31,30,31,31,30,31,30,31};intisLeap;// 是否是闰年isLeapyear%4000||year%40year%100!0;if(isLeap){dayOfMonth[2]29;}else{dayOfMonth[2]28;}day;if(daydayOfMonth[month]){day1;month;}if(month

{month1;year;}//printf(NextDay year %d, month %d, day %d\n, year, month, day);}intmain(){intyear,days;while(scanf(%d%d,year,days)!EOF){intmon1;intday1;for(inti1;idays;i){NextDay(year,mon,day);}printf(%04d-%02d-%02d\n,year,mon,day);}return0;}

1995丛林泰山HR意大利-1995丛林泰山HR意大利应用