# The user inputs a non-negative integer x and k. # The program calculates x raised to the power of k, the sum of the first x perfect squares, and the number of ways of picking k objects from n ...

Given an integer n, return true if it is a power of two. Otherwise, return false. An integer n is a power of two, if there exists an integer x such that n == 2x.