Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Find two numbers whose sum is N and does not contain any digit as K

  • Last Updated : 21 Apr, 2021

Given an integer N, the task is to find two numbers a and b such that a + b = N, where a and b doesn’t contain any of the digits as K. Print -1 if not possible.

Examples:

Hey! Looking for some great resources suitable for young ones? You've come to the right place. Check out our self-paced courses designed for students of grades I-XII. 

Start with topics like Python, HTML, ML, and learn to make some games and apps all with the help of our expertly designed content! So students worry no more, because GeeksforGeeks School is now here!

 



Input: N = 100, K = 0
Output: 1 99
Explanation:
1 + 99 = 100 and none of the numbers has 0 in it.

 Input: N = 123456789, K = 2
Output: 3456790 119999999 
Explanation:
3456790 + 119999999 = 123456789 and none of the numbers has 2 in it.

 

Approach: The idea is to iterate a loop from i = 1 to n-1, and check if i and (n – i) do not contain K. If it doesn’t contain any digit as then print the two numbers and break out of the loop. 

For Example: N = 11, k = 0
i = 1, N – 1 = 10 but 10 contains 0, so increment i
i = 2, N – 1 = 9, so print this i and n – i.

Below is the implementation of the above approach:

C++




// C++ program for
// the above approach
#include<bits/stdc++.h>
using namespace std;
 
int freqCount(string str, char k)
{
    int count = 0;
    for(int i = 0;
            i < str.size(); i++)
    {
        if (str[i] == k)
        count++;
    }
    return count;
}
 
// Function to find two
// numbers whose sum
// is N and do not
// contain any digit as k
void findAandB(int n, int k)
{
    int flag = 0;
     
    // Check every number i and (n-i)
    for(int i = 1; i < n; i++)
    {
        // Check if i and n-i doesn't
        // contain k in them print i and n-i
        if (freqCount(to_string(i),
                     (char)(k + 48)) == 0 and
            freqCount(to_string(n - i),
                     (char)(k + 48)) == 0)
        {
            cout << "(" << i << ", "
                 << n - i << ")";
            flag = 1;
            break;
        }
    }
     
    // Check if flag is 0
    // then print -1
    if (flag == 0)
        cout << -1;
}
 
// Driver Code
int main()
{
     
    // Given N and K
    int N = 100;
    int K = 0;
     
    // Function call
    findAandB(N, K);
    return 0;
}
 
// This code is contributed by Rajput-Ji
Java



// Java program for the above approach
import java.util.*;
 
class GFG{
 
static int freqCount(String str, char k)
{
    int count = 0;
    for(int i = 0; i < str.length(); i++)
    {
        if (str.charAt(i) == k)
            count++;
    }
    return count;
}
 
// Function to find two numbers
// whose sum is N and do not
// contain any digit as k
static void findAandB(int n, int k)
{
    int flag = 0;
 
    // Check every number i and (n-i)
    for(int i = 1; i < n; i++)
    {
         
        // Check if i and n-i doesn't
        // contain k in them print i and n-i
        if (freqCount(Integer.toString(i),
                     (char)(k + 48)) == 0 &&
            freqCount(Integer.toString(n - i),
                     (char)(k + 48)) == 0)
        {
            System.out.print("(" + i + ", " +
                              (n - i) + ")");
            flag = 1;
            break;
        }
    }
 
    // Check if flag is 0
    // then print -1
    if (flag == 0)
        System.out.print(-1);
}
 
// Driver code
public static void main(String[] args)
{
 
    // Given N and K
    int N = 100;
    int K = 0;
 
    // Function call
    findAandB(N, K);
}
}
 
// This code is contributed by offbeat
Python



# Python program for the above approach
 
# Function to find two numbers whose sum
# is N and do not contain any digit as k
def findAandB(n, k):
   
    flag = 0
 
    # Check every number i and (n-i)
    for i in range(1, n):
 
        # Check if i and n-i doesn't
        # contain k in them print i and n-i
        if str(i).count(chr(k + 48)) == 0 \
        and str(n-i).count(chr(k + 48)) == 0:
            print(i, n-i)
            flag = 1
            break
 
    # check if flag is 0 then print -1
    if(flag == 0):
        print(-1)
 
# Driver Code
if __name__ == '__main__':
   
  # Given N and K
    N = 100
    K = 0
     
    # Function Call
    findAandB(N, K)
C#



// C# program for the
// above approach
using System;
class GFG{
 
static int freqCount(String str,
                     char k)
{
  int count = 0;
   
  for(int i = 0; i < str.Length; i++)
  {
    if (str[i] == k)
      count++;
  }
   
  return count;
}
 
// Function to find two numbers
// whose sum is N and do not
// contain any digit as k
static void findAandB(int n, int k)
{
  int flag = 0;
 
  // Check every number i and (n-i)
  for(int i = 1; i < n; i++)
  {
    // Check if i and n-i doesn't
    // contain k in them print i and n-i
    if (freqCount(i.ToString(),
                 (char)(k + 48)) == 0 &&
        freqCount((n-i).ToString(),
                  (char)(k + 48)) == 0)
    {
      Console.Write("(" + i + ", " +
                    (n - i) + ")");
      flag = 1;
      break;
    }
  }
 
  // Check if flag is 0
  // then print -1
  if (flag == 0)
    Console.Write(-1);
}
 
// Driver code
public static void Main(String[] args)
{
  // Given N and K
  int N = 100;
  int K = 0;
 
  // Function call
  findAandB(N, K);
}
}
 
// This code is contributed by 29AjayKumar
Javascript



<script>
 
// Javascript program for
// the above approach
 
function freqCount(str, k)
{
    var count = 0;
    for(var i = 0;
            i < str.length; i++)
    {
        if (str[i] == k)
        count++;
    }
    return count;
}
 
// Function to find two
// numbers whose sum
// is N and do not
// contain any digit as k
function findAandB(n, k)
{
    var flag = 0;
     
    // Check every number i and (n-i)
    for(var i = 1; i < n; i++)
    {
        // Check if i and n-i doesn't
        // contain k in them print i and n-i
        if (freqCount(i.toString(),
                     String.fromCharCode(k + 48)) == 0 &&
            freqCount((n - i).toString(),
                     String.fromCharCode(k + 48)) == 0)
        {
            document.write( "(" + i + ", "
                 + (n - i) + ")");
            flag = 1;
            break;
        }
    }
     
    // Check if flag is 0
    // then print -1
    if (flag == 0)
        cout + -1;
}
 
// Driver Code
// Given N and K
var N = 100;
var K = 0;
 
// Function call
findAandB(N, K);
 
// This code is contributed by rrrtnx.
</script>
Output: 
(1, 99)
 
Time Complexity: O(N)
Auxiliary Space: O(1)



My Personal Notes
arrow_drop_up
Next

Find two numbers with sum N such that neither of them contains digit K
Recommended Articles
Page :
Divide array into two arrays which does not contain any pair with sum K
03, Nov 20
Largest number not exceeding N that does not contain any of the digits of S
06, Jan 21
Queries to count numbers from a range which does not contain digit K in their decimal or octal representation
16, Feb 21
Connect a graph by M edges such that the graph does not contain any cycle and Bitwise AND of connected vertices is maximum
12, Mar 21
Count N-digit numbers whose digits does not exceed absolute difference of the two previous digits
02, Jun 21
Modify array such that the array does not contain any common divisors other than 1
10, Mar 21
Count possible N-digit numbers such that each digit does not appear more than given number of times consecutively
13, Jan 21
Count of Numbers in Range where the number does not contain more than K non zero digits
27, Dec 18
Find a Symmetric matrix of order N that contain integers from 0 to N-1 and main diagonal should contain only 0's
12, Apr 19
Print digits for each array element that does not divide any digit of that element
01, Mar 21
Number of n digit numbers that do not contain 9
07, Nov 17
Length of the longest increasing subsequence which does not contain a given sequence as Subarray
01, Nov 20
Numbers of Length N having digits A and B and whose sum of digits contain only digits A and B
31, Jan 19
Find pairs in array whose sum does not exist in Array
10, Jul 20
Count of N-digit numbers having digit XOR as single digit
13, Aug 20
Find the coordinate that does not belong to any square
22, Jul 21
Find whether only two parallel lines contain all coordinates points or not
15, Feb 19
Count n digit numbers not having a particular digit
21, Feb 18
Minimum number to be added to N so that it does not contains digit D
02, Dec 21
Maximum value of X such that difference between any array element and X does not exceed K
24, Mar 21
Find the Number which contain the digit d
26, Mar 18
Count pairs from an array whose quotient of division of larger number by the smaller number does not exceed K
03, Mar 21
Smallest positive integer that does not divide any elements of the given array
03, Feb 21
Maximum sum of two elements whose digit sum is equal
13, Dec 19
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
spp____
@spp____
Vote for difficulty





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!