utopian-tree.py

#https://www.hackerrank.com/challenges/utopian-tree/problem
#!/bin/python3

import math
import os
import random
import re
import sys

#
# Complete the 'utopianTree' function below.
#
# The function is expected to return an INTEGER.
# The function accepts INTEGER n as parameter.
#


def utopianTree(n):
    # Write your code here
    res = 0
    i = 0
    while i <= n:
        if i % 2 == 0:
            res += 1
        else:
            res *= 2
        i += 1
    return res


if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')

    t = int(input().strip())

    for t_itr in range(t):
        n = int(input().strip())

        result = utopianTree(n)

        fptr.write(str(result) + '\n')

    fptr.close()