|
|||
Delivery DebacleWolfgang Puck has two very peculiar habits:
One day, Wolfgang wondered in how many different ways he can pack his cakes into certain sized boxes. Can you help him?
Input SpecificationThe input begins with t, the number of different box lengths. Each of the following t lines contains an integer n (1 ≤ n ≤ 40). Output SpecificationFor each n, output on a separate line the number of different ways to pack a 2-by-n box with cakes described above. Output is guaranteed to be less than 1018. Sample Input
Output for Sample Input
|
|||
University of Debrecen; Faculty of Informatics; v. 09/30/2024 |