Given an integer N, the task is to determine whether it is possible to obtain the value N from 1 by repetitively multiplying by 10 or 20. Print Yes if possible or No otherwise.
Input: N = 200
1 * 10 -> 10 * 20 -> 200
Input: N = 90
Follow the steps below to solve the problem:
- Count the number of trailing zeroes.
- After removing the trailing zeroes, if the remaining N cannot be expressed as a power of 2, print NO.
- Otherwise, if log2N <= Count of trailing zeroes, print Yes.
Below is the implementation of the above approach:
Time Complexity: O(log10(N))
Auxiliary Space: O(1)
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Check if sum of array can be reduced to zero by repetitively reducing array element by their index value
- Check if elements of array can be made equal by multiplying given prime numbers
- Check if N can be obtained by repetitive addition or subtraction of two given numbers
- Check if sum Y can be obtained from the Array by the given operations
- Check if K can be obtained by performing arithmetic operations on any permutation of an Array
- Maximum array sum that can be obtained after exactly k changes
- Total distinct pairs from two arrays such that second number can be obtained by inverting bits of first
- Minimum integer that can be obtained by swapping adjacent digits of different parity
- Smallest array that can be obtained by replacing adjacent pairs with their products
- Find the number of consecutive zero at the end after multiplying n numbers
- Reach A and B by multiplying them with K and K^2 at every step
- Maximize the sum of array by multiplying prefix of array with -1
- Minimum operations required to convert X to Y by multiplying X with the given co-primes
- Find Kth number from sorted array formed by multiplying any two numbers in the array
- Minimum steps to reach N from 1 by multiplying each step by 2, 3, 4 or 5
- Min operations to reduce N to 1 by multiplying by A or dividing by B
- Min operations to reduce N by multiplying by any number or taking square root
- Convert 1 into X in min steps by multiplying with 2 or 3 or by adding 1
- Maximum subsequence sum possible by multiplying each element by its index
- Construct a frequency array of digits of the values obtained from x^1, x^2, ........, x^n
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.