题目:
代码:
#!/bin/python3
import math
import os
import random
import re
import sys
# Complete the utopianTree function below.
def utopianTree(n):
if n == 0:
return 1
H = 1
for i in range(n):
if i % 2 == 0:
H = H * 2
if i % 2 != 0:
H += 1
return H
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
t = int(input())
for t_itr in range(t):
n = int(input())
result = utopianTree(n)
fptr.write(str(result) + '\n')
fptr.close()
如果觉得不错,就得点赞关注留言~
谢谢各位捧场~