//
//  main.c
//  Ctest6
//
//  Created by 王彬 on 2019/5/20.
//  Copyright ? 2019年 王彬. All rights reserved.
//



//test1
/*
#include<stdio.h>

void main()
{
    void printstar();
    void print_message();
    printstar();
    print_message();
    printstar();
}
void printstar()
{
    printf("*******************\n");
}
void print_message()
{
    printf("退而采薇除抛，倦勤者也\n");
}
*/



//test2 調(diào)用函數(shù)時(shí)的數(shù)據(jù)傳遞
/*
#include<stdio.h>

void main()
{
    int max(int x , int y);//形參
    int a , b , c;
    scanf("%d,%d", &a,&b);
    c = max(a,b);//實(shí)參
    printf("Max is %d\n",c);
}

int max(int x ,int y)
{
    int z;
    z = x > y ? x : y;
    return z;
}
*/



//test3
/*
#include<stdio.h>

void main()
{
    float max(float x,float y);
    float a,b;
    float c;
    
    scanf("%f%f",&a,&b);

    c = max(a,b);
    printf("Max is %f\n",c);
}

float max(float x,float y)
{
    float z;
    z=x>y?x:y;
    return z;
}
*/



//test4 實(shí)參求值順序
/*
#include<stdio.h>

void main()
{
    int f(int a,int b);
    int i=2,p;
    
    p=f(i,++i);
    printf("%d\n",p);
}

int f(int a,int b)
{
    int c;
    if(a>b)
    {
        c=1;
    }
    else if(a==b)
    {
        c=0;
    }
    else
    {
        c=-1;
    }
    return(c);
}
*/



//test5 對(duì)被調(diào)用函數(shù)作聲明
/*
#include<stdio.h>

void main()
{
    float add(float a,float b);//對(duì)函數(shù)進(jìn)行聲明
    float a,b,c;
    
    scanf("%f,%f",&a,&b);
    c=add(a,b);
    printf("sum is %f\n",c);
}

float add(float a,float b)
{
    float sum;
    sum=a+b;
    return sum;
}
*/



//test6 自行定義pow函數(shù)
/*
#include<stdio.h>

void main()
{
    double power(double a,double b);
    double a,b,result;
    
    scanf("%lf,%lf",&a,&b);
    result=power(a,b);
    printf("the result is  %lf:\n",result);
}

double power(double a,double b)
{
    double z=1;
    while (b)
    {
        z*=a;
        b--;
    }
    
    return z;
}
*/



//test7 嵌套函數(shù)調(diào)用
/*
#include<stdio.h>
#include<math.h>

void main()
{
    long int square(long int a);
    long int factorial(long int result1);
    long int result=0,result1,result2,a,i;
    
    for(i=0;i<2;i++)
    {
        printf("input a number:\n");
        scanf("%ld",&a);
        result1=square(a);
        result2=factorial(result1);
        result=result+result2;
    }
    printf("計(jì)算結(jié)果是：%ld\n",result);
}

long int square(long int a)
{
    long int z;
    z=a*a;
    return z;
}

long int factorial(long int result1)
{
    long int n;
    long int p=1;
    for(n=result1;result1>0;result1--)
    {
        p=p*result1;
    }
    return p;
}
*/



//test8 用遞歸的方法計(jì)算階乘
/*
#include<stdio.h>

void main()
{
    long n;
    long result;
    long recursion(long n);
    
    printf("input a number:\n");
    scanf("%ld",&n);
    result=recursion(n);
    printf("%ld! = %ld\n",n,result);
}

long recursion(long n)
{
    long temp_result;
    if(n<0)
    {
        printf("輸入錯(cuò)誤\n");
        return EOF;
    }
    else if(n==0)
    {
        temp_result=1;
    }
    else
    {
        temp_result = recursion(n-1)*n;
    }
    return temp_result;
}
*/



//test9 漢諾塔問(wèn)題鸣哀？纯陨？熙尉？？头滔？嗅回？辣苏？？哄褒？稀蟋？？呐赡？退客？？链嘀？萌狂？？怀泊？茫藏？？霹琼？务傲？？枣申？售葡？？忠藤？

#include <stdio.h>
int k=0;//統(tǒng)計(jì)步數(shù)
void Hanoi(int n,char a,char b,char c)
{
    if(n==0)//0的話,沒(méi)什么好玩的了,直接退出Ｐ铩！
    {
        return ;
    }
    else
    {
        Hanoi(n-1,a,c,b);
        k++;
        printf("%d：From %c to %c\n",k,a,c);
        Hanoi(n-1,b,a,c);
    }
}
int main()
{
    int n;
    printf("input a number:\n");
    scanf("%d",&n);
    Hanoi(n,'A','B','C');
    return 0;
}