C语言经典算法 - 双色河内塔

#include <stdio.h>
void hanoi(int disks,char source,char temp,char target)
{
  if (disks == 1)
  {
    printf("move disk from %c to %cn",source,target);
    printf("move disk from %c to %cn",target);
  }
  else
  {
    hanoi(disks - 1,target,temp);
    hanoi(1,temp,target);
    hanoi(disks - 1,target);
  }
}
 
void hanoi2colors(int disks)
{
  char source = 'A';
  char temp = 'B';
  char target = 'C';
  int i;
  for (i = disks / 2; i > 1; i--)
  {
    hanoi(i - 1,temp);
    printf("move disk from %c to %cn",temp);
    hanoi(i - 1,source);
    printf("move disk from %c to %cn",target);
  }
  printf("move disk from %c to %cn",temp);
  printf("move disk from %c to %cn",target);
}
 
int main()
{
  int n;
  printf("请输入盘数：");
  scanf("%d",&n);
  hanoi2colors(n);
  return 0;
}