40.procedure hanoi(n,x,y,z):
if n=1,print（x\"->\"z);
else hanoi(n-1,x,z,y);
print（x\"->\"z);
hanoi(n-1,y,x,z);
hanoi(n,\"x\",\"y\",\"z\");
41.A->Array[];
for(i=1,i<=n,i++):
if(i%2==0)Array[i]:
case:A {print(A->C)}C->Array[i]}
case:B{print(B->A)}A->Array[i]}
case:C {print(C->B)}