RANJAN02  Tower Of Hanoi  Revisited
Given 3 three pegs: leftmost peg A, middle peg B and rightmost peg C.Find the shortest sequence of moves that transfers a tower of n disks from the left peg A to the right peg C, if direct moves between A and C are disallowed. (Each move must be to or from the middle peg B.)
Constraints:
1. Initially the left peg A in stacked by n disks in the order of decreasing size.
2. Only one move cand be done at a time and never moving a larger one onto a smaller.
3. Number of moves will always be less than 2^64.
4. 1 <= n <= 35
Input
Input begins with a integer t, followed by t lines. Each line has the no. of pegs n.
Output
For each test case, output the minimum no. of move required to transfer the n disks from peg A to peg C.
Example
Input:
4
1
2
5
10
Output:
2
8
242
59048
hide comments
up79:
20170628 14:00:57
AC in one go :) 

vengatesh15:
20170327 15:36:23
easy dp AC with little precomputation and O(1) 

kass_97:
20170101 12:56:10
Easy....AC at once


vikikkdi:
20160706 18:07:55
little precomputation with dp and then o(1) retriveal.


mkfeuhrer:
20160624 22:02:21
python rocks!! 1 line :) 

ranjanakash166:
20160606 10:18:39
check the constraints carefully!!!!!


glexey:
20151226 09:22:11
5 lines in python is an overkill. 1 is enough, 2 is plenty for readability. 

jarvis:
20150922 19:43:11
5 lines in python !


:D:
20130123 16:08:29
It's seems to be a subcase of problem VIENTIAN. 

abhiranjan:
20130123 16:08:29
@~  Constraint 3 may help you. 
Added by:  abhiranjan 
Date:  20100928 
Time limit:  0.571s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  IIITM Local Contest 