[acm]HDOJ 2064 汉诺塔III

题目地址：

http://acm.hdu.edu.cn/showproblem.php?pid=2064

汉诺塔变种，只能从中间专业，递归关系为:f(n)=3*f(n-1)+2.

---

//汉诺塔变种，只能从中间转移
//11485816    2014-08-19 08:44:47    Accepted    2064    0MS    368K    307 B    G++    空信高手
#include<iostream>
#include<cstdio>
using namespace std;
#define LL long long 
int main()
{
    //freopen("input.txt","r",stdin);
    LL Sum[35];
    int n=0;
    Sum[0] = 0;
    Sum[1] = 2;
    for(int i=2;i<=35;i++)
    {
        Sum[i]=3*Sum[i-1]+2;
    }
    while(cin>>n)
        cout<<Sum[n]<<endl;
    return 1;
    
}