汉诺塔IV
</pre><img src="https://img-blog.csdn.net/20160816100932108?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQv/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center" alt="" /><pre name="code" class="cpp"><span style="font-size:24px;">#include<stdio.h>
int main(void)
{
long long a[21]={0,2};
for(int i=2;i<21;i++)
a[i]=a[i-1]*3+2; //汉诺塔问题
int t;
scanf("%d",&t);
while(t--)
{
int n;
scanf("%d",&n);
printf("%lld\n",a[n-1]+2); //n-1个按原来的情况移动，第n个只需移两次，所以只要加个2就行
}
return 0;
}</span>
转载请注明原文地址: https://ju.6miu.com/read-1307485.html
