https://www.hackerrank.com/challenges/utopian-tree

tree.clj

(defn- read-int-line []
  (Integer/parseInt (read-line)))

(defn- spring? [current-cycle]
  (= 0 (mod current-cycle 2)))

(defn- tree-height-after [total-cycles]
  (loop [current-cycle 0
         height 1]
    (if (>= current-cycle total-cycles)
      height
      (recur (inc current-cycle) (if (spring? current-cycle) (* 2 height) (inc height))))))

(defn run []
  (let [tc-count (read-int-line)
        test-cases (repeatedly tc-count read-int-line)]
    (doseq [total-cycles test-cases]
      (println (tree-height-after total-cycles)))))

(run)