Utopian Tree

Utopian Tree
The Utopian Tree goes through 2 cycles of growth every year. Each spring, it doubles in height. Each summer, its height increases by 1 meter.
Laura plants a Utopian Tree sapling with a height of 1 meter at the onset of spring. How tall will her tree be after  growth cycles?

----Solution--
import sys
T = int(sys.stdin.readline())
for _ in range(T):
    N = int(sys.stdin.readline())
    height = 1
        
    for i in range(N):
        if i % 2 == 0:
            height *= 2
        else:
            height += 1
            
    print(height)

Comments

Post a Comment

Popular posts from this blog

Cut the sticks

Cut the sticks     You are given   sticks, where the  length  of each stick is a positive integer. A  cut operation  is performed on the sticks such that all of them are reduced by the length of the smallest stick. ---Solution--- #include <cmath> #include <cstdio> #include <vector> #include <iostream> #include <algorithm> using namespace std; int compare (const void * a, const void * b) {   return ( *(int*)a - *(int*)b ); } int main() {     /* Enter your code here. Read input from STDIN. Print output to STDOUT */        int element,k;     cin>>element;     int array[element];     for(int i=0;i<element;i++)         {             cin>>array[i];     }      qsort (array, element, sizeof(int), compare);     int p=element;     for(int i=0;i...
Read more

Find Digits

Find Digits Given an integer,  , traverse its digits ( 1 , 2 ,..., n ) and determine how many digits evenly divide   (i.e.: count the number of times   divided by each digit  i  has a remainder of  ). Print the number of evenly divisible digits. Note:  Each digit is considered to be unique, so each occurrence of the same evenly divisible digit should be counted (i.e.: for  , the answer is  ). Solution--- #include<stdio.h> int main() {         int t,i,a,d,c,count,j;         scanf("%d",&t);         for(i=0;i<t;i++)         {       count=0;                 scanf("%d",&a);                 c=a;                 while(a!=0){               ...
Read more