zoukankan      html  css  js  c++  java
  • 【三色汉诺塔】

    /*
    三色汉诺塔 
    */
    
    #include <stdio.h>
    
    void hanoi(int disks, char source, char temp, char target)
    {
        if(disks == 1)
        {
            printf("move disk from %c to %c 
    ", source ,target);
            printf("move disk from %c to %c 
    ", source ,target);
            printf("move disk from %c to %c 
    ", source ,target);
        }
        else
        {
            hanoi(disks - 1, source, target, temp);
            hanoi(1, source, temp, target);
            hanoi(disks - 1, temp, source, target);
        }
    }
    
    void hanoi3colors(int disks)
    {
        char source = 'A';
        char temp = 'B';
        char target = 'C';
        int i;
        if(disks == 3)
        {
            printf("move disk from %c to %c 
    ", source , temp);
            printf("move disk from %c to %c 
    ", source , temp);
            printf("move disk from %c to %c 
    ", source , target);
            printf("move disk from %c to %c 
    ", temp , target);
            printf("move disk from %c to %c 
    ", temp , source);
            printf("move disk from %c to %c 
    ", target , temp);
        }
        else
        {
            hanoi(disks / 3 - 1, source, temp, target);
            printf("move disk from %c to %c 
    ", source, temp);
            printf("move disk from %c to %c 
    ", source, temp);
            printf("move disk from %c to %c 
    ", source, temp);
            
            hanoi(disks / 3 - 1, target, temp, source);
            printf("move disk from %c to %c 
    ", temp , target);
            printf("move disk from %c to %c 
    ", temp , target);
            printf("move disk from %c to %c 
    ", temp , target);
            
            hanoi(disks / 3 - 1, source, target, temp);
            printf("move disk from %c to %c 
    ", target , temp);
            printf("move disk from %c to %c 
    ", target , temp);
            
            hanoi(disks / 3 - 1, temp, source, target);
            printf("move disk from %c to %c 
    ", source , temp);
            
            for(i = disks / 3 - 1; i > 0; i--)
            {
                if(i > 1)
                {
                    hanoi(i - 1, target, source, temp);
                }
                printf("move disk from %c to %c 
    ", target, source);
                printf("move disk from %c to %c 
    ", target, source);
                if(i > 1)
                {
                    hanoi(i - 1, temp, source, target);
                }
                printf("move disk from %c to %c 
    ", source, temp);
            }
        }
    }
    
    int main()
    {
        int n;
        printf("请输入盘数:");
        scanf("%d", &n);
        
        hanoi3colors(n);
        
        return 0;
    }
  • 相关阅读:
    Luogu P4727 [HNOI2009]图的同构记数
    ARC 101 E
    JSOI2019 Round2 游记
    JSOI2019 Round1(十二省联考)游记
    Technocup 2019
    Codeforces Round #533 (Div. 2)比赛总结
    学习链接
    2018.12.29-2018.1.9安师大附中集训
    关于考试
    NOIP2018提高组 游记
  • 原文地址:https://www.cnblogs.com/libra-yong/p/6296346.html
Copyright © 2011-2022 走看看