p92854073
/
liujian
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

second

Browse Source
master
2307799741@qq.com 6 years ago
parent 3a96532cf2
commit 01ddf0a97d
4 changed files with 103 additions and 198 deletions
Show Stats Download Patch File Download Diff File

1
liujian

@ -1 +0,0 @@
Subproject commit 3fe60e45763673bec4c4262b23226f27bfc757a0

197
排班系统.cpp
Unescape View File

@ -1,197 +0,0 @@
#include <stdio.h>
int main()
{
int zhao[7],qian[7],sun[7],li[7],zhou[7],wu[7],chen[7];
int i,l,m,n,o,p,q;
for(i=0;i<=6;i++)
zhao[i]=qian[i]=sun[i]=li[i]=zhou[i]=wu[i]=chen[i]=0;
printf("\n依次输入不愿意值班日期，若输入完毕程序仍未跳转，输入0填充\n\n");
printf("\n输入赵想值班的日期\n:");
for(i=0;i<=6;i++)
{
scanf("%d",&zhao[i]);
if(zhao[i]==0) break;
}
printf("\n输入钱想值班的日期\n:");
for(i=0;i<=6;i++)
{
scanf("%d",&qian[i]);
if(qian[i]==0) break;
}
printf("\n输入孙想值班的日期\n:");
for(i=0;i<=6;i++)
{
scanf("%d",&sun[i]);
if(sun[i]==0) break;
}
printf("\n输入李想值班的日期\n:");
for(i=0;i<=6;i++)
{
scanf("%d",&li[i]);
if(li[i]==0) break;
}
printf("\n输入周想值班的日期\n:");
for(i=0;i<=6;i++)
{
scanf("%d",&zhou[i]);
if(zhou[i]==0) break;
}
printf("\n输入吴想值班的日期\n:");
for(i=0;i<=6;i++)
{
scanf("%d",&wu[i]);
if(wu[i]==0) break;
}
printf("\n输入陈想值班的日期\n:");
for(i=0;i<=6;i++)
{
scanf("%d",&chen[i]);
if(chen[i]==0) break;
}
for(i=0;i<=6;i++) //i,l,m,n,o,p,q 分别关联赵钱孙李周吴陈
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)
{printf("\n赵 钱 孙 李 周 吴 陈 ");
printf("\n*****************************");
switch(zhao[i])
{
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;
}
switch(qian[l])
{
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;
}
switch(sun[m])
{
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;
}
switch(li[n])
{
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;
}
switch(zhou[o])
{
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;
}
switch(wu[p])
{
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;
}
switch(chen[q])
{
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;
} }
}
}

BIN
排班系统.exe
View File

Binary file not shown.

103
排班系统2.cpp
Unescape View File

@ -0,0 +1,103 @@
#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()
{
int zhao[7],qian[7],sun[7],li[7],zhou[7],wu[7],chen[7];
int i,l,m,n,o,p,q,x;
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]);
}
}
Write Preview
Loading…
Cancel
Save