案例说明:
实现思想:
- 能校验每个任务是否已经完成
- 可以操作每个任务完成与否
实现思路:
- 无符号整型变量可以存32位二进制数字,我们只需要10位
- 枚举型可以把每个任务常量化
- 联想位运算的特点,可以进行逻辑运算
代码如下:
#include<stdio.h>
#include<string.h>
#define BIN(x) (1<<(x))
enum tasklist
{
task1 = BIN(0),
task2 = BIN(1),
task3 = BIN(2),
task4 = BIN(3),
task5 = BIN(4),
task6 = BIN(5),
task7 = BIN(6),
task8 = BIN(7),
task9 = BIN(8),
task10 = BIN(9),
};
void main()
{
unsigned int daytask = 0;
daytask |= task7 ;
if(daytask &= task7)
printf("mission complete\n");
else
printf("mission not complete\n");
printf("断点");
return;
}