hello C ……

canshui 2010-05-14 08:28:21

在下有天晚上在床上突然想，是不是有大虾们，可以把自己知道的比较经典的算法，说下呢……

such as 搬盘子（汉诺塔），纠结的环（约瑟夫环）,兔爸妈生兔娃（Fibonacci），wait wait ；some else 螺旋矩阵，选

择排序，恶魔站队（魔方阵），wait wait ……

有实现代码最好喽，懒得敲代码说下名字也八错，嘟嘟嘟嘟……

help help 小白喽……嘟嘟嘟嘟……

大侠（虾，蛤，牛，神，and 啥……）们，动动连心的东西吧，发扬一下咱小白与高手心连心的高尚情操……嘟嘟嘟嘟……

我（e）,就等着啦……

ps 1 :在下，知道算法狂多，不过还是请强强的大家弱弱的说出一俩（多多益善），让小小的在下知道天是广滴，
海是不小滴啦啦啦啦……

ps 2 :不积硅步，无以至千里。不积小流，无以成江海。

ps 3 铛铛铛铛，韩信点兵喽……

ps 4：感激涕零……

...全文

260 42 打赏收藏转发到动态举报

写回复

用AI写文章

42 条回复

切换为时间正序

请发表友善的回复…

发表回复

weilong8998 2010-05-15

打赏
举报

我手上有好几本算法的电子书，呵呵，里面的算法多了去了，呵呵，可惜我没学

weilong8998 2010-05-15

打赏
举报



/*

 about Hanoi the game

*/

#include <graphics.h>

#include <dos.h>

#define MAX_LEVEL STACK_SIZE

int position[MAX_LEVEL+1];

stack *theStack[3];

int depth;

int mode;

int print;

int initgame(int d){

 int i;

 int x,y;

 int h=5;

 int w;

 initerror();

 if(mode){

  int gdriver = DETECT, gmode, errorcode;

  /* initialize graphics mode */

  initgraph(&gdriver, &gmode, "");

  setfillstyle(1,7);

 }

 for(i=0;i<3;i++)

  if(!create(&theStack[i]))

   break;

 if(i!=3){

  for(;i>=0;i--)dispose(theStack[i]);

  error("initgame(int):can not init stack!\n");

  return 0;

 }

 depth=d;

 for(i=d;i;i--){

  push(theStack[0],i);

  if(mode){

   y=200+100-theStack[0]->top*(h+1);

   w=i*10;

   x=150-w/2;

   setcolor(i);

   setfillstyle(1,i);

   bar(x,y,x+w,y+h);

  }

  position[i]=0;

 }

 if(mode){

  setcolor(15);

  for(i=0;i<3;i++)

   rectangle(150+i*150-1,120,150+i*150+1,300);

  line(50,300,500,300);

 }

 return 1;

}



int endgame(){

 int i=2;

 for(;i>=0;i--)dispose(theStack[i]);

 printf("report:");

 report();

 if(mode)closegraph();

 return 1;

}



void show(int p,int from,int to){

 int i;

 int x,y;

 int newx,newy;

 int h=5;

 int w=p*10;

 y=200+100-(theStack[from]->top+1)*(h+1);

 x=from*150+150-w/2;

 newx=to*150+150-w/2;

 newy=200+100-theStack[to]->top*(h+1);

 while(y>100){

  setcolor(0);

  setfillstyle(1,0);

  bar(x,y,x+w,y+h);

  y-=(h+1);

  setcolor(15);

  rectangle(150+from*150-1,120,150+from*150+1,300);

  setcolor(p);

  setfillstyle(1,p);

  bar(x,y,x+w,y+h);

  delay(10);

 }

 while(x!=newx){

  setcolor(0);

  setfillstyle(1,0);

  bar(x,y,x+w,y+h);

  (x>newx)?x--:x++;

  setcolor(p);

  setfillstyle(1,p);

  bar(x,y,x+w,y+h);

  delay(2);

 }

 while(y<newy){

  setcolor(0);

  setfillstyle(1,0);

  bar(x,y,x+w,y+h);

  setcolor(15);

  rectangle(150+to*150-1,120,150+to*150+1,300);

  y+=(h+1);

  setcolor(p);

  setfillstyle(1,p);

  bar(x,y,x+w,y+h);

  delay(10);

 }

}



int move(int p){

 int t,s;

 if(!gettop(theStack[position[p>,&t)){

  error("move(int):the stack is empty\n");

  return 0;

 }

 if(t==p){

  pop(theStack[position[p>,&t);

  if(!mode&&print)printf("%c -> ",'A'+position[p]);

  /* another important core line */

  s=(position[p]+1+(depth%2?p%2:(p+1)%2) )%3;

  if(gettop(theStack[s],&t)&&t<p){

   error("move(int):can not move big level above small one\n");

   return 0;

  }

  push(theStack[s],p);

  if(mode)show(p,position[p],s);

  else if(print)printf("%c\t",'A'+s);

  position[p]=s;

 }else error("move(int):position error\n");

 return 1;

}

int move2(int p){

 int t,s;

 s=(position[p]+1+(depth%2?p%2:(p+1)%2) )%3;

 if(print)printf("%c->%c\t",'A'+position[p],'A'+s);

 position[p]=s;

 return 1;

}

#include <conio.h>

void main(){

 unsigned long i;

 unsigned long N=10;

 unsigned long p,q;

 printf("Welcome to Hanoi\n");

 printf("Note that this Hanoi is not write by recurrence!\n");

 printf("And not calculate with any stack.\n");

 printf("but i want to check if the a is right.\n");

 printf("i use 3 stack to show if there is any violent move happens.:)\n");

 printf("\nEnter a number as level(1 to 30):");

 scanf("%d",&N);

 if(N<1||N>30){

  printf("error: not 1 to 30\n");

  return;

 }

 printf("\n Select show mode('c' in TEXT 'g' in GRAPHICS)\n");

 printf("Note that if the level is to big you'd better not use 'g' for speed.\n");

 printf("19 is about 20 seconds. 20 is about double of that. etc.\n");

 printf("I test on a intel 166mmx cpu. 30 may be 40*1024 seconds.\n");

 printf("wish you succeed!\n");

 switch(getch()){

  case 'c':

   printf("do you want to show the result?(y/n)\n");

   printf("print result will be slow!!!\n");

   do{

    mode=getch();

    if(mode=='y')print=1;

    if(mode=='n')print=0;

   }while(mode!='y'&&mode!='n');

   mode=0;

   break;

  case 'g':mode=1;break;

  default:printf("error: neither 'c' nor 'g'\n");return;

 }



 printf("processing...\n");

 initgame(N);

 /*

  core here!!!

  only 8 lines, ha!

  here get the level queue

  as 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1

 */

 for(i=1;i<(1L<<N);i++){

  q=1L<<N;p=N+1;

  while(q&&i%q){

   q>>=1;

   p--;

  }

  if(mode||print)move(p);

  else move2(p);

 }

 printf("ok\n");

 getch();

 endgame();

}