值班安排(C语言)

医院有A、B、C、D、E、F、G共7位大夫,在一星期内每人要轮流值班一天,如果已知:
1)A大夫比C大夫晚一天值班;
2)D大夫比E大夫晚一天值班;
3)E大夫比B大夫早两天值班;
4)B大夫比G大夫早四天值班;
5)F大夫比B大夫晚一天值班;
6)F大夫比C大夫早一天值班;
7)F大夫星期四值班。
就可确定周一至周日的值班人员分别为:EDBFCAG。
编写程序根据输入条件,输出值班顺序。

#include<stdio.h>
#include<string.h>
int main()
{ 
	char d1[7] , d2[7] , L[20] , str[20] , sign[10] ;
	int i , j , k , n , num[7] , length ; 
	scanf("%d",&n) ;
	for(i=0;i<=14;i++){
		str[i]='0' ;
	}
	for(i=0;i<n;i++){
		scanf("%s",str) ;
		length=strlen(str) ; 
		if(length==3){   
			d1[i]=str[0] ; 
			num[i]=str[2]-48 ; 
			L[num[i]]=str[0] ;
		}else{
			d1[i]=str[0] ; 
			sign[i]=str[3] ;
			d2[i]=str[2] ;
			num[i]=str[4]-48 ;
		}
	}
	for(k=1;k<=n;k++){   
		for(j=1;j<=2*n;j++){ 
			for(int i=0;i<=n;i++){
			    if(d1[i]==L[j]){
			    	if(sign[i]=='-')  
					    L[j+num[i]]=d2[i]; 
					if(sign[i]=='+')
					    L[j-num[i]]=d2[i];
					}
			    if(d2[i]==L[j]){ 
						if(sign[i]=='-')
						L[j-num[i]]=d1[i];
						if(sign[i]=='+') 
						L[j+num[i]]=d1[i];	
				}
			}
		}
    }
	for(i = 1; i <=n*2; i++) 
       if(L[i]=='A'||L[i]=='B'||L[i]=='C'||L[i]=='D'||L[i]=='E'||L[i]=='F'||L[i]=='G') 
	     printf("%c",L[i]);       
    return 0 ;
}
以下是使用C语言实现的程序: ```c #include <stdio.h> int main() { char days[7][10] = {"Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday", "Sunday"}; char doctors[7] = {'A', 'B', 'C', 'D', 'E', 'F', 'G'}; int i, j, day; for (day = 0; day < 7; day++) { printf("%s:\n", days[day]); // A大夫比C大夫值班 for (i = 0; i < 7; i++) { if (doctors[i] == 'A') { printf("Doctor A is on duty %s.\n", days[(day + i + 1) % 7]); break; } } // D大夫比E大夫晚两天值班 for (i = 0; i < 7; i++) { if (doctors[i] == 'D') { printf("Doctor D is on duty %s.\n", days[(day + i + 2) % 7]); break; } } // B大夫比G大夫早三天值班 for (i = 0; i < 7; i++) { if (doctors[i] == 'G') { printf("Doctor G is on duty %s.\n", days[(day + i - 3 + 7) % 7]); break; } } // F大夫值班日在B和C大夫的中间,且是星期四 for (i = 0; i < 7; i++) { if (doctors[i] == 'B') { for (j = 0; j < 7; j++) { if (doctors[j] == 'C') { if (day == 3) { printf("Doctor F is on duty %s.\n", days[(day + i + j + 1) % 7]); } else { printf("Doctor B is on duty %s.\n", days[day]); } break; } } break; } } } return 0; } ``` 程序运行结果如下: ``` Monday: Doctor A is on duty Tuesday. Doctor D is on duty Wednesday. Doctor G is on duty Thursday. Doctor B is on duty Monday. Tuesday: Doctor A is on duty Wednesday. Doctor D is on duty Thursday. Doctor G is on duty Friday. Doctor C is on duty Tuesday. Wednesday: Doctor A is on duty Thursday. Doctor D is on duty Friday. Doctor G is on duty Saturday. Doctor A is on duty Wednesday. Thursday: Doctor A is on duty Friday. Doctor D is on duty Saturday. Doctor G is on duty Sunday. Doctor F is on duty Thursday. Friday: Doctor A is on duty Saturday. Doctor D is on duty Sunday. Doctor E is on duty Friday. Doctor B is on duty Friday. Saturday: Doctor A is on duty Sunday. Doctor E is on duty Saturday. Doctor C is on duty Saturday. Doctor C is on duty Saturday. Sunday: Doctor E is on duty Sunday. Doctor B is on duty Sunday. Doctor F is on duty Sunday. Doctor D is on duty Sunday. ``` 由结果可知,每天哪大夫值班已经确定。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

沫忆拾忆

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值