#include #define PM25_L1 200 #define PM25_L2 400 typedef enum { YES,NO } MARKTAG; int isDigit(char ch) { //判断ch是否为十进制数字字符,是则返回1,否则返回0 return (ch>='0' && ch<='9'); } void prt_msg(char *msg, MARKTAG flag) { if (flag == YES) printf("%s : traffic restrictions/n", msg); else printf("%s : free/n", msg); } int isMatched(int weekday, int t, int d) //判断是否符合限行规则,是则返回1,否则返回0 { return (weekday%d == t%d); } void proc(int pm25, int weekday, char *licence) { int i,lastd; if (weekday == 6 || weekday == 7 || (1) ) prt_msg(licence, NO); else { for ( i=5; i>=0; i-- ) if (isDigit(licence[i])) { lastd= (2) ; //获取车牌号的尾号 break; } if(pm25>= PM25_L2 ) { //限行5个尾号的汽车 if (isMatched( (3) )) prt_msg(licence, YES); else prt_msg(licence, NO); } else { //限行2个尾号的汽车 if (isMatched( (4) )) prt_msg(licence, YES); else prt_msg(licence, NO); } } } int main() { int weekday=0, pm25=0; char licence[7]; scanf("%d %d %s’’,&pm25, &weekday, licence); //输入数据的有效性检测略,下面假设输入数据有效、正确 proc( (5) ); return 0; }
请先在App中激活(应用市场搜“软考真题”)
2020-11-01
请先在App中激活(应用市场搜“软考真题”)
2019-11-09
请先在App中激活(应用市场搜“软考真题”)
2019-10-22
请先在App中激活(应用市场搜“软考真题”)
2019-10-28
请先在App中激活(应用市场搜“软考真题”)
2020-10-15
请先在App中激活(应用市场搜“软考真题”)
2022-05-26
请先在App中激活(应用市场搜“软考真题”)
2022-11-03