c语言实现汉诺塔，有三根杆子A，B，C。A杆上有N个(N>1)穿孔圆盘，盘的尺寸由下到上依次变小。要求按下列规则将所有圆盘移至C杆：提示：可将圆盘临时置于B杆，也可将从A杆移出的圆盘重新移回A杆，但都必须尊循上述两条规则。问：如何移？最少要移动多少次？-c language HANOR has three poles A, B, C. A bar there are N (N> 1) perforated disk, the disk size　bottom to top smaller. Required by the following rules will bar all the disc move to C: Tip: You can put the disc provisional pole B, can also be removed　the A lever A lever disc to move back again, but they must respect through the above two rules . Q: How do shift? At least to move many times?