Given a number . The task is to check if the number is formed by concatenating the numbers 1, 14 and 144 only any number of times and in any order.
If it is possible, print YES otherwise print NO.
Input: N = 141411 Output: YES Input: N = 14134 Output: NO
The idea is to fetch single digit, double digit and triple digit numbers from the end and check if any of them matches with 1, 14 and 144 respectively. If any of them matches, divide the number with that and repeat the above step until the number is greater than zero.
Below is the implementation of using above approach:
- Check if the large number formed is divisible by 41 or not
- Check if the number formed by the last digits of N numbers is divisible by 10 or not
- Check if concatenation of two strings is balanced or not
- Check if a right-angled triangle can be formed by moving any one of the coordinates
- Check whether a binary string can be formed by concatenating given N numbers sequentially
- Maximum number formed from array with K number of adjacent swaps allowed
- Find maximum number that can be formed using digits of a given number
- Check if a given circle lies completely inside the ring formed by two concentric circles
- Largest even number that can be formed by any number of swaps
- Number formed by the rightmost set bit in N
- Number of triangles that can be formed with given N points
- Length of the smallest number which is divisible by K and formed by using 1's only
- Maximum number of teams that can be formed with given persons
- Number of triangles formed from a set of points on three lines
- Greatest number less than equal to B that can be formed from the digits of A
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.