算法设计与分析_第二版_吕国英_第四章课后习题答案

4.1#include

#include

void main()

{

int i,n,sum=0,power,proce,remainder,interger,decimal;

printf("请输入2+22+…+2222(n个2)(不考虑精度)的n\nn=");

scanf("%d",&n);

for(i=1;i<=n&&i<=9;i++)

{

proce=(int)(pow(10,i)-1)/9*2;

sum=sum+proce;

}

if(n>9)

{

for(i=1,power=n-9;i<=power;i++)

{

proce=(int)(pow(10,9)-1)/9*2;

sum=sum/10+proce;

remainder=sum%10;

if(remainder>=5)

sum++;

}

interger=sum/100000000;

decimal=sum%100000000;

printf("2+22+…+2222(n个2)(不考虑精度)=%d.%d*e+%d\n",interger,decimal,n-1);

}

else

printf("2+22+…+2222(n个2)(不考虑精度)=%d\n",sum);

}

4.2

#include

void main()

{

int i,total=2,day=10;

for(i=day-1;i>=1;i--)

total=(total+2)*2;

printf("第一天共有%d个桃。\n",total);

}

4.3

#include

void main()

{

int flag=0,last=54,card;

printf("共有牌：%d \n",last);

printf("计算机出：3 ");

last=last-3;

while(last>1)

{

printf("还有牌：%d ",last);

printf("您出：");

scanf("%d",&card);

printf("计算机出：%d ",5-card);

last=last-5;

}

printf("\n还有牌：%d 。您只能输入1。\n",last);

printf("您出：");

scanf("%d",&card);

printf("Sorry!您输了……\n");

}

4.5

#include

void main()

{

int

array[8][8],i,j,i1=0,i2=1,i3=2,i4=3,i5=4,i6=5,i7=6,i8=7,j1=0,j2=0,j3=0,j4=0,j5= 0,j6=0,j7=0,j8=0;

//先判断不在同一行和同一列，然后再做不在对角线

printf("此处预先规定，第一行第一列处是皇后。\n");

for(j2=1;j2<8;j2++)

for(j3=1;j3<8;j3++)

for(j4=1;j4<8;j4++)

for(j5=1;j5<8;j5++)

for(j6=1;j6<8;j6++)

for(j7=1;j7<8;j7++)

for(j8=1;j8<8;j8++)

if(j3!=j2)

if(j4!=j2&&j4!=j3)

if(j5!=j2&&j5!=j3&&j5!=j4)

if(j6!=j2&&j6!=j3&&j6!=j4&&j6!=j5) if(j7!=j2&&j7!=j3&&j7!=j4&&j7!=j5&&j7!=j6)

if(j8!=j2&&j8!=j3&&j8!=j4&&j8!=j5&&j8!=j6&&j8!=j7)

if((i2-i1+j2-j1)!=0&&(i2-i1-j2+j1)!=0)//两点的位置关系！

if((i3-i1+j3-j1)!=0&&(i3-i1-j3+j1)!=0)

if((i3-i2+j3-j2)!=0&&(i3-i2-j3+j2)!=0)

if((i4-i1+j4-j1)!=0&&(i4-i1-j4+j1)!=0) if((i4-i2+j4-j2)!=0&&(i4-i2-j4+j2)!=0)

if((i4-i3+j4-j3)!=0&&(i4-i3-j4+j3)!=0)

if((i5-i1+j5-j1)!=0&&(i5-i1-j5+j1)!=0)

if((i5-i2+j5-j2)!=0&&(i5-i2-j5+j2)!=0)

if((i5-i3+j5-j3)!=0&&(i5-i3-j5+j3)!=0)

if((i5-i4+j5-j4)!=0&&(i5-i4-j5+j4)!=0)

if((i6-i1+j6-j1)!=0&&(i6-i1-j6+j1)!=0)

if((i6-i2+j6-j2)!=0&&(i6-i2-j6+j2)!=0)

if((i6-i3+j6-j3)!=0&&(i6-i3-j6+j3)!=0)

if((i6-i4+j6-j4)!=0&&(i6-i4-j6+j4)!=0)

if((i6-i5+j6-j5)!=0&&(i6-i5-j6+j5)!=0)

if((i7-i1+j7-j1)!=0&&(i7-i1-j7+j1)!=0)

if((i7-i2+j7-j2)!=0&&(i7-i2-j7+j2)!=0) if((i7-i3+j7-j3)!=0&&(i7-i3-j7+j3)!=0)