C language implementation of the tower of Hanoi Problem

Lingta-Solution

1. If there is only one gold tablet, move it from the source to the target rod and end it.

2. If there are n gold slices, move n-1-1 gold slices to the secondary rods, move themselves to the target rods, and then move the first n-1 gold slices to the target rods.

 //  Tower of Hanoi Tower  
  # Include  <  Stdio. h>  
  Void  Toh ( Int  N,  Char  A,  Char  B,  Char  C)
{
  If  (N  =     1  )
{
Printf (  "  Movedisk % d from % C to % C \ n  " , N, a, c );
  Return  ;
}
Toh (n  -  1  , A, C, B );
Printf (  "  Movedisk % d from % C to % C \ n  "  , N, a, c );
Toh (n  -  1  , B, A, C );
}

  Void  Main ()
{
  Int M, N;
Printf (  "  Enter the number of times of test data  "  );
Scanf (  "  % D  "  ,  &  M );
  While  (M  ! =     0  )
{
Printf ( "  Enter the number n to solve the n-level tower issue: \ n  "  );
Scanf (  "  % D  "  ,  &  N );
Toh (n,  '  A  '  ,  '  B  ' ,  '  C  '  );
M  --  ;
  If  (M  =     0  )
{
  Return  ;
}
}
}