C語言實例：搬山游戲

*問題分析與算法設計

計算機參加游戲時應遵循下列原則：

1) 當：

剩余山數目-1<=可移動的最大數k 時計算機要移(剩余山數目-1)座，以便將最后一座山留給人。

2)對于任意正整數x,y，一定有：

0<=x%(y+1)<=y

在有n座山的情況下，計算機為了將最后一座山留給人，而且又要控制每次搬山的數目不超過最大數k，它應搬山的數目要滿足下列關系：

(n-1)%(k+1)

如果算出結果為0，即整除無余數，則規定只搬1座山，以防止冒進后發生問題。

按照這樣的規律，可編寫出游戲程序如下：

#include

int main()

{

int n,k,x,y,cc,pc,g;

printf("More Mountain Game\n");

printf("Game Begin\n");

pc=cc=0;

g=1;

for(;;)

{

printf("No.%2d game \n",g++);

printf("---------------------------------------\n");

printf("How many mpuntains are there?");

scanf("%d",&n);

if(!n) break;

printf("How many mountains are allowed to each time?");

do{

scanf("%d",&k);

if(k>n||k<1) printf("Repeat again!\n");

}while(k>n||k<1);

do{

printf("How many mountains do you wish movw away?");

scanf("%d",&x);

if(x<1||x>k||x>n) /*判斷搬山數是否符合要求*/

{

printf("IIIegal,again please!\n");

continue;

}

n-=x;

printf("There are %d mountains left now.\n",n);

if(!n)

{

printf("...............I win. You are failure...............\n\n");cc++;

}

else

{

y=(n-1)%(k+1); /*求出最佳搬山數*/

if(!y) y=1;

n-=y;

printf("Copmputer move %d mountains away.\n",y);

if(n) printf(" There are %d mountains left now.\n",n);

else

{

printf("...............I am failure. You win..................\n\n");

pc++;

}

}

}while(n);

}

printf("Games in total have been played %d.\n",cc+pc);

printf("You score is win %d,lose %d.\n",pc,cc);

printf("My score is win %d,lose %d.\n",cc,pc);

}

深圳北大青鳥