[C/C ++] implementation of the tower

/* If there is one plate, move the plate on column A directly from column A to column C. Otherwise, move the n-1 plate on column A to Column B with C, then, move the plate on column A from column A to column C and move the n-1 plate on column B to C with a */# include <stdio. h> void hannuota (int n, char a, char B, char c) {if (1 = N) {// printf ("Move the plate numbered % d directly from the % C column to the % C column \ n", N,, c);} else {hannuota (n-1, A, C, B); // recursion, except for the n-1 plates at the bottom, move from A to bprintf via C ("Move the plate numbered % d directly from % C pillar to % C pillar \ n", n, a, c ); // move the nth number from A to channuota (n-1, B, A, C); // recursively move the n-1 number on B to C .}} Int main () {char character = 'a'; char CH2 = 'B'; char CH3 = 'C'; int N; printf ("Enter the number of plates to move: "); scanf (" % d ", & N); hannuota (n, 'A', 'B', 'C'); Return 0 ;}