Given an integer N containing the digit 4 at least once. The task is to divide the number into two parts x1 and x2 such that:
- x1 + x2 = N.
- And none of the parts contain the digit 4.
Note that there may be multiple answers.
Input: N = 4
Output: 1 3
1 + 3 = 4
Input: N = 9441
Output: 9331 110
9331 + 110 = 9441
Approach: Since number can be too large take the number as string. Divide it into two strings:
- For string 1, find all the positions of digit 4 in the string change it to 3 we can also change it to another number.
- For the second string put 1 at all positions of digit 4 and put 0 at all remaining positions from the 1st position of digit 4 to the end of the string.
Below is the implementation of the above approach:
- Divide a big number into two parts that differ by k
- Divide a number into two parts such that sum of digits is maximum
- Divide number into two parts divisible by given numbers
- Find the number of ways to divide number into four parts such that a = c and b = d
- Count number of ways to divide a number in 4 parts
- Divide a string in N equal parts
- Divide an isosceles triangle in two parts with ratio of areas as n:m
- Minimum cuts required to divide the Circle into equal parts
- Split a number into 3 parts such that none of the parts is divisible by 3
- Split a string in equal parts such that all parts are palindromes
- Partiton the string in two parts such that both parts have at least k different characters
- Break the number into three parts
- Partition a number into two divisble parts
- Sum of all second largest divisors after splitting a number into one or more parts
- Possible cuts of a number such that maximum parts are divisible by 3
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. 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.