C++ code to find composite numbers whose difference is n

Suppose we have a number n. We have to find two composite integers (non-prime) a and b, such that a - b = n.

So, if the input is like n = 512, then the output will be 4608 and 4096

Steps

To solve this, we will follow these steps −

print 10*n and 9*n.

Example

Let us see the following implementation to get better understanding −

#include<bits/stdc++.h>
using namespace std;
void solve(int n){
   cout<<10*n<<", "<<9*n;
}
int main(){
   int n = 512;
   solve(n);
}

Input

512

Output

5120, 4608

Arnab Chakraborty

Updated on 11-Mar-2022 06:54:57

• Related Questions & Answers
• C++ code to find three numbers whose sum is n
• Count numbers whose difference with N is equal to XOR with N in C++
• Find N distinct numbers whose bitwise Or is equal to K in C++
• Find N distinct numbers whose bitwise Or is equal to K in Python
• C++ code to find greater number whose factor is k
• C++ code to find palindrome string whose substring is S
• Count numbers whose XOR with N is equal to OR with N in C++
• C++ program to find range whose sum is same as n
• Take two numbers m and n & return two numbers whose sum is n and product m in JavaScript
• Count numbers < = N whose difference with the count of primes upto them is > = K in C++
• Program to find product of few numbers whose sum is given in Python
• Find a range of composite numbers of given length in C++
• Counting numbers whose difference from reverse is a product of k in C++
• C++ code to find tree height after n days
• C++ code to find screen size with n pixels