Sunday, 28 September 2014

Utopian Tree Program in java

Problem Statement:

        The Utopian tree goes through 2 cycles of growth every year. The first growth cycle occurs during the monsoon, when it doubles in height. The second growth cycle occurs during the summer, when its height increases by 1 meter.
        Now, a new Utopian tree sapling is planted at the onset of the monsoon. Its height is 1 meter. Can you find the height of the tree after N growth cycles?

Input Format
The first line contains an integer, T, the number of test cases.
T lines follow. Each line contains an integer, N, that denotes the number of cycles for that test case.

Constraints
1 <= T <= 10
0 <= N <= 60

Output Format
For each test case, print the height of the Utopian tree after N cycles.

Sample Input #00:
2
0
1
Sample Output #00:
1
2

Explanation #00:
        There are 2 test cases. When N = 0, the height of the tree remains unchanged. When N = 1, the tree doubles its height as it's planted just before the onset of monsoon.

Sample Input: #01:
2
3
4
Sample Output: #01:
6
7
Explanation: #01:

There are 2 testcases.
N = 3:
the height of the tree at the end of the 1st cycle = 2
the height of the tree at the end of the 2nd cycle = 3
the height of the tree at the end of the 3rd cycle = 6
N = 4:
the height of the tree at the end of the 4th cycle = 7


Algorithm or Steps :

  1. Accespt toptal number of test cases.
  2.  Create array of size equal to number of test cases.
  3. Accept Number of years and store it in array.
  4.  Then assume the initial height of tree as 1 (start=1).
  5. Assume that Utopian tree is planted at the onset of the monsoon
  6. Multiply height by 2 for all even years and add height by one for all odd years.
  7. Run the loop till we finish total number of years and find height.  



Program :

Program of Utopian Tree in java
Utopian Tree program in java

Success Rate :


Output of Utopian Tree program in java

To Download code click here.

For beginners in java please see this link.

3 comments: