You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
112 lines
2.2 KiB
112 lines
2.2 KiB
#include<stdio.h>
|
|
void perm(int a)
|
|
{
|
|
switch(a)
|
|
{
|
|
case 1:printf("星期一 ");
|
|
break;
|
|
case 2:printf("星期二 ");
|
|
break;
|
|
case 3:printf("星期三 ");
|
|
break;
|
|
case 4:printf("星期四 ");
|
|
break;
|
|
case 5:printf("星期五 ");
|
|
break;
|
|
case 6:printf("星期六 ");
|
|
break;
|
|
case 7:printf("星期日 ");
|
|
break;
|
|
default:
|
|
break;
|
|
}
|
|
}
|
|
int main()
|
|
{
|
|
printf("#***********************欢迎使用排班系统**************************#\n");
|
|
printf("# 特别注意 #\n");
|
|
printf("# 请各位工作人员输入自己想要休息的时间 #\n");
|
|
printf("#***********************欢迎进入排班系统**************************#\n");
|
|
int zhao[7],qian[7],sun[7],li[7],zhou[7],wu[7],chen[7];
|
|
int i,l,m,n,o,p,q,x;
|
|
FILE *fp;
|
|
x=0;
|
|
for(i=0;i<=6;i++)
|
|
zhao[i]=qian[i]=sun[i]=li[i]=zhou[i]=wu[i]=chen[i]=0;
|
|
printf("输入赵想休息的日期:\n");
|
|
for(i=0;i<=6;i++)
|
|
{
|
|
scanf("%d",&zhao[i]);
|
|
if(zhao[i]==0)
|
|
break;
|
|
}
|
|
printf("输入钱想休息的日期:\n");
|
|
for(i=0;i<=6;i++)
|
|
{
|
|
scanf("%d",&qian[i]);
|
|
if(qian[i]==0)
|
|
break;
|
|
}
|
|
printf("输入孙想休息的日期:\n");
|
|
for(i=0;i<=6;i++)
|
|
{
|
|
scanf("%d",&sun[i]);
|
|
if(sun[i]==0)
|
|
break;
|
|
}
|
|
printf("输入李想休息的日期:\n");
|
|
for(i=0;i<=6;i++)
|
|
{
|
|
scanf("%d",&li[i]);
|
|
if(li[i]==0)
|
|
break;
|
|
}
|
|
printf("输入周想休息的日期:\n");
|
|
for(i=0;i<=6;i++)
|
|
{
|
|
scanf("%d",&zhou[i]);
|
|
if(zhou[i]==0)
|
|
break;
|
|
}
|
|
printf("输入吴想休息的日期:\n");
|
|
for(i=0;i<=6;i++)
|
|
{
|
|
scanf("%d",&wu[i]);
|
|
if(wu[i]==0)
|
|
break;
|
|
}
|
|
printf("输入陈想休息的日期:\n");
|
|
for(i=0;i<=6;i++)
|
|
{
|
|
scanf("%d",&chen[i]);
|
|
if(chen[i]==0)
|
|
break;
|
|
}
|
|
printf("运行结果:");
|
|
for(i=0;i<=6;i++)
|
|
for(l=0;l<=6;l++)
|
|
for(m=0;m<=6;m++)
|
|
for(n=0;n<=6;n++)
|
|
for(o=0;o<=6;o++)
|
|
for(p=0;p<=6;p++)
|
|
for(q=0;q<=6;q++)
|
|
{
|
|
if(zhao[i]+qian[l]+sun[m]+li[n]+zhou[o]+wu[p]+chen[q]==28&&zhao[i]*qian[l]*sun[m]*li[n]*zhou[o]*wu[p]*chen[q]==5040)
|
|
{
|
|
x++;
|
|
printf("\nSolution:%d",x);
|
|
printf("\n赵 钱 孙 李 周 吴 陈 ");
|
|
printf("\n==================================================================================================================================\n");
|
|
perm(zhao[i]);
|
|
perm(qian[l]);
|
|
perm(sun[m]);
|
|
perm(li[n]);
|
|
perm(zhou[o]);
|
|
perm(wu[p]);
|
|
perm(chen[q]);
|
|
}
|
|
}
|
|
if(x==0)
|
|
printf("\n对不起我们不能实现排班");
|
|
}
|